This article has been reviewed according to Science X's editorial process and policies. Editors have highlighted the following attributes while ensuring the content's credibility:

fact-checked

peer-reviewed publication

trusted source

proofread

Research team shows theoretical quantum speedup with the quantum approximate optimization algorithm

Research team shows theoretical quantum speedup with the quantum approximate optimization algorithm
Classical and quantum algorithms applied to the LABS problem. Credit: Science Advances (2024). DOI: 10.1126/sciadv.adm6761

In a new paper in Science Advances, researchers at JPMorgan Chase, the U.S. Department of Energy's (DOE) Argonne National Laboratory and Quantinuum have demonstrated clear evidence of a quantum algorithmic speedup for the quantum approximate optimization algorithm (QAOA).

This algorithm has been studied extensively and has been implemented on many quantum computers. It has potential applications in fields such as logistics, telecommunications, financial modeling and .

"This work is a significant step towards reaching , laying the foundation for future impact in production," said Marco Pistoia, head of Global Technology Applied Research at JPMorgan Chase.

The team examined whether a with low implementation costs could provide a quantum speedup over the best-known classical methods. QAOA was applied to the Low Autocorrelation Binary Sequences problem, which has significance in understanding the behavior of physical systems, signal processing and cryptography. The study showed that if the algorithm was asked to tackle increasingly larger problems, the time it would take to solve them would grow at a slower rate than that of a classical solver.

To explore the quantum algorithm's performance in an ideal noiseless setting, JPMorgan Chase and Argonne jointly developed a simulator to evaluate the algorithm's performance at scale.

"The large-scale quantum circuit simulations efficiently utilized the DOE petascale supercomputer Polaris located at the ALCF. These results show how can complement and advance the field of quantum information science," said Yuri Alexeev, a computational scientist at Argonne. Jeffrey Larson, a computational mathematician in Argonne's Mathematics and Computer Science Division, also contributed to this research.

To take the first step toward practical realization of the speedup in the algorithm, the researchers demonstrated a small-scale implementation on Quantinuum's System Model H1 and H2 trapped-ion quantum computers. Using algorithm-specific error detection, the team reduced the impact of errors on algorithmic performance by up to 65%.

"Our long-standing partnership with JPMorgan Chase led to this meaningful and noteworthy three-way research experiment that also brought in Argonne. The results could not have been achieved without the unprecedented and world-leading quality of our H-Series Quantum Computer, which provides a flexible device for executing error-correcting and error-detecting experiments on top of gate fidelities that are years ahead of other quantum computers," said Ilyas Khan, founder and chief product officer of Quantinuum.

More information: Ruslan Shaydulin et al, Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem, Science Advances (2024). DOI: 10.1126/sciadv.adm6761

Journal information: Science Advances

Citation: Research team shows theoretical quantum speedup with the quantum approximate optimization algorithm (2024, May 29) retrieved 25 June 2024 from https://phys.org/news/2024-05-team-theoretical-quantum-speedup-approximate.html
This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no part may be reproduced without the written permission. The content is provided for information purposes only.

Explore further

Springing simulations forward with quantum computing

114 shares

Feedback to editors