| J. W. Sanders and P. Zuliani. Quantum programming . In R. C. Backhouse and J. N. F. d. Oliveira, editors, Mathematics of Program Construction 2000, number 1837 in Lecture Notes in Computer Science, pages 80--99. Springer-Verlag, 2000. |
....(as an extension of a conventional classical language) though the interest was focused mainly on quantum registers (see section 3.1) This report however did not propose any scheme for implementing an automatic translation of the high level notation into circuit objects. Sanders and Zuliani [8] extended the probabilistic version of an imperative language (pGCL) to include three high level quantum primitives (initialisation, evolution and nalisation) The resulting language (qGCL) is expressive enough to program a universal quantum computer, though its aim is more to be a tool for veri ....
....internals 5. 1 Operator composition and simpli cation This section analyses with more details the bene ts gained by using quantum operator objects instead of functions for representing quantum circuits; the function like approach, basically, is adopted both in the QCL [10, 11] and in the qGCL [8] languages. A simple example can stress the di erence between the two solutions: a Hadamard 2( function is available, which accepts a quantum register and an index i inside the register as arguments. It applies two Hadamard gates, to the i th and to the i 1 th elements of the register, and ....
J.W.Sanders, P.Zuliani, \Quantum Programming", Math. of Program Constr., Springer LNCS, 1837 (
....Related works A few papers can be found in the literature concerning the problem of quantum programming. Knill [7] moved a rst step towards standardizing notation, but no scheme for implementing an automatic translation of this notation into low level primitives was proposed. Sanders and Zuliani [16] began developing a formal semantics, whose main aim was the veri cation of programs against their speci cations (i.e. an automatic tool for verifying that a program really implements the desired unitary transformation) B. Omer [12, 13] on the other hand developed a procedural formalism ....
J.W.Sanders, P.Zuliani (1999), \Quantum Programming", TR-5-99, Oxford University, http://web.comlab.ox.ac.uk
No context found.
J. W. Sanders and P. Zuliani. Quantum programming . In R. C. Backhouse and J. N. F. d. Oliveira, editors, Mathematics of Program Construction 2000, number 1837 in Lecture Notes in Computer Science, pages 80--99. Springer-Verlag, 2000.
No context found.
P. Zuliani. Quantum Programming. PhD thesis, Oxford University, 2001. 14
No context found.
J. W. Sanders and P. Zuliani. Quantum programming . In R. C. Backhouse and J. N. F. d. Oliveira, editors, Mathematics of Program Construction 2000.
No context found.
J. W. Sanders and P. Zuliani. Quantum programming . In R. C. Backhouse and J. N. F. d. Oliveira, editors, Mathematics of Program Construction 2000, number 1837 in Lecture Notes in Computer Science, pages 80--99. Springer-Verlag, 2000.
No context found.
P. Zuliani. Quantum programming. PhD thesis, St. Cross, Oxford Univ., 2001. 20
No context found.
J. Sanders and P. Zuliani. Quantum programming. Technical report, Oxford Univ., 1999.
No context found.
Paolo Zuliani, Quantum Programming, PhD. thesis, St. Cross College, Univ. of Oxford, (2001).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC