Pith. sign in

REVIEW

Quantum Randomness and Nondeterminism

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/9610012 v1 pith:SUH2GTEB submitted 1996-10-09 quant-ph

classification quant-ph
keywords quantumnondeterminismnotionrandomnessclassicalcomplexitynondeterministicpower
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Does the notion of a quantum randomized or nondeterministic algorithm make sense, and if so, does quantum randomness or nondeterminism add power? Although reasonable quantum random sources do not add computational power, the discussion of quantum randomness naturally leads to several definitions of the complexity of quantum states. Unlike classical string complexity, both deterministic and nondeterministic quantum state complexities are interesting. A notion of \emph{total quantum nondeterminism} is introduced for decision problems. This notion may be a proper extension of classical nondeterminism.

Discussion (0). Continue with ORCID to comment.

Pith tools