Fetching the paper…
Reading the bibliography…
We refine ideas from Knill 1996, Jones 2016, Chamberland 2020, Gidney 2023+2024, Bombin 2024, and Hirano 2024 to efficiently prepare good $|T\rangle$ states.
“Flexible layout of surface code computations using AutoCCZ states”
Craig Gidney and Austin. Fowler · 1905
Earlier work this paper cites.
“Threshold Accuracy for Quantum Computation”
E. Knill, R. Laflamme and W. Zurek · 1996
Earlier work this paper cites.
“Universal quantum computation with ideal Clifford gates and noisy ancillas”
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
“A bridge to lower overhead quantum computation”
Austin Fowler and Simon Devitt · 2012
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation” arXiv:1208.0928
A.. Fowler, M. Mariantoni, J.. Martinis and A.. Cleland · 2012
Earlier work this paper cites.
“Quantum block lookahead adders and the wait for magic states”
Craig Gidney · 2012
Earlier work this paper cites.
“Surface code quantum computing by lattice surgery”
Clare Horsman, Austin Fowler, Simon Devitt and Rodney Van · 2012
Earlier work this paper cites.
“Gauge Color Codes: Optimal Transversal Gates and Gauge Fixing in Topological Stabilizer Codes”
H. Bombin · 2013
Earlier work this paper cites.
“Unfolding the color code”
Aleksander Kubica, Beni Yoshida and Fernando Pastawski · 2015
Earlier work this paper cites.
“A magic state’s fidelity can be superior to the operations that created it”
Ying Li · 2015
Earlier work this paper cites.
“Gauge color codes in two dimensions”
Cody Jones, Peter Brooks and Jim Harrington · 2016
Earlier work this paper cites.
In Quantum Information and Computation 16.13 & 14
Dmitri Maslov · 2016
Earlier work this paper cites.
“Shorter gate sequences for quantum computing by mixing unitaries”
Earl Campbell · 2017
Earlier work this paper cites.
“Factoring with n+ 2 clean qubits and n-1 dirty qubits”
Craig Gidney · 2017
Earlier work this paper cites.
“Fault-tolerant interface between quantum memories and quantum processors”
Hendrik Poulsen, Nicolai Friis and Hans. Briegel · 2017
Earlier work this paper cites.
“Encoding electronic spectra in quantum circuits with linear T complexity”
Ryan Babbush, Craig Gidney, Dominic Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler and Hartmut Neven · 2018
Earlier work this paper cites.
“Transversal gates and error propagation in 3D topological codes”
Hector Bombin · 2018
Earlier work this paper cites.
“Low overhead quantum computation using lattice surgery”
Austin Fowler and Craig Gidney · 2018
Earlier work this paper cites.
“A game of surface codes: Large-scale quantum computing with lattice surgery”
Daniel Litinski · 2018
Earlier work this paper cites.
“Neural network decoder for topological color codes with circuit level noise”
P Baireuther, M Caio, B Criger, C Beenakker and T O’Brien · 2019
Cited alongside, same era.
“Efficient magic state factories with a catalyzed CCZ to 2T transformation”
Craig Gidney and Austin Fowler · 2019
Cited alongside, same era.
“Magic State Distillation: Not as Costly as You Think”
Daniel Litinski · 2019
Cited alongside, same era.
“Three-dimensional surface codes: Transversal gates and fault-tolerant architectures”
Michael Vasmer and Dan. Browne · 2019
Cited alongside, same era.
“A fault-tolerant non-Clifford gate for the surface code in two dimensions”
Benjamin. Brown · 2020
Cited alongside, same era.
“Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits”
Christopher Chamberland and Kyungjoo Noh · 2020
“Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories”
Noah Shutty and Christopher Chamberland · 2022
Later among the works it cites.
“High-fidelity magic-state preparation with a biased-noise architecture”
Shraddha Singh, Andrew. Darmawan, Benjamin. Brown and Shruti Puri · 2022
Later among the works it cites.
“Yoked surface codes”
Craig Gidney, Michael Newman, Peter Brooks and Cody Jones · 2023
Later among the works it cites.
“Cleaner magic states with hook injection”
Craig Gidney · 2023
Later among the works it cites.
“New circuits and an open source decoder for the color code”
Craig Gidney and Cody Jones · 2023
Later among the works it cites.
“Sparse Blossom: correcting a million errors per core second with minimum-weight matching”
Oscar Higgott and Craig Gidney · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Improved quantum circuits for elliptic curve discrete logarithms”
Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler and Mathias Soeken · 2020
Cited alongside, same era.
“Reducing the number of non-Clifford gates in quantum circuits”
Aleks Kissinger and John van Wetering · 2020
Cited alongside, same era.
“Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes”
Michael. Beverland, Aleksander Kubica and Krysta. Svore · 2021
Cited alongside, same era.
“How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits”
Craig Gidney and Martin Ekerå · 2021
Cited alongside, same era.
“Stim: a fast stabilizer circuit simulator”
Craig Gidney · 2021
Cited alongside, same era.
“Dynamically generated logical qubits”
Matthew Hastings and Jeongwan Haah · 2021
Cited alongside, same era.
Later among the works it cites.
“Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics”
Matt McEwen, Dave Bacon and Craig Gidney · 2023
Later among the works it cites.
“Pipelined correlated minimum weight perfect matching of the surface code”
Alexandru Paler and Austin. Fowler · 2023
Later among the works it cites.
“Fault-Tolerant Postselection for Low-Overhead Magic State Preparation”
Héctor Bombín, Mihir Pant, Sam Roberts and Karthik. Seetharam · 2024
Closest in time.
“High-threshold and low-overhead fault-tolerant quantum memory”
Sergey Bravyi, Andrew. Cross, Jay. Gambetta, Dmitri Maslov, Patrick Rall and Theodore. Yoder · 2024
Closest in time.
“Data for "Magic state cultivation: growing T states as cheap as CNOT gates"”
Craig Gidney · 2024
Closest in time.
“Inplace Access to the Surface Code Y Basis”
Craig Gidney · 2024
Closest in time.
“Efficient fault-tolerant code switching via one-way transversal CNOT gates”
Sascha Heußen and Janine Hilder · 2024
Closest in time.
“Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States”
Yutaka Hirano, Tomohiro Itogawa and Keisuke Fujii · 2024
Closest in time.
“Even more efficient magic state distillation by zero-level distillation”
Tomohiro Itogawa, Yugo Takada, Yutaka Hirano and Keisuke Fujii · 2024
Closest in time.
“Low-overhead magic state distillation with color codes”
Seok-Hyung Lee, Felix Thomsen, Nicholas Fazio, Benjamin. Brown and Stephen. Bartlett · 2024
Closest in time.
“Algorithmic Fault Tolerance for Fast Quantum Computing”
Hengyun Zhou, Chen Zhao, Madelyn Cain, Dolev Bluvstein, Casey Duckering, Hong-Ye Hu, Sheng-Tao Wang, Aleksander Kubica and Mikhail. Lukin · 2024
Closest in time.
“An efficient quantum compiler that reducesTcount”
Luke Heyfron and Earl Campbell · 2058
Closest in time.