Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism

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.

In Proceedings QPL 2015, arXiv:1511.01181

References in corpus (5)

• Improved Simulation of Stabilizer Circuits
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
• Quantum entanglement analysis based on abstract interpretation
• A logical analysis of entanglement and separability in quantum higher-order functions

Cited by in corpus (5)

• Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs
• Gottesman Types for Quantum Programs
• Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation
• Towards Efficient Superconducting Quantum Processor Architecture Design
• Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs