Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This study demonstrates a proof-of-principle implementation of the quantum asymptotic numerical method (qANM) on real superconducting hardware, successfully tracking nonlinear solution paths with 98% accuracy despite noise. By combining high-order perturbation techniques with iterative quantum linear solvers like q-Jacobi, the work validates a viable pathway for applying near-term quantum processors to complex nonlinear computational mechanics problems.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Nonlinear path-following via the asymptotic numerical method on a quantum processor

arXiv2 min read

arXiv:2412.03939v4 Announce Type: replace Abstract: Quantum computing offers a promising avenue for advancing computational methods in science and engineering. In this work, we introduce the quantum asymptotic numerical method (qANM), a framework for solving nonlinear path-following problems using quantum computing. Based on the principle of high-order perturbation techniques, the proposed method uses Taylor series expansions to transform complex nonlinear systems into sequences of linear equations, which are then solved using quantum linear solvers. The central objective of this study is to demonstrate nonlinear path-following with the required linear systems solved on real quantum hardware. To realize this objective, we develop the quantum-enhanced Jacobi method (q-Jacobi), an iterative quantum linear solver used in the hardware experiment. Numerical simulations on a quantum simulator validate the convergence of the method. A highlight of this work is a proof-of-principle experiment on a superconducting quantum processor. Despite the noise inherent in near-term quantum hardware, the experiment achieves 98% accuracy in tracking the nonlinear solution path. We believe this work provides a useful reference for applying quantum computing to nonlinear computational mechanics.

Abstract:Quantum computing offers a promising avenue for advancing computational methods in science and engineering. In this work, we introduce the quantum asymptotic numerical method (qANM), a framework for solving nonlinear path-following problems using quantum computing. Based on the principle of high-order perturbation techniques, the proposed method uses Taylor series expansions to transform complex nonlinear systems into sequences of linear equations, which are then solved using quantum linear solvers. The central objective of this study is to demonstrate nonlinear path-following with the required linear systems solved on real quantum hardware. To realize this objective, we develop the quantum-enhanced Jacobi method (q-Jacobi), an iterative quantum linear solver used in the hardware experiment. Numerical simulations on a quantum simulator validate the convergence of the method. A highlight of this work is a proof-of-principle experiment on a superconducting quantum processor. Despite the noise inherent in near-term quantum hardware, the experiment achieves 98% accuracy in tracking the nonlinear solution path. We believe this work provides a useful reference for applying quantum computing to nonlinear computational mechanics.

Quantum Physics (quant-ph); Computational Engineering, Finance, and Science (cs.CE)

arXiv:2412.03939 [quant-ph]

(or arXiv:2412.03939v4 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2412.03939 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1007/s00466-026-02852-0 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 279 words

Related coverage