FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes
Ramin Ayanzadeh, Narges Alavisamani, Poulami Das, Moinuddin K. Qureshi · 2023
Quantum Approximate Optimization Algorithm (QAOA) is one of the leading candidates for demonstrating the quantum advantage using near-term quantum computers. Unfortunately, high device error rates limit us from reliably running QAOA circuits for problems with more than a few qubits. In QAOA, the problem graph is translated into a quantum circuit such that every edge corresponds to two 2-qubit CNOT operations in each layer of the circuit. As CNOTs are extremely error-prone, the fidelity of QAOA circuits is dictated by the number of edges in the problem graph.