Fetching the paper…
Reading the bibliography…
Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach.
R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics , vol. 21, pp. 467–488, 1982
1982
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,” Physical Review A , vol. 52, no. 5, p. 3457, 1995
1995
Earlier work this paper cites.
C. Pomerance, “A tale of two sieves,” Notices of the AMS , vol. 43, no. 12, pp. 1473–1485, 1996
1996
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.
R. Drechsler, “Preudo-Kronecker expressions for symmetric functions,” IEEE Trans. on Computers , vol. 48, no. 9, pp. 987–990, 1999
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge University Press, 2000
2000
Earlier work this paper cites.
A. Mishchenko and M. A. Perkowski, “Fast heuristic minimization of exclusive-sum-of-products,” in Reed-Muller Workshop , 2001
2001
Earlier work this paper cites.
R. Královic, “Time and space complexity of reversible pebbling,” in Conf. on Current Trends in Theory and Practice of Informatics , 2001, pp. 292–303
2001
Earlier work this paper cites.
R. Somma, G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, “Simulating physical phenomena by quantum networks,” Physical Review A , vol. 65, p. 04323, 2002
2002
Earlier work this paper cites.
A. Mishchenko and M. A. Perkowski, “Logic syntheis of reversible wave cascades,” in Int’l Workshop on Logic and Synthesis , 2002
2002
Earlier work this paper cites.
D. M. Miller, D. Maslov, and G. W. Dueck, “A transformation based algorithm for reversible logic synthesis,” in Design Automation Conference , 2003, pp. 318–323
2003
Earlier work this paper cites.
V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes, “Synthesis of reversible logic circuits,” IEEE Trans. on CAD of Integrated Circuits and Systems , vol. 22, no. 6, pp. 710–722, 2003
2003
Earlier work this paper cites.
A. Aspuru-Guzik, A. D. Dutoi, and M. Love, Peter J.and Head-Gordon, “Simulated quantum computation of molecular energies,” Science , vol. 309, pp. 1704–1707, 2005
2005
Earlier work this paper cites.
K. M. Svore, A. V. Aho, A. W. Cross, I. Chuang, and I. L. Markov, “A layered software architecture for quantum computing design tools,” IEEE Computer , vol. 39, no. 1, pp. 74–83, 2006
2006
Earlier work this paper cites.
D. Maslov, G. W. Dueck, and D. M. Miller, “Techniques for the synthesis of reversible Toffoli networks,” ACM Trans. Design Autom. Electr. Syst. , vol. 12, no. 4, p. 42, 2007
2007
Earlier work this paper cites.
K. Fazel, M. A. Thornton, and J. E. Rice, “ESOP-based Toffoli gate cascade generation,” in Pacific Rim Conference on Communications, Computers and Signal Processing , 2007
2007
Earlier work this paper cites.
A. De Vos and Y. Van Rentergem, “Young subgroups for reversible computers,” Advances in Mathematics of Communications , vol. 2, no. 2, pp. 183–200, 2008
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters , vol. 103, no. 15, p. 150502, 2009
2009
Earlier work this paper cites.
R. Wille and R. Drechsler, “BDD-based synthesis of reversible logic for large functions,” in Design Automation Conference , 2009, pp. 270–275
2009
Earlier work this paper cites.
D. Große, R. Wille, G. W. Dueck, and R. Drechsler, “Exact synthesis of elementary quantum gate circuits,” Multiple-Valued Logic and Soft Computing , vol. 15, no. 4, pp. 283–300, 2009
2009
Earlier work this paper cites.
M. Saeedi, M. S. Zamani, M. Sedighi, and Z. Sasanian, “Reversible circuit synthesis using a cycle-based approach,” ACM Journal on Emerging Technologies in Computing Systems , vol. 6, no. 4, p. 13, 2010
2010
Earlier work this paper cites.
M. Soeken, R. Wille, and R. Drechsler, “Hierarchical synthesis of reversible circuits using positive and negative Davio decomposition,” in Int’l Design and Test Symp. , 2010, pp. 143–148
2010
Earlier work this paper cites.
M. Roetteler, “Quantum algorithms for highly non-linear Boolean functions,” in ACM-SIAM Symp. on Discrete Algorithms , 2010, pp. 448–457
2010
Earlier work this paper cites.
A. M. Childs and W. van Dam, “Quantum algorithms for algebraic problems,” Reviews of Modern Physics , vol. 82, no. 1, pp. 1–52, 2010
2010
Earlier work this paper cites.
J. Miszczak, “Models of quantum computation and quantum programming languages,” Bull. Pol. Acad. Sci.-Tech. Sci. , vol. 59, no. 3, pp. 305–324, 2011
2011
Cited alongside, same era.
S. P. Jordan, K. S. M. Lee, and J. Preskill, “Quantum algorithms for quantum field theories,” Science , vol. 336, pp. 1130–1133, 2012
2012
Cited alongside, same era.
M. Soeken, R. Wille, C. Hilken, N. Przigoda, and R. Drechsler, “Synthesis of reversible circuits with minimal lines for large functions,” in Asia and South Pacific Design Automation Conference , 2012, pp. 85–92
2012
Cited alongside, same era.
M. Soeken, S. Frehse, R. Wille, and R. Drechsler, “RevKit: A toolkit for reversible circuit design,” Multiple-Valued Logic and Soft Computing , vol. 18, no. 1, pp. 55–65, 2012
2012
Cited alongside, same era.
B. D. Clader, B. C. Jacobs, and C. R. Sprouse, “Preconditioned quantum linear system algorithm,” Physical Review Letters , vol. 110, no. 25, p. 250504, 2013
M. Soeken, R. Wille, O. Keszocze, D. M. Miller, and R. Drechsler, “Embedding of large Boolean functions for reversible logic,” ACM Journal on Emerging Technologies in Computing Systems , vol. 12, no. 4, pp. 41:1–41:26, 2016
2016
Later among the works it cites.
M. Soeken and A. Chattopadhyay, “Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis,” in Design Automation Conference , 2016, pp. 149:1–149:6
2016
Later among the works it cites.
B. Valiron, “Generating reversible circuits from higher-order functional programs,” in Int’l Conf. on Reversible Computation , 2016, pp. 289–306
2016
Later among the works it cites.
S. Bravyi and D. Gosset, “Improved classical simulation of quantum circuits dominated by Clifford gates,” Physical Review Letters , vol. 116, no. 25, p. 250501, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
A. Green, P. L. Lumsdaine, N. Ross, P. Selinger, and B. Valiron, “Quipper: A scalable quantum programming language,” in ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’13, Seattle, WA, USA, June 16-19, 2013 , 2013, pp. 333–342
2013
Cited alongside, same era.
M. Saeedi and I. L. Markov, “Synthesis and optimization of reversible circuits - a survey,” ACM Computing Surveys , vol. 45, no. 2, pp. 21:1–21:34, 2013
2013
Cited alongside, same era.
T. H. Johnson, S. R. Clark, and D. Jaksch, “What is a quantum simulator?” EPJ Quantum Technology , vol. 1, no. 10, pp. 1–12, 2014
2014
Cited alongside, same era.
D. Wecker and K. M. Svore, “LIQUi|>: A software design architecture and domain-specific language for quantum computing,” 2014
2014
Cited alongside, same era.
C. Bandyopadhyay, H. Rahaman, and R. Drechsler, “Improved cube list based cube pairing approach for synthesis of ESOP based reversible logic,” Transactions on Computational Science , vol. 24, pp. 129–146, 2014
2014
Cited alongside, same era.
M. Amy, D. Maslov, and M. Mosca, “Polynomial-time T T -depth optimization of Clifford+ T T circuits via matroid partitioning,” IEEE Trans. on CAD of Integrated Circuits and Systems , vol. 33, no. 10, pp. 1476–1489, 2014
2014
Cited alongside, same era.
D. W. Berry, A. M. Childs, and R. Kothari, “Hamiltonian simulation with nearly optimal dependence on all parameters,” in IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015 , 2015, pp. 792–809
2015
Cited alongside, same era.
T. Häner, M. Roetteler, and K. M. Svore, “Factoring using 2 n + 2 2n+2 qubits with Toffoli based modular multiplication,” Quantum Information and Computation , vol. 18, no. 7&8, pp. 673–684, 2017
2017
Later among the works it cites.
M. Roetteler, M. Naehrig, K. Svore, and K. Lauter, “Quantum resource estimates for computing elliptic curve discrete logarithms,” in Proceedings of the 23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT’17), Hong King, China , ser. Lecture Notes in Computer Science, vol. 10625. Springer, 2017, pp. 241–270
2017
Later among the works it cites.
A. Scherer, B. Valiron, S. Mau, D. S. Alexander, E. van den Berg, and T. E. Chapuran, “Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target,” Quantum Information Processing , vol. 16, no. 3, p. 60, 2017
2017
Later among the works it cites.
F. T. Chong, D. Franklin, and M. Martonosi, “Programming languages and compiler design for realistic quantum hardware,” Nature , vol. 549, no. 7671, pp. 180–187, 2017
2017
Later among the works it cites.
D. Castelvecchi, “Quantum computers ready to leap out of the lab in 2017,” Nature , vol. 541, no. 7635, pp. 9–10, 2017
2017
Later among the works it cites.
IBM, “IBM builds its most powerful universal quantum computing processors,” 2017, press release by IBM, posted online May 17, 2017
2017
Later among the works it cites.
Rigetti, “Unsupervised machine learning on Rigetti 19Q with Forest1.2,” 2017, press release by Rigetti, Inc., posted online December 18, 2017
2017
Later among the works it cites.
Intel, “Intel delivers 17-qubit superconducting chip with advanced packaging to QuTech,” 2017, press release by Intel, posted online October 10, 2017
2017
Later among the works it cites.
IBM, “IBM announces advances to IBM quantum systems & ecosystem,” 2017, press release by IBM, posted online Nov 10, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
T. Häner and D. S. Steiger, “0.5 petabyte simulation of a 45-qubit quantum circuit,” in Int’l Conf. on High Performance Computing, Networking, Storage and Analysis , 2017, pp. 33:1–33:10
2017
Later among the works it cites.
J. Paykin, R. Rand, and S. Zdancewic, “QWIRE: a core language for quantum circuits,” in Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017 , 2017, pp. 846–858
2017
Later among the works it cites.
“Microsoft Quantum Development Kit,” 2017, available at https://microsoft.com/quantum
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Zulehner and R. Wille, “Make it reversible: Efficient embedding of non-reversible functions,” in Design, Automation and Test in Europe , 2017, pp. 458–463
2017
Later among the works it cites.
M. Soeken, M. Roetteler, N. Wiebe, and G. De Micheli, “Design automation and design space exploration for quantum computers,” in Design, Automation and Test in Europe , 2017, pp. 470–475
2017
Later among the works it cites.
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
Later among the works it cites.
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.
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 Proceedings of the Real World Domain Specific Languages Workshop (RWDSL 2018) . ACM, 2018, pp. 7:1–7:10
2018
Closest in time.