Abstract.
It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives. The underlying scheme involves a run-time environment which calculates the byte-code for the quantum operations and pipes it to a quantum device controller or to a simulator. This language can compactly express existing quantum algorithms and reduce them to sequences of elementary operations; it also easily lends itself to automatic, hardware independent, circuit simplification. A publicly available preliminary implementation of the proposed ideas has been realised using the language.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press New York, NY, 2000)
R. Cleve, A. Ekert, C. Macchiavello, M. Mosca, Proc. Roy. Soc. Lond. A 454 339 1998, quant-ph/9708016
D.P. DiVincenzo, Fortschr. Phys.487712000, quant-ph/0002077
D. Deutsch, Proc. Roy. Soc. Lond. A425731989
E. Bernstein, U. Vazirani, 25th ACM Symposium on the Theory of Computation 199311-20
A.C. Yao, 34th IEEE Symposium on Foundations of Computer Science1993352-361, also available at feynman.stanford.edu/qcomp/yao/index.html
E.H. Knill, Conventions for Quantum Pseudocode, unpublished, LANL report LAUR-96-2724
J.W. Sanders, P. Zuliani, Math. Progr. Constr.1837802000, also as TR-5-99 (1999), Oxford University, available at web.comlab.ox.ac.uk/oucl/publications/tr/index.html
P. Zuliani, IBM J. Res. Develop.458072001, also as TR-11-00, Oxford University, available at web.comlab.ox.ac.uk/oucl/publications/tr/index.html
B. Ömer, Master thesis (theoretical physics), 1998, tph.tuwien.ac.at/~oemer/qcl.html
B. Ömer, Master thesis (computer science), 2000, tph.tuwien.ac.at/~oemer/qcl.html
M.A. Nielsen, I.L. Chuang, Phys. Rev. Lett.793211997, quant-ph/9703032
E.H. Knill, M.A. Nielsen, “Theory of quantum computation”, Supplement III, Encyclopaedia of Mathematics (Summer 2001), quant-ph/0010057
J.I. Cirac, P. Zoller, Phys. Rev. Lett.7440941995
D. Coppersmith, “An Approximate Fourier Transform Useful in Quantum Factoring”, unpublished, Technical report IBM, Research report 19642, IBM, 07/12/1994
P.W. Shor, SIAM J. Comp.2614841997, also as quant-ph/9508027
L.K. Grover, 28th Annual ACM Symposium on the Theory of Computing (STOC)1996212-219, quant-ph/9605043
B. Stroustrup, The C++ Programming Language, 3rd edn. (Addison Wesley Longman, Reading, MA, 1997)
T.G. Draper, “Addition on a Quantum Computer”, unpublished, quant-ph/0008033
Y. Lecerf, C. R. Acad. Fr. Sci. 25725971963
C.H. Bennett, IBM J. Res. Dev.175251973
A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, H. Weinfurter, Phys. Rev. A5234571995, quant-ph/9503016
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 25 June 2002, Published online: 30 July 2003
PACS:
03.67.Lx Quantum computation
Rights and permissions
About this article
Cite this article
Bettelli, S., Calarco, T. & Serafini, L. Toward an architecture for quantum programming. Eur. Phys. J. D 25, 181–200 (2003). https://doi.org/10.1140/epjd/e2003-00242-2
Issue Date:
DOI: https://doi.org/10.1140/epjd/e2003-00242-2