Quantum loop programs

DSpace/Manakin Repository

Search OPUS

Advanced Search


My Account

Show simple item record

dc.contributor.author Ying, M
dc.contributor.author Feng, Y
dc.date.accessioned 2011-02-07T06:21:56Z
dc.date.issued 2006-05-26
dc.identifier.citation Acta Informatica, 2006, 47 pp. 221 - 250
dc.identifier.other C1 en_US
dc.identifier.uri http://hdl.handle.net/10453/13461
dc.description.abstract Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of quantum loop programs. In this paper, we introduce a general scheme of quantum loops and describe its computational process. The notions of termination and almost termination are proposed for quantum loops, and the function computed by a quantum loop is defined. To show their expressive power, quantum loops are applied in describing quantum walks. Necessary and sufficient conditions for termination and almost termination of a general quantum loop on any mixed input state are presented. A quantum loop is said to be (almost) terminating if it (almost) terminates on any input state. We show that a quantum loop is almost terminating if and only if it is uniformly almost terminating. It is observed that a small disturbance either on the unitary transformation in the loop body or on the measurement in the loop guard can make any quantum loop (almost) terminating. Moreover, a representation of the function computed by a quantum loop is given in terms of finite summations of matrices. To illustrate the notions and results obtained in this paper, two simplest classes of quantum loop programs, one qubit quantum loops, and two qubit quantum loops defined by controlled gates, are carefully examined.
dc.relation.hasversion Accepted manuscript version
dc.title Quantum loop programs
dc.type Journal Article
dc.parent Acta Informatica
dc.journal.volume 47
dc.journal.number 4 en_US
dc.publocation New York, USA en_US
dc.identifier.startpage 221 en_US
dc.identifier.endpage 250 en_US
dc.cauo.name FEIT.Faculty of Engineering & Information Technology en_US
dc.conference Verified OK en_US
dc.for 0803 Computer Software
dc.personcode 103396
dc.personcode 106439
dc.percentage 100 en_US
dc.classification.name Computer Software 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 NA en_US
dc.description.keywords quant-ph
dc.description.keywords quant-ph
dc.description.keywords quant-ph
dc.description.keywords quant-ph
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

Files in this item

This item appears in the following Collection(s)

Show simple item record