Template:Mainpage rotating external quantum article: Difference between revisions

From ScholarlyWiki
Jump to navigation Jump to search
Update rotating external quantum article
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
Quantum Computing Explained
</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
NIST · Quantum Information Science · 18 March 2025
</div>
</div>


<div style="margin-top:8px;">
<div style="margin-top:8px;">
'''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
'''Article preview.''' Quantum computers use the laws of quantum physics at very small scales to process information in ways that differ from classical computers. Current quantum computers are still rudimentary and error-prone, but more advanced versions could help with certain difficult problems in science, materials research, drug discovery and cybersecurity.
</div>
</div>


<div style="margin-top:8px;">
<div style="margin-top:8px;">
The arXiv record is a preprint entry; readers should consult the linked page for the current abstract, subject classification and version history.
The article explains basic ideas such as qubits, superposition and the difference between quantum and classical computing. It also emphasizes that quantum computers are not expected to replace ordinary computers, but may work alongside them for specialized tasks.
</div>
</div>


<div style="margin-top:10px;">
<div style="margin-top:10px;">
[https://arxiv.org/abs/2605.16195 Read the full article at arXiv ->]
[https://www.nist.gov/quantum-information-science/quantum-computing-explained Read the full article ]
</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. Selected external quantum article.
External source: NIST. Educational scientific article.
</div>
</div>


</div>
</div>

Revision as of 18:44, 18 May 2026

Image from or related to the featured external quantum article.

Featured external quantum article

Quantum Computing Explained

NIST · Quantum Information Science · 18 March 2025

Article preview. Quantum computers use the laws of quantum physics at very small scales to process information in ways that differ from classical computers. Current quantum computers are still rudimentary and error-prone, but more advanced versions could help with certain difficult problems in science, materials research, drug discovery and cybersecurity.

The article explains basic ideas such as qubits, superposition and the difference between quantum and classical computing. It also emphasizes that quantum computers are not expected to replace ordinary computers, but may work alongside them for specialized tasks.

External source: NIST. Educational scientific article.