DeepAI AI Chat
Log In Sign Up

Efficient template matching in quantum circuits

by   Raban Iten, et al.

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.


Quanto: Optimizing Quantum Circuits with Automatic Generation of Circuit Identities

Existing quantum compilers focus on mapping a logical quantum circuit to...

Bell sampling from quantum circuits

A central challenge in the verification of quantum computers is benchmar...

Efficient decomposition of unitary matrices in quantum circuit compilers

Unitary decomposition is a widely used method to map quantum algorithms ...

A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series

In this paper, we present a fixed-quantum circuit design for the simulat...

Quantum Search for Scaled Hash Function Preimages

We present the implementation of Grover's algorithm in a quantum simulat...

Towards a generic compilation approach for quantum circuits through resynthesis

In this paper, we propose a generic quantum circuit resynthesis approach...

The limits of quantum circuit simulation with low precision arithmetic

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