A Pattern Matching-Based Framework for Quantum Circuit Rewriting
- URL: http://arxiv.org/abs/2206.06684v1
- Date: Tue, 14 Jun 2022 08:40:06 GMT
- Title: A Pattern Matching-Based Framework for Quantum Circuit Rewriting
- Authors: Hui Jiang, Diankang Li, Yuxin Deng, Ming Xu
- Abstract summary: We propose a pattern matching-based framework for rewriting quantum circuits, called QRewriting.
It takes advantage of a new representation of quantum circuits using symbol sequences.
We develop a rule library for basic optimizations and use it to rewrite Arithmetic and Toffoli benchmarks from the $G_IBM$ gate set to the $G_Sur$ gate set.
- Score: 7.664419735814611
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The realization of quantum algorithms relies on specific quantum compilations
according to the underlying quantum processors. However, there are various ways
to physically implement qubits in different physical devices and manipulate
those qubits. These differences lead to different communication methods and
connection topologies, with each vendor implementing its own set of primitive
gates. Therefore, quantum circuits have to be rewritten or transformed in order
to be transplanted from one platform to another. We propose a pattern
matching-based framework for rewriting quantum circuits, called QRewriting. It
takes advantage of a new representation of quantum circuits using symbol
sequences. Unlike the traditional way of using directed acyclic graphs, the new
representation allows us to easily identify the patterns that appear
non-consecutively but reducible. Then, we convert the problem of pattern
matching into that of finding distinct subsequences and propose a
polynomial-time dynamic programming-based pattern matching and replacement
algorithm. We develop a rule library for basic optimizations and use it to
rewrite the Arithmetic and Toffoli benchmarks from the $G_{IBM}$ gate set to
the $G_{Sur}$ gate set. Compared with the existing tool PaF, QRewriting obtains
an improvement of reducing depths (resp. gate counts) by 29\% (resp. 14\%).
Related papers
- Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling [0.0]
We propose a novel algorithm for the synthesis of trotterized time-evolution operators.
Our synthesis procedure takes the qubit connectivity of a target quantum computer into account.
We show a significant improvement for randomized circuits and different molecular ansatzes.
arXiv Detail & Related papers (2024-08-01T07:50:16Z) - Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage.
We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection.
Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
arXiv Detail & Related papers (2024-07-05T12:06:40Z) - A Representative Framework for Implementing Quantum Finite Automata on Real Devices [0.0]
We present a framework for the implementation of quantum finite automata algorithms for gate-based quantum computers.
First, we compile the known theoretical results from the literature to reduce the number of CNOT gates.
Second, we demonstrate techniques for modifying the algorithms based on the basis gates of available quantum hardware.
arXiv Detail & Related papers (2024-06-17T09:28:24Z) - AltGraph: Redesigning Quantum Circuits Using Generative Graph Models for Efficient Optimization [2.089191490381739]
AltGraph is a novel search-based circuit transformation approach.
It generates equivalent quantum circuits using existing generative graph models.
It achieves on average a 37.55% reduction in the number of gates and a 37.75% reduction in the circuit depth post-transpiling.
arXiv Detail & Related papers (2024-02-23T19:01:47Z) - Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
arXiv Detail & Related papers (2023-12-18T19:00:00Z) - Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
We numerically simulate and characterize the operation of various quantum processors.
We identify and assess quantum complexity by comparing the performance of each device against benchmark lines.
We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
arXiv Detail & Related papers (2023-04-10T23:01:10Z) - 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) - Exploring ab initio machine synthesis of quantum circuits [0.0]
Gate-level quantum circuits are often derived manually from higher level algorithms.
Here we explore methods for the ab initio creation of circuits within a machine.
arXiv Detail & Related papers (2022-06-22T17:48:29Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - Quantum Search for Scaled Hash Function Preimages [1.3299507495084417]
We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions.
We show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover's algorithm can only provide some marginal practical advantage in terms of error mitigation.
arXiv Detail & Related papers (2020-09-01T18:00:02Z) - 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.