.png){kind=icon}
.png){kind=icon}
Return
Photonic counterdiabatic quantum optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1038/s42005-024-01807-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One of the key applications of near-term quantum computers has been the development of quantum optimization algorithms. However, these algorithms have largely been focused on qubit-based technologies. Here, we propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm reduces the required quantum operations for optimization compared to adiabatic protocols. This reduction enables us to tackle non-convex continuous optimization within the near-term era of quantum computing. Through illustrative benchmarking, we show that our approach can outperform existing state-of-the-art hybrid adiabatic quantum algorithms in terms of convergence and implementability. Our algorithm offers a practical and accessible experimental realization, bypassing the need for high-order operations and overcoming experimental constraints. We conduct a proof-of-principle demonstration on Xanadu's eight-mode nanophotonic quantum chip, successfully showcasing the feasibility and potential impact of the algorithm. The authors introduce a hybrid quantum-classical algorithm for photonic quantum computing that focuses on tackling continuous-variable optimization problems using fewer quantum operations than existing methods. The approach shows better performance and practical implementation potential, demonstrated on Xanadu's quantum chip.
Journal
IF:
5.8
Papers:
2.7K
Citations:
9.2K
View more organizations