Pith. sign in

REVIEW 1 cited by

The Halting Problem for Quantum Computers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/9806054 v2 pith:CGHJDMOU submitted 1998-06-16 quant-ph

classification quant-ph
keywords quantumcomputersdifferenthaltingproblemarguearisebeen
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We argue that the halting problem for quantum computers which was first raised by Myers, is by no means solved, as has been claimed recently. We explicitly demonstrate the difficulties that arise in a quantum computer when different branches of the computation halt at different, unknown, times.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Denotational Semantics for Quantum Loops

    cs.PL 2025-06 conditional novelty 4.0 of 10

    Quantum while loops get a denotational semantics as the strong limit of linear operators that discard the non-terminating part of the computation.

Pith tools