Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Noise Robustness of Quantum Relaxation for Combinatorial Optimization (2403.05153v1)

Published 8 Mar 2024 in quant-ph

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Combinatorial optimization. Handbook of combinatorics, 2(1541-1597):4, 1995.
  2. Solving vehicle routing problem using quantum approximate optimization algorithm. IEEE Transactions on Intelligent Transportation Systems, 2022.
  3. Application of quantum approximate optimization algorithm to job shop scheduling problem. European Journal of Operational Research, 310(2):518–528, 2023.
  4. Quantum computing for finance: State-of-the-art and future prospects. IEEE Transactions on Quantum Engineering, 1:1–24, 2020.
  5. Combinatorial optimization via highly efficient quantum walks. Phys. Rev. Research, 2:023302, 2020.
  6. A variational eigenvalue solver on a photonic quantum processor. Nature communications, 5(1):4213, 2014.
  7. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014.
  8. Qaoa for max-cut requires hundreds of qubits for quantum speed-up. Sci Rep, 9:6903, 2019.
  9. Quantum optimization: Potential, challenges, and the path forward, 2023.
  10. Quantum optimization using variational algorithms on near-term quantum devices. Quantum Science and Technology, 3(3):030503, 2018.
  11. Cutqc: using small quantum computers for large quantum circuit evaluations. In Proceedings of the 26th ACM International conference on architectural support for programming languages and operating systems, pages 473–486, 2021.
  12. Qubit-efficient encoding schemes for binary optimisation problems. Quantum, 5:454, May 2021.
  13. Efficient discrete feature encoding for variational quantum classifier. IEEE Transactions on Quantum Engineering, 2:1–14, 2021.
  14. Approximate solutions of combinatorial problems via quantum relaxations. arXiv preprint arXiv:2111.03167, 2021.
  15. Dense quantum coding and quantum finite automata. Journal of the ACM (JACM), 49(4):496–511, 2002.
  16. The role of entanglement in quantum-relaxation based optimization algorithms. arXiv preprint arXiv:2302.00429, 2023.
  17. Quantum-relaxation based optimization algorithms: Theoretical extensions. arXiv preprint arXiv:2302.09481, 2023.
  18. Recursive Quantum Relaxation for Combinatorial Optimization Problems. arXiv e-prints, page arXiv:2403.02045, March 2024.
  19. Holevo A. S. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9:3–11, 1973.
  20. (4, 1)-quantum random access coding does not exist—one qubit is not enough to recover one of four bits. New Journal of Physics, 8(8):129, 2006.
  21. O. Liabøtrø. Improved classical and quantum random access codes. Physical Review A, 95(5), may 2017.
  22. Constructions of quantum random access codes. In Asian Quantum Information Symposium (AQIS), volume 66, 2018.
  23. The geometry of Bloch space in the context of quantum random access codes. Quantum Information Processing, 21(4):1–16, 2022.
  24. Quantum random access code in noisy channels, 2022.
  25. Qiskit contributors. Qiskit: An open-source framework for quantum computing, 2023.
  26. Richard M. Karp. Reducibility among Combinatorial Problems, pages 85–103. Springer US, Boston, MA, 1972.
  27. Optimizing parametrized quantum circuits with free-axis single-qubit gates. IEEE Transactions on Quantum Engineering, 2023.
  28. Simulating time evolution with fully optimized single-qubit gates on parametrized quantum circuits. Physical Review A, 105(6):062421, 2022.
  29. Full optimization of a single-qubit gate on the generalized sequential quantum optimizer. arXiv preprint arXiv:2209.08535, 2022.
  30. Sequential minimal optimization for quantum-classical hybrid algorithms. Physical Review Research, 2(4):043158, 2020.
  31. Structure optimization for parameterized quantum circuits. Quantum, 5:391, 2021.
  32. Amplitude estimation via maximum likelihood on noisy quantum computer. Quantum Information Processing, 20(9):293, 2021.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets