Polynomial time quantum computation with advice
arXiv:quant-ph/0305100 · doi:10.1016/j.ipl.2004.02.005
Abstract
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-error probability.
9 pages
References in corpus (1)
Cited by in corpus (6)
- An Application of Quantum Finite Automata to Interactive Proof Systems
- One-Way Reversible and Quantum Finite Automata with Advice
- An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
- Constant-Space Quantum Interactive Proofs Against Multiple Provers
- On estimating the entropy of shallow circuit outputs
- Proceedings of the 7th International Workshop on Physics and Computation