Template:Mainpage rotating external quantum article: Difference between revisions
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
<div style="font-weight:bold; color:#006b45; font-size:120%; margin-bottom:6px;"> | <div style="font-weight:bold; color:#006b45; font-size:120%; margin-bottom:6px;"> | ||
Featured external quantum article | |||
</div> | </div> | ||
<div style="font-size: | <div style="font-size:120%; font-weight:bold; margin-bottom:4px;"> | ||
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems | |||
</div> | </div> | ||
<div style="font-size:90%; color:#555; margin-bottom:8px;"> | <div style="font-size:90%; color:#555; margin-bottom:8px;"> | ||
Sophia Simon, Dominic W. Berry, Rolando D. Somma · arXiv:2605.16195 · submitted 15 May 2026 · Quantum Physics | |||
</div> | </div> | ||
<div style="margin-top: | <div style="margin-top:8px;"> | ||
'''Abstract.''' We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. | |||
For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity that scales nearly optimally with the relevant problem parameters, evolution time, and target error. | |||
The work contrasts earlier quantum approaches for differential equations, which can require exponential time because the solution is encoded in a quantum state with very small amplitudes. | |||
The authors demonstrate the method through the simulation of dissipative dynamics for non-interacting fermions, compare it with classical algorithms, and give evidence for polynomial quantum speedups in lattice systems. | |||
</div> | |||
<div style="margin-top:10px;"> | |||
[https://arxiv.org/abs/2605.16195 Read the full paper at arXiv →] | |||
</div> | </div> | ||
<div style="margin-top:8px; font-size:90%; color:#666;"> | <div style="margin-top:8px; font-size:90%; color:#666;"> | ||
External source: arXiv quant-ph. | External source: arXiv quant-ph. This is a preprint and is not necessarily peer reviewed. | ||
</div> | </div> | ||
</div> | </div> | ||
Revision as of 17:57, 18 May 2026
Featured external quantum article
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
Sophia Simon, Dominic W. Berry, Rolando D. Somma · arXiv:2605.16195 · submitted 15 May 2026 · Quantum Physics
Abstract. We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity that scales nearly optimally with the relevant problem parameters, evolution time, and target error. The work contrasts earlier quantum approaches for differential equations, which can require exponential time because the solution is encoded in a quantum state with very small amplitudes. The authors demonstrate the method through the simulation of dissipative dynamics for non-interacting fermions, compare it with classical algorithms, and give evidence for polynomial quantum speedups in lattice systems.
External source: arXiv quant-ph. This is a preprint and is not necessarily peer reviewed.