Fetching the paper…
Reading the bibliography…
This work focuses on reducing the physical cost of implementing quantum algorithms when using the state-of-the-art fault-tolerant quantum error correcting codes, in particular, those for which implementing the T gate consumes vastly more resources than the other gates in the gate set.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Quantum computations: algorithms and error correction
A Yu Kitaev · 1997
Earlier work this paper cites.
The heisenberg representation of quantum computers
Daniel Gottesman · 1998
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W Shor · 1999
Earlier work this paper cites.
Quantum teleportation is a universal computational primitive
Daniel Gottesman and Isaac L Chuang · 1999
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Universal quantum computation with ideal clifford gates and noisy ancillas
Bravyi, S., and Kitaev, A · 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.
The solovay-kitaev algorithm
CM Dawson and MA Nielsen · 2006
Earlier work this paper cites.
Optimal synthesis of linear reversible circuits
Ketan N Patel, Igor L Markov, and John P Hayes · 2008
Earlier work this paper cites.
High-threshold universal quantum computation on the surface code
Austin G Fowler, Ashley M Stephens, and Peter Groszkowski · 2009
Earlier work this paper cites.
Single-qubit-gate error below 10- 4 in a trapped ion
Kenton R Brown, Andrew C Wilson, Yves Colombe, C Ospelkaus, Adam M Meier, E Knill, D Leibfried, and David J Wineland · 2011
Earlier work this paper cites.
Engineered two-dimensional ising interactions in a trapped-ion quantum simulator with hundreds of spins
Joseph W Britton, Brian C Sawyer, Adam C Keith, C-C Joseph Wang, James K Freericks, Hermann Uys, Michael J Biercuk, and John J Bollinger · 2012
Earlier work this paper cites.
Universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
Jerry M Chow, Jay M Gambetta, AD Córcoles, Seth T Merkel, John A Smolin, Chad Rigetti, S Poletto, George A Keefe, Mary B Rothwell, JR Rozen, et al · 2012
Earlier work this paper cites.
Superconducting qubit in a waveguide cavity with a coherence time approaching 0.1 ms
Chad Rigetti, Jay M Gambetta, Stefano Poletto, BLT Plourde, Jerry M Chow, AD Córcoles, John A Smolin, Seth T Merkel, JR Rozen, George A Keefe, et al · 2012
Earlier work this paper cites.
Strong resilience of topological codes to depolarization
Héctor Bombin, Ruben S Andrist, Masayuki Ohzeki, Helmut G Katzgraber, and Miguel A Martín-Delgado · 2012
Earlier work this paper cites.
Towards practical classical processing for the surface code
Austin G Fowler, Adam C Whiteside, and Lloyd CL Hollenberg · 2012
Cited alongside, same era.
Universal fault-tolerant quantum computation with only transversal gates and error correction
Adam Paetznick and Ben W Reichardt · 2013
Cited alongside, same era.
Exact synthesis of multiqubit clifford+ t circuits
Brett Giles and Peter Selinger · 2013
Cited alongside, same era.
Synthesis of unitaries with clifford+ t circuits
Vadym Kliuchnikov · 2013
Cited alongside, same era.
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and t gates
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2013
Cited alongside, same era.
Low-overhead constructions for the fault-tolerant toffoli gate
Improved classical simulation of quantum circuits dominated by clifford gates
Sergey Bravyi and David Gosset · 2016
Later among the works it cites.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A Smolin · 2016
Later among the works it cites.
Parallelizing quantum circuit synthesis
Olivia Di Matteo and Michele Mosca · 2016
Later among the works it cites.
Optimal ancilla-free clifford+ t approximation of z-rotations
Neil J Ross and Peter Selinger · 2016
Later among the works it cites.
Halving the cost of quantum addition
Craig Gidney · 2018
Later among the works it cites.
An efficient quantum compiler that reduces t count
Luke E Heyfron and Earl T Campbell · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cody Jones · 2013
Cited alongside, same era.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler · 2013
Cited alongside, same era.
Quantum circuits of t-depth one
Selinger, P · 2013
Cited alongside, same era.
Fast and efficient exact synthesis of single qubit unitaries generated by clifford and t gates
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2013
Cited alongside, same era.
Asymptotically optimal approximation of single qubit unitaries by clifford and t circuits using a constant number of ancillary qubits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 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.
Polynomial-time t-depth optimization of clifford+ t circuits via matroid partitioning
Matthew Amy, Dmitri Maslov, and Michele Mosca · 2014
Cited alongside, same era.
On the controlled-not complexity of controlled-not–phase circuits
Matthew Amy, Parsiad Azimzadeh, and Michele Mosca · 2018
Later among the works it cites.
Quantum circuit design of a t-count optimized integer multiplier
Edgard Muñoz-Coreas and Himanshu Thapliyal · 2018
Later among the works it cites.
T-count optimization and reed-muller codes
Matthew Amy and Michele Mosca · 2019
Later among the works it cites.
Techniques to reduce π / 4 \pi/4 -parity phase circuits, motivated by the zx calculus
Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang · 2019
Later among the works it cites.
Optimizing t gates in clifford+ t circuit as π / 4 \pi/4 rotations around paulis
Fang Zhang and Jianxin Chen · 2019
Later among the works it cites.
Reducing t-count with the zx-calculus
Aleks Kissinger and John van de Wetering · 2019
Later among the works it cites.
https://globalriskinstitute.org/download/quantum-threat-timeline-report-2020/
Michele Mosca, and Marco Piani. Quantum threat timeline report 2020 · 2020
Closest in time.
Optimal two-qubit circuits for universal fault-tolerant quantum computation
Andrew N Glaudell, Neil J Ross, and Jacob M Taylor · 2020
Closest in time.
Quantum circuit designs of carry lookahead adder optimized for t-count t-depth and qubits
Himanshu Thapliyal, Edgard Muñoz-Coreas, and Vladislav Khalus · 2021
Closest in time.
T-count optimized quantum circuit designs for single-precision floating-point division
SS Gayathri, R Kumar, Samiappan Dhanalakshmi, Gerard Dooly, and Dinesh Babu Duraibabu · 2021
Closest in time.
A quasi-polynomial time heuristic algorithm for synthesizing t-depth optimal circuits
Vlad Gheorghiu, Michele Mosca, and Priyanka Mukhopadhyay · 2021
Closest in time.