Entanglement scaling in quantum advantage benchmarks
Name
PhysRevA.101.012349.pdf
Size
371.42 KB
Format
Adobe PDF
Checksum (MD5)
9a9a8d06875c3b0d465cfa87f0173331
Author(s)
Biamonte, Jacob D.
Morales, Mauro E. S.
Koh, Dax Enshan
Date Issued
January 2020
Journal
Physical Review A
Publisher
American Physical Society (APS)
Citation
Biamonte, Jacob D., Mauro E. S. Morales, and Dax Enshan Koh. "Entanglement scaling in quantum advantage benchmarks." Physical Review A, 101, 1 (January 2020): 012349. © 2020 American Physical Society
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1103/PhysRevA.101.012349
