.png){kind=icon}
.png){kind=icon}
Return
Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.3.040339.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension chi for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost func-tion that it seeks to minimize and find that it follows a scaling law F(ln chi IN), where N is the number of qubits. With ln chi amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relation-ship with chi and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.
Keywords:
COMPUTATIONAL ADVANTAGE
SUPREMACY
CUT
Journal
P
IF:
11
Papers:
919
Citations:
9.0K
