Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism

TL;DR

This paper extends previous methods for static analysis of quantum entanglement in quantum programs by utilizing stabilizer formalism to more accurately determine qubit separability.

Contribution

It introduces a refined analysis technique based on stabilizer formalism that accounts for entanglement undoing and measurement effects in quantum programs.

Findings

Enhanced analysis accuracy for quantum entanglement detection.

Better understanding of entanglement dynamics during quantum operations.

Improved static analysis tools for quantum program verification.

Abstract

Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum entanglement in quantum programs is necessary. Several papers studied the problem. They decided qubits were entangled if multiple qubits unitary gates are applied to them, and some refined this reasoning using information about the state of each separated qubit. However, they do not care about the fact that unitary gate undoes entanglement and that measurement may separate multiple qubits. In this paper, we extend prior work using stabilizer formalism. It refines reasoning about separability of quantum variables in quantum programs.