Fetching the paper…
Reading the bibliography…
We designed an search algorithm in order to find a non-transversal but fault-tolerant construction of a logical controlled-phase gate for general [[n,1,d]] degenerate quantum code.
Knill, Emanuel, Raymond Laflamme, and Wojciech Zurek. ”Accuracy threshold for quantum computation.”
1996
Earlier work this paper cites.
Shor, Peter W. ”Fault-tolerant quantum computation.” Proceedings of 37th Conference on Foundations of Computer Science. IEEE, 1996
1996
Earlier work this paper cites.
Steane, Andrew M. ”Error correcting codes in quantum theory.”
1996
Earlier work this paper cites.
Shor, Peter W. ”Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.”
1999
Earlier work this paper cites.
Nielsen, Michael A., and Isaac Chuang
2002
Earlier work this paper cites.
Oskin, Mark, Frederic T. Chong, and Isaac L. Chuang. ”A practical architecture for reliable quantum computers.”
2002
Earlier work this paper cites.
Bravyi, Sergey, and Alexei Kitaev. ”Universal quantum computation with ideal Clifford gates and noisy ancillas.”
2005
Earlier work this paper cites.
Metodi, Tzvetan S., et al. ”A general purpose architectural layout for arbitrary quantum computations.”
2005
Earlier work this paper cites.
Aliferis, Panos, Daniel Gottesman, and John Preskill. ”Quantum accuracy threshold for concatenated distance-3 codes.”
2006
Earlier work this paper cites.
Bacon, Dave. ”Operator quantum error-correcting subsystems for self-correcting quantum memories.”
2006
Cited alongside, same era.
Aliferis, Panos, and Andrew W. Cross. ”Subsystem fault tolerance with the Bacon-Shor code.”
2007
Cited alongside, same era.
Gottesman, Daniel. ”An introduction to quantum error correction and fault-tolerant quantum computation.”
2010
Cited alongside, same era.
Zeng, Bei, Andrew Cross, and Isaac L. Chuang. ”Transversality versus universality for additive quantum codes.”
2011
Cited alongside, same era.
Bravyi, Sergey, and Jeongwan Haah. ”Magic-state distillation with low overhead.”
2012
Cited alongside, same era.
Fowler, Austin G., et al. ”Surface codes: Towards practical large-scale quantum computation.”
Yoder, Theodore J., Ryuji Takagi, and Isaac L. Chuang. ”Universal fault-tolerant gates on concatenated stabilizer codes.”
2016
Later among the works it cites.
Campbell, Earl T., Barbara M. Terhal, and Christophe Vuillot. ”Roads towards fault-tolerant universal quantum computation.”
2017
Later among the works it cites.
Li, Muyuan, et al. ”Fault tolerance with bare ancillary qubits for a [[7, 1, 3]] code.”
2017
Later among the works it cites.
Chamberland, Christopher, Tomas Jochym-O’Connor, and Raymond Laflamme. ”Overhead analysis of universal concatenated quantum codes.”
2017
Later among the works it cites.
Nikahd, Eesa, Mehdi Sedighi, and Morteza Saheb Zamani. ”Nonuniform code concatenation for universal fault-tolerant quantum computing.”
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Fowler, Austin G., Simon J. Devitt, and Cody Jones. ”Surface code implementation of block code state distillation.”
2013
Cited alongside, same era.
Gottesman, Daniel. ”Fault-tolerant quantum computation with constant overhead.”
2014
Cited alongside, same era.
Jochym-O’Connor, Tomas, and Raymond Laflamme. ”Using concatenated quantum codes for universal fault-tolerant quantum gates.”
2014
Cited alongside, same era.
Wecker, Dave, and Krysta M. Svore. ”LIQUi—¿: A software design architecture and domain-specific language for quantum computing.” unpublished
Cited in the paper.
Preskill, John. ”Quantum Computing in the NISQ era and beyond.”
2018
Later among the works it cites.
Neill, Charles, et al. ”A blueprint for demonstrating quantum supremacy with superconducting qubits.”
2018
Later among the works it cites.
Chao, Rui, and Ben W. Reichardt. ”Fault-tolerant quantum computation with few qubits.”
2018
Later among the works it cites.