CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 08, 2026

Efficient simulation of noisy IQP circuits with amplitude-damping noise

arXiv Quantum Archived Apr 08, 2026 ✓ Full text saved

arXiv:2604.05036v1 Announce Type: new Abstract: Efficient classical simulation of noisy intermediate-scale quantum (NISQ) circuits has been a topic of intense study over the past few years. The majority of results on efficient simulation assume that the circuits undergo some variant of unital noise or involve sufficient randomness. However, there are limited results for circuits undergoing non-unital noise in the absence of randomness. In this work, we present a polynomial-time classical algorit

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 6 Apr 2026] Efficient simulation of noisy IQP circuits with amplitude-damping noise Shravan Shravan, Mohsin Raza, Ariel Shlosberg Efficient classical simulation of noisy intermediate-scale quantum (NISQ) circuits has been a topic of intense study over the past few years. The majority of results on efficient simulation assume that the circuits undergo some variant of unital noise or involve sufficient randomness. However, there are limited results for circuits undergoing non-unital noise in the absence of randomness. In this work, we present a polynomial-time classical algorithm to sample from the output distributions of amplitude-damped instantaneous quantum polynomial (IQP) circuits. Our algorithm works for circuits generated by arbitrary l-local diagonal gates with depth d = \Omega(\log(n)), undergoing constant amplitude-damping noise. Comments: 5+26 pages, 1+2 figures. Comments are welcome Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.05036 [quant-ph]   (or arXiv:2604.05036v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2604.05036 Focus to learn more Submission history From: Shravan Shravan [view email] [v1] Mon, 6 Apr 2026 18:00:04 UTC (120 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation 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 Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Apr 08, 2026
    Archived
    Apr 08, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗