Entanglement Scaling in Quantum Advantage Benchmarks
arXiv:1808.00460 · doi:10.1103/PhysRevA.101.012349
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 (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() 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.
arXiv commentupdates and improvements from the review process; 8 pages; 3 figures
References in corpus (22)
- Quantum Machine Learning
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum Computational Supremacy
- Simulating quantum computation by contracting tensor networks
- Digitized adiabatic quantum computing with a superconducting circuit
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Quantum computing and the entanglement frontier
- 64-Qubit Quantum Circuit Simulation
- Architectures for quantum simulation showing a quantum speedup
- Simulation of low-depth quantum circuits as complex undirected graphical models
- Universality of Entanglement and Quantum Computation Complexity
- Demonstration of a Parametrically-Activated Entangling Gate Protected from Flux Noise
- Classical Simulation of Intermediate-Size Quantum Circuits
- Impossibility of Classically Simulating One-Clean-Qubit Computation
- Quantum Supremacy Is Both Closer and Farther than It Appears
- Tensor Network Contractions for #SAT
- Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
- Quantum Supremacy Circuit Simulation on Sunway TaihuLight
- Tensor Network Methods for Invariant Theory