Partial Equivalence Checking of Quantum Circuits
- URL: http://arxiv.org/abs/2208.07564v1
- Date: Tue, 16 Aug 2022 06:56:53 GMT
- Title: Partial Equivalence Checking of Quantum Circuits
- Authors: Tian-Fu Chen, Jie-Hong R. Jiang, Min-Hsiu Hsieh
- Abstract summary: Equivalence checking of quantum circuits is an essential element in quantum program compilation.
We devise algorithms for checking quantum circuits whose partial equivalence cannot be verified.
- Score: 23.357645240384876
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Equivalence checking of quantum circuits is an essential element in quantum
program compilation, in which a quantum program can be synthesized into
different quantum circuits that may vary in the number of qubits,
initialization requirements, and output states. Verifying the equivalences
among the implementation variants requires proper generality. Although
different notions of quantum circuit equivalence have been defined, prior
methods cannot check observational equivalence between two quantum circuits
whose qubits are partially initialized, which is referred to as partial
equivalence. In this work, we prove a necessary and sufficient condition for
two circuits to be partially equivalent. Based on the condition, we devise
algorithms for checking quantum circuits whose partial equivalence cannot be
verified by prior approaches. Experiment results confirm the generality and
demonstrate the efficiency and effectiveness of our method. Our result may
unleash the optimization power of quantum program compilation to take more
aggressive steps.
Related papers
- Equivalence Checking of Quantum Circuits via Intermediary Matrix Product Operator [4.306566710489809]
Equivalence checking plays a vital role in identifying errors that may arise during compilation and optimization of quantum circuits.
We introduce a novel method based on Matrix Product Operators (MPOs) for determining the equivalence of quantum circuits.
arXiv Detail & Related papers (2024-10-14T18:00:00Z) - Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
We show that a quantum processor can correctly solve the basic classification task considered.
With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
The first complete equational theory for quantum circuits has only recently been introduced.
We simplify the equational theory by proving that several rules can be derived from the remaining ones.
The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
arXiv Detail & Related papers (2023-03-06T13:31:27Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Equivalence Checking of Dynamic Quantum Circuits [7.835264621634824]
State-of-the-art quantum devices still contain only a very limited number of qubits.
One possible way to execute more realistic algorithms in near-term quantum devices is to employ dynamic quantum circuits.
This technique can help to significantly reduce the resources required to achieve a given accuracy of a quantum algorithm.
arXiv Detail & Related papers (2021-06-03T08:03:22Z) - Equivalence checking of quantum circuits by nonlocality [0.6091702876917279]
We show that this realistic problem can be solved completely from the viewpoints of quantum nonlocality.
Specifically, we design an elegant protocol that examines underlying quantum nonlocality.
We show that the protocol also works approximately, where the distance between two quantum circuits can be calculated accurately.
arXiv Detail & Related papers (2021-05-06T13:07:24Z) - Variational certification of quantum devices [0.0]
We describe a simple procedure based on variational quantum eigensolver which can be utilized to compare quantum devices.
We provide numerical results demonstrating its feasibility in realistic scenarios by running the procedure on IBM quantum computer.
arXiv Detail & Related papers (2020-11-03T17:56:22Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Advanced Equivalence Checking for Quantum Circuits [4.265279817927261]
We propose an advanced methodology for equivalence checking of quantum circuits.
We show that, by exploiting the reversibility of quantum circuits, complexity can be kept feasible.
In contrast to the classical realm, simulation is very powerful in verifying quantum circuits.
arXiv Detail & Related papers (2020-04-17T18:56:23Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.