Compare Papers
Paper 1
Systematic approach to hyperbolic quantum error correction codes
Ahmed Adel Mahmoud, Kamal Mohamed Ali, Steven Rayan
- Year
- 2026
- Journal
- Physical Review A
- DOI
- 10.1103/95mp-w7kr
- arXiv
- -
No abstract.
Open paperPaper 2
Quantum Approximate Bayesian Optimization Algorithms with Two Mixers and Uncertainty Quantification
Jungin E. Kim, Yan Wang
- Year
- 2023
- Journal
- arXiv preprint
- DOI
- arXiv:2307.16335
- arXiv
- 2307.16335
The searching efficiency of the quantum approximate optimization algorithm is dependent on both the classical and quantum sides of the algorithm. Recently a quantum approximate Bayesian optimization algorithm (QABOA) that includes two mixers was developed, where surrogate-based Bayesian optimization is applied to improve the sampling efficiency of the classical optimizer. A continuous-time quantum walk mixer is used to enhance exploration, and the generalized Grover mixer is also applied to improve exploitation. In this paper, an extension of QABOA is proposed to further improve its searching efficiency. The searching efficiency is enhanced through two aspects. First, two mixers, including one for exploration and the other for exploitation, are applied in an alternating fashion. Second, uncertainty of the quantum circuit is quantified with a new quantum Matérn kernel based on the kurtosis of the basis state distribution, which increases the chance of obtaining the optimum. The proposed new two-mixer QABOA$'$s with and without uncertainty quantification are compared with three single-mixer QABOA$'$s on five discrete and four mixed-integer problems. The results show that the proposed two-mixer QABOA with uncertainty quantification has the best performance in efficiency and consistency for five out of the nine tested problems. The results also show that QABOA with the generalized Grover mixer performs the best among the single-mixer algorithms, thereby demonstrating the benefit of exploitation and the importance of dynamic exploration-exploitation balance in improving searching efficiency.
Open paper