Fetching the paper…
Reading the bibliography…
Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales.
K. K. Likharev and V. K. Semenov, RSFQ logic/memory family: A new Josephson-junction technology for sub-terahertz-clock-frequency digital systems, IEEE Transactions on Applied Superconductivity 1
1991
Earlier work this paper cites.
J. Preskill, Reliable quantum computers, Proc. Roy. Soc. Lond. A 454
1998
Earlier work this paper cites.
D. Gottesman, The Heisenberg representation of quantum computers, Proc. XXII Int. Coll. Group. Th. Meth. Phys. 1
1999
Earlier work this paper cites.
A. W. Harrow, B. Recht, and I. L. Chuang, Efficient discrete approximations of quantum gates, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303
2003
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71
2005
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
H. Bombin, Topological order with a twist: Ising anyons from an abelian model, Phys. Rev. Lett. 105
2010
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, Phys. Rev. A 86
2012
Earlier work this paper cites.
C. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New J. Phys. 14
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86
2012
Earlier work this paper cites.
A. G. Fowler, Time-optimal quantum computation, arXiv:1210.4626 (2012)
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
N. C. Jones, J. D. Whitfield, P. L. McMahon, M.-H. Yung, R. V. Meter, A. Aspuru-Guzik, and Y. Yamamoto, Faster quantum chemistry simulation on fault-tolerant quantum computers, New J. Phys. 14
2012
Earlier work this paper cites.
A. G. Fowler, S. J. Devitt, and C. Jones, Surface code implementation of block code state distillation, Scientific Rep. 3
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
M. Amy, D. Maslov, M. Mosca, and M. Roetteler, A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32
2013
Earlier work this paper cites.
P. Selinger, Quantum circuits of T T -depth one, Phys. Rev. A 87
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
G. Duclos-Cianci and K. M. Svore, Distillation of nonstabilizer states for universal quantum computation, Phys. Rev. A 88
2013
Cited alongside, same era.
A. Bocharov, Y. Gurevich, and K. M. Svore, Efficient decomposition of single-qubit gates into v v basis circuits, Phys. Rev. A 88
2013
Cited alongside, same era.
2014
Cited alongside, same era.
M. Amy, D. Maslov, and M. Mosca, Polynomial-time T T -depth optimization of Clifford+ T T circuits via matroid partitioning, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33
2014
Cited alongside, same era.
D. Litinski and F. von Oppen, Braiding by Majorana tracking and long-range CNOT gates with color codes, Phys. Rev. B 96
2017
Later among the works it cites.
D. Litinski and F. v. Oppen, Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes, Quantum 2
2018
Closest in time.
2018
Closest in time.
J. Haah and M. B. Hastings, Codes and Protocols for Distilling T T , controlled- S S , and Toffoli Gates, Quantum 2
2018
Closest in time.
L. E. Heyfron and E. T. Campbell, An efficient quantum compiler that reduces T T count, Quantum Sci. Technol. 4
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Cited alongside, same era.
Y. Li, A magic state’s fidelity can be superior to the operations that created it, New J. Phys. 17
2015
Cited alongside, same era.
G. Duclos-Cianci and D. Poulin, Reducing the quantum-computing overhead with complex gate distillation, Phys. Rev. A 91
2015
Cited alongside, same era.
E. T. Campbell and J. O’Gorman, An efficient magic state approach to small angle rotations, Quantum Sci. Technol. 1
2016
Cited alongside, same era.
G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, arXiv:1610.06546 (2016)
2016
Cited alongside, same era.
M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, Elucidating reaction mechanisms on quantum computers, PNAS 114
2017
Cited alongside, same era.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549
2017
Cited alongside, same era.
D. Litinski and F. von Oppen, Quantum computing with Majorana fermion codes, Phys. Rev. B 97
2018
Closest in time.
A. Lavasani and M. Barkeshli, Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes, Phys. Rev. A 98
2018
Closest in time.
E. T. Campbell and M. Howard, Magic state parity-checker with pre-distilled components, Quantum 2
2018
Closest in time.
2018
Closest in time.
C. Dickel, J. J. Wesdorp, N. K. Langford, S. Peiter, R. Sagastizabal, A. Bruno, B. Criger, F. Motzoi, and L. DiCarlo, Chip-to-chip entanglement of transmon qubits using engineered measurement fields, Phys. Rev. B 97
2018
Closest in time.
P. Campagne-Ibarcq, E. Zalys-Geller, A. Narla, S. Shankar, P. Reinhold, L. Burkhart, C. Axline, W. Pfaff, L. Frunzio, R. J. Schoelkopf, and M. H. Devoret, Deterministic remote entanglement of superconducting circuits through microwave two-photon transitions, Phys. Rev. Lett. 120
2018
Closest in time.
C. J. Axline, L. D. Burkhart, W. Pfaff, M. Zhang, K. Chou, P. Campagne-Ibarcq, P. Reinhold, L. Frunzio, S. Girvin, L. Jiang, et al. , On-demand quantum state transfer and entanglement between remote microwave cavity memories, Nat. Phys. 14
2018
Closest in time.
C. Gidney, Halving the cost of quantum addition, Quantum 2
2018
Closest in time.
L. Lao, B. van Wee, I. Ashraf, J. van Someren, N. Khammassi, K. Bertels, and C. G. Almudever, Mapping of lattice surgery-based quantum circuits on surface code architectures, Quantum Sci. Technol. 4
2018
Closest in time.
M. S. Kesselring, F. Pastawski, J. Eisert, and B. J. Brown, The boundaries and twist defects of the color code and their applications to topological quantum computation, Quantum 2
2018
Closest in time.
IBM doubling qubits every 8 months, https://www.nextbigfuture.com/2018/02/ibm-doubling-qubits-every-8-months-and-ecommerce-cryptography-at-risk-in-7-15-years.html , accessed: 2018-08-01
2018
Closest in time.
J. I. Hall, Notes on Coding Theory Chapter 6: Modifying Codes, https://users.math.msu.edu/users/jhall/classes/ codenotes/Mod.pdf , accessed: 2019-01-30
2019
Closest in time.
C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schumacher, Concentrating partial entanglement by local operations, Phys. Rev. A 53
2046
Closest in time.