Quantum Supremacy Lower Bounds by Entanglement Scaling

08/01/2018
by   Jacob D. Biamonte, et al.
0

A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum supremacy. The minimal requirements to realize quantum supremacy have so far been based on building a device to surpass extrapolated numerical simulation times. Here, we derive a formula for the minimal number of nearest-neighbor gates on a 2D lattice required to possibly generate a quantum state possessing volumetric entanglement scaling in the number of qubits. Hence, we predict the minimum random circuit depth needed to generate the maximal bipartite entanglement correlations between all problem variables (qubits). This derivation leads immediately to an interval which is constant on a coarse-grained entanglement upper bound---all existing numerical simulations fall inside this interval. These bounds make explicit a nuance implicit in other proposals with critical physical consequence. The hardware itself must be able to support super-logarithmic ebits of entanglement across some poly(n) number of qubit-bipartitions, otherwise the quantum state itself will not possess volumetric entanglement growth and full-lattice-range correlations. In conclusion we forecast that quantum supremacy will not be possible for gate-depths of less than 100 on systems of 80 to 150 qubits. These findings are just above the entanglement interval lower-bound that we derived in the study.

READ FULL TEXT

page 1

page 5

research
04/23/2019

α-Logarithmic negativity

The logarithmic negativity of a bipartite quantum state is a widely empl...
research
08/01/2019

Existence of some optimal maximal entanglement entanglement-assisted quantum codes

We establish the existence of optimal maximal entanglement entanglement-...
research
11/03/2021

Fundamental limitations on device-independent quantum conference key agreement

We provide several general upper bounds on device-independent conference...
research
02/24/2021

Entanglement Diagnostics for Efficient Quantum Computation

We consider information spreading measures in randomly initialized varia...
research
03/13/2019

Analytic Semi-device-independent Entanglement Quantification for Bipartite Quantum States

We define a property called nondegeneracy for Bell inequalities, which d...
research
07/05/2023

Hybrid Ground-State Quantum Algorithms based on Neural Schrödinger Forging

Entanglement forging based variational algorithms leverage the bi-partit...
research
05/30/2018

Quantum correlations and entanglement in a Kitaev-type spin chain

The entanglement and quantum correlation measures have been investigated...

Please sign up or login with your details

Forgot password? Click here to reset