A Practical Quantum Instruction Set Architecture

J. McCarthy, “Recursive functions of symbolic expressions and their computation by machine, part i,” Communications of the ACM , vol. 3, no. 4, pp. 184–195, 1960

1960

Earlier work this paper cites.

J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex fourier series,” Mathematics of computation , vol. 19, no. 90, pp. 297–301, 1965

1965

Earlier work this paper cites.

W. M. McKeeman, “Peephole optimization,” Commun. ACM , vol. 8, no. 7, pp. 443–444, Jul. 1965. [Online]. Available: http://doi.acm.org/10.1145/364995.365000

1965

Earlier work this paper cites.

F. E. Allen, “Control flow analysis,” SIGPLAN Not. , vol. 5, no. 7, pp. 1–19, Jul. 1970. [Online]. Available: http://doi.acm.org/10.1145/390013.808479

1970

Earlier work this paper cites.

D. Deutsch, “Quantum Theory, the Church–Turing Principle and the Universal Quantum Computer,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 400, no. 1818, pp. 97–117, 1985

1985

Earlier work this paper cites.

IEEE standard for binary floating-point arithmetic , New York, 1985, note: Standard 754–1985

1985

Earlier work this paper cites.

B. W. Kernighan, The C Programming Language , 2nd ed., D. M. Ritchie, Ed. Prentice Hall Professional Technical Reference, 1988

1988

Earlier work this paper cites.

American National Standards Institute and Information Technology Industry Council, American National Standard for Information Technology: programming language — Common LISP , American National Standards Institute, 1430 Broadway, New York, NY 10018, USA, 1996, approved December 8, 1994

1994

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.

D. Deutsch, A. Barenco, and A. Ekert, “Universality in quantum computation,” in Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 449, no. 1937. The Royal Society, 1995, pp. 669–677

1995

Earlier work this paper cites.

R. Milner, M. Tofte, and D. Macqueen, The Definition of Standard ML . Cambridge, MA, USA: MIT Press, 1997

1997

Earlier work this paper cites.

B. Ömer, “Structured quantum programming,” Ph.D. dissertation, Technical University of Vienna, 2003. [Online]. Available: http://tph.tuwien.ac.at/ oemer/doc/structquprog.pdf

2003

Earlier work this paper cites.

C. Lattner and V. Adve, “LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation,” in Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO’04) , Palo Alto, California, Mar 2004

2004

Earlier work this paper cites.

D. E. Knuth, The Art of Computer Programming, Volume 1, Fascicle 1: MMIX – A RISC Computer for the New Millennium (Art of Computer Programming) . Addison-Wesley Professional, 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.

P. Selinger and B. Valiron, “A lambda calculus for quantum computation with classical control,” Mathematical Structures in Computer Science , vol. 16, no. 03, pp. 527–552, 2006

2006

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge University Press, 2010

2010

Cited alongside, same era.

J. M. Chow, “Quantum information processing with superconducting qubits,” Ph.D. dissertation, Yale University, 2010

2010

Cited alongside, same era.

A. J. Abhari, A. Faruque, M. J. Dousti, L. Svec, O. Catu, A. Chakrabati, C.-F. Chiang, S. Vanderwilt, J. Black, and F. Chong, “Scaffold: Quantum programming language,” DTIC Document, Tech. Rep., 2012

2012

Cited alongside, same era.

A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger, and B. Valiron, “Quipper: A scalable quantum programming language,” SIGPLAN Not. , vol. 48, no. 6, pp. 333–342, Jun. 2013. [Online]. Available: http://doi.acm.org/10.1145/2499370.2462177

2013

Cited alongside, same era.

S. Aaronson, Quantum computing since Democritus . Cambridge University Press, 2013

A. JavadiAbhari, S. Patil, D. Kudrow, J. Heckey, A. Lvov, F. T. Chong, and M. Martonosi, “Scaffcc: Scalable compilation and analysis of quantum programs,” Parallel Computing , vol. 45, pp. 2–17, 2015

2015

Later among the works it cites.

P. J. J. O’Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler, E. Jeffrey, E. Lucero, A. Megrant, J. Y. Mutus, M. Neeley, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, P. V. Coveney, P. J. Love, H. Neven, A. Aspuru-Guzik, and J. M. Martinis, “Scalable quantum simulation of molecular energies,” Phys. Rev. X , vol. 6, p. 031007, Jul 2016. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevX.6.031007

2016

Closest in time.

R. Barends, A. Shabani, L. Lamata, J. Kelly, A. Mezzacapo, U. Las Heras, R. Babbush, A. Fowler, B. Campbell, Y. Chen et al. , “Digitized adiabatic quantum computing with a superconducting circuit,” Nature , vol. 534, no. 7606, pp. 222–226, 2016

2016

Closest in time.