A robust quantum nonlinear solver based on the asymptotic numerical method
- URL: http://arxiv.org/abs/2412.03939v2
- Date: Fri, 06 Dec 2024 01:42:13 GMT
- Title: A robust quantum nonlinear solver based on the asymptotic numerical method
- Authors: Yongchun Xu, Zengtao Kuang, Qun Huang, Jie Yang, Hamid Zahrouni, Michel Potier-Ferry, Kaixuan Huang, Jia-Chi Zhang, Heng Fan, Heng Hu,
- Abstract summary: We introduce the quantum numerical method, a novel quantum nonlinear solver.
By linearizing nonlinear problems using the Taylor series, the method transforms them into sequences of linear equations solvable by quantum algorithms.
We perform experiments on a superconducting quantum processor from Quafu, successfully achieving up to 98% accuracy in the obtained nonlinear solution path.
- Score: 14.736884598380557
- License:
- Abstract: Quantum computing offers a promising new avenue for advancing computational methods in science and engineering. In this work, we introduce the quantum asymptotic numerical method, a novel quantum nonlinear solver that combines Taylor series expansions with quantum linear solvers to efficiently address nonlinear problems. By linearizing nonlinear problems using the Taylor series, the method transforms them into sequences of linear equations solvable by quantum algorithms, thus extending the convergence region for solutions and simultaneously leveraging quantum computational advantages. Numerical tests on the quantum simulator Qiskit confirm the convergence and accuracy of the method in solving nonlinear problems. Additionally, we apply the proposed method to a beam buckling problem, demonstrating its robustness in handling strongly nonlinear problems and its potential advantages in quantum resource requirements. Furthermore, we perform experiments on a superconducting quantum processor from Quafu, successfully achieving up to 98% accuracy in the obtained nonlinear solution path. We believe this work contributes to the utility of quantum computing in scientific computing applications.
Related papers
- New Quantum Algorithm For Solving Linear System of Equations [0.0]
We introduce a new quantum algorithm for solving linear systems based on the gradient descent method.
Inspired by the vector/density state formalism, we represent a point, or vector, as a density state-like entity.
The operator corresponding to the intermediate solution is updated iteratively, with a provable guarantee of convergence.
arXiv Detail & Related papers (2025-02-19T11:08:56Z) - Nonlinear quantum computing by amplified encodings [0.0]
This paper presents a novel framework for high-dimensional nonlinear quantum computation.
It exploits tensor products of amplified vector and matrix encodings.
The framework offers a new path to nonlinear quantum algorithms.
arXiv Detail & Related papers (2024-11-25T14:37:57Z) - Efficient Use of Quantum Linear System Algorithms in Interior Point
Methods for Linear Optimization [0.0]
We develop an Inexact Infeasible Quantum Interior Point Method to solve linear optimization problems.
We also discuss how can we get an exact solution by Iterative Refinement without excessive time of quantum solvers.
arXiv Detail & Related papers (2022-05-02T21:30:56Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - On nonlinear transformations in quantum computation [0.0]
We develop a series of basic subroutines for implementing nonlinear transformations of input quantum states.
Our algorithms are framed around the concept of a weighted state.
arXiv Detail & Related papers (2021-12-23T01:51:37Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Variational Quantum Linear Solver with Dynamic Ansatz [0.0]
Variational quantum algorithms have found success in the NISQ era owing to their hybrid quantum-classical approach.
We introduce the dynamic ansatz in the Variational Quantum Linear Solver for a system of linear algebraic equations.
We demonstrate the algorithm advantage in comparison to the standard, static ansatz by utilizing fewer quantum resources.
arXiv Detail & Related papers (2021-07-19T03:42:25Z) - Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard.
We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware.
The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
arXiv Detail & Related papers (2021-07-08T17:59:55Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
We review and extend the application of deep learning to quantum geometric control problems.
We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems.
Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
arXiv Detail & Related papers (2020-06-19T19:12:14Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.