An Algebra Of Quantum Processes

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Ying, Mingsheng en_US
dc.contributor.author Feng, Yuan en_US
dc.contributor.author Duan, Runyao en_US
dc.contributor.author Ji, Zhengfeng en_US
dc.contributor.editor en_US
dc.date.accessioned 2010-05-28T09:47:33Z
dc.date.available 2010-05-28T09:47:33Z
dc.date.issued 2009 en_US
dc.identifier 2008004753 en_US
dc.identifier.citation Ying Mingsheng et al. 2009, 'An Algebra Of Quantum Processes', Association For Computing Machinery, vol. 10, no. 3, pp. 1-36. en_US
dc.identifier.issn 1557-945X en_US
dc.identifier.other C1 en_US
dc.identifier.uri http://hdl.handle.net/10453/9122
dc.description.abstract We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but no classical data is explicitly involved. An operational semantics of qCCS is presented in terms of (nonprobabilistic) labeled transition systems. Strong bisimulation between processes modeled in qCCS is defined, and its fundamental algebraic properties are established, including uniqueness of the solutions of recursive equations. To model sequential computation in qCCS, a reduction relation between processes is defined. By combining reduction relation and strong bisimulation we introduce the notion of strong reduction-bisimulation, which is a device for observing interaction of computation and communication in quantum systems. Finally, a notion of strong approximate bisimulation (equivalently, strong bisimulation distance) and its reduction counterpart are introduced. It is proved that both approximate bisimilarity and approximate reduction-bisimilarity are preserved by various constructors of quantum processes. This provides us with a formal tool for observing robustness of quantum processes against inaccuracy in the implementation of its elementary gates. en_US
dc.language en_US
dc.publisher Association For Computing Machinery en_US
dc.relation.hasversion Accepted manuscript version en_US
dc.rights © ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Acm Transactions On Computational Logic, (2009) http://doi.acm.org/10.1145/1507244.1507249 en_US
dc.title An Algebra Of Quantum Processes en_US
dc.parent Acm Transactions On Computational Logic en_US
dc.journal.volume 10 en_US
dc.journal.number 3 en_US
dc.publocation New York en_US
dc.identifier.startpage 1 en_US
dc.identifier.endpage 36 en_US
dc.cauo.name FEIT.School of Systems, Management and Leadership en_US
dc.conference Verified OK en_US
dc.for 080203 en_US
dc.personcode 103396 en_US
dc.personcode 106439 en_US
dc.personcode 106353 en_US
dc.personcode 0000049993 en_US
dc.percentage 100 en_US
dc.classification.name Computational Logic and Formal Languages en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom en_US
dc.date.activity en_US
dc.location.activity en_US
dc.description.keywords Theory; Quantum computation; quantum communication; super-operator; process algebra; bisimulation en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record