Noise Robustness of Quantum Relaxation for Combinatorial Optimization

Abstract

Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple variables per qubit using quantum random-access code (QRAC). Reducing the number of qubits will alleviate physical noise (typically, decoherence), and as a result, the quality of the binary solution of QRAO may be robust against noise, which is, however, unknown. In this article, we numerically demonstrate that the mean approximation ratio of the (3, 1)-QRAC Hamiltonian, i.e., the Hamiltonian utilizing the encoding of three bits into one qubit by QRAC, is less affected by noise compared with the conventional Ising Hamiltonian used in the quantum annealer and the quantum approximate optimization algorithm. Based on this observation, we discuss a plausible mechanism behind the robustness of QRAO under depolarizing noise. Finally, we assess the number of shots required to estimate the values of binary variables correctly under depolarizing noise and show that the (3, 1)-QRAC Hamiltonian requires less shots to achieve the same accuracy compared with the Ising Hamiltonian.

Keywords

• Combinatorial optimization
• depolarizing noise
• quantum random-access code (QRAC)
• quantum relaxation