Recursive Methods for Synthesizing Permutations on Limited-Connectivity Quantum Computers

07/13/2022
by   Cynthia Chen, et al.
0

We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a non-scalable, yet exact, synthesis. Our algorithms are applicable to generic connectivity constraints, scale favorably, and achieve close-to-optimal performance in many cases. We demonstrate the utility of these algorithms by optimizing the compilation of Quantum Volume circuits, and to disprove an old conjecture on reversals being the hardest permutation on a path.

READ FULL TEXT
research
10/06/2022

AutoQC: Automated Synthesis of Quantum Circuits Using Neural Network

While the ability to build quantum computers is improving dramatically, ...
research
10/17/2022

On Optimal Subarchitectures for Quantum Circuit Mapping

Compiling a high-level quantum circuit down to a low-level description t...
research
07/11/2019

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis

Due to the decoherence of the state-of-the-art physical implementations ...
research
04/27/2023

Scalable quantum circuits for n-qubit unitary matrices

This work presents an optimization-based scalable quantum neural network...
research
05/01/2020

ROS: Resource-constrained Oracle Synthesis for Quantum Computers

We present a completely automatic synthesis framework for oracle functio...
research
07/03/2021

Quantum Error Mitigation Relying on Permutation Filtering

Quantum error mitigation (QEM) is a class of promising techniques capabl...
research
07/20/2022

Short-Depth Circuits for Dicke State Preparation

We present short-depth circuits to deterministically prepare any Dicke s...

Please sign up or login with your details

Forgot password? Click here to reset