On the qubit routing problem

02/21/2019
by   Alexander Cowtan, et al.
0

We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler. We present empirical results showing the effectiveness of this method in terms of reducing two-qubit gate depth and two-qubit gate count, compared to other implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2022

Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer

Increasing capabilities of quantum computing hardware and the challenge ...
research
02/13/2019

Explicit lower bounds on strong simulation of quantum circuits in terms of T-gate count

We investigate Clifford+T quantum circuits with a small number of T-gate...
research
07/20/2022

Short-Depth Circuits for Dicke State Preparation

We present short-depth circuits to deterministically prepare any Dicke s...
research
02/17/2021

Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns

Current quantum processors are noisy, have limited coherence and imperfe...
research
04/27/2023

Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective

We present an industrial end-user perspective on the current state of qu...
research
04/28/2023

A New Quantum Dempster Rule of Combination

Dempster rule of combination (DRC) is widely used for uncertainty reason...
research
12/17/2020

Compiler Design for Distributed Quantum Computing

In distributed quantum computing architectures, with the network and com...

Please sign up or login with your details

Forgot password? Click here to reset