Circuit Transformations for Quantum Architectures

by   Andrew M. Childs, et al.

Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits to architecture qubits. To achieve this, we first consider the qubit movement subproblem and use the routing via matchings framework to prove tighter bounds on parallel routing. In practice, we only need to perform partial permutations, so we generalize routing via matchings to that setting. We give new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product. Secondly, for serial routing, we consider the token swapping framework and extend a 4-approximation algorithm for general graphs to support partial permutations. We apply these routing procedures to give several circuit transformations, using various heuristic qubit placement subroutines. We implement these transformations in software and compare their performance for large quantum circuits on grid and modular architectures, identifying strategies that work well in practice.



There are no comments yet.


page 1

page 2

page 3

page 4


Quartz: Superoptimization of Quantum Circuits (Extended Version)

Existing quantum compilers optimize quantum circuits by applying circuit...

Qubit Routing using Graph Neural Network aided Monte Carlo Tree Search

Near-term quantum hardware can support two-qubit operations only on the ...

Quantum Circuit Transformations with a Multi-Level Intermediate Representation Compiler

Quantum computing promises remarkable approaches for processing informat...

Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing

Despite rapid advances in quantum computing technologies, the qubit conn...

Quantum routing with fast reversals

We present methods for implementing arbitrary permutations of qubits und...

Automatic Datapath Optimization using E-Graphs

Manual optimization of Register Transfer Level (RTL) datapath is commonp...

Planning for Compilation of a Quantum Algorithm for Graph Coloring

The problem of compiling general quantum algorithms for implementation o...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.