Polynomial time quantum computation with advice
Quantum Physics
2016-05-24 v3 Computational Complexity
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.
Cite
@article{arxiv.quant-ph/0305100,
title = {Polynomial time quantum computation with advice},
author = {Harumichi Nishimura and Tomoyuki Yamakami},
journal= {arXiv preprint arXiv:quant-ph/0305100},
year = {2016}
}
Comments
9 pages