Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra via Schrodingerisation
arXiv:2304.02865 · doi:10.1098/rspa.2023.0370
Abstract
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system can in fact be transformed into a system of Schrodinger's equations via a method called Schrodingerisation. Building on the observation that iterative methods in linear algebra, and more generally discrete linear dynamical systems, can be viewed as discrete time approximations of dynamical systems which evolve continuously in time, we can apply the Schrodingerisation technique. Thus quantum simulation can be directly applied to the continuous-time limits of some of the simplest iterative methods. This applies to general (explicit) iterative schemes or discrete linear dynamical systems. In particular, we introduce the quantum Jacobi and quantum power methods for solving the quantum linear systems of equations and for estimating the maximum eigenvector and eigenvalue of a matrix respectively. The proposed quantum simulation can be performed on either discrete-variable quantum systems or on hybrid continuous-variable and discrete-variable quantum systems. This framework provides an interesting alternative method to solve linear algebra problems using quantum simulation.
References in corpus (25)
- Quantum information with continuous variables
- Quantum algorithm for solving linear systems of equations
- Quantum principal component analysis
- Continuous variable quantum information: Gaussian states and beyond
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Hybrid quantum information processing
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Preconditioned quantum linear system algorithm
- Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
- Near-optimal ground state preparation
- How Powerful is Adiabatic Quantum Computation?
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions
- Quantum Power Method by a Superposition of Time-Evolved States
- Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
- Hybrid Quantum Computation in Quantum Optics
- Exact and efficient Lanczos method on a quantum computer
- Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
- Quantum Algorithms for Estimating Physical Quantities using Block-Encodings
- The power of one qumode for quantum computation
- Universal hybrid quantum computing in trapped ions
- Continuous vs. Discrete Optimization of Deep Neural Networks
- Combinatorial optimization through variational quantum power method
Cited by in corpus (6)
- Quantum simulation of partial differential equations via Schrodingerisation
- Quantum Circuits for partial differential equations via Schrödingerisation
- Efficient explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations
- An invitation to the sample complexity of quantum hypothesis testing
- Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions
- Vortex Detection from Quantum Data