Symbolic Reasoning about Quantum Circuits in Coq

05/22/2020
by   Wenjun Shi, et al.
0

A quantum circuit is a computational unit that transforms an input quantum state to an output one. A natural way to reason about its behavior is to compute explicitly the unitary matrix implemented by it. However, when the number of qubits increases, the matrix dimension grows exponentially and the computation becomes intractable. In this paper, we propose a symbolic approach to reasoning about quantum circuits. It is based on a small set of laws involving some basic manipulations on vectors and matrices. This symbolic reasoning scales better than the explicit one and is well suited to be automated in Coq, as demonstrated with some typical examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/05/2020

Symbolic Verification of Quantum Circuits

This short note proposes a symbolic approach for representing and reason...
research
08/06/2021

An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation

Quantum computing is a promising technology that harnesses the peculiari...
research
02/08/2023

Symbolic Quantum Simulation with Quasimodo

The simulation of quantum circuits on classical computers is an importan...
research
04/28/2023

A New Quantum Dempster Rule of Combination

Dempster rule of combination (DRC) is widely used for uncertainty reason...
research
04/01/2021

Unitarization Through Approximate Basis

In this paper, we introduce the problem of unitarization. Unitarization ...
research
11/17/2022

Synthesizing Quantum-Circuit Optimizers

Near-term quantum computers are expected to work in an environment where...
research
01/02/2020

Optimal Entropy Compression and Purification in Quantum Bits

Global unitary transformations (optswaps) that optimally increase the bi...

Please sign up or login with your details

Forgot password? Click here to reset