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

research
05/22/2020

Symbolic Reasoning about Quantum Circuits in Coq

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

Tractable Boolean and Arithmetic Circuits

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

Circuits: An abstract viewpoint

Our primary purpose is to isolate the abstract, mathematical properties ...
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
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...
research
02/27/2019

Learning Logistic Circuits

This paper proposes a new classification model called logistic circuits....
research
03/06/2023

Simple Complete Equational Theories for Quantum Circuits with Ancillae or Partial Trace

Although quantum circuits have been ubiquitous for decades in quantum co...

Please sign up or login with your details

Forgot password? Click here to reset