Continuous-variable quantum approximate optimization on a programmable photonic quantum processor

7Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

Variational quantum algorithms (VQAs) provide a promising approach to achieving quantum advantage for practical problems on near-term noisy intermediate-scale quantum (NISQ) devices. Thus far, most studies on VQAs have focused on qubit-based systems, but the power of VQAs can be potentially boosted by exploiting infinite-dimensional continuous-variable (CV) systems. Here, we implement the CV version of one VQA, a quantum approximate optimization algorithm, by developing an automated collaborative computing system between a programmable photonic quantum computer and a classical computer. We experimentally demonstrate that this algorithm solves the minimization problem of simple continuous functions by implementing the quantum version of gradient descent to localize an initially broadly distributed wave function to the minimum. This method allows the execution of a practical CV quantum algorithm on a physical platform. Our work can be extended to the minimization of more general functions, providing an alternative to achieve the quantum advantage in practical problems.

Cite

CITATION STYLE

APA

Enomoto, Y., Anai, K., Udagawa, K., & Takeda, S. (2023). Continuous-variable quantum approximate optimization on a programmable photonic quantum processor. Physical Review Research, 5(4). https://doi.org/10.1103/PhysRevResearch.5.043005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free