[Paper Review] Unbounded loops in quantum programs: categories and weak while loops

Pablo Andrés-Martí­nez|arXiv (Cornell University)|Dec 10, 2022

Quantum Computing Algorithms and Architecture4 citations

TL;DR

This paper introduces a categorical framework for unbounded quantum loops using traced monoidal categories and proposes the $κ$-while loop, a classically controlled quantum loop that preserves quantum speed-up by tuning measurement strength. It proves the execution formula as a categorical trace in finite and infinite-dimensional Hilbert spaces, enabling coherent quantum iteration and weak measurement-based loop control.

ABSTRACT

Control flow of quantum programs is often divided into two different classes: classical and quantum. Quantum programs with classical control flow have their conditional branching determined by the classical outcome of measurements, and these collapse quantum data. Conversely, quantum control flow is coherent, i.e. it does not perturb quantum data; quantum walk-based algorithms are practical examples where coherent quantum feedback plays a major role. This dissertation has two main contributions: (i) a categorical study of coherent quantum iteration and (ii) the introduction of weak while loops. (i) The objective is to endow categories of quantum processes with a traced monoidal structure capable of modelling iterative quantum loops. To this end, the trace of a morphism is calculated via the execution formula, which adds up the contribution of all possible paths of the control flow. Haghverdi's unique decomposition categories are generalised to admit additive inverses and equipped with convergence criteria using basic topology. In this setting, it is possible to prove the validity of the execution formula as a categorical trace on certain categories of quantum processes. (ii) A weak while loop is a classical control flow primitive that offers a trade-off between the collapse caused on each iteration and the amount of information gained. The trade-off may be adjusted by tuning a parameter and, in certain situations, it is possible to set its value so that we may control the algorithm without sacrificing its quantum speed-up. As an example, it is shown that Grover's search problem can be implemented using a weak while loop, maintaining the same time complexity as the standard Grover's algorithm (as previously shown by Mizel).

Motivation & Objective

• To develop a categorical foundation for coherent quantum iteration using traced monoidal structures in quantum process categories.
• To generalize Haghverdi’s decomposition categories to include additive inverses and convergence criteria via topology.
• To introduce the $κ$-while loop as a classically controlled loop that balances measurement collapse and information gain.
• To demonstrate that quantum speed-up can be preserved in unbounded loops by tuning the measurement strength $κ$.
• To provide a denotational semantics for weak while loops using functorial constructions and isomorphisms in CPTR categories.

Proposed method

• Generalize unique decomposition categories to include additive inverses and define convergence using topological criteria.
• Use the execution formula to compute the trace of a morphism as the sum over all control flow paths.
• Construct the $κ$-while loop via a functor $F$ from $σ$-monoids to CPTR, using the isomorphism $h$ and canonical inclusions $\theta, \phi$.
• Define $\mathrm{Wk}_{\kappa,Q}(\mathcal{C})$ as a morphism in $\mathbf{CPTR}$ using $\phi \circ F(h \circ E_{\kappa,Q}) \circ (\mathcal{C} \otimes \mathrm{id}) \circ F(h^{-1}) \circ \theta$.
• Represent the loop’s action via matrix decomposition using quasi-projections $\pi_{\bot}, \pi_{\top}$ and injections $\iota_{\bot}, \iota_{\top}$.
• Establish that $(\mathbf{LSI}_{\leq}, \oplus, \mathrm{ex})$ is totally traced using Fourier decomposition and time-shift invariance.

Experimental results

Research questions

• RQ1 Can unbounded quantum loops be formally modeled using categorical trace structures in both finite and infinite-dimensional Hilbert spaces?
• RQ2 How can a classically controlled loop be designed to minimize measurement-induced collapse while preserving quantum speed-up?
• RQ3 What conditions ensure that the number of iterations in a weak while loop is bounded with high probability?
• RQ4 Is it possible to define a categorical trace for coherent quantum feedback in time-shift invariant systems?
• RQ5 Can the $κ$-while loop be used to implement Grover’s search with the same time complexity as the standard algorithm?

Key findings

• The execution formula is proven valid as a categorical trace in categories of quantum processes over finite-dimensional Hilbert spaces.
• The category of time-shift invariant quantum processes over discrete time is shown to be totally traced using Fourier decomposition.
• The $κ$-while loop is formally defined via a functorial construction that maps a loop body $\mathcal{C}$ to its weakly measured counterpart in $\mathbf{CPTR}$.
• The loop maintains the same time complexity as standard Grover’s algorithm when implemented with optimal measurement strength $\kappa$.
• Sufficient conditions are provided to estimate the worst-case number of iterations with arbitrarily high probability.
• The construction ensures that quantum speed-up is preserved by tuning $\kappa$ to balance measurement collapse and information gain.