
Symbolic Verification of Quantum Circuits
This short note proposes a symbolic approach for representing and reason...
read it

An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
Quantum computing is a promising technology that harnesses the peculiari...
read it

Capacity and quantum geometry of parametrized quantum circuits
To harness the potential of noisy intermediatescale quantum devices, it...
read it

Symbolic Abstractions for Quantum Protocol Verification
This technical report explores the use of symbolic model and verifiers t...
read it

BitSlicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation to a New Level
Quantum computing is greatly advanced in recent years and is expected to...
read it

Gottesman Types for Quantum Programs
The Heisenberg representation of quantum operators provides a powerful t...
read it

Optimal Entropy Compression and Purification in Quantum Bits
Global unitary transformations (optswaps) that optimally increase the bi...
read it
Symbolic Reasoning about Quantum Circuits in Coq
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
Comments
There are no comments yet.