{"id":"74c6061c-b318-4992-a4ac-be2a0fd4df15","arxiv_id":"2608.03102","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"Random stabilizer states are asymptotically Erdos-Renyi graphs, yielding exact GHZ entanglement numbers and revealing a hidden unitary sub-circuit in monitored Clifford circuits.","lead":"This paper studies monitored random quantum circuits by drawing their output states as graphs, and finds a hidden dense random pattern inside the volume-law phase. That pattern corresponds to a smaller unmeasured quantum circuit, which explains the phase's error-protecting power.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The G(N_sub,1/2) emergent-subgraph claim rests on unverified edge independence in Eq. (39); correlations could break the hidden-unitary picture.","rationale":"Read in good faith, the paper presents a genuinely new graph-theoretic framework, and the GHZ-statistics derivation is independently supported by the Nguyen–Wood universality theorem and by numerical convergence. The monitored-circuit central claim, however, is the emergent dense subgraph and the hidden-unitary picture, and its only analytical support is the heuristic independent-toggling argument in Sec. VI C. The reader's weakest assumption identified exactly this step, and I agree. The concern is not that the picture is false; the numerics are suggestive. It is that the evidence provided (degree distribution, adjacency-matrix plots) does not distinguish G(N_sub,1/2) from correlated dense graph ensembles, and the analytical derivation does not control the correlations. Testing the joint edge statistics, for example triangle counts, would settle whether the subgraph is truly Erdős–Rényi. Since the reader already assigned CONDITIONAL with moderate confidence, this concern does not change the verdict; it sharpens the condition. The paper's self-contained limitations (the toy model is explicitly over-simplified; the p_c mean-field uses hand-picked rates) are acknowledged in the text and do not by themselves alter the central claim.","tokens_in":28824,"tokens_out":21339,"duration_ms":186643,"concrete_test":"Simulate monitored random Clifford circuits at p=0.08 and p=0.12 with N=1000 qubits and at least 3000 samples. For each trajectory, identify the dense subgraph by ordering vertices by degree and isolating the dense block in the adjacency matrix. Compute the number of triangles among dense vertices and compare with the Erdős–Rényi prediction: for G(N_sub,1/2), the mean is roughly (N_sub choose 3)/8 with variance roughly (N_sub choose 3)/8. If the observed triangle count deviates by more than three standard deviations, the induced subgraph is not G(N_sub,1/2). As a second check, estimate Pr(Γ_ij=1, Γ_ik=1) for triples of dense vertices; under G(N_sub,1/2) this must equal 1/4, and a significant excess or deficit indicates correlations that Eq. (39) neglects.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that in the volume-law phase the output-state graph contains an emergent Erdős–Rényi subgraph G(N_sub,1/2), so the output state is equivalent to a unitary circuit on N_sub qubits. This rests on the derivation in Sec. VI C, Eq. (39), which assumes a sparse graph with a homogeneous infinitesimal long-range averaged edge density r and treats each remote edge as independently toggled by C2 gates with probability q=0.4r^2 per gate. The parity argument yields only the marginal probability for a single edge; it does not establish that edges are independent, and the toggling events for different edges are correlated because they share gate neighborhoods and the graph co-evolves. Moreover, the derivation assumes r→0+, but the numerics of Sec. IV show a finite long-range AED (O(1) for p well below p_c), so the regime of validity of Eq. (39) is unclear. The numerical evidence in Fig. 8(b) only checks the degree distribution (r_sub≈0.5), which is consistent with many correlated graph ensembles and does not verify the G(N_sub,1/2) joint distribution. If edge correlations are strong, the induced subgraph need not be G(N_sub,1/2), and the identification with a unitary circuit output (which itself relies on the heuristic Sec. III A convergence of canonical extended graph states to G(N,1/2)) fails. This would undercut the explanation of the GHZ plateau and the quantum error-correcting capability of the volume-law phase.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a graph-state framework for characterizing typical output states of monitored random Clifford circuits. It first argues that the graph part of random stabilizer states in the Hu–Khesin canonical form approaches the Erdős–Rényi ensemble G(N,1/2) at large N, and uses this to derive the average GHZ content of random stabilizer states, reporting 1.204 for even N and 1.325 for odd N via a rank count of symmetric binary matrices over F2. Turning to monitored 1D circuits, the paper classifies graph updates into C0, C1, and C2 edge toggles, claims that C2 toggles generate an emergent dense induced subgraph G(N_sub,1/2) in the volume-law phase, and uses this picture to explain the GHZ plateau and the quantum error-correcting capability of the volume-law phase. It also presents an infection-recovery toy model for the spatial clustering of dense vertices and a mean-field analysis of C1 toggles giving p_c = 0.1608, in agreement with the numerically known value p_c ≈ 0.16.","tokens_in":29229,"tokens_out":18780,"duration_ms":182032,"significance":"If the central structural claim is correct, the framework would be a genuinely useful complement to replica and clipped-gauge methods: it provides analytic values for a quantity previously studied only numerically or asymptotically, offers a concrete picture of the volume-law phase as a hidden unitary circuit, and produces a graph-theoretic estimate of the MIPT critical point. The GHZ derivation is the strongest part of the paper: the rank-even lemma, the counting of rank-2m adjacency matrices over F2, and the reduction to dim ker Γ through the V_ω subspaces are coherent and checkable, and Appendix A gives a useful universality argument for independent Bernoulli entries. The monitored-circuit part is considerably more heuristic: the emergent-subgraph mechanism in Sec. VI C rests on independence and sparseness assumptions that are not controlled, and the numerical evidence checks only the degree distribution, not the joint edge distribution. The paper is therefore significant in potential but currently falls short of establishing its headline structural claim.","major_comments":[{"comment":"The step from the parity calculation to the conclusion that the induced subgraph is G(N_sub,1/2) is not justified. Equation (39) computes only the marginal probability that a fixed remote pair is toggled an odd number of times, and it does so by treating the N/2 gate events as independent Bernoulli trials with common probability q = 0.4r^2. The events {i ∈ µ(k) and j ∈ µ(k+1)} are correlated across different k because vertex neighborhoods overlap and because the graph co-evolves during the circuit; moreover, several gates in Table I (for example (X,X):(1∼2) and (Y,Y):(1∼2)) delete existing edges as a side effect, so the net update is not a sequence of independent flips. The derivation therefore yields a marginal probability, not the joint distribution of the edge indicators. The numerical check in Fig. 8(b) verifies only the normalized degree distribution (r_sub ≈ 0.5), which is consistent with many correlated graph ensembles. Please either prove asymptotic independence or negative correlation of the edge indicators, or test the G(N_sub,1/2) hypothesis directly by comparing quantities sensitive to the joint distribution, such as triangle counts, edge-correlation functions, or the adjacency spectrum. Until then, the hidden-unitary-circuit picture and the resulting explanation of the GHZ plateau and of quantum error correction remain heuristic.","section":"Sec. VI C, Eq. (39)"},{"comment":"The regime of validity of Eq. (39) is unclear. The calculation assumes a sparse graph with an infinitesimal homogeneous long-range averaged edge density r → 0^+, but Sec. IV A and Figs. 3 and 4 show a finite long-range AED in the volume-law phase, with O(1) values for p well below p_c. The text argues that C2 toggles create a gap between o(N^{-1/2}) and 1/2 in the scaling of r, but it does not explain how the dense/sparse classification emerges dynamically from a graph whose bulk AED is not infinitesimal, nor why the off-diagonal blocks in Fig. 7(b) should have r = o(N^{-1/2}) in the thermodynamic limit. Please specify precisely which density r enters Eq. (39), how the dense subset is selected, and provide numerical evidence that the complementary blocks are indeed o(N^{-1/2}) rather than merely small at the system sizes shown.","section":"Sec. VI C and Sec. IV A"},{"comment":"The statement that random stabilizer states converge to G(N,1/2) is stronger than what is actually shown. Equation (11) establishes only the marginal probability of an edge, with an O(2^{-k}) bias for edges incident to the kth vertex, and the canonical extended-graph construction imposes additional constraints (the role of H vertices and the exclusion of the empty edge set in the connected case) that correlate different edges. The bound on the fraction of biased edges does not by itself imply convergence in total variation nor convergence of nonlinear functionals such as the nullity distribution. Since the GHZ derivation in Sec. III D replaces the actual ensemble by G(N,1/2), and Appendix A proves universality only for independent Bernoulli entries, the paper needs either a universality argument for the actual dependent near-Bernoulli ensemble or a more modest statement of the convergence result that is actually used.","section":"Sec. III A and Sec. III D"},{"comment":"The claim that the output state is equivalent to a unitary circuit on N_sub qubits weakly perturbed by N−N_sub qubits carrying little entanglement needs a precise metric, and the text's own edge counting casts doubt on it. The paper states that edges connecting the dense subgraph to the outside contribute O(N^{1/2}) per vertex, i.e., O(N^{3/2}) cross edges in total. For a graph state, the entanglement across the dense/sparse partition is controlled by the rank over F2 of the off-diagonal adjacency block, not by the normalized edge density; a random off-diagonal block with density o(N^{-1/2}) can still have rank proportional to min(N_sub, N−N_sub), giving volume-law entanglement between the two parts. The notion of 'weakly perturbed' must therefore be specified (for example, closeness of local reduced density matrices, preservation of code distance, or a bound on the rank of the off-diagonal block), and the relevant quantity should be checked numerically. Without this, the quantum error-correction interpretation is not established by the present argument.","section":"Sec. VI C, item 2"},{"comment":"The critical-point estimate p_c = 0.1608 is presented as a prediction, but the derivation in Eq. (40) relies on uncontrolled approximations: C2 toggles are neglected, gates with 'negative price' are dropped, and the critical point is assumed to have a homogeneous edge density without a demonstrated justification. In addition, the infection-recovery toy model in Sec. VI D places its absorbing transition near p ≈ 0.16 only after choosing the gate-induced infection rate α_u(p) = 0.4 − 0.1⟨Γ1⟩, while the earlier discussion selects α_≁ = 0.35 'in hindsight' to match the dense-fraction data. I recommend that Eqs. (38)–(40) be explicitly labeled as a heuristic mean-field estimate and that the abstract and conclusions soften the claim that the graph argument determines the critical point.","section":"Sec. VI D and Sec. VI E"}],"minor_comments":[{"comment":"The phrase 'weekly perturbed' should be 'weakly perturbed' in the abstract and in the corresponding sentence in Sec. I B.","section":"Abstract and Introduction"},{"comment":"In the paragraph introducing the infection-recovery model, 'see Ref. VI D' should be 'see Sec. VI D'.","section":"Sec. VI D"},{"comment":"The text says C2 toggles are also seen in 'X- and Z-measurements', but according to Table I it is X- and Y-measurements that generate the relevant multi-edge toggles; Z-measurements only isolate the measured vertex. This appears to be a typo.","section":"Sec. VI C"},{"comment":"The Introduction writes 'Shur–Weyl duality'; the standard spelling is 'Schur–Weyl duality'.","section":"Sec. I"},{"comment":"Reference [64] contains a malformed DOI ('10.1103/fl34-h1p1') and should be corrected.","section":"References"},{"comment":"The asymptotic limits 1.204 and 1.325 are asserted without showing the evaluation of the sum or a reproducible calculation. Since these are headline quantitative results, please include the asymptotic analysis or a short derivation (or a small code snippet) so that the values can be independently checked.","section":"Sec. III D, Eq. (34)"}],"recommendation":"major_revision","confidential_remarks":"The GHZ derivation is the strongest and most original part of the manuscript and could justify publication after revision. The monitored-circuit part, especially the emergent G(N_sub,1/2) subgraph and the hidden-unitary-circuit interpretation, is currently heuristic and needs either a rigorous control of edge correlations or direct numerical verification of the joint distribution. The paper would also benefit from a data/code availability statement for the numerical figures. The p_c estimate is best presented as a mean-field heuristic rather than a derivation."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper does two very different things. One is solid and useful: it gives a graph-theoretic derivation of the mean GHZ content of random stabilizer states, with the even-odd asymptotics 1.204 and 1.325. The counting of rank-2m adjacency matrices over F2 is clean, the rank-even argument is standard but well presented, and the reduction of g3 to dim ker Gamma is carefully argued. This part deserves to be cited and should survive contact with referees, provided the authors show the asymptotic limit that produces those two constants -- right now they are asserted rather than derived. The convergence to G(N,1/2) is also stated more strongly than it is proved: the canonical-form counting gives marginal edge probabilities, not joint independence, so the equivalence is plausible but not rigorous. For the GHZ numbers this is likely fine, because the nullity is a robust quantity and the numerics back the claim, but the proof as written has a gap. The other part, the emergent dense subgraph G(N_sub,1/2) in the volume-law phase, is the more striking claim and the weaker one. Equation (39) computes the marginal probability that a single remote edge is toggled an odd number of times, assuming a homogeneous infinitesimal long-range density r. It says nothing about joint independence of edges, and the numerical evidence in Fig. 8(b) only checks the degree distribution, which many correlated graph ensembles would also reproduce. The regime assumption r->0+ also sits awkwardly with the O(1) long-range AED the paper itself reports in the volume-law phase. The hidden-unitary-circuit picture is appealing and might be right, but it is a heuristic extrapolation, not a derivation. The mean-field p_c=0.1608 and the infection-recovery toy model are honestly labeled as toy models, but they contain hand-picked rates; the p_c value is at least self-consistent. No code or data is provided for the numerics, which is a minor but real reproducibility issue. Overall: the GHZ result alone justifies sending this to peer review. The emergent-subgraph claim needs either a serious independence argument or clear reframing as a conjecture with supporting numerics. I would accept a peer-review invitation on this paper, and I would want the referees to push on exactly the two soft spots above.","headline":"The GHZ even-odd result is real and worth taking seriously; the emergent G(N_sub,1/2) subgraph claim is a suggestive heuristic that needs more than the marginal-edge argument the paper actually supplies.","tokens_in":756,"tokens_out":1472,"would_cite":true,"duration_ms":71165,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Typical output states of monitored random Clifford circuits are governed by an emergent dense random subgraph that acts as a smaller unitary circuit.","keywords":["measurement-induced phase transition","Clifford circuits","graph states","stabilizer states","GHZ entanglement","Erdős-Rényi random graphs","quantum error correction","absorbing-state phase transition"],"falsifier":"Take an output state at $p=0.14$ with $N=1000$, extract its adjacency matrix, identify the dense subgraph by vertex degree, and compare its edge-count distribution or triangle count with that of $G(N_{\\mathrm{sub}},1/2)$; a systematic deviation—for instance, a subgraph whose edge probability depends on $p$ or on spatial position—would falsify the claim that the subgraph is Erdős–Rényi at $r=1/2$. A more direct check is to measure whether the edge probability of the dense subgraph stays at $1/2$ as $p$ approaches $p_c$ from below.","tokens_in":28627,"feed_emoji":"⚛️","tokens_out":6957,"duration_ms":55898,"temperature":0.7,"pith_summary":"This paper argues that the typical output states of monitored random Clifford circuits can be understood directly through their graph representations, rather than only through entanglement entropies. It shows that uniformly random stabilizer states asymptotically become Erdős–Rényi random graphs $G(N,1/2)$, which yields an analytic derivation of the mean GHZ entanglement content of random stabilizer states: $\\langle g_3\\rangle=1.204$ for even $N$ and $1.325$ for odd $N$. In the volume-law phase of a one-dimensional monitored circuit, the output-state graph is claimed to contain an emergent dense subgraph $G(N_{\\mathrm{sub}},1/2)$, so the output state behaves like the output of a smaller unitary Clifford circuit on $N_{\\mathrm{sub}}$ qubits, weakly coupled to the remaining qubits. This picture is used to explain the GHZ plateau, the quantum error-correcting capability of the volume-law phase, and to locate the measurement-induced phase transition at $p_c = 0.1608$ through a mean-field argument.","feed_headline":"Hidden unitary circuit emerges inside measured Clifford circuits","feed_subtitle":"Graph-based analysis explains the GHZ plateau and pinpoints the transition at p_c = 0.1608.","key_machinery":"The central object is the canonical extended graph state: a stabilizer state written as local Clifford gates applied to a graph state, with a numbering gauge that makes the correspondence one-to-one. The argument is carried by classifying the graph updates induced by each Clifford gate and measurement into three edge-toggle types, $C_0$, $C_1$, and $C_2$. The $C_2$ toggles—nonlocal moves that flip a remote edge when two neighbors of the gate are connected—are shown to drive any subgraph whose averaged edge density exceeds $N^{-1/2}$ into the uniformly random form $G(N_{\\mathrm{sub}},1/2)$; the $C_1$ toggles, which act as local interactions among adjacency-matrix entries, are then used in a mean-field equation that determines $p_c$.","core_discovery":"On its own terms, the central discovery is that the graph encoding of a stabilizer state is not just a bookkeeping device: in the thermodynamic limit, the graphs of uniformly random stabilizer states converge to the Erdős–Rényi ensemble $G(N,1/2)$, making the nullity of the adjacency matrix the natural carrier of tripartite GHZ entanglement. For monitored one-dimensional Clifford circuits in the volume-law phase, the paper finds that the output-state adjacency matrix contains a dense subgraph of exactly the same class, $G(N_{\\mathrm{sub}},1/2)$, regardless of the measurement rate $p$, with $N_{\\mathrm{sub}}/N$ shrinking toward the area-law phase. Because $G(N,1/2)$ is precisely the graph ensemble produced by deep unitary Clifford circuits, the paper concludes that the monitored output state is, up to weakly entangled 'sparse' qubits, the output of a unitary circuit on $N_{\\mathrm{sub}}$ qubits. This hidden unitary circuit is then identified as the mechanism behind the plateau in GHZ content ($\\langle g_3\\rangle\\approx 1.25$) across the volume-law phase and behind the error-correcting properties previously observed there. The paper also derives the measurement-induced transition critical point $p_c=0.1608$ from a mean-field treatment of one class of edge toggles.","pith_inferences":["A testable extension: if the hidden unitary circuit is real, logical operators of the embedded error-correcting code should be supported mainly on the dense subgraph; one could verify this by computing the code distance of the subgraph alone and comparing it with the full-state code distance.","The infection-recovery toy model's absorbing-state transition invites a critical-exponent analysis: scaling of the dense-vertex density near $p_c=0.1608$ could reveal whether the measurement-induced transition belongs to the directed percolation universality class, a question the paper leaves open.","The same graph-toggle decomposition could carry over to circuits with non-Clifford gates, where the $C_1$ toggles' interpretation as local interactions between adjacency-matrix entries suggests a route toward a kinetic theory of magic or stabilizer entropy, though the paper does not pursue this.","The nullity-based formula $g_3 = \\dim\\ker\\Gamma - \\sum_\\omega \\dim\\ker\\Gamma_\\omega$ suggests that other adjacency-matrix invariants, such as rank statistics over the real numbers, may correspond to as-yet-unidentified multipartite entanglement measures in stabilizer states."],"forward_implications":["The GHZ content of random stabilizer states becomes $\\langle g_3\\rangle = 1.204$ for even $N$ and $1.325$ for odd $N$, resolving the even–odd effect and explaining why the GHZ plateau in monitored circuits hovers near $1.25$ across the volume-law phase.","The output state of a monitored circuit in the volume-law phase is, up to weakly entangled corrections, the output of a unitary Clifford circuit on $N_{\\mathrm{sub}}$ qubits, so $N_{\\mathrm{sub}}/N$ serves as an order parameter for the measurement-induced transition.","The volume-law phase inherits good quantum error-correcting codes from the hidden unitary subgraph, which directly accounts for dynamical purification and error-correction behavior observed in monitored circuits.","The mean-field equation for the $C_1$ toggles places the critical measurement rate at $p_c = 0.1608$, matching numerical estimates near $0.16$.","Dense vertices cluster along the one-dimensional chain in a way captured by an infection-recovery model, suggesting that the measurement-induced transition can be viewed as an absorbing-state phase transition."],"supporting_citations":[{"why":"Supplies the canonical extended graph state gauge, whose one-to-one correspondence with stabilizer states grounds the whole graph-theoretic approach.","marker":"[78]"},{"why":"Gives the tripartite stabilizer decomposition and the formula $g_3 = N - \\dim S_{\\mathrm{local}}$, which the paper rewrites in graph-nullity form.","marker":"[66]"},{"why":"Documents the even–odd GHZ effect and the volume-law plateau that this paper sets out to explain.","marker":"[31]"},{"why":"Provides the graph-update rules for Clifford gates and measurements that underlie the $C_0/C_1/C_2$ toggle classification.","marker":"[4]"},{"why":"Shows that short random Clifford circuits define good quantum error-correcting codes, the property the dense subgraph is claimed to inherit.","marker":"[86]"},{"why":"Defines the Erdős–Rényi ensemble $G(N,r)$, used as the limit ensemble for random stabilizer graphs and for the emergent subgraph.","marker":"[79, 80]"},{"why":"Supplies the universality theorem used to show that GHZ nullity statistics are independent of edge probability $r$ for Erdős–Rényi graphs.","marker":"[88]"},{"why":"Proves that the GHZ content of random stabilizer tensor networks is $O(1)$, providing the prior bound this paper sharpens into exact constants.","marker":"[47]"}],"fun_headline_variants":["Hidden unitary circuit emerges inside monitored Clifford output","Graph analysis reveals unitary core in measured Clifford circuits","Random stabilizer graphs converge to Erdos-Renyi, explaining GHZ","Graph mean-field locates transition at p_c = 0.1608"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The derivation of the emergent dense subgraph assumes that long-range edges are so sparse and so uniformly distributed that each remote pair of qubits is toggled independently, ignoring correlations between edges, fluctuations in vertex degree, and gates that delete edges.","fun_headline_variants_meta":{"raw":{"variants":["Hidden unitary circuit emerges inside monitored Clifford output","Graph analysis reveals unitary core in measured Clifford circuits","Random stabilizer graphs converge to Erdos-Renyi, explaining GHZ","Graph mean-field locates transition at p_c = 0.1608"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000309,"raw_usage":{"total_tokens":1890,"prompt_tokens":1195,"completion_tokens":695,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":811,"completion_tokens_details":{"reasoning_tokens":637}},"tokens_in":811,"tokens_out":695,"duration_ms":6734,"temperature":1.0,"reasoning_tokens":637,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T14:54:31.659220+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take an output state at $p=0.14$ with $N=1000$, extract its adjacency matrix, identify the dense subgraph by vertex degree, and compare its edge-count distribution or triangle count with that of $G(N_{\\mathrm{sub}},1/2)$; a systematic deviation—for instance, a subgraph whose edge probability depends on $p$ or on spatial position—would falsify the claim that the subgraph is Erdős–Rényi at $r=1/2$. A more direct check is to measure whether the edge probability of the dense subgraph stays at $1/2$ as $p$ approaches $p_c$ from below.","supporting_citations":[{"cited_title":"Gadde, V","cited_arxiv_id":null,"evidence_quote":"Supplies the canonical extended graph state gauge, whose one-to-one correspondence with stabilizer states grounds the whole graph-theoretic approach."},{"cited_title":"Bertini, K","cited_arxiv_id":null,"evidence_quote":"Supplies the universality theorem used to show that GHZ nullity statistics are independent of edge probability $r$ for Erdős–Rényi graphs."}],"review_version":2}