Symbolic Verification of Quantum Circuits

10/05/2020
by   Mingsheng Ying, et al.
0

This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the existing techniques and tools for verification of classical logic circuits in reasoning about quantum circuits.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/22/2020

Symbolic Reasoning about Quantum Circuits in Coq

A quantum circuit is a computational unit that transforms an input quant...
02/07/2022

Tractable Boolean and Arithmetic Circuits

Tractable Boolean and arithmetic circuits have been studied extensively ...
06/16/2020

Circuits: An abstract viewpoint

Our primary purpose is to isolate the abstract, mathematical properties ...
05/17/2018

Towards Large-scale Functional Verification of Universal Quantum Circuits

We introduce a framework for the formal specification and verification o...
03/22/2021

A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond

We introduce a class of rooted graphs which allows one to encode various...
02/27/2019

Learning Logistic Circuits

This paper proposes a new classification model called logistic circuits....
05/02/2022

Giallar: Push-Button Verification for the Qiskit Quantum Compiler

This paper presents Giallar, a fully-automated verification toolkit for ...