Entanglement scaling in quantum advantage benchmarks

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

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 adversarial advantage. In what ways can the entanglement realized in such a demonstration be quantified? Inspired by the area law of tensor networks, we derive an upper bound for the minimum random circuit depth needed to generate the maximal bipartite entanglement correlations between all problem variables (qubits). This bound is lattice geometry dependent and makes explicit a nuance implicit in other proposals with physical consequence. The hardware itself should be able to support superlogarithmic ebits of entanglement across some poly(n) number of qubit bipartitions; otherwise the quantum state itself will not possess volumetric entanglement scaling and full-lattice-range correlations. Hence, as we present a connection between quantum advantage protocols and quantum entanglement, the entanglement implicitly generated by such protocols can be tested separately to further ascertain the validity of any quantum advantage claim.

Cite

CITATION STYLE

APA

Biamonte, J. D., Morales, M. E. S., & Koh, D. E. (2020). Entanglement scaling in quantum advantage benchmarks. Physical Review A, 101(1). https://doi.org/10.1103/PhysRevA.101.012349

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free