Fetching the paper…
Reading the bibliography…
Magic states are eigenstates of non-Pauli operators.
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.
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
A fault-tolerant one-way quantum computer
R. Raussendorf, J. Harrington, and K. Goyal · 2006
Earlier work this paper cites.
On the structure of protocols for magic state distillation
Earl T. Campbell and Dan E. Browne · 2009
Earlier work this paper cites.
Magic-state distillation with low overhead
Sergey Bravyi and Jeongwan Haah · 2012
Earlier work this paper cites.
Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Earlier work this paper cites.
Magic-state distillation with the four-qubit code
Adam M. Meier, Bryan Eastin, and Emanuel Knill · 2013
Earlier work this paper cites.
Asymptotically optimal approximation of single qubit unitaries by clifford and t t circuits using a constant number of ancillary qubits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2013
Earlier work this paper cites.
Andrew J Landahl and Chris Cesare · 2013
Cited alongside, same era.
Distilling one-qubit magic states into toffoli states
Bryan Eastin · 2013
Cited alongside, same era.
An algorithm for the t-count
David Gosset, Vadym Kliuchnikov, Michele Mosca, and Vincent Russo · 2014
Cited alongside, same era.
Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries
Adam Paetznick and Krysta M Svore · 2014
Cited alongside, same era.
Efficient synthesis of probabilistic quantum circuits with fallback
Alex Bocharov, Martin Roetteler, and Krysta M. Svore · 2015
Cited alongside, same era.
Reducing the quantum-computing overhead with complex gate distillation
Magic state distillation with low space overhead and optimal asymptotic input count
Jeongwan Haah, Matthew B. Hastings, D. Poulin, and D. Wecker · 2017
Closest in time.
Towers of generalized divisible quantum codes
Jeongwan Haah · 2017
Closest in time.
Quantum computation with realistic magic-state factories
Joe O’Gorman and Earl T. Campbell · 2017
Closest in time.
Codes and protocols for distilling t t , controlled- s s , and toffoli gates
Jeongwan Haah and Matthew B Hastings · 2017
Closest in time.
Magic state distillation at intermediate size
Jeongwan Haah, Matthew B Hastings, D Poulin, and D Wecker · 2018
Closest in time.
Distillation with sublogarithmic overhead
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Guillaume Duclos-Cianci and David Poulin · 2015
Cited alongside, same era.
Optimal ancilla-free clifford+ t approximation of z-rotations
Neil J Ross and Peter Selinger · 2016
Cited alongside, same era.
Roads towards fault-tolerant universal quantum computation
Earl T Campbell, Barbara M Terhal, and Christophe Vuillot · 2017
Cited alongside, same era.
Multilevel distillation of magic states for quantum computing
Cody Jones
Cited in the paper.
Distillation protocols for fourier states in quantum computing
Cody Jones
Cited in the paper.
Low-overhead constructions for the fault-tolerant toffoli gate
Cody Jones
Cited in the paper.
Unifying gate synthesis and magic state distillation
Earl T. Campbell and Mark Howard
Cited in the paper.
Matthew B. Hastings and Jeongwan Haah · 2018
Closest in time.
An efficient magic state approach to small angle rotations
Earl T Campbell and Joe O’Gorman · 2058
Closest in time.