Fetching the paper…
Reading the bibliography…
We consider the task of breaking down a quantum computation given as an isometry into C-NOTs and single-qubit gates, while keeping the number of C-NOT gates small.
A. S. Householder, “Unitary triangularization of a nonsymmetric matrix,” J. ACM 5
1958
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A 52
1995
Earlier work this paper cites.
E. Knill, “Approximation by quantum circuits,” e-print arXiv:quant-ph/9508006 (1995)
1995
Earlier work this paper cites.
P. Heggernes and P. Matstoms, “Finding good column orderings for sparse QR factorization,” in Second SIAM Conference on Sparse Matrices (1996)
1996
Earlier work this paper cites.
V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes, “Synthesis of reversible logic circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 22
2003
Earlier work this paper cites.
S. Fenner, “Implementing the fanout gate by a Hamiltonian,” e-print arXiv:quant-ph/0309163 (2003)
2003
Earlier work this paper cites.
V. V. Shende, I. L. Markov, and S. S. Bullock, “Minimal universal two-qubit controlled-not-based circuits,” Phys. Rev. A 69
2004
Earlier work this paper cites.
V. V. Shende, I. L. Markov, and S. S. Bullock, “Smaller two-qubit circuits for quantum communication and computation,” in Proceedings Design, Automation and Test in Europe Conference and Exhibition , Vol. 2 (2004) pp. 980–985
2004
Cited alongside, same era.
V. Bergholm, J. J. Vartiainen, M. Möttönen, and M. M. Salomaa, “Quantum circuits with uniformly controlled one-qubit gates,” Phys. Rev. A 71
2005
Cited alongside, same era.
V. V. Shende, S. S. Bullock, and I. L. Markov, “Synthesis of quantum-logic circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25
2006
Cited alongside, same era.
P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov, “Engineering of arbitrary U ( n ) \mathrm{U}(n) transformations by quantum Householder reflections,” Phys. Rev. A 74
2006
Cited alongside, same era.
S. P. Jordan and P. Wocjan, “Efficient quantum circuits for arbitrary sparse unitaries,” Phys. Rev. A 80
V. Kliuchnikov, “Synthesis of unitaries with Clifford+T circuits,” e-print arXiv:1306.3200 (2013)
2013
Later among the works it cites.
B. Torosov, E. Kyoseva, and N. Vitanov, “Fault-tolerant composite Householder reflection,” Journal of Physics B: Atomic 48
2015
Later among the works it cites.
D. Maslov, “Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization,” Phys. Rev. A 93
2016
Later among the works it cites.
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…
2009
Cited alongside, same era.
M. Plesch and Č. Brukner, “Quantum-state preparation with universal gate decompositions,” Phys. Rev. A 83
2011
Cited alongside, same era.
R. Iten, R. Colbeck, I. Kukuljan, J. Home, and M. Christandl, “Quantum circuits for isometries,” Phys. Rev. A 93
Cited in the paper.
R. Iten, R. Colbeck, and M. Christandl, “Quantum circuits for quantum channels,” Physical Review A 95
Cited in the paper.
2019
Later among the works it cites.
T. G. de Brugière, M. Baboulin, B. Valiron, and C. Allouche, “Quantum circuits synthesis using Householder transformations,” Computer Physics Communications 248
2020
Closest in time.