Equivalence Checking of Quantum Circuits with the ZX-Calculus
- URL: http://arxiv.org/abs/2208.12820v1
- Date: Fri, 26 Aug 2022 18:00:01 GMT
- Title: Equivalence Checking of Quantum Circuits with the ZX-Calculus
- Authors: Tom Peham, Lukas Burgholzer and Robert Wille
- Abstract summary: State-of-the-art quantum computers are capable of running increasingly complex algorithms.
The need for automated methods to design and test potential applications rises.
Recently, new methods have been proposed that tackle this problem.
- Score: 3.610459670994051
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As state-of-the-art quantum computers are capable of running increasingly
complex algorithms, the need for automated methods to design and test potential
applications rises. Equivalence checking of quantum circuits is an important,
yet hardly automated, task in the development of the quantum software stack.
Recently, new methods have been proposed that tackle this problem from widely
different perspectives. One of them is based on the ZX-calculus, a graphical
rewriting system for quantum computing. However, the power and capability of
this equivalence checking method has barely been explored. The aim of this work
is to evaluate the ZX-calculus as a tool for equivalence checking of quantum
circuits. To this end, it is demonstrated how the ZX-calculus based approach
for equivalence checking can be expanded in order to verify the results of
compilation flows and optimizations on quantum circuits. It is also shown that
the ZX-calculus based method is not complete$\unicode{x2014}$especially for
quantum circuits with ancillary qubits. In order to properly evaluate the
proposed method, we conduct a detailed case study by comparing it to two other
state-of-the-art methods for equivalence checking: one based on path-sums and
another based on decision diagrams. The proposed methods have been integrated
into the publicly available QCEC tool (https://github.com/cda-tum/qcec) which
is part of the Munich Quantum Toolkit (MQT).
Related papers
- Application of ZX-calculus to Quantum Architecture Search [0.0]
This paper presents a novel approach to quantum architecture search by integrating the techniques of ZX-calculus with Genetic Programming (GP)
We propose a GP framework that utilizes mutations defined via ZX-calculus, a graphical language that can simplify visualizing and working with quantum circuits.
Our results indicate that certain ZX-calculus-based mutations perform significantly better than others for Quantum Architecture Search (QAS) in all metrics considered.
arXiv Detail & Related papers (2024-06-03T08:30:24Z) - Equivalence Checking of Quantum Circuits by Model Counting [0.0]
This paper gives a Turing reduction of the (universal) quantum circuits equivalence problem to weighted model counting (WMC)
With an open-source implementation, we demonstrate that this novel approach can outperform a state-of-the-art equivalence-checking tool based on ZX calculus and decision diagrams.
arXiv Detail & Related papers (2024-03-27T17:58:20Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering [3.187381965457262]
We develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steering effect.
Our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory.
arXiv Detail & Related papers (2023-03-14T13:55:06Z) - The Basis of Design Tools for Quantum Computing: Arrays, Decision
Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
Quantum computers promise to efficiently solve important problems classical computers never will.
A fully automated quantum software stack needs to be developed.
This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
arXiv Detail & Related papers (2023-01-10T19:00:00Z) - Equivalence Checking of Parameterized Quantum Circuits: Verifying the
Compilation of Variational Quantum Algorithms [3.610459670994051]
Variational quantum algorithms have been introduced as a promising class of quantum-classical hybrid algorithms.
It is essential to verify that parameterized quantum circuits have been compiled correctly.
No methodology capable of handling circuits with parameters has been proposed yet.
arXiv Detail & Related papers (2022-10-21T18:00:04Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
Faults are by nature while most man-made systems, and especially computers, work deterministically.
This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
arXiv Detail & Related papers (2022-09-08T17:55:30Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Quantum Multiple-Valued Decision Diagrams in Graphical Calculi [0.0]
We show how to turn a QMDD into an equivalent ZH-diagram, and vice-versa.
This allows tools from one formalism to be used into the other.
arXiv Detail & Related papers (2021-07-02T16:50:11Z) - 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)
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.