An Efficient Decomposition of the Carleman Linearized Burgers' Equation

Abstract

Herein, we present a polylogarithmic decomposition method to load the matrix from the linearized 1-dimensional Burgers' equation onto a quantum computer. First, we use the Carleman linearization method to map the nonlinear Burgers' equation into an infinite linear system of equations, which is subsequently truncated to order $\alpha$. This new finite linear system is then embedded into a larger system of equations with the key property that its matrix can be decomposed into a linear combination of $\mathcal{O}(\log n_t+{\alpha }^2\log n_x)$ terms for $n_t$ time steps and $n_x$ spatial grid points. While the terms in this linear combination are not unitary, each can be implemented using a simple block encoding procedure. A numerical simulation is performed by combining our approach with the variational quantuam linear solver demonstrating that accurate solutions are possible. Finally, a resource estimate shows that the upper bound of the Clifford and T gate counts scale like $\mathcal{O}(\alpha (\log n_x{)}^2)$ and $\mathcal{O}((\log n_x{)}^2)$, respectively. This is therefore the first explicit polylogarithmic data loading method with respect to $n_x$ and $n_t$ for a Carleman linearized system.

Updated to the published version

References in corpus (22)

• Quantum algorithm for solving linear systems of equations
• Barren Plateaus in Variational Quantum Computing
• A Quantum Inspired Approach to Exploit Turbulence Structures
• Improved quantum algorithms for linear and nonlinear differential equations
• Variational Quantum Solutions to the Advection-Diffusion Equation for Applications in Fluid Dynamics
• Exponential quantum speedup in simulating coupled classical oscillators
• Quantum Computers for Weather and Climate Prediction: The Good, the Bad and the Noisy
• Benchmarking of Different Optimizers in the Variational Quantum Algorithms for Applications in Quantum Chemistry
• Quantum algorithm for the Navier Stokes equations by using the streamfunction vorticity formulation and the lattice Boltzmann method
• Quantum algorithms: A survey of applications and end-to-end complexities
• Efficient quantum amplitude encoding of polynomial functions
• Tensor networks enable the calculation of turbulence probability distributions
• Nonlinear dynamics as a ground-state solution on quantum computers
• A Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer
• Potential quantum advantage for simulation of fluid dynamics
• Shallow unitary decompositions of quantum Fredkin and Toffoli gates for connectivity-aware equivalent circuit averaging
• Incompressible Navier-Stokes solve on noisy quantum hardware via a hybrid quantum-classical scheme
• Quantum algorithms for computing observables of nonlinear partial differential equations
• Limitations for Quantum Algorithms to Solve Turbulent and Chaotic Systems
• Quantum Carleman linearisation efficiency in nonlinear fluid dynamics
• The cost of solving linear differential equations on a quantum computer: fast-forwarding to explicit resource counts
• Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics

Cited by in corpus (1)

• Solving the Nonlinear Vlasov Equation on a Quantum Computer