Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.19310 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909622791569408 |
|---|---|
| author | Vaszary, Tamás Datta, Animesh Goffrey, Tom Appelbe, Brian |
| author_facet | Vaszary, Tamás Datta, Animesh Goffrey, Tom Appelbe, Brian |
| contents | We present a mapping of the nonlinear, electrostatic Vlasov equation with Krook-type collision operators, discretized on a (1+1) dimensional grid, onto a recent Carleman linearization-based quantum algorithm for solving ordinary differential equations (ODEs) with quadratic nonlinearities. We derive upper bounds for the query- and gate complexities of the quantum algorithm in the limit of large grid sizes. We conclude that these are polynomially larger than the time complexity of the corresponding classical algorithms. We find that this is mostly due to the dimension, sparsity and norm of the Carleman linearized evolution matrix. We show that the convergence criteria of the quantum algorithm places severe restrictions on potential applications. This is due to the high level of dissipation required for convergence, that far exceeds the physical dissipation effect provided by the Krook operator for typical plasma physics applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19310 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Solving the Nonlinear Vlasov Equation on a Quantum Computer Vaszary, Tamás Datta, Animesh Goffrey, Tom Appelbe, Brian Quantum Physics Plasma Physics We present a mapping of the nonlinear, electrostatic Vlasov equation with Krook-type collision operators, discretized on a (1+1) dimensional grid, onto a recent Carleman linearization-based quantum algorithm for solving ordinary differential equations (ODEs) with quadratic nonlinearities. We derive upper bounds for the query- and gate complexities of the quantum algorithm in the limit of large grid sizes. We conclude that these are polynomially larger than the time complexity of the corresponding classical algorithms. We find that this is mostly due to the dimension, sparsity and norm of the Carleman linearized evolution matrix. We show that the convergence criteria of the quantum algorithm places severe restrictions on potential applications. This is due to the high level of dissipation required for convergence, that far exceeds the physical dissipation effect provided by the Krook operator for typical plasma physics applications. |
| title | Solving the Nonlinear Vlasov Equation on a Quantum Computer |
| topic | Quantum Physics Plasma Physics |
| url | https://arxiv.org/abs/2411.19310 |