Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions

by   Andrew Y. Guo, et al.

The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as 1/r^α in the distance r provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shor's algorithm to be performed on a D-dimensional lattice in time logarithmic in the number of qubits for interactions with α≤ D. As a corollary, we show that power-law systems with α≤ D are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.


page 1

page 2

page 3

page 4


On the complexity of implementing Trotter steps

Quantum dynamics can be simulated on a quantum computer by exponentiatin...

Quantum Computation with Machine-Learning-Controlled Quantum Stuff

We describe how one may go about performing quantum computation with arb...

Quantifying nonlocality: how outperforming local quantum codes is expensive

Quantum low-density parity-check (LDPC) codes are a promising avenue to ...

Advantages and limitations of quantum routing

The Swap gate is a ubiquitous tool for moving information on quantum har...

Implementing the fanout operation with simple pairwise interactions

It has been shown that, for even n, evolving n qubits according to a Ham...

Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures

Quantum technologies currently struggle to scale beyond moderate scale p...

Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing

The "Sum-Over-Paths" formalism is a way to symbolically manipulate linea...

Please sign up or login with your details

Forgot password? Click here to reset