A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Bisimulation for quantum processes
2011
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11
Quite a few versions of bisimulation have been defined for quantum processes in the literature, but in the best case they are only proved to be preserved by parallel composition of purely quantum processes ...
In this paper we introduce a novel notion of bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when ...
Section 4 defines the notion of bisimulations for configurations as well as quantum processes. ...
doi:10.1145/1926385.1926446
dblp:conf/popl/FengDY11
fatcat:2v3qdl7qivcnneldpelbrrpfbi
Bisimulation for quantum processes
[article]
2013
arXiv
pre-print
In this paper we introduce a novel notion of probabilistic bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition ...
We also establish some basic algebraic laws for this bisimulation. ...
Yuxin Deng for their generous comments and suggestions. ...
arXiv:1007.2584v3
fatcat:mr3zoyjknrafrjsbtlmai7zcnm
Bisimulation for Quantum Processes
2012
ACM Transactions on Programming Languages and Systems
Quite a few versions of bisimulation have been defined for quantum processes in the literature, but in the best case they are only proved to be preserved by parallel composition of purely quantum processes ...
In this paper we introduce a novel notion of bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when ...
Section 4 defines the notion of bisimulations for configurations as well as quantum processes. ...
doi:10.1145/2400676.2400680
fatcat:ur2eff2jf5ebzdnldhmhozhbfq
Bisimulation for quantum processes
2011
SIGPLAN notices
Quite a few versions of bisimulation have been defined for quantum processes in the literature, but in the best case they are only proved to be preserved by parallel composition of purely quantum processes ...
In this paper we introduce a novel notion of bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when ...
Section 4 defines the notion of bisimulations for configurations as well as quantum processes. ...
doi:10.1145/1925844.1926446
fatcat:uqvfhho6tnap5ilncdbsihnr7e
Probabilistic bisimulations for quantum processes
2007
Information and Computation
Based on this operational semantics, the notions of strong probabilistic bisimulation and weak probabilistic bisimulation between quantum processes are introduced. ...
Modeling and reasoning about concurrent quantum systems is very important for both distributed quantum computing and quantum protocol verification. ...
The authors thank the colleagues in the Quantum Computation and Quantum Information Research Group for useful discussion. This ...
doi:10.1016/j.ic.2007.08.001
fatcat:owm52hv4tff5nelv6m6hoedgx4
Open Bisimulation for Quantum Processes
[article]
2012
arXiv
pre-print
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 ...
Quantum processes describe concurrent communicating systems that may involve quantum information. ...
be combined arbitrarily), and congruent bisimulation for quantum processes was defined in [10] . ...
arXiv:1201.0416v1
fatcat:ubsxtrxccnfhbdic7zgiv4eity
Symbolic bisimulation for quantum processes
[article]
2012
arXiv
pre-print
We show that the symbolic bisimulation defined here is equivalent to the open bisimulation for quantum processes in the previous work, when strong bisimulations are considered. ...
In this paper, we introduce a symbolic operational semantics for quantum processes directly at the quantum operation level, which allows us to describe the bisimulation between quantum processes without ...
Based on it, symbolic bisimulation between quantum processes, which also incorporates a symbolic treatment for classical data, motivated by symbolic bisimulation for classical processes, is presented and ...
arXiv:1202.3484v2
fatcat:zj5cojb7vbfblc3zf6ashuhwke
Symbolic Bisimulation for Quantum Processes
2014
ACM Transactions on Computational Logic
We show that the symbolic bisimulation defined here is equivalent to the open bisimulation for quantum processes in previous work, when strong bisimulations are considered. ...
In this paper, we introduce a symbolic operational semantics for quantum processes directly at the quantum operation level, which allows us to describe the bisimulation between quantum processes without ...
Based on it, symbolic bisimulation between quantum processes, which also incorporates a symbolic treatment for classical data, motivated by symbolic bisimulation for classical processes, is presented and ...
doi:10.1145/2579818
fatcat:eqhxp4krvvfcdi7krkd3j7t6sa
Probabilistic bisimulations for quantum processes
2007
Information and Computation
Based on this operational semantics, the notions of strong probabilistic bisimulation and weak probabilistic bisimulation between quantum processes are introduced. ...
Modeling and reasoning about concurrent quantum systems is very important for both distributed quantum computing and quantum protocol verification. ...
The authors thank the colleagues in the Quantum Computation and Quantum Information Research Group for useful discussion. This work was partially supported by the ...
doi:10.1016/j.ic.2007.08.002
fatcat:glz4jwxzufch7kbyl6zcbzzeuu
Open Bisimulation for Quantum Processes
[chapter]
2012
Lecture Notes in Computer Science
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 ...
An operational semantics of QPAlg is given, and further a probabilistic branching bisimulation between quantum processes is defined. ...
bisimulation for quantum processes was defined in [9] . ...
doi:10.1007/978-3-642-33475-7_9
fatcat:7hane677pfg7neonjaj5jpuvsa
A probabilistic branching bisimulation for quantum processes
[article]
2005
arXiv
pre-print
according to the postulates of quantum mechanics, a probabilistic branching bisimulation is defined among processes considered as having the same behavior. ...
Inspired by classical process algebras, which provide a framework for modeling cooperating computations, a process algebraic notation is defined, which provides a homogeneous style to formal descriptions ...
Finally, a bisimulation among processes is defined in section 4. ...
arXiv:quant-ph/0508116v1
fatcat:qrgg6rn46za5lps7yvgtuhtkoa
Bisimulations for Probabilistic and Quantum Processes (Invited Paper)
2018
International Conference on Concurrency Theory
In this paper, we review some key ideas used in the formulations and characterisations of reasonable notions of bisimulations for both probabilistic and quantum processes. ...
Bisimulation is a fundamental concept in the classical concurrency theory for comparing the behaviour of nondeterministic processes. ...
providing a coinduction proof technique for quantum processes. ...
doi:10.4230/lipics.concur.2018.2
dblp:conf/concur/Deng18
fatcat:jbxwydynqjeydmqjwk5harg3wm
An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing
[article]
2013
arXiv
pre-print
We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). ...
We establish not only a strong bisimularity for quantum processes, but also a weak bisimularity to model the silent step and abstract internal computations in quantum processes. ...
There are several innovations in this paper, we enumerate them as follows. (1) A weak bisimularity (quantum branching bisimulation equivalence) is established for quantum processes. ...
arXiv:1311.2960v1
fatcat:vrlm5ikztraephv4kqdcdiahli
Toward automatic verification of quantum cryptographic protocols
[article]
2015
arXiv
pre-print
This paper remedies this problem by introducing a novel notion of distribution-based bisimulation for quantum processes. ...
All of the bisimulations proposed so far for quantum processes in these process algebras are state-based, implying that they only compare individual quantum states, but not a combination of them. ...
F. is also supported by the National Natural Science Foundation of China (Grant Nos. 61428208 and 61472412) and the CAS/SAFEA International Partnership Program for Creative Research Team. ...
arXiv:1507.05278v1
fatcat:x2d2pol5vnhodanxzx6cwhqffa
Toward Automatic Verification of Quantum Cryptographic Protocols
2015
International Conference on Concurrency Theory
This paper remedies this problem by introducing a novel notion of distribution-based bisimulation for quantum processes. ...
All of the bisimulations proposed so far for quantum processes in these process algebras are state-based, implying that they only compare individual quantum states, but not a combination of them. ...
F. is also supported by the National Natural Science Foundation of China (Grant Nos. 61428208 and 61472412) and the CAS/SAFEA International Partnership Program for Creative Research Team. ...
doi:10.4230/lipics.concur.2015.441
dblp:conf/concur/FengY15
fatcat:lj7vm3whcjayxjjuumxxxbqnlq
« Previous
Showing results 1 — 15 out of 496 results