Dave Bacon
Skip Abstract Section
Abstract
What quantum algorithms outperform classical computation and how do they do it?
- Aharonov, D., Ben-Or, M. Fault-tolerant quantum computation with constant error rate. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (1997). ACM, 176--188. Google Scholar
Digital Library
- Aharonov, Y., Davidovich, L., Zagury, N. Quantum random walks. Phys. Rev. A 48, 167 (1993).Google ScholarCross Ref
- Ambainis, A. Quantum walk algorithm for element distinctness. SIAM J. Comput. 37 (2007), 210. Google ScholarDigital Library
- Ambainis, A., Kempe, J., Rivosh, A. Coins make quantum walks faster. In Proceedings of the 16th Annual ACM SIAM Symposium on Discrete Algorithms (2005), 1099. Google ScholarDigital Library
- Aspuru-Guzik, A., Dutoi, A., Love, P.J., head-Gordon, M. Simulated quantum computation of molecular energies. Science 309, 5741 (2005).Google ScholarCross Ref
- Bell, J.S. On the Einstein Podolsky Rosen paradox. Physics 1, (1964), 195.Google ScholarCross Ref
- Buhrman, H. Špalek, R. Quantum verification of matrix products. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (2006), 880. Google ScholarDigital Library
- Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A. Exponential algorithmic speedup by quantum walk. In Proceedings of the 35th ACM Symposium on Theory of Computing (2003), 59--68. Google ScholarDigital Library
- Farhi, E., Gutmann, S. Quantum computation and decision trees. Phys. Rev. A 58 (1998), 915.Google ScholarCross Ref
- Farhi, E., Goldstone, J., Gutmann, S. A quantum algorithm for the Hamiltonian NAND tree. Eprint arXiv:quant-ph/0702144, 2007.Google Scholar
- Feynman, R. Simulating physics with computers. Intl. J. Theor. Phys. 21 (1982), 467--488.Google ScholarCross Ref
- Grover, L. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (New York, 1996). ACM, 212--219. Google ScholarDigital Library
- Häffner, H., Hänsel, W., Roos, C.F., Benhelm, J., al kar, D.C., Chwalla, M., Körber, T., Rapol, U.D., Riebe, M., Schmidt, P.O., Becher, C., Gühne, O., Dür, W., Blatt, R. Scalable multiparticle entanglement of trapped ions. Nature 438 (2005), 643.Google ScholarCross Ref
- Hallgren, S. Polynomial-time quantum algorithms for pell's equation and the principal ideal problem. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computation (New York, 2002). ACM, 653--658. Google ScholarDigital Library
- Kedlaya, K.S. Quantum computation of zeta functions of curves. Comput. Complex. 15, 1--19 (2006). Google ScholarDigital Library
- Kitaev, A. Quantum error correction with imperfect gates. In Quantum Communication, Computing and Measurement (New York, 1997). Plenum, 181--188.Google Scholar
- Knill, E., Laflamme, R., Zurek, W.H. Resilent quantum computation. Science 279 (1998), 342--345.Google ScholarCross Ref
- Knill, E., Laflamme, R., Zurek, W.H. Resilient quantum computation: error models and thresholds. Proc. Roy. Soc. Lond. Ser. A 454 (1998), 365--384.Google ScholarCross Ref
- Leibfried, D., Knill, E., Seidelin, S., Britton, J., Blakestad, R.B., Chiaverini, J., Hume, D.B., Itano, W.M., Jost, J.D., Langer, C., Ozeri, R., Reichle, R., Wineland, D.J. Creation of a six-atom 'Schrödinger cat' state. Nature 438 (2005), 639.Google ScholarCross Ref
- Magniez, F., Santha, M., Szegedy, M. Quantum algorithms for the triangle problem. In Proceedings of the 16th Annual ACM SIAM Symposium on Discrete Algorithms (2005), 1109. Google ScholarDigital Library
- Nielsen, M.A. Chuang, I.L. Quantum Computation and Quantum Information. Cambridge University Press, New York, 2000. Google ScholarDigital Library
- Regev, O. Quantum computation and lattice problems. In 43rd Symposium on Foundations of Computer Science (IEEE Computer Society, 2002), 520--529. Google ScholarDigital Library
- Rivest, R.L., Shamir, A., Adleman, L. A method of obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (1978), 120--126. Google ScholarDigital Library
- Shor, P.W. Algorithms for quantum computation: Discrete log and factoring. In Proceedings of the 35th Annual Symposium on the Foundations of Computer Science. S. Goldwasser, ed. (Los Alamitos, CA, 1994). IEEE Computer Society, 124--134. Google ScholarDigital Library
- Shor, P.W. Fault tolerant quantum computation. In Proceedings of the 37th Symposium on the Foundations of Computer Science (Los Alamitos, CA, 1996), IEEE, 56--65. Google ScholarDigital Library
- Woehr, J. Online interview "A Conversation with Christos Papadimitriou". Dr. Dobb's J. July Dave Bacon is an assistant research professor in the Department of Computer Science and Engineering, Department of Physics, at the University of Washington, Seattle.Google Scholar
Index Terms
- Recent progress in quantum algorithms
Recommendations
Recent results in trapped-ion quantum computing at NIST
We review recent experiments on entanglement, Bell's inequality, and decoherence-free subspaces in a quantum register of trapped 9Be+ ions. We have demonstrated entanglement of up to four ions [1] using the technique of Mølmer and Sørensen [2]. This ...
Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots
AbstractVarious quantum algorithms depend on quantum phase estimation (QPE) as basic blocks or main subroutines to leverage superposition and entanglement during quantum computations. The QPE algorithm estimates the unknown phase of an eigenvalue ...
Quantum correlation swapping
Quantum correlations (QCs), including quantum entanglement and those different, are important quantum resources and have attracted much attention recently. Quantum entanglement swapping as a kernel technique has already been applied to quantum repeaters ...
Comments