Fetching the paper…
Reading the bibliography…
Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation.
Factorization of symmetric matrices and trace-orthogonal bases in finite fields
Gadiel Seroussi and Abraham Lempel · 1980
Earlier work this paper cites.
Algebraico-geometric codes
Valerii Denisovich Goppa · 1982
Earlier work this paper cites.
Some remarks on the number of rational points of algebratic curves over finite fields
Ihara Yasutaka · 1982
Earlier work this paper cites.
On the number of self-dual bases of g f ( q m ) gf(q^{m}) over g f ( q ) gf(q)
Dieter Jungnickel, Alfred J Menezes, and Scott A Vanstone · 1990
Earlier work this paper cites.
A tower of artin-schreier extensions of function fields attaining the drinfeld-vladut bound
Arnaldo Garcia and Henning Stichtenoth · 1995
Earlier work this paper cites.
Fault-tolerant quantum computation
P.W. Shor · 1996
Earlier work this paper cites.
Concentrating partial entanglement by local operations
Charles H. Bennett, Herbert J. Bernstein, Sandu Popescu, and Benjamin Schumacher · 1996
Earlier work this paper cites.
On the asymptotic behaviour of some towers of function fields over finite fields
Arnaldo Garcia and Henning Stichtenoth · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
D. Aharonov and M. Ben-Or · 1997
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac L Chuang · 1999
Earlier work this paper cites.
Asymptotically good quantum codes
Alexei Ashikhmin, Simon Litsyn, and Michael A Tsfasman · 2001
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.
Distillation of secret key and entanglement from quantum states
Igor Devetak and Andreas Winter · 2005
Earlier work this paper cites.
Quantum accuracy threshold for concatenated distance-3 codes
Panos Aliferis, Daniel Gottesman, and John Preskill · 2006
Earlier work this paper cites.
Fault-tolerance threshold for a distance-three quantum code
Ben W. Reichardt · 2006
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error rate
Dorit Aharonov and Michael Ben-Or · 2008
Earlier work this paper cites.
Semi-clifford operations, structure of c k hierarchy, and gate complexity for fault-tolerant quantum computation
Bei Zeng, Xie Chen, and Isaac L Chuang · 2008
Cited alongside, same era.
Restrictions on transversal encoded quantum gate sets
Bryan Eastin and Emanuel Knill · 2009
Cited alongside, same era.
Algebraic function fields and codes
Henning Stichtenoth · 2009
Cited alongside, same era.
Algebraic geometry in coding theory and cryptography
Harald Niederreiter and Chaoping Xing · 2009
Cited alongside, same era.
An introduction to quantum error correction and fault-tolerant quantum computation
Daniel Gottesman · 2010
Cited alongside, same era.
Magic-state distillation with low overhead
Sergey Bravyi and Jeongwan Haah · 2012
Cited alongside, same era.
Codes and protocols for distilling t t , controlled- s s , and toffoli gates
Jeongwan Haah and Matthew B Hastings · 2018
Later among the works it cites.
Distillation with sublogarithmic overhead
Matthew B Hastings and Jeongwan Haah · 2018
Later among the works it cites.
Magic state distillation with punctured polar codes
Anirudh Krishna and Jean-Pierre Tillich · 2018
Later among the works it cites.
Towards low overhead magic state distillation
Anirudh Krishna and Jean-Pierre Tillich · 2019
Later among the works it cites.
Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\rangle to 2 | T ⟩ 2|T\rangle transformation
Craig Gidney and Austin G. Fowler · 2019
Later among the works it cites.
Lower bounds on the non-clifford resources for quantum computations
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Magic-state distillation in all prime dimensions using quantum reed-muller codes
Earl T Campbell, Hussain Anwar, and Dan E Browne · 2012
Cited alongside, same era.
Negative quasi-probability as a resource for quantum computation
Victor Veitch, Christopher Ferrie, David Gross, and Joseph Emerson · 2012
Cited alongside, same era.
Magic-state distillation with the four-qubit code
Adam M. Meier, Bryan Eastin, and Emanuel Knill · 2013
Cited alongside, same era.
Multilevel distillation of magic states for quantum computing
Cody Jones · 2013
Cited alongside, same era.
Low-overhead constructions for the fault-tolerant toffoli gate
Cody Jones · 2013
Cited alongside, same era.
Quantum circuits of t t -depth one
Peter Selinger · 2013
Cited alongside, same era.
Michael Beverland, Earl Campbell, Mark Howard, and Vadym Kliuchnikov · 2020
Later among the works it cites.
Designing the Quantum Channels Induced by Diagonal Gates
Jingzhen Hu, Qingzhong Liang, and Robert Calderbank · 2022
Later among the works it cites.
Morphing quantum codes
Michael Vasmer and Aleksander Kubica · 2022
Later among the works it cites.
Asymptotically good quantum and locally testable classical ldpc codes
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
Quantum tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
Classification of small triorthogonal codes
Sepehr Nezami and Jeongwan Haah · 2022
Later among the works it cites.
Good quantum ldpc codes with linear time decoders
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2023
Later among the works it cites.
Surviving as a quantum computer in a classical world
Daniel Gottesman · 2024
Closest in time.
Time-efficient constant-space-overhead fault-tolerant quantum computation
Hayata Yamasaki and Masato Koashi · 2024
Closest in time.
personal communication, 2024
Anirudh Krishna · 2024
Closest in time.
Asymptotically good quantum codes with transversal non-clifford gates, 2024
Louis Golowich and Venkatesan Guruswami · 2024
Closest in time.
Good binary quantum codes with transversal ccz gate, 2024
Quynh T. Nguyen · 2024
Closest in time.