On the robustness of bucket brigade quantum RAM

Peter W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A 52

1995

Earlier work this paper cites.

A. R. Calderbank and Peter W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A 54

1996

Earlier work this paper cites.

Gilles Brassard, Peter Høyer, and Alain Tapp, “Quantum cryptanalysis of hash and claw-free functions,” SIGACT News 28

1997

Earlier work this paper cites.

A. S. Sedra and K. C. Smith, Microelectronic Circuits (Oxford Press, New York, 1998)

1998

Earlier work this paper cites.

Michele Mosca and Phillip Kaye, “Quantum networks for generating arbitrary quantum states,” in Optical Fiber Communication Conference and International Conference on Quantum Information (Optical Society of America, 2001) p. PB28

2001

Earlier work this paper cites.

R. C. Jaeger and T. N. Blalock, Microelectronic Circuit Design (McGraw-Hill, Dubuque, 2003)

2003

Earlier work this paper cites.

Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman, “Exponential algorithmic speedup by a quantum walk,” in Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing , STOC ’03 (ACM, New York, NY, USA, 2003) pp. 59–68

2003

Earlier work this paper cites.

Peter Høyer, Michele Mosca, and Ronald de Wolf, “Quantum search on bounded-error inputs,” in Automata, Languages and Programming , Lecture Notes in Computer Science, Vol. 2719, edited by JosC.M. Baeten, JanKarel Lenstra, Joachim Parrow, and GerhardJ. Woeginger (Springer Berlin Heidelberg, 2003) pp. 291–299

2003

Earlier work this paper cites.

Greg Kuperberg, “A subexponential-time quantum algorithm for the dihedral hidden subgroup problem,” SIAM J. Comput. 35

2005

Cited alongside, same era.

Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Phys. Rev. A 71

2005

Cited alongside, same era.

H. Bombin and M. A. Martin-Delgado, “Topological quantum distillation,” Phys. Rev. Lett. 97

2006

Cited alongside, same era.

Andris Ambainis, “Quantum walk algorithm for element distinctness,” SIAM J. Comput. 37

2007

Cited alongside, same era.

Phillip Kaye, Raymond Laflamme, and Michele Mosca, An Introduction to Quantum Computing (Oxford University Press, 2007)

2007

Cited alongside, same era.

Fang-Yu Hong, Yang Xiang, Zhi-Yan Zhu, Li-zhen Jiang, and Liang-neng Wu, “Robust quantum random access memory,” Phys. Rev. A 86

2012

Later among the works it cites.

Sergey Bravyi and Jeongwan Haah, “Magic-state distillation with low overhead,” Phys. Rev. A 86

Original

2012

Later among the works it cites.

Adam Paetznick and Ben W. Reichardt, “Universal fault-tolerant quantum computation with only transversal gates and error correction,” Phys. Rev. Lett. 111

2013

Later among the works it cites.

Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd, “Quantum support vector machine for big data classification,” Phys. Rev. Lett. 113

2014

Later among the works it cites.

Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost, “Quantum principal component analysis,” Nat. Phys. 10

2014

Later among the works it cites.