An algebra of quantum processes

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Ying, M
dc.contributor.author Feng, Y
dc.contributor.author Duan, R
dc.contributor.author Ji, Z
dc.date.accessioned 2010-05-28T09:47:33Z
dc.date.issued 2009-04-01
dc.identifier.citation ACM Transactions on Computational Logic, 2009, 10 (3)
dc.identifier.issn 1529-3785
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. © 2009 ACM.
dc.language eng
dc.relation.hasversion Accepted manuscript version en_US
dc.relation.isbasedon 10.1145/1507244.1507249
dc.title An algebra of quantum processes
dc.type Journal Article
dc.parent ACM Transactions on Computational Logic
dc.journal.volume 3
dc.journal.volume 10
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 Computational Logic and Formal Languages
dc.personcode 103396
dc.personcode 106353
dc.personcode 106439
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 Bisimulation
dc.description.keywords Process algebra
dc.description.keywords Quantum communication
dc.description.keywords Quantum computation
dc.description.keywords Super-operator
pubs.embargo.period Not known
pubs.organisational-group /University of Technology Sydney
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group /University of Technology Sydney/Strength - Quantum Computation and Intelligent Systems
utslib.copyright.status Open Access
utslib.copyright.date 2015-04-15 12:23:47.074767+10
pubs.consider-herdc true


Files in this item

This item appears in the following Collection(s)

Show simple item record