The Quantum Approximate Optimization Algorithm performance with low entanglement and high circuit depth

Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot simulate them classically for intermediate sizes. Since entanglement lies at the core of quantum computing power, we investigate its role in these heuristic methods for solving optimization problems. In particular, we use matrix product states to simulate the quantum approximate optimization algorithm with reduced bond dimensions $D$, a parameter bounding the system entanglement. Moreover, we restrict the simulation further by deterministically sampling solutions. We conclude that entanglement plays a minor role in the MaxCut and Exact Cover 3 problems studied here since the simulated algorithm analysis, with up to $60$ qubits and $p=100$ algorithm layers, shows that it provides solutions for bond dimension $D \approx 10$ and depth $p \approx 30$. Additionally, we study the classical optimization loop in the approximated algorithm simulation with $12$ qubits and depth up to $p=4$ and show that the approximated optimal parameters with low entanglement approach the exact ones.

No reviews yet.

No comments yet.