Fetching the paper…
Reading the bibliography…
We present a constructive method to create quantum circuits that implement oracles $|x\rangle|y\rangle|0\rangle^k \mapsto |x\rangle|y \oplus f(x)\rangle|0\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count.
C. H. Bennett, “Time/space trade-offs for reversible computation,” SIAM Journal on Computing , vol. 18, no. 4, pp. 766–776, 1989
1989
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Symposium on Theory and Computing , 1996, pp. 212–219
1996
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing , vol. 26, no. 5, pp. 1484–1509, 1997
1997
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, “Quantum teleportation is a universal computational primitive,” Nature , vol. 402, pp. 390–393, 1999
1999
Earlier work this paper cites.
J. Boyar, R. Peralta, and D. Pochuev, “On the multiplicative complexity of boolean functions over the basis ( ∧ , ⊕ , 1 ) (\land,\oplus,1) ,” Theoretical Computer Science , vol. 235, no. 1, pp. 43–57, 2000
2000
Earlier work this paper cites.
S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Physical Review A , vol. 71, p. 022316, 2005
2005
Earlier work this paper cites.
A. Mishchenko, S. Chatterjee, and R. Brayton, “DAG-aware AIG rewriting: a fresh look at combinational logic synthesis,” in Design Automation Conference , 2006
2006
Earlier work this paper cites.
K. Fazel, M. A. Thornton, and J. Rice, “ESOP-based toffoli gate cascade generation,” in Pacific Rim Conference on Communications, Computers and Signal Processing , 2007
2007
Earlier work this paper cites.
J. Boyar and R. Peralta, “Tight bounds for the multiplicative complexity of symmetric functions,” Theoretical Computer Science , vol. 396, no. 1–3, pp. 223–246, 2008
2008
Earlier work this paper cites.
L. M. de Moura and N. Bjørner, “Z3: an efficient SMT solver,” in Int’l Conf. on Tools and Algorithms for the Construction and Analysis of Systems , 2008, pp. 337–340
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett. , vol. 103, 2009
2009
Earlier work this paper cites.
C. Fuhs and P. Schneider-Kamp, “Synthesizing shortest linear straight-line programs over GF(2) using SAT,” in Int’l Conf. on Theory and Applications of Satisfiability Testing , 2010, pp. 71–84
2010
Cited alongside, same era.
M. Amy, D. Maslov, M. Mosca, and M. Roetteler, “A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits,” IEEE Trans. on CAD of Integrated Circuits and Systems , vol. 32, no. 6, pp. 818–830, 2013
2013
Cited alongside, same era.
C. Jones, “Low-overhead constructions for the fault-tolerant Toffoli gate,” Physical Review A , vol. 87, no. 2, p. 022328, 2013
2013
Cited alongside, same era.
J. Boyar, P. Matthews, and R. Peralta, “Logic minimization techniques with applications to cryptology,” Journal of Cryptology , vol. 26, no. 2, pp. 280–312, 2013
2013
Cited alongside, same era.
A. Parent, M. Roetteler, and K. M. Svore, “REVS: A tool for space-optimized reversible circuit synthesis,” in Int’l Conf. on Reversible Computation , 2017, pp. 90–101
2017
Later among the works it cites.
2017
Later among the works it cites.
C. Gidney, “Halving the cost of quantum addition,” Quantum , vol. 2, p. 74, 2018
2018
Later among the works it cites.
G. Meuli, M. Soeken, M. Roetteler, N. Wiebe, and G. De Micheli, “A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+ T quantum network synthesis,” in Asia and South Pacific Design Automation Conference . IEEE Press, 2018, pp. 664–669
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…
2014
Cited alongside, same era.
D. E. Knuth, The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability . Addison-Wesley, 2015
2015
Cited alongside, same era.
M. Grassl, B. Langenberg, M. Roetteler, and R. Steinwandt, “Applying grover’s algorithm to AES: quantum resource estimates,” in Post-Quantum Cryptography , 2016
2016
Cited alongside, same era.
M. Soeken, M. Roetteler, N. Wiebe, and G. De Micheli, “Hierarchical reversible logic synthesis using LUTs,” in Design Automation Conference , 2017, pp. 78:1–78:6
2017
Cited alongside, same era.
J. O’Gorman and E. T. Campbell, “Quantum computation with realistic magic-state factories,” Physical Review A , vol. 95, no. 3, p. 032338, 2017
2017
Cited alongside, same era.
M. Howard and E. Campbell, “Application of a resource theory for magic states to fault-tolerant quantum computing,” Phys. Rev. Lett. , vol. 118, 2017
2017
Cited alongside, same era.
K. Svore, A. Geller, M. Troyer, J. Azariah, C. Granade, B. Heim, V. Kliuchnikov, M. Mykhailova, A. Paz, and M. Roetteler, “Q#: Enabling scalable quantum computing and development with a high-level DSL,” in Real World Domain Specific Languages Workshop , 2018, pp. 7:1–7:10
2018
Later among the works it cites.
Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, “Automated optimization of large quantum circuits with continuous parameters,” npj Quantum Information , vol. 4, no. 23, pp. 1–12, 2018
2018
Later among the works it cites.
G. Meuli, M. Soeken, and G. De Micheli, “SAT-based { \{ CNOT, T } \} quantum circuit synthesis,” in Int’l Conf. on Reversible Computation . Springer, 2018, pp. 175–188
2018
Later among the works it cites.
E. Testa, M. Soeken, L. Amarú, and G. De Micheli, “Reducing the multiplicative complexity in logic networks for cryptography and security applications,” in DAC , 2019
2019
Closest in time.
Ç. Çalik, M. S. Turan, and R. Peralta, “The multiplicative complexity of 6-variable Boolean functions,” Cryptography and Communications , vol. 11, no. 1, pp. 93–107, 2019
2019
Closest in time.
G. Meuli, M. Soeken, M. Roetteler, N. Bjorner, and G. De Micheli, “Reversible pebbling game for quantum memory management,” in Design, Automation and Test in Europe , 2019
2019
Closest in time.