Fetching the paper…
Reading the bibliography…
We contribute a 2D nearest-neighbor quantum architecture for Shor's algorithm to factor an $n$-bit number in $O(\log^2(n))$ depth.
C. S. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Transactions on Electronic Computers
1964
Earlier work this paper cites.
K.-Y. Siu, J. Bruck, T. Kailath, and T. Hofmeister, “Depth efficient neural networks for division and related problems,” IEEE Transactions on Information Theory
1993
Earlier work this paper cites.
P. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science
1994
Earlier work this paper cites.
V. Vedral, A. Barenco, and A. Ekert, “Quantum networks for elementary arithmetic operations,” Physical Review A
1996
Earlier work this paper cites.
C. Miquel, J. Paz, and R. Perazzo, “Factoring in a dissipative quantum computer,” Physical Review A
1996
Earlier work this paper cites.
D. Beckman, A. Chari, S. Devabhaktuni, and J. Preskill, “Efficient networks for quantum factoring,” Physical Review A
1996
Earlier work this paper cites.
P. Gossett, “Quantum Carry-Save Arithmetic,” arXiv:quant-ph/9808061
1998
Earlier work this paper cites.
C. Zalka, “Fast versions of Shor’s quantum factoring algorithm,” arXiv:quant-ph/9806084v1
1998
Earlier work this paper cites.
Cambridge, U.K.: Cambridge University Press, 2000
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2000
Earlier work this paper cites.
A. Sørensen and K. Mølmer, “Entanglement and quantum computation with ions in thermal motion,” Physical Review A
2000
Earlier work this paper cites.
T. G. Draper, “Addition on a Quantum Computer,” arXiv:quant-ph/0008033
2000
Earlier work this paper cites.
R. Cleve and J. Watrous, “Fast parallel circuits for the quantum fourier transform,” in Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS’00)
2000
Earlier work this paper cites.
S. Beauregard, “Circuit for Shor’s algorithm using 2n+3 qubits,” arXiv:quant-ph/0205095
2002
Earlier work this paper cites.
Providence, Rhode Island: American Mathematical Society, 2002
A. Y. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation · 2002
Earlier work this paper cites.
D. Kielpinski, C. Monroe, and D. Wineland, “Architecture for a large-scale ion-trap quantum computer,” Nature
2002
Cited alongside, same era.
A. W. Harrow, B. Recht, and I. L. Chuang, “Efficient discrete approximations of quantum gates,” J. Math. Phys
2002
Cited alongside, same era.
R. Raussendorf, D. Browne, and H. Briegel, “Measurement-based quantum computation on cluster states,” Physical Review A
2003
Cited alongside, same era.
A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg, “Implementation of Shor’s Algorithm on a Linear Nearest Neighbour Qubit Array,” Quantum Information and Computation
2004
Cited alongside, same era.
R. Van Meter and K. Itoh, “Fast quantum modular exponentiation,” Physical Review A
2005
Cited alongside, same era.
J. Benhelm, G. Kirchmair, C. F. Roos, and R. Blatt, “Towards fault-tolerant quantum computing with trapped ions,” Nature Physics
2008
Later among the works it cites.
A. Broadbent and E. Kashefi, “Parallelizing Quantum Circuits,” Theoretical Computer Science
2009
Later among the works it cites.
M. G. Whitney, N. Isailovic, Y. Patel, and J. Kubiatowicz, “A fault tolerant, area efficient architecture for Shor’s factoring algorithm,” Proceedngs of the International Symposium on Computer Architecture
2009
Later among the works it cites.
D. E. Browne, E. Kashefi, and S. Perdrix, “Computational depth complexity of measurement-based quantum computation,” in Proceedings of the Fifth Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC)
2010
Later among the works it cites.
Y. Takahashi, S. Tani, and N. Kunihiro, “Quantum Addition Circuits and Unbounded Fan-Out,” Quantum Information and Computation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Høyer and R. Špalek, “Quantum Circuits with Unbounded Fan-out,” Theory of Computing
2005
Cited alongside, same era.
Y. Takahashi and N. Kunihiro, “A linear-size quantum circuit for addition with no ancillary qubits,” Quantum Information and Computation
2005
Cited alongside, same era.
S. A. Kutin, “Shor’s algorithm on a nearest-neighbor machine,” arXiv:quant-ph/0609001
2006
Cited alongside, same era.
Ph.d., Keio University, 2006
R. Van Meter, Architecture of a Quantum Multicomputer Optimized for Shor’s Factoring Algorithm · 2006
Cited alongside, same era.
R. Van Meter, K. Itoh, and T. Ladd, “Architecture-dependent execution time of Shor’s algorithm,” Proceedings of Mesoscopic Superconductivity and Spintronics
2006
Cited alongside, same era.
Y. Takahashi and N. Kunihiro, “A quantum circuit for Shor’s factoring algorithm using 2n+2 qubits,” Quantum Information and Computation
2006
Cited alongside, same era.
T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, “A logarithmic-depth quantum carry-lookahead adder,” Quantum Information and Computation
2006
Cited alongside, same era.
2010
Later among the works it cites.
2010
Later among the works it cites.
A. Harrow and A. Fowler, “Private communication,” Oct 2011
2011
Later among the works it cites.
A. G. Fowler, “Constructing arbitrary Steane code single logical,” Quantum Information and Computation
2011
Later among the works it cites.
2012
Closest in time.
2012
Closest in time.
D. Rosenbaum, “Optimal Quantum Circuits for Nearest-Neighbor Architectures,” 8th Conference on Theory of Quantum Computation, Communication and Cryptography
2013
Closest in time.
C. Jones, “Distillation protocols for Fourier states in quantum computing,” arXiv:1303.3066
2013
Closest in time.
C. Jones, “Low-overhead constructions for the fault-tolerant Toffoli gate,” Physical Review A
2013
Closest in time.