Generic and Scalable Differential Equation Solver for Quantum Scientific Computing

• URL: http://arxiv.org/abs/2409.18146v1
• Date: Tue, 24 Sep 2024 21:09:54 GMT
• Title: Generic and Scalable Differential Equation Solver for Quantum Scientific Computing
• Authors: Jinhwan Sul, Yan Wang,
• Abstract summary: One of the most important topics in quantum scientific computing is solving differential equations. In this paper, a generalized quantum functional expansion framework is proposed. Four example differential equations are solved to demonstrate the generic QFE framework.
• Score: 4.067407250874754
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the most important topics in quantum scientific computing is solving differential equations. In this paper, generalized quantum functional expansion (QFE) framework is proposed. In the QFE framework, a functional expansion of solution is encoded into a quantum state and the time evolution of the quantum state is solved with variational quantum simulation (VQS). The quantum functional encoding supports different numerical schemes of functional expansions. The lower bound of the required number of qubits is double logarithm of the inverse error bound in the QFE framework. Furthermore, a new parallel Pauli operation strategy is proposed to significantly improve the scalability of VQS. The number of circuits in VQS is exponentially reduced to only the quadratic order of the number of ansatz parameters. Four example differential equations are solved to demonstrate the generic QFE framework.

Related papers

• Undecidable problems associated with variational quantum algorithms [2.8166046619628315]
  Variational Quantum Algorithms (VQAs) are widely studied as candidates for near-term quantum advantage. Recent work has shown that training VQAs is NP-hard in general. We present a conditional result suggesting that the training of VQAs is undecidable, even in idealized, noiseless settings.
  arXiv  Detail & Related papers  (2025-03-31T04:52:43Z)
• Nonlinear functions of quantum states [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits. We develop quantum algorithms of fundamental tasks, achieving a sample complexity of $tildemathcalO (1/(varepsilon2kappa)$ for both von Neumann entropy estimation and quantum state fidelity calculations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Variational Quantum Algorithms for Differential Equations on a Noisy Quantum Computer [0.0]
  We consider a framework of variational quantum algorithms, quantum circuit learning (QCL), in conjunction with derivation methods, to solve differential equations (DEs) We show that it is possible to determine derivatives of the learned functions using the parameter shift rule on the IBM hardware. Despite these limitations, we solve a first-order DE on the IBM quantum computer.
  arXiv  Detail & Related papers  (2024-05-03T13:00:32Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• Towards Quantum Computational Mechanics [1.530480694206666]
  We show how quantum computing can be used to solve representative element volume (RVE) problems in computational homogenisation. Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
  arXiv  Detail & Related papers  (2023-12-06T12:53:02Z)
• Quantum Computing for Solid Mechanics and Structural Engineering -- a Demonstration with Variational Quantum Eigensolver [3.8061090528695534]
  Variational quantum algorithms exploit the features of superposition and entanglement to optimize a cost function efficiently. We implement and demonstrate the numerical processes on the 5-qubit and 7-qubit quantum processors on the IBM Qiskit platform.
  arXiv  Detail & Related papers  (2023-08-28T17:52:47Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle [0.0]
  Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version, quantum singular value transformation (QSVT) QSVT transforms and improve the presentation of most quantum algorithms.
  arXiv  Detail & Related papers  (2022-05-12T17:58:59Z)
• Fundamental limitations on optimization in variational quantum algorithms [7.165356904023871]
  A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs) We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
  arXiv  Detail & Related papers  (2022-05-10T17:14:57Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• 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)
• VQE Method: A Short Survey and Recent Developments [5.9640499950316945]
  The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues and eigenvalues of a Hamiltonian. VQE has been successfully applied to solve the electronic Schr"odinger equation for a variety of small molecules. Modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatze.
  arXiv  Detail & Related papers  (2021-03-15T16:25:36Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.