Counting by quantum eigenvalue estimation
暂无分享,去创建一个
[1] Alexei Y. Kitaev,et al. Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..
[2] Umesh V. Vazirani,et al. Quantum Complexity Theory , 1997, SIAM J. Comput..
[3] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[4] R. Feynman. Simulating physics with computers , 1999 .
[5] Lov K. Grover. A framework for fast quantum mechanical algorithms , 1997, STOC '98.
[6] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[7] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[8] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[9] Dong Pyo Chi,et al. Quantum Database Searching by a Single Query , 1997 .
[10] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[12] M. Mosca. Quantum Searching Counting and Amplitude Ampli cation by Eigenvector Analysis , 1998 .
[13] H. S. Allen. The Quantum Theory , 1928, Nature.
[14] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[15] Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1999 .
[16] Markus Grassl,et al. Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution , 1998, QCQC.
[17] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[18] D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[19] Jin-Soo Kim,et al. Quantum Database Search by a Single Query , 1998, QCQC.
[20] Gilles Brassard,et al. An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[21] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[22] Michele Mosca,et al. The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer , 1998, QCQC.
[23] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[24] Gilles Brassard,et al. Quantum Counting , 1998, ICALP.
[25] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[26] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[27] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[28] Charles H. Bennett. Notes on the history of reversible computation , 2000, IBM J. Res. Dev..
[29] R. Cleve,et al. Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.