Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Annual ACM Symposium on Theory of Computing . ACM, 1996, pp. 212–219

1996

Earlier work this paper cites.

P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing , vol. 26, no. 5, pp. 1484–1509, Oct. 1997. [Online]. Available: http://dx.doi.org/10.1137/S0097539795293172

1997

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, “Quantum information and quantum computation,” Cambridge: Cambridge University Press , vol. 2, no. 8, p. 23, 2000

2000

Earlier work this paper cites.

M. G. Neeley, “Generation of three-qubit entanglement using josephson phase qubits,” Ph.D. dissertation, University of California, Santa Barbara, 2010

2010

Earlier work this paper cites.

A. J. Landahl, J. T. Anderson, and P. R. Rice, “Fault-tolerant quantum computing with color codes,” arXiv preprint arXiv:1108.5738 , 2011

Original

2011

Earlier work this paper cites.

A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A , vol. 86, no. 3, p. 032324, 2012

2012

Earlier work this paper cites.

C. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, “Surface code quantum computing by lattice surgery,” New Journal of Physics , vol. 14, no. 12, p. 123011, 2012

2012

Earlier work this paper cites.

A. G. Fowler, A. C. Whiteside, and L. C. Hollenberg, “Towards practical classical processing for the surface code,” Physical review letters , vol. 108, no. 18, p. 180501, 2012

2012

Earlier work this paper cites.

S. Bravyi and J. Haah, “Magic-state distillation with low overhead,” Physical Review A , vol. 86, no. 5, p. 052329, 2012

2012

Cited alongside, same era.

H. Bombín, “Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes,” New Journal of Physics , vol. 17, no. 8, p. 083002, 2015

2015

Cited alongside, same era.

R. Naik, N. Leung, S. Chakram, P. Groszkowski, Y. Lu, N. Earnest, D. McKay, J. Koch, and D. Schuster, “Random access quantum information processors using multimode circuit quantum electrodynamics,” Nature communications , vol. 8, no. 1, p. 1904, 2017

2017

Cited alongside, same era.

S. S. Tannu, Z. A. Myers, P. J. Nair, D. M. Carmean, and M. K. Qureshi, “Taming the instruction bandwidth of quantum computers via hardware-managed error correction,” in 2017 50th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 2017, pp. 679–691

2017

Cited alongside, same era.

F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin, S. Habegger, M. P. Harrigan, M. J. Hartmann, A. Ho, M. Hoffmann, T. Huang, T. S. Humble, S. V. Isakov, E. Jeffrey, Z. Jiang, D. Kafri, K. Kechedzhi, J. Kelly, P. V. Klimov, S. Knysh, A. Korotkov, F. Kostritsa, D. Landhuis, M. Lindmark, E. Lucero, D. Lyakh, S. Mandrà, J. R. McClean, M. McEwen, A. Megrant, X. Mi, K. Michielsen, M. Mohseni, J. Mutus, O. Naaman, M. Neeley, C. Neill, M. Y. Niu, E. Ostby, A. Petukhov, J. C. Platt, C. Quintana, E. G. Rieffel, P. Roushan, N. C. Rubin, D. Sank, K. J. Satzinger, V. Smelyanskiy, K. J. Sung, M. D. Trevithick, A. Vainsencher, B. Villalonga, T. White, Z. J. Yao, P. Yeh, A. Zalcman, H. Neven, and J. M. Martinis, “Quantum supremacy using a programmable superconducting processor,” Nature , vol. 574, no. 7779, pp. 505–510, 2019. [Online]. Available: https://doi.org/10.1038/s41586-019-1666-5

2019

Later among the works it cites.

C. Gidney and M. Eker, “How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits,” arXiv preprint arXiv:1905.09749 , 2019

Original