[Paper Review] $Q|SI angle$: A Quantum Programming Environment

Shusen Liu, Xin Wang+6 more|arXiv (Cornell University)|Oct 26, 2017

Quantum Computing Algorithms and Architecture25 references3 citations

TL;DR

This paper introduces $Q|SI\rangle$, a quantum programming environment built on the .NET framework that supports quantum programming via a quantum-extended while-language. It features a compiler, quantum circuit optimization, simulation, and novel analysis tools for termination, runtime, and invariants, enabling high-level, verifiable quantum algorithm development with feedback-driven quantum assembly (f-QASM).

ABSTRACT

This paper describes a quantum programming environment, named $Q|SI angle$. It is a platform embedded in the .Net language that supports quantum programming using a quantum extension of the $\mathbf{while}$-language. The framework of the platform includes a compiler of the quantum $\mathbf{while}$-language and a suite of tools for simulating quantum computation, optimizing quantum circuits, and analyzing and verifying quantum programs. Throughout the paper, using $Q|SI angle$ to simulate quantum behaviors on classical platforms with a combination of components is demonstrated. The scalable framework allows the user to program customized functions on the platform. The compiler works as the core of $Q|SI angle$ bridging the gap from quantum hardware to quantum software. The built-in decomposition algorithms enable the universal quantum computation on the present quantum hardware.

Motivation & Objective

• To provide a high-level, extensible quantum programming environment that abstracts quantum circuit details for algorithm development.
• To address the challenge of writing, verifying, and optimizing quantum programs by integrating formal semantics and analysis tools.
• To bridge the gap between quantum software and current quantum hardware through a feedback-enabled assembly language (f-QASM).
• To enable scalable simulation and verification of quantum algorithms, including measurement-based loops and case statements.
• To support practical quantum application development through extensible, customizable components for real-world protocols like BB84 and Grover's search.

Proposed method

• The platform is built around a quantum-extended while-language with measurement-based case and while constructs for expressing large-scale quantum algorithms.
• A compiler translates quantum while-programs into f-QASM, a feedback-enhanced extension of QASM, enabling efficient implementation of measurement-driven control flow.
• The framework includes a quantum circuit optimizer that reduces gate count and improves circuit depth using built-in decomposition algorithms.
• A quantum simulator enables classical emulation of quantum programs, using pseudo-random sampling for measurement operations.
• A program analyzer computes termination probability and average running time using semi-definite programming (SDP) for loop invariants.
• The system supports integration with external tools and platforms, including IBM's quantum hardware and LIQUi|> for cross-platform analysis.

Experimental results

Research questions

• RQ1 How can a high-level quantum programming language be designed to support measurement-based control flow constructs like case and while loops?
• RQ2 What compiler techniques are needed to translate quantum while-programs into executable quantum circuits with feedback support?
• RQ3 How can quantum program termination and average running time be formally analyzed and verified using semi-definite programming?
• RQ4 What simulation and optimization strategies enable efficient classical emulation of quantum algorithms on current hardware constraints?
• RQ5 How can the platform be extended to support integration with diverse quantum software stacks and real quantum hardware?

Key findings

• The $Q|SI\rangle$ platform successfully compiles quantum while-programs into optimized f-QASM sequences, enabling execution on current quantum hardware with feedback support.
• The system demonstrated correct simulation of quantum walk-like behavior in the Qloop case, accurately reflecting predicted measurement probabilities.
• BB84 protocol simulations revealed that channel noise, sampling rate, and packet length significantly affect key distribution success, with parameters tuned via $Q|SI\rangle$ for optimal performance.
• Grover’s search algorithm showed increased error rates in multi-solution scenarios, indicating the need for algorithmic modifications in such settings.
• The program analyzer successfully computed termination probabilities and average running times using SDP-based invariant generation, enabling formal verification of quantum loops.
• The platform enables modular, extensible development of quantum applications, with support for complex protocols and scalable circuit optimization.