Laws of Quantum Programming

Abstract: In this paper, we investigate the fundamental laws of quantum programming. We extend a comprehensive set of Hoare et al.'s basic laws of classical programming to the quantum setting. These laws characterise the algebraic properties of quantum programs, such as the distributivity of sequential composition over (quantum) if-statements and the unfolding of nested (quantum) if-statements. At the same time, we clarify some subtle differences between certain laws of classical programming and their quantum counterparts. Additionally, we derive a fixpoint characterization of quantum while-loops and a loop-based realisation of tail recursion in quantum programming. Furthermore, we establish two normal form theorems: one for quantum circuits and one for finite quantum programs. The theory in which these laws are established is formalised in the Coq proof assistant, and all of these laws are mechanically verified. As an application case of our laws, we present a formal derivation of the principle of deferred measurements in dynamic quantum circuits. We expect that these laws can be utilized in correctness-preserving transformation, compilation, and automatic code optimization in quantum programming. In particular, because these laws are formally verified in Coq, they can be confidently applied in quantum program development.

• The paper establishes a formal framework by extending classical programming laws to quantum circuits and programs, providing a basis for rigorous reasoning and optimization.
• It proposes a three-layer framework comprising quantum circuits, purely quantum programs, and classical-quantum hybrid programs to structure quantum computation.
• Key contributions include deriving normal forms for circuits and programs, characterizing recursion and loops, and formally verifying the laws in Coq.

Overview of "Laws of Quantum Programming"

The paper "Laws of Quantum Programming" by Ying, Zhou, and Barthe extends fundamental classical programming laws to the domain of quantum programming, presenting a comprehensive set of algebraic rules applicable to quantum circuits and programs. It builds a foundational framework for reasoning about quantum computations, offering a formal structure that can be leveraged in correctness-preserving transformation, compilation, and optimization.

Framework Description:

The authors propose a three-layer framework for quantum programming:

1. Quantum Circuits Layer: This bottom layer encompasses quantum circuits built from basic gates. The circuits are defined algebraically, leveraging the quantum if-statement for conditional operations.
2. Purely Quantum Programs Layer: This middle layer consists of quantum programs that manage quantum operations without classical variables. It supports a higher-level structure with if-statements controlled by quantum measurements and recursion.
3. Classical-Quantum Hybrid Layer: The top layer represents programs combining classical and quantum computations. Quantum programs are embedded in classical constructs allowing the interplay of quantum operations with classical logic.

Key Contributions:

The paper delineates several contributions through theoretical expositions and mechanical verification in the Coq proof assistant:

• Algebraic Laws: The authors extend and redefine classical programming laws to quantum programming. These involve rules for sequential composition, if-statements, and introducing creative quantum-specific constructs such as quantum choice, where quantum logical operations facilitate program control directly tied to the state of quantum information.
• Normal Forms: Significant attention is given to deriving normal forms for quantum circuits and programs. For circuits, a form is established where any regular quantum circuit can be transformed into a sequential composition of quantum if-statements. For programs, they describe finite quantum programs equatable to if-statements applied to circuits.
• Recursion and Loops: They explore recursion in quantum programming, providing fixed-point characterizations and showing how tail recursion is realizable as loops. These findings are essential for optimizing quantum program execution, given the constraints of quantum hardware and error margins.
• Formal Verification: The mechanical verification of the derived laws using Coq is notable. The effort includes formal definitions of quantum operations and proofs of compliance with theoretical properties, reinforcing the soundness and reliability of using these laws in software practice.

Implications and Future Directions:

The implications of this research are broad-ranging within the landscape of quantum computing. By formalizing quantum programming laws, the work provides a toolkit for software engineers to reason about and optimize quantum programs confidently. This framework paves the way for developing robust compilers and efficient quantum algorithms, a crucial step for practical quantum computing.

In conclusion, the development of algebraic laws in quantum programming represents a critical advancement for quantum programming languages and methods. As quantum hardware and algorithms evolve, these techniques will be increasingly significant for ensuring that software development keeps pace with the complexities and capabilities of quantum technologies. Future research can extend these laws further into practical applications, integrating seamlessly with classical programming environments to usher in a new era of hybrid computing solutions.