Pith. sign in

REVIEW 2 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

arxiv 2501.13050 v1 pith:4TL2PZU2 submitted 2025-01-22 quant-ph cs.CCmath-phmath.MP

classification quant-phcs.CCmath-phmath.MP
keywords noisequantumbackpropagationnon-unitalpauliefficientalgorithmsclassical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantitative Universal Approximation for Noisy Quantum Neural Networks

    quant-ph 2026-04 unverdicted novelty 7.0 of 10

    A quantitative universal approximation theorem with error bounds is established for noisy quantum neural networks applied to expectation targets in finance.

  2. Quantitative Universal Approximation for Noisy Quantum Neural Networks

    quant-ph 2026-04 unverdicted novelty 5.0 of 10

    Provides a quantitative universal approximation theorem with error bounds for noisy quantum neural networks and tests on real hardware for quantitative finance.

Pith tools