Performance analysis of a filtering variational quantum algorithm
Gespeichert in:
| Veröffentlicht in: | New Journal of Physics vol. 27, no. 5 (May 2025), p. 054505 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Veröffentlicht: |
IOP Publishing
|
| Schlagworte: | |
| Online-Zugang: | Citation/Abstract Full Text - PDF |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|
| Abstract: | Even a minor boost in solving combinatorial optimization problems can greatly benefit multiple industries. Quantum computers, with their unique information processing capabilities, hold promise for delivering such enhancements. The filtering variational quantum eigensolver (F-VQE) is a variational hybrid quantum algorithm designed to solve combinatorial optimization problems on existing quantum computers with limited qubit number, connectivity, and fidelity. In this work we employ instantaneous quantum polynomial circuits as our parameterized quantum circuits. We propose a hardware-efficient implementation that respects limited qubit connectivity and show that they halve the number of circuits necessary to evaluate the gradient with the parameter-shift rule. To assess the potential of this protocol in the context of combinatorial optimization, we conduct extensive numerical analysis. We compare the performance against three classical baseline algorithms on weighted MaxCut and the asymmetric traveling salesperson problem (ATSP). We employ noiseless simulators for problems encoded on 13–29 qubits, and up to 37 qubits on the IBMQ real quantum devices. The ATSP encoding employed reduces the number of qubits and avoids the need of constraints compared to the standard quadratic unconstrained binary optimization/Ising model. Despite some observed positive signs, we conclude that significant development is necessary for a practical advantage with F-VQE. |
|---|---|
| ISSN: | 1367-2630 |
| DOI: | 10.1088/1367-2630/add365 |
| Quelle: | Publicly Available Content Database |