Template:Mainpage rotating external quantum article: Difference between revisions
No edit summary |
Update rotating external quantum article |
||
| Line 13: | Line 13: | ||
<div style="font-size:120%; font-weight:bold; margin-bottom:4px;"> | <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;"> | ||
arXiv · Simon, Sophia, Berry, Dominic W., Somma, Rolando D. · Quantum science preprint | |||
</div> | </div> | ||
<div style="margin-top:8px;"> | <div style="margin-top:8px;"> | ||
'''Article preview.''' | '''Article preview.''' 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 $\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)$, where the constant $ν$ depends on the problem parameters, $\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $ε$ is the error. In particular, $ν\mathcal{L}$ is linear in $t$ for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through | ||
</div> | </div> | ||
<div style="margin-top:8px;"> | <div style="margin-top:8px;"> | ||
The | The arXiv record is a preprint entry; readers should consult the linked page for the current abstract, subject classification and version history. | ||
</div> | </div> | ||
<div style="margin-top:10px;"> | <div style="margin-top:10px;"> | ||
[https:// | [https://arxiv.org/abs/2605.16195 Read the full article 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: | External source: arXiv. Selected external quantum article. | ||
</div> | </div> | ||
</div> | </div> | ||
Revision as of 18:37, 18 May 2026
Image from or related to the featured external quantum article.
Featured external quantum article
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
arXiv · Simon, Sophia, Berry, Dominic W., Somma, Rolando D. · Quantum science preprint
Article preview. 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 $\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)$, where the constant $ν$ depends on the problem parameters, $\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $ε$ is the error. In particular, $ν\mathcal{L}$ is linear in $t$ for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through
The arXiv record is a preprint entry; readers should consult the linked page for the current abstract, subject classification and version history.
External source: arXiv. Selected external quantum article.