Polynomial time quantum computation with advice.pdfVIP

a r X i v : q u a n t - p h / 0 3 0 5 1 0 0 v 3 1 1 A p r 2 0 0 4 Polynomial Time Quantum Computation with Advice ? Harumichi Nishimura Tomoyuki Yamakami School of Information Technology and Engineering University of Ottawa, Ottawa, Ontario, Canada K1N 6N5 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. Key Words: computational complexity, quantum circuit, advice function 1 Prologue Quantum computation has emerged to shape a future computational paradigm based on quantum physics. To carry out a given task faster and more precisely, it is also practical to supplement such a quantum computation with a small piece of information beside an original input. Ideally, such information should be succinct and given equally to all inputs of fixed size. The notion of such supplemental information, under the name of “advice,” was first sought in a classical setting by Karp and Lipton [15] in the early 1980s. Originally, Karp and Lipton introduced the notion of advice to characterize non-uniform models of computations, following the early work of Savage [21] and Adleman [1] on non-uniform Boolean circuits. In this paper, we consider polynomial-time bounded-error quantum computations that take advice, which is given in the form of a pure quantum state (referred to as quantum advice). Of particular interest are the languages recognized by polynomial-time quantum computations with quantum advice under the condition that the quantum computations should not err with probability more than 1/3, provided that the given advice is correct. The major difference from the original definition of Karp and Lipton is that we do not impose any condition on the acceptance probability of an underlying quantum c