Checking equivalence of quantum circuits and states

@article{Viamontes2007CheckingEO,
  title={Checking equivalence of quantum circuits and states},
  author={George F. Viamontes and Igor L. Markov and John P. Hayes},
  journal={2007 IEEE/ACM International Conference on Computer-Aided Design},
  year={2007},
  pages={69-74}
}
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to. but more challenging, than the related problems in classical (non-quantum) CAD. such as determining if two states or circuits are functionally equivalent. While differences in classical states are… 

Figures and Tables from this paper

Handling Non-Unitaries in Quantum Circuit Equivalence Checking
TLDR
This work demonstrates methodically, as well as experimentally, that existing techniques for verifying the equivalence of quantum circuits can be kept applicable for this broader class of circuits, dynamic quantum circuits.
Equivalence Checking of Dynamic Quantum Circuits
TLDR
This paper gives a formal definition of dynamic quantum circuits and proposes to characterise their functionality in terms of ensembles of linear operators, based on this novel semantics, and proposes and implements two decision diagram-based algorithms for checking the equivalence ofynamic quantum circuits.
Towards Verification of Dynamic Quantum Circuits
TLDR
This work proposes two different schemes that eventually allow to treat the involved circuits as if they were not dynamic at all, and provides a basis for applying existing techniques for quantum circuit verification to this broader class of circuits.
Improved DD-based Equivalence Checking of Quantum Circuits
TLDR
This work proposes an improved DD-based equivalence checking approach which addresses shortcomings of existing solutions and utilizes decision diagrams to exploit the fact that quantum operations are inherently reversible - allowing for dedicated strategies that keep the overhead moderate in many cases.
Equivalence Checking in Multi-level Quantum Systems
TLDR
This paper proposes a scheme which is capable of verifying the equivalence of two quantum operations regardless of the dimension of their underlying quantum system and can be incorporated into data-structures particularly suited for the representation of quantum functionality and enables an efficient verification.
A compact and efficient SAT encoding for quantum circuits
TLDR
This work proposes a compact and efficient SAT encoding for quantum circuits that loses restrictions on Boolean satisfiability, and introduces a structural analysis which determines an upper bound on possible quantum states.
Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow
TLDR
An efficient scheme for quantum circuit equivalence checking—specialized for verifying results of the IBM Qiskit quantum circuit compilation flow—is proposed, which allows to verify even large circuit instances with tens of thousands of operations within seconds or even less, whereas state-of-the-art techniques frequently time-out or require substantially more runtime.
Efficient and Correct Compilation of Quantum Circuits
TLDR
This summary paper reviews how existing compilation approaches can be optimized by utilizing heuristic search algorithms or exact reasoning engines and how the correctness of the obtained results can be verified afterwards by clever data structures such as decision diagrams.
Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits
TLDR
A novel quantum compiler optimization, named relaxed peephole optimization (RPO) for quantum computers, which leverages the single-qubit state information that can be determined statically by the compiler and extends the approach to optimize the quantum gates when some input qubits are in known pure states.
N ov 2 01 8 Equivalence Checking of Sequential antum Circuits
TLDR
The main theorem is shown showing that equivalence checking of two quantum Mealy machines can be done with input sequences that are taken from some chosen basis and have a length quadratic in the dimensions of the state Hilbert spaces of themachines.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Improving Gate-Level Simulation of Quantum Circuits
TLDR
The results demonstrate that QuIDDs asymptotically outperform all other known simulation techniques and show that well-known worst-case instances of classical searching can be circumvented in many specific cases by data compression techniques.
Quantum circuits for incompletely specified two-qubit operators
TLDR
This work identifies cases in which unitary operators can be implemented using fewer quantum gates than are required for generic completely specified operators, and takes up the practical challenge of satisfying a given specification with the smallest possible circuit.
Elementary gates for quantum computation.
TLDR
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Graph-based simulation of quantum computation in the density matrix representation
TLDR
This work proposes a new technique aimed at efficiently simulating quantum circuits that are subject to errors, and describes new graph-based algorithms implemented in the simulator QuIDDPro/D that use the density matrix representation.
Improved Simulation of Stabilizer Circuits
TLDR
The Gottesman-Knill theorem, which says that a stabilizer circuit, a quantum circuit consisting solely of controlled-NOT, Hadamard, and phase gates can be simulated efficiently on a classical computer, is improved in several directions.
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment
TLDR
This work studies the theoretical aspects of the problem of the practical realization of an abstract quantum circuit when executed on quantum hardware and presents empirical results that match the best known solutions that have been developed by experimentalists.
The Heisenberg Representation of Quantum Computers
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features
Fast quantum modular exponentiation
TLDR
It is found that to exponentia te an n-bit number, for storage space 100n, the authors can execute modular exponentiation two hundred to seven hundred times faster than optimized versions of the basic algorithms, depending on architecture, for n = 128.
Synthesis of quantum-logic circuits
TLDR
Efficient quantum-logic circuits that perform two tasks are discussed: 1) implementing generic quantum computations, and 2) initializing quantum registers that are asymptotically optimal for respective tasks.
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
...
1
2
3
4
...