Answers are grounded in this paper and cite their sources.
We study measurement-induced entanglement (MIE) generated by column-by-column sampling of noisy 2D random circuits of size <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mi>N</a:mi> </a:math> and depth <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" display="inline"> <c:mi>T</c:mi> </c:math> . Focusing primarily on Clifford circuits and using the operator entanglement <e:math xmlns:e="http://www.w3.org/1998/Math/MathML" display="inline"> <e:msub> <e:mi>S</e:mi> <e:mtext>op</e:mtext> </e:msub> </e:math> of the sampling-induced boundary state as a proxy for computational complexity, first, we reproduce in the noiseless limit a finite-depth transition from area- to volume-law scaling at a threshold depth <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" display="inline"> <g:msub> <g:mi>T</g:mi> <g:mi>c</g:mi> </g:msub> <g:mo>=</g:mo> <g:mn>6</g:mn> </g:math> . In contrast, in the presence of single-qubit depolarizing noise at any constant rate <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline"> <i:mrow> <i:mi>p</i:mi> <i:mo>></i:mo> <i:mn>0</i:mn> </i:mrow> </i:math> , we find that the operator entanglement <k:math xmlns:k="http://www.w3.org/1998/Math/MathML" display="inline"> <k:msub> <k:mi>S</k:mi> <k:mtext>op</k:mtext> </k:msub> </k:math> obeys an area law, with its maximum value scaling approximately linearly with <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline"> <m:mi>T</m:mi> <m:mo>/</m:mo> <m:mi>p</m:mi> </m:math> in the regime <o:math xmlns:o="http://www.w3.org/1998/Math/MathML" display="inline"> <o:mi>T</o:mi> <o:mo>></o:mo> <o:msub> <o:mi>T</o:mi> <o:mi>c</o:mi> </o:msub> </o:math> . By analyzing the spatial distribution of stabilizer generators, we observe exponential localization of stabilizer generators; these both account for the scaling of the maximal <q:math xmlns:q="http://www.w3.org/1998/Math/MathML" display="inline"> <q:msub> <q:mi>S</q:mi> <q:mtext>op</q:mtext> </q:msub> </q:math> and imply an exponential decay of conditional mutual information across buffered tripartitions, which we also confirm numerically. Together, these results indicate that constant local noise destroys long-range MIE in 2D random Clifford circuits, and that a tensor-network-based algorithm can efficiently sample from noisy 2D random Clifford circuits (i) at sub-logarithmic depths <s:math xmlns:s="http://www.w3.org/1998/Math/MathML" display="inline"> <s:mi>T</s:mi> <s:mo>=</s:mo> <s:mi>o</s:mi> <s:mo stretchy="false">(</s:mo> <s:mi>log</s:mi> <s:mi>N</s:mi> <s:mo stretchy="false">)</s:mo> </s:math> for any constant noise rate <w:math xmlns:w="http://www.w3.org/1998/Math/MathML" display="inline"> <w:mrow> <w:mi>p</w:mi> <w:mo>=</w:mo> <w:mi mathvariant="normal">Ω</w:mi> <w:mo stretchy="false">(</w:mo> <w:mn>1</w:mn> <w:mo stretchy="false">)</w:mo> </w:mrow> </w:math> , and (ii) at constant depths <bb:math xmlns:bb="http://www.w3.org/1998/Math/MathML" display="inline"> <bb:mrow> <bb:mi>T</bb:mi> <bb:mo>=</bb:mo> <bb:mi>O</bb:mi> <bb:mo stretchy="false">(</bb:mo> <bb:mn>1</bb:mn> <bb:mo stretchy="false">)</bb:mo> </bb:mrow> </bb:math> for noise rates <fb:math xmlns:fb="http://www.w3.org/1998/Math/MathML" display="inline"> <fb:mrow> <fb:mi>p</fb:mi> <fb:mo>=</fb:mo> <fb:mi mathvariant="normal">Ω</fb:mi> <fb:mo stretchy="false">(</fb:mo> <fb:msup> <fb:mrow> <fb:mi>log</fb:mi> </fb:mrow> <fb:mrow> <fb:mo>−</fb:mo> <fb:mn>1</fb:mn> </fb:mrow> </fb:msup> <fb:mi>N</fb:mi> <fb:mo stretchy="false">)</fb:mo> </fb:mrow> </fb:math> . Finally, we turn to depth <kb:math xmlns:kb="http://www.w3.org/1998/Math/MathML" display="inline"> <kb:mi>T</kb:mi> <kb:mo>=</kb:mo> <kb:mn>4</kb:mn> </kb:math> Haar-random and measurement-based quantum computing-type circuits, providing evidence that MIE in noisy 2D Haar-random circuits exhibits the same qualitative behavior as in random Clifford circuits, and that noise destroys the volume-law scaling of MIE in non-Clifford circuits.
No takes yet. Share an insight, caveat, or question.
Wei et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: