Efficient quantum algorithm for dissipative nonlinear differential equations
Name
pnas.2026805118.pdf
Description
Published version
Size
839.61 KB
Format
Adobe PDF
Checksum (MD5)
f67c5133f618011cdc0be4467d7ae762
Author(s)
Liu, Jin-Peng
Kolden, Herman Øie
Krovi, Hari K
Loureiro, Nuno F
Trivisa, Konstantina
Childs, Andrew M
Date Issued
2021
Journal
Proceedings of the National Academy of Sciences of the United States of America
Publisher
Proceedings of the National Academy of Sciences
Citation
Liu, Jin-Peng, Kolden, Herman Øie, Krovi, Hari K, Loureiro, Nuno F, Trivisa, Konstantina et al. 2021. "Efficient quantum algorithm for dissipative nonlinear differential equations." Proceedings of the National Academy of Sciences of the United States of America, 118 (35).
Version
Final published version
Abstract
Significance
Nonlinear differential equations appear in many domains and are notoriously difficult to solve. Whereas previous quantum algorithms for general nonlinear differential equations have complexity exponential in the evolution time, we give the first quantum algorithm for dissipative nonlinear differential equations that is efficient provided the dissipation is sufficiently strong relative to nonlinear and forcing terms and the solution does not decay too rapidly. We also establish a lower bound showing that differential equations with sufficiently weak dissipation have worst-case complexity exponential in time, giving an almost tight classification of the quantum complexity of simulating nonlinear dynamics. Furthermore, numerical results for the Burgers equation suggest that our algorithm may potentially address complex nonlinear phenomena even in regimes with weaker dissipation.
Nonlinear differential equations appear in many domains and are notoriously difficult to solve. Whereas previous quantum algorithms for general nonlinear differential equations have complexity exponential in the evolution time, we give the first quantum algorithm for dissipative nonlinear differential equations that is efficient provided the dissipation is sufficiently strong relative to nonlinear and forcing terms and the solution does not decay too rapidly. We also establish a lower bound showing that differential equations with sufficiently weak dissipation have worst-case complexity exponential in time, giving an almost tight classification of the quantum complexity of simulating nonlinear dynamics. Furthermore, numerical results for the Burgers equation suggest that our algorithm may potentially address complex nonlinear phenomena even in regimes with weaker dissipation.
MIT Department
Massachusetts Institute of Technology. Department of Nuclear Science and Engineering
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1073/PNAS.2026805118
