Efficient template matching in quantum circuits

09/11/2019
by   Raban Iten, et al.
0

Given a large and a small quantum circuit, we are interested in finding all maximal matches of the small circuit, called template, in the large circuit under consideration of pairwise commutation relations between quantum gates. In this work we present a classical algorithm for this task that provably finds all maximal matches with a running time that is polynomial in the number of gates and the number of qubits of the circuit for a fixed template size. Such an algorithm finds direct applications in quantum circuit optimization. Given a template circuit for which a lower-cost implementation is known, we may search for all instances of the template in a large circuit and replace them with their optimized version.

READ FULL TEXT
research
11/22/2021

Quanto: Optimizing Quantum Circuits with Automatic Generation of Circuit Identities

Existing quantum compilers focus on mapping a logical quantum circuit to...
research
05/31/2023

Bell sampling from quantum circuits

A central challenge in the verification of quantum computers is benchmar...
research
08/12/2023

An Efficient Quantum Factoring Algorithm

We show that n-bit integers can be factorized by independently running a...
research
01/29/2018

A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series

In this paper, we present a fixed-quantum circuit design for the simulat...
research
04/18/2023

Towards a generic compilation approach for quantum circuits through resynthesis

In this paper, we propose a generic quantum circuit resynthesis approach...
research
02/16/2022

The Parameterized Complexity of Quantum Verification

We initiate the study of parameterized complexity of problems in terms ...
research
05/27/2020

The limits of quantum circuit simulation with low precision arithmetic

This is an investigation of the limits of quantum circuit simulation wit...

Please sign up or login with your details

Forgot password? Click here to reset