Quantum routing with fast reversals

03/04/2021
by   Aniruddha Bapat, et al.
0

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n, we show that there exists a constant ϵ≈ 0.034 such that the quantum routing time is at most (1-ϵ)n, whereas any swap-based protocol needs at least time n-1. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k ≤ n qubits and give algorithms with quantum routing time at most n/3 + O(k^2) on paths and at most 2r/3 + O(k^2) on general graphs with radius r.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/13/2021

Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks

While it is known that unconditionally secure position-based cryptograph...
10/08/2018

A quantum network stack and protocols for reliable entanglement-based networks

We present a stack model for breaking down the complexity of entanglemen...
09/20/2019

Modeling and Designing Routing Protocols in Quantum Networks

Quantum networks enable a number of important applications such as quant...
02/25/2019

Circuit Transformations for Quantum Architectures

Quantum computer architectures impose restrictions on qubit interactions...
03/16/2021

Faster Quantum Concentration via Grover's Search

We present quantum algorithms for routing concentration assignments on f...
01/24/2019

A stack-vector routing protocol for automatic tunneling

In a network, a tunnel is a part of a path where a protocol is encapsula...
06/02/2021

Formally Verified Convergence of Policy-Rich DBF Routing Protocols

In this paper we present new general convergence results about the behav...
This week in AI

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