Fetching the paper…
Reading the bibliography…
Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations.
Scheme for reducing decoherence in quantum computer memory
Peter W Shor · 1995
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
Resilient quantum computation
Emanuel Knill, Raymond Laflamme, and Wojciech H Zurek · 1998
Earlier work this paper cites.
Resilient quantum computation: error models and thresholds
Emanuel Knill, Raymond Laflamme, and Wojciech H Zurek · 1998
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.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A.Yu. Kitaev · 2003
Earlier work this paper cites.
Simulated quantum computation of molecular energies
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon · 2005
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.
Measurement-based quantum computation with the toric code states
Sergey Bravyi and Robert Raussendorf · 2007
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Restrictions on transversal encoded quantum gate sets
Emanuel Knill Bryan Eastin · 2009
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
Cited alongside, same era.
Quantum computation with topological codes: from qubit to topological fault-tolerance, 2015
Keisuke Fujii · 2015
Cited alongside, same era.
Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code
Hayato Goto · 2016
Cited alongside, same era.
Optimal ancilla-free clifford+t approximation of z-rotations
Neil J. Ross and Peter Selinger · 2016
Cited alongside, same era.
Fault-tolerant interface between quantum memories and quantum processors
Hendrik Poulsen Nautrup, Nicolai Friis, and Hans J. Briegel · 2017
Cited alongside, same era.
Quantum Computing in the NISQ era and beyond
John Preskill · 2018
Qulacs: a fast and versatile quantum circuit simulator for research purpose
Yasunari Suzuki, Yoshiaki Kawase, Yuya Masumura, Yuria Hiraga, Masahiro Nakadai, Jiabao Chen, Ken M. Nakanishi, Kosuke Mitarai, Ryosuke Imai, Shiro Tamiya, Takahiro Yamamoto, Tennin Yan, Toru Kawakubo, Yuya O. Nakagawa, Yohei Ibe, Youyuan Zhang, Hirotsugu Yamashita, Hikaru Yoshimura, Akihiro Hayashi, and Keisuke Fujii · 2021
Later among the works it cites.
A fault-tolerant honeycomb memory
Craig Gidney, Michael Newman, Austin Fowler, and Michael Broughton · 2021
Later among the works it cites.
Stim: a fast stabilizer circuit simulator
Craig Gidney · 2021
Later among the works it cites.
Demonstration of fault-tolerant universal quantum gate operations
Lukas Postler, Sascha Heu β \beta en, Ivan Pogorelov, Manuel Rispler, Thomas Feldker, Michael Meth, Christian D Marciniak, Roman Stricker, Martin Ringbauer, Rainer Blatt, et al · 2022
Later among the works it cites.
Phase transition in random circuit sampling, 2023
A. Morvan et al · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fault-tolerant magic state preparation with flag qubits
Christopher Chamberland and Andrew W Cross · 2019
Cited alongside, same era.
Magic State Distillation: Not as Costly as You Think
Daniel Litinski · 2019
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
Cited alongside, same era.
Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits
Lingling Lao and Carmen G Almudever · 2020
Cited alongside, same era.
Variational quantum algorithms
M. Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, and Patrick J. Coles · 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.
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout van den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, and Abhinav Kandala · 2023
Later among the works it cites.
Partially fault-tolerant quantum computing architecture with error-corrected clifford gates and space-time efficient analog rotations, 2023
Yutaro Akahoshi, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato, and Keisuke Fujii · 2023
Later among the works it cites.
Simulation and performance analysis of quantum error correction with a rotated surface code under a realistic noise model
Mitsuki Katsuda, Kosuke Mitarai, and Keisuke Fujii · 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.
Magic state cultivation: growing t states as cheap as cnot gates
Craig Gidney, Noah Shutty, and Cody Jones · 2024
Closest in time.
Beyond nisq: The megaquop machine
John Preskill · 2025
Closest in time.