Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The Sciences

THE QUANTUM LOOP

Amitabha Sen, Sharon Butler

Published Nov 12, 1989• 3 citations
Publisher
DOI
10.1002/j.2326-1951.1989.tb02191.x

Related papers

Quantum loop programs

Mingsheng Ying, Yuan Feng

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.

arXiv:quant-ph/0605218•May 25, 2006•1 citation

Quantum Loop

Jim D

Scientific American•Jan 1, 2020•0 citations

A Quantum Box

Springer eBooks•Dec 12, 2005•0 citations

Preliminary studies on general quantum Loop program

Yongming Li

Loop is a very important program construct in classical computation. So, it is necessary to study the structure of the quantum Loop programs. This paper defines a general quantum Loop program whose body is a quantum operation, and gives the definitions for termination, almost termination and non-termination of the general quantum Loop program with respect to any input state. It proves the necessary and sufficient conditions for termination of the general quantum Loop programs given input state. As applications, it finally verifies the embedded quantum Loop programs whose body is unitary operation is a general quantum Loop program.

Computer Engineering and Applications Journal•Jan 1, 2012•0 citations

The Quantum Bridge

Forrest Landry

•Jan 1, 2026•0 citations

Loops, Loop Sequences and Loop Surfaces in Statistical Geodesics, and Quantum Information

Aalok Pandya

The locus of probability flow in Quantum Mechanics and information is explored. We explore loops, loop sequences and loop surfaces in the statistical geodesics. Having known about the loop character of the statistical geodesics in probability space, we discuss wider physical aspects of consequences of the geometry of the probabilities in the form of loop sequences and loop surfaces. These are interpreted as the locus of probability flow. A deeper philosophical observation reveals that these loops, loop sequences and loop surfaces are the information grids. These investigations in many ways could be significant not only in the research in Statistics, but also in Mathematics, and Physics in general, and entropy, gravity and information theory in specific.

arXiv:1005.4190•May 23, 2010•0 citations
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.
Loop is a very important program construct in classical computation. So, it is necessary to study the structure of the quantum Loop programs. This paper defines a general quantum Loop program whose body is a quantum operation, and gives the definitions for termination, almost termination and non-termination of the general quantum Loop program with respect to any input state. It proves the necessary and sufficient conditions for termination of the general quantum Loop programs given input state. As applications, it finally verifies the embedded quantum Loop programs whose body is unitary operation is a general quantum Loop program.
The locus of probability flow in Quantum Mechanics and information is explored. We explore loops, loop sequences and loop surfaces in the statistical geodesics. Having known about the loop character of the statistical geodesics in probability space, we discuss wider physical aspects of consequences of the geometry of the probabilities in the form of loop sequences and loop surfaces. These are interpreted as the locus of probability flow. A deeper philosophical observation reveals that these loops, loop sequences and loop surfaces are the information grids. These investigations in many ways could be significant not only in the research in Statistics, but also in Mathematics, and Physics in general, and entropy, gravity and information theory in specific.