| | |
| | |
Stat |
Members: 3645 Articles: 2'503'724 Articles rated: 2609
24 April 2024 |
|
| | | |
|
Article overview
| |
|
Quantum subroutine problem and the robustness of quantum complexity classes | Harumichi Nishimura
; Masanao Ozawa
; | Date: |
18 Jul 2001 | Subject: | quant-ph | Abstract: | 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 {f EQP}, {f BQP}, and {f ZQP} under the above general formulation, extending the earlier results on the robustness of {f BQP} shown by Bennett et al. | Source: | arXiv, quant-ph/0107089 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |