Quantum subroutine problem and the robustness of quantum complexity classes

Details Quantum subroutine problem and the robustness of quantum complexity classes Quantum subroutine problem and the robustness of quantum complexity classes

2001-07-17

arxiv.org/abs/quant-ph/0107089v1

Physics

Quantum Physics

Latex, 22 pages

Scientific paper

This paper positively solves the quantum subroutine problem for fully quantum oracles. The quantum subroutine problem asks whether a quantum computer with an efficiently computable oracle can be efficiently simulated by a non-oracle quantum computer. We extends the earlier results obtained by Bennett, Bernstein, Brassard, and Vazirani, and by Aharonov, Kitaev, and Nisan to the case where the oracle evaluates a unitary operator and the computer is allowed to be in the superposition of a query state and a non-query state during computation. We also prove the robustness of {\bf EQP}, {\bf BQP}, and {\bf ZQP} under the above general formulation, extending the earlier results on the robustness of {\bf BQP} shown by Bennett et al.

Affiliated with

Also associated with

No associations

Rating

Quantum subroutine problem and the robustness of quantum complexity classes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum subroutine problem and the robustness of quantum complexity classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum subroutine problem and the robustness of quantum complexity classes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581525