Quantum Randomness and Nondeterminism

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.

[1]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  E. Knill Approximation by Quantum Circuits , 1995 .

[3]  E. Knill,et al.  Conventions for quantum pseudocode , 1996, 2211.02559.

[4]  Peter W. Shor,et al.  Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[5]  Péter Gács,et al.  Thermodynamics of computation and information distance , 1993, STOC.

[6]  Preskill,et al.  Efficient networks for quantum factoring. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[7]  E. Knill Bounds for approximation in total variation distance by quantum circuits , 1995 .

[8]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.