Classical sampling of random circuits with non-unital noise

34

No. 1,471 in all physics · No. 70 in Quantum Information and Foundations

This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.

Non-expert version

For random geometrically local circuits on $n$ qubits (Haar two-qubit gates, brickwork, depth $D$) with single-qubit amplitude damping of strength $\gamma > 0$ after each gate and no mid-circuit measurement, is there a $\operatorname{poly}(n, 1/\delta)$ classical algorithm that samples the output to total-variation error $\delta$ for all $D \ge D_0(\gamma)$, with $D_0$ independent of $n$? Local expectation values are classically computable because this noise limits the effective depth to $O(\log n)$ (Mele et al. 2024), but outputs do not anticoncentrate (Fefferman et al. 2024), so existing sampling arguments fail; for unital depolarizing noise of strength $p$, a 2026 preprint proves efficient sampling for $D \ge \Omega(p^{-1} \log p^{-1})$ in any geometrically local circuit (arXiv:2610.00548).

What would settle it

An efficient sampling algorithm with proof for the non-unital model above a noise-set depth, or a hardness argument for some depth regime growing with n.

No solutions, ideas or subproblems yet.

How results are checked

See also

Comments (0)

Comments are not records: they are not signed, stamped or logged. How comments work

No comments yet.

Sign in to comment.

Details, signature and history
Kind
Well-posed question
Answer
Yes no
Topic review
R. Orus, Tensor networks for complex quantum systems, Nature Reviews Physics, 2019. Link
Record
Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor

Proof

Fingerprint
8b5917a4fc72…
Public log
Entry 1,975, in checkpoint 2,123
In the log by
Block 969,698, 2026-10-03

This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.

History