Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This study evaluates the practical utility of Carleman-linearization-based quantum algorithms for solving the nonlinear Vlasov equation, concluding that current query and gate complexities are polynomially worse than classical methods for large grids. Furthermore, the convergence criteria identified impose severe physical restrictions, suggesting these approaches are not yet viable for realistic plasma applications without excessive dissipation. The analysis highlights significant hurdles in mapping complex kinetic equations to quantum hardware before they can offer a computational advantage over classical solvers.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Solving the Nonlinear Vlasov Equation on a Quantum Computer

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2411.19310v3 Announce Type: replace Abstract: The practical applicability of a recent Carleman-linearization-based quantum algorithm for solving ordinary differential equations (ODEs) with quadratic nonlinearities is investigated for the nonlinear electrostatic Vlasov equation with Krook-type collision operators. The equation is discretized on a (1+1)-dimensional phase-space grid and mapped onto the input of the quantum algorithm. Upper bounds for the query and gate complexities are derived in the limit of large grid sizes and found to be polynomially larger than the time complexity of the corresponding classical algorithms, primarily due to the dimension, sparsity, and norm of the Carleman-linearized evolution matrix. The convergence criteria are shown to impose severe restrictions on physically relevant plasma applications, requiring dissipation levels far exceeding those provided by the Krook operator.

Abstract:The practical applicability of a recent Carleman-linearization-based quantum algorithm for solving ordinary differential equations (ODEs) with quadratic nonlinearities is investigated for the nonlinear electrostatic Vlasov equation with Krook-type collision operators. The equation is discretized on a (1+1)-dimensional phase-space grid and mapped onto the input of the quantum algorithm. Upper bounds for the query and gate complexities are derived in the limit of large grid sizes and found to be polynomially larger than the time complexity of the corresponding classical algorithms, primarily due to the dimension, sparsity, and norm of the Carleman-linearized evolution matrix. The convergence criteria are shown to impose severe restrictions on physically relevant plasma applications, requiring dissipation levels far exceeding those provided by the Krook operator.

46 pages, 3 figures Peer reviewed by Quantum. Published in Quantum

Quantum Physics (quant-ph); Plasma Physics (physics.plasm-ph)

arXiv:2411.19310 [quant-ph]

(or arXiv:2411.19310v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2411.19310 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 224 cuvinte

Subiecte conexe