Back to News
quantum-computing

Classical Simulation of Noiseless Quantum Dynamics without Randomness

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers from China proposed the Low-weight Pauli Dynamics (LPD) algorithm, a classical method to simulate noiseless quantum systems without relying on randomness or noise, addressing a long-standing limitation in quantum simulation techniques. The LPD algorithm efficiently approximates local observables for short-time quantum dynamics by leveraging sufficiently entangled states, where entanglement—typically a barrier—paradoxically reduces classical simulation errors, as proven by average-case error bounds. Unlike tensor-network methods that fail as entanglement grows, LPD bridges the gap by combining Pauli truncation with deterministic error control, offering a scalable alternative for near-term quantum-classical hybrid simulations. The team demonstrates that required entangled states can be pre-generated via tensor networks or shallow quantum circuits, enabling practical implementation on existing near-term quantum devices. This work extends accessible quantum dynamics regimes by reducing circuit depth for long-time simulations, providing a complementary path to full quantum advantage while unifying classical simulation approaches.
Classical Simulation of Noiseless Quantum Dynamics without Randomness

Summarize this article with:

Quantum Physics arXiv:2601.15770 (quant-ph) [Submitted on 22 Jan 2026] Title:Classical Simulation of Noiseless Quantum Dynamics without Randomness Authors:Jue Xu, Chu Zhao, Xiangran Zhang, Shuchen Zhu, Qi Zhao View a PDF of the paper titled Classical Simulation of Noiseless Quantum Dynamics without Randomness, by Jue Xu and 4 other authors View PDF HTML (experimental) Abstract:Simulating noiseless quantum dynamics classically faces a fundamental dilemma: tensor-network methods become inefficient as entanglement saturates, while Pauli-truncation approaches typically rely on noise or randomness. To close the gap, we propose the Low-weight Pauli Dynamics (LPD) algorithm that efficiently approximates local observables for short-time dynamics in the absence of noise. We prove that the truncation error admits an average-case bound without assuming randomness, provided that the state is sufficiently entangled. Counterintuitively, entanglement--usually an obstacle for classical simulation--alleviates classical simulation error. We further show that such entangled states can be generated either by tensor-network classical simulation or near-term quantum devices. Our results establish a rigorous synergy between existing classical simulation methods and provide a complementary route to quantum simulation that reduces circuit depth for long-time dynamics, thereby extending the accessible regime of quantum dynamics. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2601.15770 [quant-ph] (or arXiv:2601.15770v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.15770 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Jue Xu [view email] [v1] Thu, 22 Jan 2026 08:59:57 UTC (516 KB) Full-text links: Access Paper: View a PDF of the paper titled Classical Simulation of Noiseless Quantum Dynamics without Randomness, by Jue Xu and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-01 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-algorithms
quantum-simulation

Source Information

Source: arXiv Quantum Physics