Fetching the paper…
Reading the bibliography…
The purpose of unitary synthesis is to find a gate sequence that optimally approximates a target unitary transformation.
Mixed-state entanglement and quantum error correction
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, and William K. Wootters. 1996 · 1996
Earlier work this paper cites.
Entanglement of a Pair of Quantum Bits
Sam A. Hill and William K. Wootters. 1997 · 1997
Earlier work this paper cites.
Resilient quantum computation: error models and thresholds
Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek. 1998 · 1998
Earlier work this paper cites.
Cryptographic distinguishability measures for quantum-mechanical states
C.A. Fuchs and J. van de Graaf. 1999 · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang. 2000 · 2000
Earlier work this paper cites.
Efficient discrete approximations of quantum gates
Aram W. Harrow, Benjamin Recht, and Isaac L. Chuang. 2002 · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu Kitaev, A. H. Shen, and M. N. Vyalyi. 2002 · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A.Yu. Kitaev. 2003 · 2003
Earlier work this paper cites.
Semidefinite Programs and Combinatorial Optimization
L. Lovász. 2003 · 2003
Earlier work this paper cites.
Toward a General Theory of Quantum Games. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (San Diego, California, USA) (STOC ’07) . Association for Computing Machinery, New York, NY, USA, 565–574
Gus Gutoski and John Watrous. 2007 · 2007
Earlier work this paper cites.
Fault-Tolerant Quantum Computation with Constant Error Rate
Dorit Aharonov and Michael Ben-Or. 2008 · 2008
Cited alongside, same era.
Theoretical framework for quantum networks
Giulio Chiribella, Giacomo Mauro D’Ariano, and Paolo Perinotti. 2009 · 2009
Cited alongside, same era.
Constructing Arbitrary Steane Code Single Logical Qubit Fault-Tolerant Gates
Austin G. Fowler. 2011 · 2011
Cited alongside, same era.
Factorization and Dilation Problems for Completely Positive Maps on von Neumann Algebras
Uffe Haagerup and Magdalena Musat. 2011 · 2011
Cited alongside, same era.
Nengkun Yu, Runyao Duan, and Quanhua Xu. 2012 · 2012
Cited alongside, same era.
Optimal Ancilla-Free CLIFFORD+V Approximation of Z-Rotations
Neil J. Ross. 2015 · 2015
Later among the works it cites.
Quantum error correction for quantum memories
Barbara M. Terhal. 2015 · 2015
Later among the works it cites.
Shorter gate sequences for quantum computing by mixing unitaries
Earl Campbell. 2017 · 2017
Later among the works it cites.
Turning Gate Synthesis Errors into Incoherent Errors
Matthew B. Hastings. 2017 · 2017
Later among the works it cites.
Optimal convex approximations of quantum states
Massimiliano F. Sacchi. 2017 · 2017
Later among the works it cites.
Convex approximations of quantum channels
Massimiliano F. Sacchi and Tito Sacchi. 2017 · 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…
Michal Horodecki and Jonathan Oppenheim. 2013 · 2013
Cited alongside, same era.
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 · 2013
Cited alongside, same era.
Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits
Alex Bocharov, Martin Roetteler, and Krysta M. Svore. 2015 · 2015
Cited alongside, same era.
Reversible Framework for Quantum Resource Theories
Fernando G. S. L. Brandão and Gilad Gour. 2015 · 2015
Cited alongside, same era.
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca. 2016 · 2015
Cited alongside, same era.
John Watrous. 2018 · 2018
Later among the works it cites.
Quantum resource theories
Eric Chitambar and Gilad Gour. 2019 · 2019
Later among the works it cites.
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
Adam Bouland and Tudor Giurgica-Tiron. 2021 · 2021
Later among the works it cites.
Vadym Kliuchnikov, Kristin Lauter, Romy Minko, Adam Paetznick, and Christophe Petit. 2022 · 2022
Later among the works it cites.