Towards Large-scale Functional Verification of Universal Quantum Circuits

05/17/2018
by   Matthew Amy, et al.
0

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 for exponential sums with free variables. Our algorithm is further shown to give a polynomial-time decision procedure for checking the equivalence of Clifford group circuits. We evaluate our methods by performing automated verification of optimized Clifford+T circuits with up to 100 qubits and thousands of T gates, as well as the functional verification of quantum algorithms using hundreds of qubits. Our experiments culminate in the automated verification of the Hidden Shift algorithm for a class of Boolean functions in a fraction of the time it has taken recent algorithms to simulate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2021

Polynomial Circuit Verification using BDDs

Verification is one of the central tasks during circuit design. While mo...
research
01/02/2023

Rotational Abstractions for Verification of Quantum Fourier Transform Circuits

With the race to build large-scale quantum computers and efforts to expl...
research
09/07/2020

PolyAdd: Polynomial Formal Verification of Adder Circuits

Only by formal verification approaches functional correctness can be ens...
research
03/02/2023

quAssert: Automatic Generation of Quantum Assertions

Functional validation is necessary to detect any errors during quantum c...
research
02/22/2023

Obfuscation of Pseudo-Deterministic Quantum Circuits

We show how to obfuscate pseudo-deterministic quantum circuits, assuming...
research
01/18/2023

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

We introduce a new paradigm for analysing and finding bugs in quantum ci...
research
10/21/2022

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

Variational quantum algorithms have been introduced as a promising class...

Please sign up or login with your details

Forgot password? Click here to reset