Papers › Prospects of Quantum Error Mitigation for Quantum Signal Processing
Prospects of Quantum Error Mitigation for Quantum Signal Processing
Ugnė Liaubaitė, S. E. Skelton
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Quantum error mitigation (QEM) protocols have provably exponential bounds on the cost scaling; however, exploring which regimes QEM can recover usable results is still of sizable interest. The expected absence of complete error correction for near-term and intermediate-term quantum devices means that QEM protocols will remain relevant for devices with low enough error rates to attempt small examples of fault-tolerant algorithms. Herein, we are interested in the performance of QEM with a template for quantum algorithms, quantum signal processing (QSP). QSP-based algorithms are designed with an especially simple relation between the circuit depths and the algorithm's parameters, including the required precision. Hence, they may be a useful playground for exploring QEM's practical performance and costs for a range of controlled parameters. As a preliminary step in this direction, this work explores the performance of zero-noise-extrapolation (ZNE) on a Hamiltonian simulation algorithm designed within QSP under local depolarizing noise. We design a QSP-based Hamiltonian simulation of a modified Ising model under depolarizing noise for low precision and varying simulation times. We quantify for which noise and depth regimes our ZNE protocol can recover an approximation of the noiseless expectation value. We discuss existing bounds on the sample budget, eventually using a fixed number of shots. While this does not guarantee the success of QEM, it gives us usable results in relevant cases. Finally, we briefly discuss and present a numerical study on the region where ZNE is unusable, even given an unlimited sample budget.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections