REVIEW 3 cited by
Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 3 Pith papers
-
Interplay of resources for universal continuous-variable quantum computing
The authors define symplectic coherence, show that circuits with little of it can be classically simulated, and map this resource to coherence in discrete-variable quantum computing via the GKP encoding.
-
Pauli Propagation: A Computational Framework for Simulating Quantum Systems
Pauli propagation, a classical method that evolves Pauli operators through quantum circuits, is presented as a unified algorithmic framework together with the Julia package PauliPropagation.jl that implements it.
-
One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States
The note conjectures a polynomial-time recursive method for computing arbitrary local projections on 2D square-lattice cluster states, but the core 2D recursion is not proved and the numerical evidence is too small to...
Discussion (0). Continue with ORCID to comment.