Back to News
quantum-computing

Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality

arXiv Quantum Physics
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers Sabrina Yue Wang and Raul A. Santos introduced a quantum algorithm simulating unital Lindbladian dynamics without extra ancillas, advancing noise modeling in open quantum systems. The team developed a decoupling scheme for interacting dephasing Lindbladians, reducing circuit complexity by sampling time-correlated probability distributions between coupled subsystems. Their method traces out bosonic degrees of freedom in electron-phonon systems, mapping part of the dynamics to IQP circuits—quantum circuits believed to be classically hard to sample. For non-interacting fermionic subsystems, the algorithm enables classical solvability, creating a hybrid quantum-classical approach to dissipative quantum simulations. The work highlights computational trade-offs in simulating coupled quantum systems, leveraging IQP duality to potentially demonstrate quantum advantage in noisy intermediate-scale applications.
Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality

Summarize this article with:

Quantum Physics arXiv:2601.06298 (quant-ph) [Submitted on 9 Jan 2026] Title:Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality Authors:Sabrina Yue Wang, Raul A. Santos View a PDF of the paper titled Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality, by Sabrina Yue Wang and Raul A. Santos View PDF HTML (experimental) Abstract:Noise and decoherence are ubiquitous in the dynamics of quantum systems coupled to an external environment. In the regime where environmental correlations decay rapidly, the evolution of a subsytem is well described by a Lindblad quantum master equation. In this work, we introduce a quantum algorithm for simulating unital Lindbladian dynamics by sampling unitary quantum channels without extra ancillas. Using ancillary qubits we show that this algorithm allows approximating general Lindbladians as well. For interacting dephasing Lindbladians coupling two subsystems, we develop a decoupling scheme that reduces the circuit complexity of the simulation. This is achieved by sampling from a time-correlated probability distribution - determined by the evolution of one subsystem, which specifies the stochastic circuit implemented on the complementary subsystem. We demonstrate our approach by studying a model of bosons coupled to fermions via dephasing, which naturally arises from anharmonic effects in an electron-phonon system coupled to a bath. Our method enables tracing out the bosonic degrees of freedom, reducing part of the dynamics to sampling an instantaneous quantum polynomial (IQP) circuit. The sampled bitstrings then define a corresponding fermionic problem, which in the non-interacting case can be solved efficiently classically. We comment on the computational complexity of this class of dissipative problems, using the known fact that sampling from IQP circuits is believed to be difficult classically. Comments: Subjects: Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el) Cite as: arXiv:2601.06298 [quant-ph] (or arXiv:2601.06298v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.06298 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Sabrina Yue Wang [view email] [v1] Fri, 9 Jan 2026 20:24:49 UTC (859 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality, by Sabrina Yue Wang and Raul A. SantosView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-01 Change to browse by: cond-mat cond-mat.str-el 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-geopolitics
quantum-hardware
quantum-networking

Source Information

Source: arXiv Quantum Physics