Quantum while loops get a denotational semantics as the strong limit of linear operators that discard the non-terminating part of the computation.
The Halting Problem for Quantum Computers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Denotational Semantics for Quantum Loops
Quantum while loops get a denotational semantics as the strong limit of linear operators that discard the non-terminating part of the computation.