Quantum entanglement analysis based on abstract interpretation
arXiv:0801.4230 · doi:10.1007/978-3-540-69166-2_18
Abstract
Entanglement is a non local property of quantum states which has no classical counterpart and plays a decisive role in quantum information theory. Several protocols, like the teleportation, are based on quantum entangled states. Moreover, any quantum algorithm which does not create entanglement can be efficiently simulated on a classical computer. The exact role of the entanglement is nevertheless not well understood. Since an exact analysis of entanglement evolution induces an exponential slowdown, we consider approximative analysis based on the framework of abstract interpretation. In this paper, a concrete quantum semantics based on superoperators is associated with a simple quantum programming language. The representation of entanglement, i.e. the design of the abstract domain is a key issue. A representation of entanglement as a partition of the memory is chosen. An abstract semantics is introduced, and the soundness of the approximation is proven.
13 pages
References in corpus (7)
- Unextendible Product Bases and Bound Entanglement
- Universal resources for measurement-based quantum computation
- Calculation of the Electron Self Energy for Low Nuclear Charge
- Measuring Controlled-NOT and two-qubit gate operation
- Separability properties of tripartite states with UxUxU-symmetry
- A logical analysis of entanglement and separability in quantum higher-order functions
- Quantum Domain Theory - Definitions and Applications
Cited by in corpus (15)
- ScaffCC: Scalable Compilation and Analysis of Quantum Programs
- Lineal: A linear-algebraic Lambda-calculus
- Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs
- Analyzing Quantum Programs with LintQ: A Static Analysis Framework for Qiskit
- Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory
- A logical analysis of entanglement and separability in quantum higher-order functions
- Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism
- Gottesman Types for Quantum Programs
- Linear and non-linear relational analyses for Quantum Program Optimization
- Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation
- Completeness of algebraic CPS simulations
- Towards Efficient Superconducting Quantum Processor Architecture Design
- A Practical Quantum Hoare Logic with Classical Variables, I
- Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
- Hybrid Path-Sums for Hybrid Quantum Programs