Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2506.21751 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911025902649344 |
|---|---|
| author | Schleich, Philipp Kharazi, Tyler Li, Xiangyu Liu, Jin-Peng Aspuru-Guzik, Alán Wiebe, Nathan |
| author_facet | Schleich, Philipp Kharazi, Tyler Li, Xiangyu Liu, Jin-Peng Aspuru-Guzik, Alán Wiebe, Nathan |
| contents | Complicated boundary conditions are essential to accurately describe phenomena arising in nature and engineering. Recently, the investigation of a potential speedup through quantum algorithms in simulating the governing ordinary and partial differential equations of such phenomena has gained increasing attention. We design an efficient quantum algorithms for solving differential equations with arbitrary boundary conditions. Specifically, we propose an approach to enforce arbitrary boundary conditions and constraints through adding a penalty projection to the governing equations. Assuming a fast-forwardable representation of the projection to ensure an efficient interaction picture imulation, the cost of to enforce the constraints is at most $O(\logλ)$ in the strength of the penalty $λ$ in the gate complexity; in the worst case, this goes as $O([\|v(0)\|^2\|A_0\| + \|b\|_{L^1[0;t]}^2)]t^2/\varepsilon)$, for precision $\varepsilon$ and a dynamical system $\frac{\rm d}{{\rm d}t} v(t) = A_0(t) v(t) + b(t)$ with negative semidefinite $A_0(t)$ of size $n^d\times n^d$. E.g., for the heat equation, this leads to a gate complexity overhead of $\widetilde O(d\log n + \log t)$. We show constraint error bounds for the penalty approach and provide validating numerical experiments, and estimate the circuit complexity using the Linear Combination of Hamiltonian Simulation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_21751 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections Schleich, Philipp Kharazi, Tyler Li, Xiangyu Liu, Jin-Peng Aspuru-Guzik, Alán Wiebe, Nathan Quantum Physics Complicated boundary conditions are essential to accurately describe phenomena arising in nature and engineering. Recently, the investigation of a potential speedup through quantum algorithms in simulating the governing ordinary and partial differential equations of such phenomena has gained increasing attention. We design an efficient quantum algorithms for solving differential equations with arbitrary boundary conditions. Specifically, we propose an approach to enforce arbitrary boundary conditions and constraints through adding a penalty projection to the governing equations. Assuming a fast-forwardable representation of the projection to ensure an efficient interaction picture imulation, the cost of to enforce the constraints is at most $O(\logλ)$ in the strength of the penalty $λ$ in the gate complexity; in the worst case, this goes as $O([\|v(0)\|^2\|A_0\| + \|b\|_{L^1[0;t]}^2)]t^2/\varepsilon)$, for precision $\varepsilon$ and a dynamical system $\frac{\rm d}{{\rm d}t} v(t) = A_0(t) v(t) + b(t)$ with negative semidefinite $A_0(t)$ of size $n^d\times n^d$. E.g., for the heat equation, this leads to a gate complexity overhead of $\widetilde O(d\log n + \log t)$. We show constraint error bounds for the penalty approach and provide validating numerical experiments, and estimate the circuit complexity using the Linear Combination of Hamiltonian Simulation. |
| title | Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2506.21751 |