Corpus ID: 227223023

Static Analysis of Quantum Programs via Gottesman Types

  title={Static Analysis of Quantum Programs via Gottesman Types},
  author={Robert Rand and Aarthi Sundaram and Kartik Singhal and Brad Lackey},
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H , S and CNOT . The Gottesman-Knill theorem showed that we can use this representation to efficiently simulate Clifford circuits. We show that Gottesman’s semantics for quantum programs can be treated as a type system, allowing us to efficiently characterize a common subset of quantum programs. We apply this… Expand

Figures from this paper

Formal Verification of Gottesman Semantics
In “Gottesman Types for Quantum Programs” [6], Rand et al. introduced a type system, based on the Gottesman-Knill theorem [3] for characterizing quantum circuits that use the Clifford gate set. WhileExpand
Extending Gottesman Types Beyond the Clifford Group
  • 2021


Gottesman Types for Quantum Programs
It is shown that Gottesman’s semantics for quantum programs can be treated as a type system, allowing us to efficiently characterize a common subset of quantum programs and extend beyond the Clifford set to partially characterize a broad range of programs. Expand
Quipper: a scalable quantum programming language
Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Expand
Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism
  • K. Honda
  • Physics, Computer Science
  • QPL
  • 2015
This paper refines reasoning about separability of quantum variables in quantum programs using stabilizer formalism, and extends prior work using stabilizers formalism. Expand
The Heisenberg Representation of Quantum Computers
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key featuresExpand
ReQWIRE: Reasoning about Reversible Quantum Circuits
Methods for verifying that ancillae are discarded in the desired state are presented, and these methods are used to implement a verified compiler from classical functions to quantum oracles. Expand
Quantum Patterns and Types for Entanglement and Separability
  • S. Perdrix
  • Computer Science
  • Electron. Notes Theor. Comput. Sci.
  • 2007
A typing system for reflecting entanglement and separability is presented in the context of classically controlled quantum computation where a classical program controls a sequence of quantum operations, i.e. unitary transformations and measurements acting on a quantum memory. Expand
Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL
Q# is presented, a quantum-focused domain-specific language explicitly designed to correctly, clearly and completely express quantum algorithms that provides a type system; a tightly constrained environment to safely interleave classical and quantum computations; specialized syntax; symbolic code manipulation to automatically generate correct transformations of quantum operations. Expand
Rewiring stabilizer codes
We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approachExpand
Universal fault-tolerant quantum computation with Bacon-Shor codes
We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing inExpand
Quantum Entanglement Analysis Based on Abstract Interpretation
In this paper, a concrete quantum semantics based on superoperators is associated with a simple quantum programming language and the soundness of the approximation is proven. Expand