2024/03/08 by Kentaro Tamura, Tamura, Kentaro, Yohichi Suzuki +13
Chemistry · Computer Science · Neuroscience · Psychology · #Artificial intelligence #Chemistry #Computer science #Control theory (sociology) #Neuroscience #Noise (video) #Physics #Psychology #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum mechanics #Relaxation (psychology) #Robustness (evolution) #Statistical physics
paper · pdf · doi:10.48550/arxiv.2403.05153
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2024/03/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
QRAO (Quantum Random Access Optimization) is a relaxation algorithm that reduces the number of qubits required to solve a problem by encoding multiple variables per qubit using QRAC (Quantum Random Access Code). Reducing the number of qubits is a common way of dealing with the impact of noise on a quantum algorithm. Our interest lies in the impact of noise on the quality of the binary solution of QRAO, which is unknown. We demonstrate that the mean approximation ratio of the (3, 1)-QRAC Hamiltonian, i.e., the Hamiltonian utilizing the encoding of 3 bits into 1 qubit by QRAC, is less affected by noise compared to the Ising Hamiltonian used in quantum annealer and QAOA (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 to the Ising Hamiltonian.