Abstract

Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and Vazirani, in Proc. 25th Annual ACM Symposium Theory Comput., 1993, pp. 11--20, SIAM J. Comput., 26 (1997), pp. 1277--1339], [Simon, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 116--123, SIAM J. Comput., 26 (1997), pp. 1340--1349], [Shor, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 124--134] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of $\NP$ can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$. We also show that relative to a permutation oracle chosen uniformly at random with probability 1 the class $\NP \cap \coNP$ cannot be solved on a QTM in time $o(2^{n/3})$. The former bound is tight since recent work of Grover [in {\it Proc.\ $28$th Annual ACM Symposium Theory Comput.}, 1996] shows how to accept the class $\NP$ relative to any oracle on a quantum computer in time $O(2^{n/2})$.

MSC codes

  1. 68Q05
  2. 68Q15
  3. 03D10
  4. 03D15

Keywords

  1. quantum Turing machines
  2. oracle quantum Turing machines
  3. quantum polynomial time

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
László Babai, Shlomo Moran, Arthur‐Merlin games: a randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci., 36 (1988), 254–276, 17th Annual ACM Symposium on the Theory of Computing (Providence, RI, 1985)
2.
C. H. Bennett, Logical reversibility of computation, IBM J. Res. Develop., 17 (1973), pp. 525–532.
3.
Charles Bennett, John Gill, Relative to a random oracle A, PANPAco-NPA with probability 1, SIAM J. Comput., 10 (1981), 96–113
4.
Ethan Bernstein, Umesh Vazirani, Quantum complexity theory, SIAM J. Comput., 26 (1997), 1411–1473
5.
André Berthiaume, Gilles Brassard, The quantum challenge to structural complexity theory, IEEE Comput. Soc. Press, Los Alamitos, CA, 1992, 132–137
6.
André Berthiaume, Gilles Brassard, Oracle quantum computing, J. Modern Opt., 41 (1994), 2521–2535
7.
M. Boyer, G. Brassard, P. Høyer, and A. Tapp, Tight bounds on quantum searching, in Proc. 4th Workshop on Phys. Comput., New England Complex Systems Institute, Boston, 1996, pp. 36–43. Available online in the InterJournal at http://interjournal.org.
8.
N. Bshouty and J. Jackson, Learning DNF over uniform distribution using a quantum example oracle, in Proc. 8th Annual ACM Conference on Comput. Learning Theory, Santa Cruz, CA, 1995, pp. 118–127.
9.
D. Deutsch, Quantum theory, the Church‐Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A, 400 (1985), 97–117
10.
D. Deutsch, Quantum computational networks, Proc. Roy. Soc. London Ser. A, 425 (1989), 73–90
11.
David Deutsch, Richard Jozsa, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439 (1992), 553–558
12.
Richard Feynman, Simulating physics with computers, Internat. J. Theoret. Phys., 21 (1981/82), 467–488, Physics of computation, Part II (Dedham, Mass., 1981)
13.
Lov Grover, A fast quantum mechanical algorithm for database search, ACM, New York, 1996, 212–219
14.
J. Machta, Phase Information in Quantum Oracle Computing, manuscript, Physics Dept., University of Massachusetts at Amherst, Amherst, MA, 1996.
15.
P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in Proc. 35th Annual IEEE Symposium on Foundations of Comput. Sci., Santa Fe, NM, 1994, pp. 124–134.
16.
D. Simon, On the power of quantum computation, in Proc. 35th Annual IEEE Symposium on Foundations of Comput. Sci., Santa Fe, NM, 1994, pp. 116–123;
SIAM J. Comput., 26 (1997), pp. 1340–1349.
17.
Andrew Yao, Quantum circuit complexity, IEEE Comput. Soc. Press, Los Alamitos, CA, 1993, 352–361

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 1510 - 1523
ISSN (online): 1095-7111

History

Published online: 28 July 2006

MSC codes

  1. 68Q05
  2. 68Q15
  3. 03D10
  4. 03D15

Keywords

  1. quantum Turing machines
  2. oracle quantum Turing machines
  3. quantum polynomial time

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media