Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909748398391296 |
|---|---|
| author | Martinez, Victor Angrisani, Armando Pankovets, Ekaterina Fawzi, Omar França, Daniel Stilck |
| author_facet | Martinez, Victor Angrisani, Armando Pankovets, Ekaterina Fawzi, Omar França, Daniel Stilck |
| contents | As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient classical simulation algorithms possible. Among the most promising approaches are Pauli backpropagation algorithms, which have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits-a leading contender for near-term quantum advantage-under random circuit assumptions and depolarizing noise. However, their efficiency was not previously established for more realistic non-unital noise models, such as amplitude damping, that better capture noise on existing hardware. Here, we close this gap by adapting Pauli backpropagation to non-unital noise, proving that it remains efficient even under these more challenging conditions. Our proof leverages a refined combinatorial analysis to handle the complexities introduced by non-unital channels, thus strengthening Pauli backpropagation as a powerful tool for simulating near-term quantum devices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13050 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation Martinez, Victor Angrisani, Armando Pankovets, Ekaterina Fawzi, Omar França, Daniel Stilck Quantum Physics Computational Complexity Mathematical Physics As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient classical simulation algorithms possible. Among the most promising approaches are Pauli backpropagation algorithms, which have already demonstrated their ability to efficiently simulate certain classes of parameterized quantum circuits-a leading contender for near-term quantum advantage-under random circuit assumptions and depolarizing noise. However, their efficiency was not previously established for more realistic non-unital noise models, such as amplitude damping, that better capture noise on existing hardware. Here, we close this gap by adapting Pauli backpropagation to non-unital noise, proving that it remains efficient even under these more challenging conditions. Our proof leverages a refined combinatorial analysis to handle the complexities introduced by non-unital channels, thus strengthening Pauli backpropagation as a powerful tool for simulating near-term quantum devices. |
| title | Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation |
| topic | Quantum Physics Computational Complexity Mathematical Physics |
| url | https://arxiv.org/abs/2501.13050 |