Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.20174 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917191190839296 |
|---|---|
| author | Camilo, Giancarlo Maciel, Thiago O. Tosta, Allan Alhajri, Abdulla Silva, Thais de Lima França, Daniel Stilck Aolita, Leandro |
| author_facet | Camilo, Giancarlo Maciel, Thiago O. Tosta, Allan Alhajri, Abdulla Silva, Thais de Lima França, Daniel Stilck Aolita, Leandro |
| contents | The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of current quantum hardware. While quantum error correction (QEC) offers a clear path towards fault tolerance, overcoming the scalability issues will take time. Early applications will likely rely on QEC combined with quantum error mitigation (QEM). We introduce a QEM scheme against both compilation errors and logical-gate noise that is circuit-, QEC code-, and compiler-agnostic. The scheme builds on quasi-probability methods and uses information about the circuit's gates' compilations to attain an unbiased estimation of noiseless expectation values incurring a constant sample-complexity overhead. Moreover, it features maximal circuit size and code distance both independent of the target precision, in contrast to strategies based on QEC alone. We formulate the mitigation procedure as a linear program, demonstrate its efficacy through numerical simulations, and illustrate it for estimating the Jones polynomials of knots. Our method significantly reduces quantum resource requirements for high-precision estimations, offering a practical route towards fault-tolerant quantum computation with precision-independent overheads for fixed circuit complexity and code distance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_20174 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Compilation-informed probabilistic logical-error cancellation Camilo, Giancarlo Maciel, Thiago O. Tosta, Allan Alhajri, Abdulla Silva, Thais de Lima França, Daniel Stilck Aolita, Leandro Quantum Physics The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of current quantum hardware. While quantum error correction (QEC) offers a clear path towards fault tolerance, overcoming the scalability issues will take time. Early applications will likely rely on QEC combined with quantum error mitigation (QEM). We introduce a QEM scheme against both compilation errors and logical-gate noise that is circuit-, QEC code-, and compiler-agnostic. The scheme builds on quasi-probability methods and uses information about the circuit's gates' compilations to attain an unbiased estimation of noiseless expectation values incurring a constant sample-complexity overhead. Moreover, it features maximal circuit size and code distance both independent of the target precision, in contrast to strategies based on QEC alone. We formulate the mitigation procedure as a linear program, demonstrate its efficacy through numerical simulations, and illustrate it for estimating the Jones polynomials of knots. Our method significantly reduces quantum resource requirements for high-precision estimations, offering a practical route towards fault-tolerant quantum computation with precision-independent overheads for fixed circuit complexity and code distance. |
| title | Compilation-informed probabilistic logical-error cancellation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.20174 |