Fetching the paper…
Reading the bibliography…
In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits.
Algorithms for quantum computation: discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Scheme for reducing decoherence in quantum computer memory
Peter W Shor · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K Grover · 1996
Earlier work this paper cites.
Two qcma-complete problems
Pawel Wocjan, Dominik Janzing, and Thomas Beth · 2003
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Optimal synthesis of linear reversible circuits
Ketan Patel, Igor Markov, , and John Hayes · 2008
Earlier work this paper cites.
Exact non-identity check is nqp-complete
Yu Tanaka · 2010
Earlier work this paper cites.
The complexity of boolean formula minimization
David Buchfuhrer and Christopher Umans · 2011
Earlier work this paper cites.
QMA-complete problems
Adam D Bookatz · 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.
Exact synthesis of multiqubit Clifford+ T circuits
Brett Giles and Peter Selinger · 2013
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 geometry of stabilizer states
Héctor J. García, Igor L. Markov, and Andrew W. Cross · 2014
Cited alongside, same era.
A Finite Presentation of CNOT-Dihedral Operators
Matthew Amy, Jianxin Chen, and Neil J. Ross · 2017
Cited alongside, same era.
An efficient quantum compiler that reduces T count
Luke E Heyfron and Earl T Campbell · 2018
Cited alongside, same era.
T-count optimization and Reed-Muller codes
Matthew Amy and Michele Mosca · 2019
Cited alongside, same era.
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.
Quantum algorithms for quantum chemistry and quantum materials science
Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan · 2020
Later among the works it cites.
Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities
Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang · 2020
Later among the works it cites.
Reducing the number of non-Clifford gates in quantum circuits
Aleks Kissinger and John van de Wetering · 2020
Later among the works it cites.
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Craig Gidney and Martin Ekerå · 2021
Later among the works it cites.
A (quasi-) polynomial time heuristic algorithm for synthesizing t-depth optimal circuits
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A tutorial on quantum approximate optimization algorithm (qaoa): Fundamentals and applications
Jaeho Choi and Joongheon Kim · 2019
Cited alongside, same era.
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
Cited alongside, same era.
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Daniel Litinski · 2019
Cited alongside, same era.
Magic State Distillation: Not as Costly as You Think
Daniel Litinski · 2019
Cited alongside, same era.
Vlad Gheorghiu, Michele Mosca, and Priyanka Mukhopadhyay · 2022
Later among the works it cites.
T-count and t-depth of any multi-qubit unitary
Vlad Gheorghiu, Michele Mosca, and Priyanka Mukhopadhyay · 2022
Later among the works it cites.
The variational quantum eigensolver: a review of methods and best practices
Jules Tilly, Hongxiang Chen, Shuxiang Cao, Dario Picozzi, Kanav Setia, Ying Li, Edward Grant, Leonard Wossnig, Ivan Rungger, George H Booth, et al · 2022
Later among the works it cites.
Quantum circuit optimization with alphatensor
Francisco JR Ruiz, Tuomas Laakkonen, Johannes Bausch, Matej Balog, Mohammadamin Barekatain, Francisco JH Heras, Alexander Novikov, Nathan Fitzpatrick, Bernardino Romera-Paredes, John van de Wetering, et al · 2024
Closest in time.
Optimal compilation of parametrised quantum circuits
John van de Wetering, Richie Yeung, Tuomas Laakkonen, and Aleks Kissinger · 2024
Closest in time.