Article

Open bisimulation for quantum processes

Authors:

Yuan FengAuthors Info & Claims

TCS'12: Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Pages 119 - 133

https://doi.org/10.1007/978-3-642-33475-7_9

Published: 26 September 2012 Publication History

Abstract

Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between quantum processes. We also give a modal characterisation of the behavioural equivalence, by extending the Hennessy-Milner logic to a quantum setting.

References

[1]

Baeten, J.C. M., Weijland, W. P.: Process Algebra. Cambridge University Press (1990)

Digital Library

[2]

Bennett, C. H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing, pp. 175-179 (1984)

[3]

Davidson, T. A. S.: Formal Verification Techniques using Quantum Process Calculus. PhD thesis, University of Warwick (2011)

[4]

Deng, Y., Du, W.: Logical, metric, and algorithmic characterisations of probabilistic bisimulation. Technical Report CMU-CS-11-110. Carnegie Mellon University (March 2011)

[5]

Deng, Y., Feng, Y.: Open bisimulation for quantum processes. Full Version of the current paper, http://arxiv.org/abs/1201.0416

[6]

Deng, Y., Hennessy, M.: On the Semantics of Markov Automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 307-318. Springer, Heidelberg (2011)

Digital Library

[7]

Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C.: Testing Finitary Probabilistic Processes (Extended Abstract). In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 274-288. Springer, Heidelberg (2009)

Digital Library

[8]

Feng, Y., Duan, R., Ji, Z., Ying, M.: Probabilistic bisimulations for quantum processes. Information and Computation 205(11), 1608-1639 (2007)

Digital Library

[9]

Feng, Y., Duan, R., Ying, M.: Bisimulation for quantum processes. In: Proc. POPL 2011, pp. 523-534. ACM (2011)

Digital Library

[10]

Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. Journal of Logic and Algebraic Programming 63(1), 131-173 (2005)

[11]

Gay, S. J., Nagarajan, R.: Types and typechecking for communicating quantum processes. Mathematical Structures in Computer Science 16(03), 375-406 (2006)

Digital Library

[12]

Gay, S. J., Nagarajan, R.: Communicating quantum processes. In: Palsberg, J., Abadi, M. (eds.) Proc. POPL 2005, pp. 145-157 (2005)

Digital Library

[13]

Grover, L. K.: A fast quantum mechanical algorithm for database search. In: Proc. ACM STOC, pp. 212-219 (1996)

Digital Library

[14]

Grover, L. K.: Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters 78(2), 325 (1997)

[15]

Hennessy, M.: A proof system for communicating processes with value-passing. Formal Aspects of Computer Science 3, 346-366 (1991)

[16]

Hennessy, M., Ingólfsdóttir, A.: A theory of communicating processes value-passing. Information and Computation 107(2), 202-236 (1993)

Digital Library

[17]

Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), 137-161 (1985)

Digital Library

[18]

Hoare, C. A. R.: Communicating Sequential Processes. Prentice Hall (1985)

Digital Library

[19]

Honda, K., Tokoro, M.: On reduction-based process semantics. Theoretical Computer Science 151(2), 437-486 (1995)

Digital Library

[20]

Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science 1(1:4) (2005)

[21]

Jorrand, P., Lalire, M.: Toward a quantum process algebra. In: Proceedings of the 1st Conference on Computing Frontiers, pp. 111-119. ACM (2004)

Digital Library

[22]

Lalire, M.: Relations among quantum processes: Bisimilarity and congruence. Mathematical Structures in Computer Science 16(3), 407-428 (2006)

Digital Library

[23]

Milner, R.: Communication and Concurrency. Prentice-Hall (1989)

Digital Library

[24]

Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Parts I and II. Information and Computation 100, 1-77 (1992)

Digital Library

[25]

Nielsen, M., Chuang, I.: Quantum computation and quantum information. Cambridge University Press (2000)

Digital Library

[26]

Rathke, J., Sobociýski, P.: Deriving Structural Labelled Transitions for Mobile Ambients. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 462-476. Springer, Heidelberg (2008)

Digital Library

[27]

Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica 33(1), 69-97 (1996)

Digital Library

[28]

Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higherorder languages. In: Proc. LICS 2007, pp. 293-302. IEEE Computer Society (2007)

Digital Library

[29]

Sangiorgi, D., Walker, D.: The p-calculus: a Theory of Mobile Processes. Cambridge University Press (2001)

Digital Library

[30]

Shor, P. W.: Algorithms for quantum computation: discrete log and factoring. In: Proc. FOCS 1994, pp. 124-134 (1994)

Digital Library

[31]

Ying, M., Feng, Y., Duan, R., Ji, Z.: An algebra of quantum processes. ACM Transactions on Computational Logic 10(3), 1-36 (2009)

Digital Library

Cited By

Ceragioli LGadducci FLomurno GTedeschi G(2024)Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic ObserversProceedings of the ACM on Programming Languages10.1145/36328858:POPL(1269-1297)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632885
Wu HYang QLong H(2024)Branching bisimulation semantics for quantum processesInformation Processing Letters10.1016/j.ipl.2024.106492186:COnline publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1016/j.ipl.2024.106492
Ceragioli LGadducci FLomurno GTedeschi G(2024)Testing Quantum ProcessesLeveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola10.1007/978-3-031-73709-1_9(132-151)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-73709-1_9
Show More Cited By

Recommendations

Symbolic Bisimulation for Quantum Processes

With the previous notions of bisimulation presented in the literature, to check if two quantum processes are bisimilar, we have to instantiate their free quantum variables with arbitrary quantum states, and verify the bisimilarity of the resulting ...
Bisimulation for Quantum Processes

Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles of quantum mechanics. On the ...
Bisimulation for quantum processes
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles of quantum mechanics. On the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

TCS'12: Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

September 2012

387 pages

ISBN:9783642334740

Editors:
Jos M. Baeten
Centrum Wiskunde & Informatica (CWI), Science Park 123, Amsterdam, The Netherlands
,
Tom Ball
Microsoft Research, One Microsoft Way, Redmond, WA, The Netherlands
,
Frank S. Boer
Centrum Wiskunde & Informatica (CWI), Science Park 123, Amsterdam, The Netherlands

Sponsors

CWI: Centrum voor Wiskunde en Informatica - Netherlands
Microsoft Research: Microsoft Research
IPA: Institute for Programming research and Algorithmics
The Netherlands Organisation for Scientific Research: The Netherlands Organisation for Scientific Research
IFIP: International Federation for Information Processing

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 September 2012

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ceragioli LGadducci FLomurno GTedeschi G(2024)Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic ObserversProceedings of the ACM on Programming Languages10.1145/36328858:POPL(1269-1297)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632885
Wu HYang QLong H(2024)Branching bisimulation semantics for quantum processesInformation Processing Letters10.1016/j.ipl.2024.106492186:COnline publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1016/j.ipl.2024.106492
Ceragioli LGadducci FLomurno GTedeschi G(2024)Testing Quantum ProcessesLeveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola10.1007/978-3-031-73709-1_9(132-151)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-73709-1_9
Mousavi MPeters KSchmitt A(2024)Towards a Formal Testing Theory for Quantum ProcessesLeveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola10.1007/978-3-031-73709-1_8(111-131)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-73709-1_8
Qin XDeng YDu W(2020)Verifying Quantum Communication Protocols with Ground BisimulationTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-030-45237-7_2(21-38)Online publication date: 25-Apr-2020
https://dl.acm.org/doi/10.1007/978-3-030-45237-7_2
Liu ASun M(2019)A Coalgebraic Semantics Framework for Quantum SystemsFormal Methods and Software Engineering10.1007/978-3-030-32409-4_24(387-402)Online publication date: 5-Nov-2019
https://dl.acm.org/doi/10.1007/978-3-030-32409-4_24
Feng YDeng YYing M(2014)Symbolic Bisimulation for Quantum ProcessesACM Transactions on Computational Logic10.1145/257981815:2(1-32)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2579818

View Options

View options

Media

Figures

Other

Tables

View Table of Contents