Towards Large-scale Functional Verification of Universal Quantum Circuits

  title={Towards Large-scale Functional Verification of Universal Quantum Circuits},
  author={Matthew Amy},
  • M. Amy
  • Published 17 May 2018
  • Computer Science, Physics
  • CoRR
We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of specifying quantum operations, particularly for quantum implementations of classical functions. Verification of circuits over all levels of the Clifford hierarchy with respect to either a specification or reference circuit is enabled by a novel rewrite system… 

Figures and Tables from this paper

Rotational Abstractions for Verification of Quantum Fourier Transform Circuits

This paper proposes a novel formal verification method targeted at Quantum Fourier Transform (QFT) circuits that is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of qubits thus far verified using formal verification methods.

Towards Verification of Dynamic Quantum Circuits

This work proposes two different schemes that eventually allow to treat the involved circuits as if they were not dynamic at all, and provides a basis for applying existing techniques for quantum circuit verification to this broader class of circuits.

Equivalence Checking of Quantum Circuits With the ZX-Calculus

It is demonstrated how the ZX-calculus based approach for equivalence checking can be expanded in order to verify the results of compilation flows and optimizations on quantum circuits.

Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms

This work shows that verifying the equivalence of parameterized circuits can be achieved in a purely symbolic fashion using an equivalence checking approach based on the ZX calculus, and efficiently obtained with conventional methods by taking advantage of the degrees of freedom inherent to parameterization circuits.

An Automated Deductive Verification Framework for Circuit-building Quantum Programs

Qbricks is proposed, a formal verification environment for circuit-building quantum programs, featuring both parametric specifications and a high degree of proof automation, and the main tool is developed, PPS, a parametric extension of the recently developed path sum semantics.

Formal Methods in Quantum Circuit Design

The development of a formal model of quantum circuits with ancillary bits based on the Feynman path integral, along with a concrete verification algorithm, which doubles as a natural specification language for quantum computations.

Handling non-unitaries in quantum circuit equivalence checking

This work demonstrates methodically, as well as experimentally, that existing techniques for verifying the equivalence of quantum circuits can be kept applicable for this broader class of circuits, dynamic quantum circuits.

Completeness of the ZH-calculus

There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be

A Deductive Verification Framework for Circuit-building Quantum Programs

Qbricks is proposed, the first formal verification environment for circuit-building quantum programs, featuring clear separation between code and proof, parametric specifications and proofs, high degree of proof automation and allowing to encode quantum programs in a natural way, i.e. close to textbook style.

An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)

A new paradigm for analysing and catching bugs in quantum circuits is introduced, a technique based on tree automata to compactly represent sets of quantum states is proposed and transformers to implement the semantics of quantum gates over this representation are developed.



Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.

The algorithm may serve as a verification tool for near-term quantum computers which cannot in practice be simulated by other means and can be used in practice to simulate medium-sized quantum circuits dominated by Clifford gates.

Fast equivalence-checking for quantum circuits

  • S. YamashitaI. Markov
  • Computer Science, Physics
    2010 IEEE/ACM International Symposium on Nanoscale Architectures
  • 2010
This work develops several verification techniques for reversible circuits which arise as runtime bottlenecks of key quantum algorithms, and extends existing quantum verification tools using SAT-solvers.

Verification of Concurrent Quantum Protocols by Equivalence Checking

A tool which uses a concurrent language for describing quantum systems, and performs verification by checking equivalence between specification and implementation, and applies this tool to specify and verify interesting and practical quantum protocols from teleportation to secret sharing.

Analyzing Algebraic Quantum Circuits Using Exponential Sums

This article proves several properties of algebraic quantum circuits and derives a “least action principle” that shows how the behaviour of such circuits is determined by those computational paths whose action polynomials are extremal.

QWIRE Practice: Formal Verification of Quantum Circuits in Coq

A denotational semantics is formalized that interprets QWIRE circuits as superoperators on density matrices, and some simple quantum programs are proved, ensuring that quantum circuits are well-formed.

Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations

It is shown that single quantum bit operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states are sufficient to construct a universal quantum computer.

Verified Compilation of Space-Efficient Reversible Circuits

A reversible circuit compiler called ReVerC is presented, which has been formally verified in F* and compiles circuits that operate correctly with respect to the input program and provably cleans temporary values.

Quantum circuits and low-degree polynomials over F2

This work explores a correspondence between quantum circuits and low-degree polynomials over the finite field F2 and gives proofs of classical hardness results based on quantum circuit concepts and finds efficient classical simulation algorithms for certain classes of quantum circuits based on efficient algorithms for classes of polynomers.

QMC: A Model Checker for Quantum Systems

The unconditional security of quantum key distribution protocols does not automatically imply the same degree of security for actual systems, of course; this justifies the need for systems modelling and verification in this setting.

On the controlled-NOT complexity of controlled-NOT–phase circuits

It is proved that CNOT minimization over CNOT and phase gates is at least as hard as synthesizing a CNOT -optimal circuit computing a set of parities of its inputs, and presented an efficient heuristic algorithm for synthesizing circuits over C NOT and Z-basis rotations with small CNOT cost.