{"id":"c9117170-605f-4579-886f-871f762ab8c9","arxiv_id":"2605.12665","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The reduced transition matrix in chaotic dual-unitary quantum circuits has low-rank structure with entropy growing at most logarithmically in time, enabling efficient approximation for local expectation values.","lead":"The paper shows that the reduced transition matrix for local observables in quantum dynamics admits an efficient low-rank approximation because its entropy grows at most logarithmically with time in chaotic dual-unitary circuits. This structure could simplify classical simulation of quantum systems by focusing on effective bath information rather than the full wavefunction.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest_assumption correctly isolates the entropy bound for chaotic dual-unitary circuits as the key step. Because the paper asserts an exact proof for the random case and the abstract gives no indication that the singular-value control or the definition of the reduced transition matrix contains a circular step, the UNVERDICTED verdict with low confidence remains appropriate; the concrete test above would still be the natural next verification even if the full proof were already accepted.","tokens_in":1659,"tokens_out":321,"duration_ms":38282,"concrete_test":"Extract the reduced transition matrix for a small random dual-unitary circuit (e.g., 4-site, t=10) from the supplementary code or by direct contraction; compute its singular-value spectrum and verify that the cumulative tail sum after k= O(log t) values is < 10^{-3} while the entropy S = -sum lambda_i log lambda_i satisfies S <= c log t + O(1).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the reduced transition matrix admits an efficient low-rank approximation because its truncation error is bounded by the tail of the singular-value spectrum and, for chaotic dual-unitary circuits, the associated von Neumann entropy grows at most logarithmically. This rests on an exact result for random dual-unitary circuits plus numerical checks for fixed instances. No internal inconsistency, hidden assumption about normalization, or failure of the Eckart-Young-type error bound is visible from the stated construction.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims that the reduced transition matrix, a combination of influence matrices determining local expectation values, admits an efficient low-rank approximation because its truncation error is controlled by the tail of the singular-value spectrum. For chaotic dual-unitary circuits the associated von Neumann entropy grows at most logarithmically in time; this follows from exact results on random dual-unitary circuits together with numerical support on fixed instances of both dual-unitary and random circuits.","tokens_in":1739,"tokens_out":374,"duration_ms":35041,"significance":"If the central claims hold, the work is significant for the influence-matrix approach to classical simulation of quantum dynamics. Demonstrating that the reduced transition matrix remains low-rank despite strong temporal correlations in the underlying influence matrices, and that its entropy grows only logarithmically, directly addresses a known obstacle to efficient simulation of chaotic systems. The exact analytic results for random dual-unitary circuits constitute a clear strength, supplying rigorous, parameter-free support that is then corroborated numerically.","major_comments":[],"minor_comments":[{"comment":"Abstract: the statement that truncation error is controlled by the singular-value spectrum would benefit from an explicit reference to the relevant Eckart-Young-type bound or theorem number in the main text.","section":"Abstract"},{"comment":"The numerical section should report the precise circuit sizes, time ranges, and singular-value cutoffs used, together with error bars or convergence checks, to allow readers to assess the strength of the supporting evidence.","section":null},{"comment":"Notation: ensure that the precise definition of the reduced transition matrix (as a combination of influence matrices) is stated once, early, and used consistently in all subsequent equations and figures.","section":null}],"recommendation":"minor_revision","confidential_remarks":"No concerns regarding scope, citation practices, or undisclosed novelty from the information provided."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive summary, recognition of the significance of our results, and recommendation for minor revision. We are pleased that the exact analytic results for random dual-unitary circuits and the logarithmic entropy growth were viewed as strengths.","responses":[],"tokens_in":1161,"tokens_out":66,"duration_ms":11557,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that this work identifies a low-rank approximation for the reduced transition matrix in the influence-matrix formalism, where truncation error is bounded by the singular-value tail, and proves that the associated von Neumann entropy grows at most logarithmically for chaotic dual-unitary circuits. The exact derivation for random dual-unitary circuits is the strongest part; it follows directly from the circuit averaging and dual-unitary properties without extra assumptions. That gives a clean structural result rather than just another numerical observation. The numerics on fixed instances of both dual-unitary and random circuits then check that the singular-value decay behaves as expected in practice, which supports using the low-rank form for local observables without needing the full wavefunction. This is useful because it sidesteps the strong temporal correlations that usually make influence matrices hard to compress. The connection to simulation efficiency is straightforward and the error control via Eckart-Young style bounds is standard but applied here in a timely way. On the softer side, the logarithmic bound for non-random chaotic dual-unitary circuits rests more on the numerics than on a general proof, so it could be sensitive to how well the chosen instances represent the chaotic regime or to finite-size effects. The paper does not appear to overstate this, but a referee might ask for more systematic scaling checks. Overall this is aimed at people working on tensor-network or influence-matrix methods for quantum dynamics who need better compression tools. It has enough of a concrete result to deserve peer review; the exact random-case part gives it a solid foundation even if the general case needs tightening.","headline":"The paper shows the reduced transition matrix has a controllable low-rank structure with logarithmic entropy growth for chaotic dual-unitary circuits, backed by exact random-case results.","tokens_in":2223,"tokens_out":391,"would_cite":true,"duration_ms":17094,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/ArithmeticFromLogic.lean","rs_theorem":"LogicNat recovery and embed_strictMono","paper_passage":"We then prove that, for chaotic dual-unitary circuits, the associated entropy grows at most logarithmically in time... S(ρ_t0) ≲ O(lnt)"}],"headline":"Reduced transition matrix entropy bounds in dual-unitary circuits show no RS-shaped structure","alignment":"orthogonal","rationale":"The paper's core machinery (joint SVD truncation of the reduced transition matrix T_t0, von Neumann entropy S(ρ_t0) of its normalized singular values, and the logarithmic bound S(ρ_t0) ≲ O(ln t) derived via projector decomposition and membrane arguments for chaotic dual-unitary circuits) operates entirely within standard quantum-information and many-body dynamics. It invokes neither the recognition cost J(x) = ½(x + x⁻¹) − 1, φ-ladder spacings, 8-tick periodicity, nor any parameter-free derivation of constants. The construction is therefore orthogonal to the RS forcing chain.","tokens_in":55051,"confidence":"high","tokens_out":266,"duration_ms":22698,"cache_read_input_tokens":32896,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The reduced transition matrix for local observables in chaotic dual-unitary circuits admits a low-rank approximation because its entropy grows at most logarithmically in time.","keywords":["influence matrix","reduced transition matrix","low-rank approximation","dual-unitary circuits","quantum circuit simulation","entropy growth","chaotic quantum dynamics"],"falsifier":"A numerical or analytical observation that the entropy of the reduced transition matrix grows faster than logarithmically with time in a chaotic dual-unitary circuit.","tokens_in":2557,"feed_emoji":"📉","tokens_out":587,"duration_ms":28442,"temperature":0.7,"pith_summary":"Influence matrices retain only the effective bath seen by local observables but still carry strong temporal correlations that hinder efficient representation. The reduced transition matrix is formed by a suitable combination of influence matrices and directly determines local expectation values. Its truncation error is controlled by the singular-value spectrum, which motivates a low-rank approximation. For chaotic dual-unitary circuits the associated entropy grows at most logarithmically in time. This is shown exactly for random dual-unitary circuits and supported numerically for fixed instances of both dual-unitary and random circuits.","feed_headline":"Reduced transition matrix shows logarithmic entropy growth in chaotic circuits","feed_subtitle":"Low-rank approximation becomes viable for local observables once the entropy bound is established.","key_machinery":"The reduced transition matrix, a combination of influence matrices that directly determines local expectation values, with truncation error controlled by its singular-value spectrum.","core_discovery":"The reduced transition matrix can be efficiently approximated because its singular-value spectrum controls the truncation error, and for chaotic dual-unitary circuits the associated entropy grows at most logarithmically in time. This follows from exact results for random dual-unitary circuits and is supported by numerical results for fixed instances.","pith_inferences":["Similar low-rank structure might appear in other classes of circuits if comparable entropy bounds can be established.","The method could be combined with existing tensor-network techniques to simulate larger open systems or measurement dynamics.","Checking whether the logarithmic bound survives in non-dual-unitary chaotic circuits would test the generality of the result."],"forward_implications":["Local expectation values can be computed to controlled accuracy using low-rank truncations of the reduced transition matrix.","Simulation cost for local observables remains manageable at long times in chaotic dual-unitary systems.","The logarithmic entropy bound holds for both random dual-unitary circuits (exactly) and fixed instances (numerically).","Singular-value truncation provides a systematic approximation scheme without needing the full wavefunction."],"fun_headline_variants":["Logarithmic entropy growth for reduced transition matrix in chaos","Low-rank structure of reduced transition matrix in chaos","Reduced transition matrix admits low-rank approximation in chaos","Singular value spectrum governs truncation error in chaos"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The truncation error is controlled by the singular-value spectrum of the reduced transition matrix in chaotic dual-unitary circuits.","fun_headline_variants_meta":{"raw":{"variants":["Logarithmic entropy growth for reduced transition matrix in chaos","Low-rank structure of reduced transition matrix in chaos","Reduced transition matrix admits low-rank approximation in chaos","Singular value spectrum governs truncation error in chaos"]},"model":"grok-4.3","cost_usd":0.007663,"raw_usage":{"total_tokens":3376,"prompt_tokens":568,"num_sources_used":0,"completion_tokens":57,"cost_in_usd_ticks":76628000,"prompt_tokens_details":{"text_tokens":568,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2751,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":568,"tokens_out":57,"duration_ms":31269,"temperature":1.0,"reasoning_tokens":2751,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-14T20:13:34.555727+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A numerical or analytical observation that the entropy of the reduced transition matrix grows faster than logarithmically with time in a chaotic dual-unitary circuit.","supporting_citations":[],"review_version":1}