Entanglement scaling in quantum advantage benchmarks
- Publisher:
- American Physical Society (APS)
- Publication Type:
- Journal Article
- Citation:
- Physical Review A, 2018, 101, (1), pp. 012349
- Issue Date:
- 2018-08-02
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
PhysRevA.101.012349.pdf | Published version | 371.42 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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 (i) lattice
geometry dependent and (ii) makes explicit a nuance implicit in other proposals
with physical consequence. The hardware itself should 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 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.
Please use this identifier to cite or link to this item: