Toward a quantum process algebra

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Toward a quantum process algebra

Full text

Pdf (185 KB)

Source

Conference On Computing Frontiers archive
Proceedings of the 1st conference on Computing frontiers table of contents

Ischia, Italy

SESSION: Quantum computing table of contents

Pages: 111 - 119

Year of Publication: 2004

ISBN:1-58113-741-9

Authors

Philippe Jorrand	Leibniz Laboratory, Grenoble, France
Marie Lalire	Leibniz Laboratory, Grenoble, France

Sponsors

ACM: Association for Computing Machinery
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 30, Citation Count: 5

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/977091.977108 What is a DOI?

ABSTRACT

Quantum computations operate in the quantum world. For their results to be useful in any way, there is an intrinsic necessity of cooperation and communication controlled by the classical world. As a consequence, full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate. This paper aims at defining a high level language allowing the description of classical and quantum programming, and their cooperation. Since process algebras provide a framework to model cooperating computations and have well defined semantics, they have been chosen as a basis for this language. Starting with a classical process algebra, this paper explains how to transform it for including quantum computation. The result is a quantum process algebra with its operational semantics, which can be used to fully describe quantum algorithms in their classical context.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Aspect, J. Dalibard, and G. Roger. Experimental tests of Bell's inequalities using time-varying. Physical Review Letters, 49:1804--1807, 1982.
	2	J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1:195--200, 1964.
	3	C. H. Bennett and G. Brassard. Quantum cryptography: Public-key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing, pages 175--179, Bangalore, India, December 1984.
	4	C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters. Teleporting an unknown quantum state via dual classical and EPR channels. Physical Review Letters, 70:1895--1899, 1993.
	5	Tommaso Bolognesi , Ed Brinksma, Introduction to the ISO specification language LOTOS, Computer Networks and ISDN Systems, v.14 n.1, p.25-59, March, 1987 [doi>10.1016/0169-7552(87)90085-7]
	6	D. Cazorla , F. Cuartero , V. Valero , F. L. Pelayo, A process algebra for probabilistic and nondeterministic processes, Information Processing Letters, v.80 n.1, p.15-23, October 15, 2001 [doi>10.1016/S0020-0190(01)00213-7]
	7	D. Cazorla, F. Cuartero, V. Valero, F. L. Pelayo, and J. Pardo. Algebraic theory of probabilistic and nondeterministic processes. The Journal of Logic and Algebraic Programming, 55(1--2):57--103, 2003.
	8	A. Di Pierro and H. Wiklicky. Quantum constraint programming. In L. M. Pereira and P. Quaresma, editors, Proceedings of APPIA-GULP-PRODE'01, pages 113--130, Evora, Portugal, 2001.
	9	A. Einstein, B. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Physical Review, 47:777--780, 1935.
	10	J. Gruska. Quantum Computing. McGraw-Hill, June 1999.
	11	Robin Milner, Communication and concurrency, Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1995
	12	R. Nagarajan and S. Gay. Formal verification of quantum protocols. Los Alamos arXive e-print quant-ph/0203086, 2002.
	13	Quantum computation and quantum information, Cambridge University Press, New York, NY, 2000
	14	B. Omer. Quantum programming in QCL. Master's thesis, Institute Information System, Technical University of Vienna, 2000.
	15	An introduction to quantum computing for non-physicists, ACM Computing Surveys (CSUR), v.32 n.3, p.300-335, Sept. 2000 [doi>10.1145/367701.367709]
	16	Peter Selinger, Towards a quantum programming language, Mathematical Structures in Computer Science, v.14 n.4, p.527-586, August 2004 [doi>10.1017/S0960129504004256]
	17	A. Van Tonder. A lambda calculus for quantum computation. Los Alamos arXive e-print quant-ph/0307150, 2003.
	18	P. Zuliani. Quantum Programming. PhD thesis, St Cross College, University of Oxford, 2001.

CITED BY 5

	Yuan Feng , Runyao Duan , Zhengfeng Ji , Mingsheng Ying, Probabilistic bisimulations for quantum processes, Information and Computation, v.205 n.11, p.1608-1639, November, 2007
	Vincent Danos , Elham Kashefi , Prakash Panangaden, The measurement calculus, Journal of the ACM (JACM), v.54 n.2, p.8-es, April 2007
	Simon J. Gay, Quantum programming languages: survey and bibliography, Mathematical Structures in Computer Science, v.16 n.4, p.581-600, August 2006
	Simon Perdrix , Philippe Jorrand, Classically controlled quantum computation, Mathematical Structures in Computer Science, v.16 n.4, p.601-620, August 2006
	Mingsheng Ying , Yuan Feng , Runyao Duan , Zhengfeng Ji, An algebra of quantum processes, ACM Transactions on Computational Logic (TOCL), v.10 n.3, p.1-36, April 2009