A Software Methodology for Compiling Quantum Programs

Jack Edmonds, “Paths, trees, and flowers,” Canadian Journal of mathematics 17

1965

Earlier work this paper cites.

CH Bennett, “Logical reversibility of computation,” Maxwell’s Demon. Entropy, Information, Computing , 197–204 (1973)

1973

Earlier work this paper cites.

RichardP. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics 21

1982

Earlier work this paper cites.

Peter W Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on (IEEE, 1994) pp. 124–134

1994

Earlier work this paper cites.

Adriano Barenco, Charles H Bennett, Richard Cleve, David P DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A Smolin, and Harald Weinfurter, “Elementary gates for quantum computation,” Physical Review A 52

1995

Earlier work this paper cites.

Bernhard Ömer, “A procedural formalism for quantum computing,” (1998)

1998

Earlier work this paper cites.

R Clint Whaley and Jack J Dongarra, “Automatically tuned linear algebra software,” in Proceedings of the 1998 ACM/IEEE conference on Supercomputing (IEEE Computer Society, 1998) pp. 1–27

1998

Earlier work this paper cites.

Thomas G Draper, “Addition on a quantum computer,” arXiv preprint quant-ph/0008033 (2000)

2000

Earlier work this paper cites.

Rolando Somma, Gerardo Ortiz, James E Gubernatis, Emanuel Knill, and Raymond Laflamme, “Simulating physical phenomena by quantum networks,” Physical Review A 65

2002

Earlier work this paper cites.

Stephane Beauregard, “Circuit for shor’s algorithm using 2n+ 3 qubits,” arXiv preprint quant-ph/0205095 (2002)

2002

Earlier work this paper cites.

Steven A Cuccaro, Thomas G Draper, Samuel A Kutin, and David Petrie Moulton, “A new quantum ripple-carry addition circuit,” arXiv preprint quant-ph/0410184 (2004)

2004

Cited alongside, same era.

Alán Aspuru-Guzik, Anthony D Dutoi, Peter J Love, and Martin Head-Gordon, “Simulated quantum computation of molecular energies,” Science 309

2005

Cited alongside, same era.

Krysta M Svore, Alfred V Aho, Andrew W Cross, Isaac Chuang, and Igor L Markov, “A layered software architecture for quantum computing design tools,” Computer , 74–83 (2006)

2006

Cited alongside, same era.

Simon J Gay, “Quantum programming languages: Survey and bibliography,” Mathematical Structures in Computer Science 16

2006

Cited alongside, same era.

Dmitri Maslov, Gerhard W Dueck, D Michael Miller, and Camille Negrevergne, “Quantum circuit simplification and level compaction,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on 27

Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd, “Quantum support vector machine for big data classification,” Physical review letters 113

2014

Later among the works it cites.

Dave Wecker and Krysta M Svore, “LIQ U ​ i ​ | ⟩ Ui\ket{} : A software design architecture and domain-specific language for quantum computing,” arXiv:1402.4467 (2014)

Original

2014

Later among the works it cites.

Ali JavadiAbhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T Chong, and Margaret Martonosi, “ScaffCC: A framework for compilation and analysis of quantum computing programs,” in Proceedings of the 11th ACM Conference on Computing Frontiers (ACM, 2014) p. 1

2014

Later among the works it cites.

Neil J Ross and Peter Selinger, “Optimal ancilla-free clifford+ t approximation of z-rotations,” arXiv:1403.2975 (2014)

Original

2014

Later among the works it cites.