{"id":"119491db-a2a8-4946-a876-76eecf510695","arxiv_id":"2508.16826","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A QSVT-based algorithm implements modular flow of an operator with respect to a density matrix in O~(κ²|t|log(κ²/ε)) queries to a block encoding of the state.","lead":"This paper gives a quantum algorithm that implements modular flow, the time evolution generated by the logarithm of a density matrix, using the quantum singular value transform. If correct, it would give the first explicit method for modular flow, with applications to measuring chiral central charge and to simulating bulk observers in holography.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 2's error bound is wrong: the Chebyshev series for log|x| has 1/n coefficients, so near x=1/κ its tail is Θ(κ/N), not exponentially small in N/κ²; Theorem 1's κ² log(κ²/ε) complexity is therefore unsupported.","rationale":"The reader's weakest assumption was the block-encoding oracle, which is a standard and explicitly acknowledged limitation; the reader also flagged the unsupported lower bound. However, the most load-bearing issue is a concrete technical error in Lemma 2, which underpins the main upper bound. The proof incorrectly treats the Chebyshev remainder as the remainder of a geometric series in cos(2 arccos x), but the actual coefficients decay only as 1/n. A standard summation-by-parts bound shows the tail near the spectral edge x=1/κ is Θ(κ/N) for N≫κ. Inserting the paper's N=O(κ² log(κ²/ε)) gives an error that can vastly exceed ε for small ε, so Theorem 1's claimed query complexity is not established. The algorithm might be salvageable with a different polynomial approximation (e.g., a Taylor expansion in (1−x) or an optimized Chebyshev approximation on [1/κ,1]), but the paper as written provides a false error bound and a quantitatively incorrect complexity claim. This moves the verdict from CONDITIONAL toward REJECT, because the core algorithmic guarantee is unsupported.","tokens_in":13490,"tokens_out":23658,"duration_ms":281277,"concrete_test":"For κ=100 and ε=10⁻⁶, set N=⌈κ² ln(κ²/ε)⌉ ≈ 230,259 and numerically evaluate the exact partial sum f_N(x) = −ln 2 + Σ_{n=1}^N T_{2n}(x)(−1)^{n−1}/n at x=1/κ=0.01. Compare |f_N(0.01) − ln(0.01)| to ε. The Abel-summation tail estimate predicts an error of about 2×10⁻⁴, far above ε; if confirmed, Lemma 2's Eq. (10) is invalidated.","verdict_should_be":"REJECT","load_bearing_attack":"The central algorithm rests on Lemma 2 (Eqs. 5–12), which claims that the degree-2N Chebyshev partial sum f_N approximates ½log(x²) to error ε on [−1,1]\\[−1/κ,1/κ] for N=O(κ² log(κ²/ε)). The proof compares the tail of ∑ T_{2n}(x)(−1)^{n−1}/n to the Maclaurin tail of log(1+z), bounding it by (−cos(2 arccos(1/κ)))^{N+1}/(1+cos(2 arccos(1/κ))) ≈ (1−2/κ²)^{N+1}κ²/2. But the Chebyshev series is not a power series in cos(2 arccos x): its terms are cos(2n arccos x)/n. For x=1/κ, the tail is effectively −∑_{n>N} cos(2n/κ)/n. Since |∑_{n=N+1}^M cos(2n/κ)| ≤ κ, Abel summation gives |tail| ≤ 2κ/(N+1). With N=κ² log(κ²/ε), the tail is ~1/(κ log(κ²/ε)), which is ≫ ε for small enough ε (e.g., κ=100, ε=10⁻⁶ gives N≈2.3×10⁵ but tail ≈2×10⁻⁴). Thus Lemma 2's error bound is false and Theorem 1's query-complexity claim lacks a valid proof; the actual complexity of the construction as written must scale at least as κ/ε per log-encoding call.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a QSVT-based algorithm for implementing modular flow ρ^{-it}Oρ^{it} for a block-encoded density matrix ρ. The central construction approximates -log ρ by a truncated Chebyshev series, then feeds the resulting approximate modular Hamiltonian into a QSVT Hamiltonian-simulation routine. The authors claim a query complexity of O~(κ²|t| log(κ²/ε)), where 1/κ is the smallest nonzero eigenvalue of ρ. They also discuss applications to chiral central charge extraction, to the Jafferis–Lamprou/Gao–Lamprou holographic observer proposal, and to von Neumann entropy estimation, and they claim a query-complexity lower bound for modular flow based on the known entropy-estimation lower bound. The paper is clearly written and situates the algorithm within standard QSVT tools, but the main technical lemma and the lower-bound argument have serious defects.","tokens_in":13932,"tokens_out":16856,"duration_ms":202477,"significance":"If correct, the paper would provide the first explicit provable algorithm for modular flow and would connect a well-studied physics quantity to the QSVT toolbox. The applications, especially to chiral central charge and to holographic bulk-observer probes, are potentially interesting. The paper also has the virtue of being constructive and explicit. However, the central polynomial approximation lemma is demonstrably incorrect, and the claimed lower bound is not a lower bound. The significance is therefore conditional: the conceptual idea is natural, but the results as stated are not supported.","major_comments":[{"comment":"The error bound in Lemma 2 is false. The proof identifies the tail of ∑ T_{2n}(x)(-1)^{n-1}/n with the Maclaurin tail of log(1+z) at z=cos(2 arccos x), but the actual tail at x=cos θ is ∑_{n>N} (-1)^{n-1} cos(2nθ)/n = Re ∑_{n>N} (-1)^{n-1} e^{2inθ}/n, which is not a power series in cos(2θ). At x=1 the tail is the alternating harmonic tail ∑_{n>N} (-1)^{n-1}/n ~ 1/(2N), not exponentially small. At x=1/κ, the tail is -∑_{n>N} cos(2n/κ)/n, and Abel summation with |∑_{n=1}^M cos(2n/κ)| ≤ 1/sin(1/κ) gives |tail| ≤ 2κ/(N+1). Thus for N=O(κ² log(κ²/ε)) the error at x=1/κ is ~1/(κ log(κ²/ε)), which is far larger than ε for large κ and small ε. Consequently Eq. (12), the degree bound Eq. (13), and the query complexity of Theorem 1 are unsupported.","section":"§3.1, Lemma 2"},{"comment":"This section does not prove a lower bound on modular flow. The argument says that the von Neumann entropy lower bound Ω(n²/ε) forces any modular flow implementation to scale polynomially in n. But a reduction from entropy estimation to modular flow only shows that the particular entropy-estimation algorithm built on modular flow must respect the entropy lower bound; it does not constrain the complexity of an arbitrary modular-flow oracle. The inequality in Eq. (47) compares an upper bound on the proposed entropy algorithm with a known lower bound; that is a consistency check, not a lower bound on modular flow. The sentence 'There can be no modular flow implementation scaling like log n' is a non sequitur. A genuine lower bound would require showing that any algorithm implementing modular flow with q queries can be converted into an entropy estimator whose complexity violates the known bo","section":"§4.3, 'query complexity lower bound'"},{"comment":"The QPE-based entropy estimation omits the phase-precision cost. The entropy is recovered from the mean of phases θ_n = π log λ_n / log κ. To achieve additive error ε in S(ρ), the phases must be estimated to precision O(ε/log κ), and QPE then requires O(log κ/ε) controlled-U applications per sample (or a comparable number of ancilla qubits). This factor is absent from the sample count in Eq. (40) and from the total query count in Eq. (41). In addition, Eq. (33) defines QPE(ρ,U) as ∑ e^{iθ_k}⟨k|ρ|k⟩ = Tr(ρU), while Eq. (38) uses QPE(V)_ρ = ∑ θ_n λ_n; these are different quantities, and QPE does not directly output Tr(ρU) for a general U. The section therefore does not provide a valid estimate of von Neumann entropy with the stated complexity.","section":"§4.3, Eq. (39)–(41)"},{"comment":"The claimed computation of the correlation function W(s,t) by QPE is not justified. For a mixed state ρ and a unitary U that does not commute with ρ, QPE on ρ gives a distribution over U-eigenstates with weights ⟨k|ρ|k⟩ in the eigenbasis of U; it does not return Tr(ρU). The operators \tilde U = ρ^{-is}U_1ρ^{is}U_2 are not generally diagonal in the eigenbasis of ρ, so the identity in Eq. (35) does not follow. A controlled-Hadamard test on a purification would be a standard alternative, but no such procedure is described. Thus the holographic application, as written, is not established.","section":"§4.2, Eq. (33)–(36)"}],"minor_comments":[{"comment":"The definition of a block encoding is imprecise: 'acts on H_R⊗H_A as |0⟩⟨0|⊗O' should be 'there exists a unitary U whose top-left block equals O/α', with α≥∥O∥.","section":"§2.1"},{"comment":"The notation QPE(ρ,U) is used inconsistently: Eq. (33) writes it as a trace with e^{iθ_k}, while Eq. (38) writes it as a phase average with θ_n. These are different quantities and should be distinguished.","section":"Eq. (33) and Eq. (38)"},{"comment":"Typos: 'Cheybshev' should be 'Chebyshev'; 'langauge' should be 'language'.","section":"Appendix A and Conclusions"},{"comment":"The signs around log(1/2κ) are confusing. The text says P^{MH} uses 1/(2 log(1/2κ)), which is negative for κ>1/2, while Appendix B says f^{log}_{κ',ε} is bounded by log(2κ). Please normalize consistently to avoid ambiguity.","section":"Appendix B and §3.2"}],"recommendation":"major_revision","confidential_remarks":"The paper's core technical lemma (Lemma 2) is demonstrably wrong, and the lower-bound claim is logically invalid. I do not consider these presentation issues. If the authors can supply a correct polynomial approximation for log on [1/κ,1] (which likely changes the stated complexity), and either remove or properly prove the lower-bound claim, the manuscript could become publishable. If Lemma 2 cannot be repaired, I would recommend rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"John,\n\nYou should know before reading closely: the central theorem as stated is not supported. Lemma 2 claims the degree-2N Chebyshev partial sum for ½log(x²) is ε-close on [1/κ,1] with N = O(κ² log(κ²/ε)). The proof compares the tail to the Maclaurin tail of log(1+z) with z = -cos(2 arccos x). That comparison is invalid: the series is not a power series in that z. Its terms are cos(2n arccos x)/n. At x=1/κ, the tail is effectively -∑_{n>N} cos(2n/κ)/n. For small 2/κ, sums of cos(2n/κ) over intervals are O(κ), so the tail is bounded by about 2κ/(N+1). Plugging in their N leaves a residual ~1/(κ log(κ²/ε)), far above ε. So the error bound is false, and Theorem 1's query complexity is unsupported. The construction as written needs degree at least ~κ/ε, which kills the practical claim.\n\nThat's the bad news. The good news is the paper still has something. The task—implementing modular flow algorithmically—is genuinely new, and framing it with QSVT is natural. The review of QSVT is clear, and the applications (chiral central charge, AdS/CFT bulk observer, entropy estimation) are plausible directions. The reduction for the lower bound is at best a consistency check: they show their own algorithm has the n²-like scaling, but they don't prove a matching lower bound on modular flow. The abstract overstates this as a proven lower bound; it isn't. The QPE-based entropy estimation also ignores the cost of high-precision phase estimation; the variance argument needs more care.\n\nOn the citation pattern and assumptions: the block-encoding oracle for ρ is a real limitation, but they acknowledge it. The external results are standard. No signs of fitted parameters or invented entities.\n\nSo who is this for? Someone working on quantum algorithms for entanglement-related quantities will find the framing useful and the flaw instructive. I would not cite it as a reliable result until the polynomial approximation is fixed or replaced. The authors may be able to salvage the idea by using a different polynomial, but the current write-up needs a major revision.\n\nIf this lands on my desk, I'd send it to a referee—the question is important enough—but with a clear request to check the approximation lemma and resubmit after fixing it.\n\nBest.","headline":"Modular flow via QSVT is a good idea, but the central lemma has a bogus error bound and the advertised complexity doesn't follow.","tokens_in":14376,"tokens_out":5975,"would_cite":false,"duration_ms":65833,"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":"This paper gives a quantum algorithm that ε-approximates modular flow in O~(κ²|t| log(κ²/ε)) queries, with a matching lower bound.","keywords":["modular flow","modular Hamiltonian","quantum singular value transform","QSVT","entanglement","von Neumann entropy","chiral central charge","AdS/CFT"],"falsifier":"Take a 2×2 state ρ = diag(1/κ, 1−1/κ), classically compute ρ^{-i}Oρ^i for a fixed traceless operator O, then run the algorithm with a block-encoding circuit and count the queries. If the query count exceeds C κ²|t| log(κ²/ε) for a fixed constant C, or the implemented operator differs from the exact flow by more than ε in spectral norm, Theorem 1 is false.","tokens_in":13408,"feed_emoji":"⚛️","tokens_out":7539,"duration_ms":80558,"temperature":0.7,"pith_summary":"Entanglement entropy is a single number, but the modular Hamiltonian -log ρ and its flow ρ^{-it}Oρ^{it} carry more information, and physicists have proposed using modular flow to extract topological data and to describe observers inside holographic spacetimes. This paper supplies what was missing: an explicit quantum algorithm that implements modular flow with a provable cost. For any block-encoded state ρ whose smallest nonzero eigenvalue is 1/κ, Theorem 1 gives an ε-approximation to the flow in O~(κ²|t| log(κ²/ε)) queries to the encoding. The construction approximates -log ρ by a QSVT-compatible polynomial, then runs Hamiltonian simulation; a companion lower-bound argument shows the cost is near-optimal. If the algorithm works as claimed, modular flow becomes a computable primitive for condensed-matter and holographic experiments.","feed_headline":"Modular flow gets a quantum algorithm with a proven cost","feed_subtitle":"A polynomial approximation to the modular Hamiltonian lets QSVT simulate the flow; a lower bound shows the cost is near-optimal.","key_machinery":"The modular Hamiltonian polynomial: a degree-2N Chebyshev partial sum f_N(x) = -log 2 + Σ_{n=1}^N T_{2n}(x)(-1)^{n-1}/n, rescaled by 1/log(1/2κ) and multiplied by a rectangular polynomial that suppresses |x|≤1/2κ, making it bounded by 1 and of definite parity. This polynomial is admissible for the quantum singular value transform (QSVT), which applies it to the singular values of a block-encoded ρ, producing an ε-approximation to -log ρ; Hamiltonian simulation then applies ρ^{it}. The degree N=O(κ² log(κ²/ε)) of the log polynomial is the dominant cost.","core_discovery":"The paper's central claim is that modular flow is efficiently implementable from a block encoding of ρ. Theorem 1 states that for a block-encoded ρ with smallest nonzero eigenvalue 1/κ, one can construct Õ(t) with ||Õ(t)-ρ^{-it}Oρ^{it}||<ε using O~(κ²|t| log(κ²/ε)) queries to the encoding. The proof constructs an explicit polynomial approximating (1/2 log(1/2κ)) log(x²) on the spectrum outside a gap of width 1/κ, uses the quantum singular value transform to turn it into an approximate modular Hamiltonian, and feeds that into Hamiltonian simulation to produce ρ^{it}. A reduction from von Neumann entropy estimation to modular flow then gives a query lower bound, so the algorithm's scaling cann","pith_inferences":["I infer that the Chebyshev expansion of log(x²) is the true workhorse: the same technique should apply to other operator functions with logarithmic singularities, giving κ²-type costs whenever the spectrum has a gap.","The paper's caveat that holographic states may lack efficient block encodings suggests the practical bottleneck is state preparation, not flow simulation; a testable next step is finding circuit families for which ρ^{it} is easy even though ρ itself is hard to block-encode.","If the purification construction is combined with existing ground-state preparation oracles for gapped systems, modular flow could become a practical probe of topological order at modest system sizes, since the cost no longer singles out tiny eigenvalues.","The polylog(n) entropy estimate for fixed κ indicates that the hardness of von Neumann entropy estimation resides in resolving tiny eigenvalues; for states with known condition number, entropy estimation may be much easier than the worst-case n² lower bound."],"forward_implications":["For any block-encoded ρ with smallest nonzero eigenvalue 1/κ, the modular flow of any operator can be ε-approximated at modular time t using O~(κ²|t| log(κ²/ε)) queries, making modular flow a concrete computational primitive rather than a formal object.","The reduction from von Neumann entropy estimation to modular flow implies any modular-flow algorithm must scale polynomially with the dimension n, so the κ² dependence in Theorem 1 cannot be improved to log n.","In a topologically ordered gapped ground state, running modular flow across a tripartite disk and measuring the entanglement entropy of one region reveals the chiral central charge c_- through the slope πc_-/3 of the entropy as a function of modular time.","Given oracle access to a block encoding of the reduced state and to operator insertions, modular flow plus quantum phase estimation can evaluate the correlation function proposed for probing behind the horizon in the holographic bulk-observer scenario.","When modular flow is applied to a purification |ψ⟩, the κ-dependence can be tamed: choosing κ=O(d²/δ²) gives error at most δ with cost linear in |t| and polynomial in the dimension d."],"supporting_citations":[{"why":"Supplies the QSVT framework that implements polynomial transforms of block-encoded operators, the tool on which the whole construction rests.","marker":"[20]"},{"why":"Supplies the QSVT review, the Hamiltonian-simulation query count, and the matrix-inversion polynomial construction used to build the rectangular factor.","marker":"[23]"},{"why":"Supplies the Ω(n² log(1/δ)/ε) lower bound for von Neumann entropy estimation that yields the modular-flow lower bound.","marker":"[22]"},{"why":"Provides the von Neumann entropy estimation lower bound used alongside [22] for the lower-bound argument.","marker":"[27]"},{"why":"Shows a state-preparation oracle yields a block encoding of the reduced density matrix, underpinning the purification result.","marker":"[25]"},{"why":"Sets up the holographic bulk-observer application by identifying modular flow with proper-time evolution.","marker":"[16]"},{"why":"Defines the correlation function the paper's holographic application aims to compute with modular flow and quantum phase estimation.","marker":"[21]"}],"fun_headline_variants":["Quantum algorithm simulates modular flow at near-optimal cost","Modular flow efficiently computed by new quantum algorithm","Proven near-optimal quantum algorithm for modular flow","Quantum algorithm for modular flow: efficient and provably tight","Simulate modular flow with quantum algorithm and proven efficiency"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The complexity guarantee is measured only against an oracle that block-encodes ρ; if no such encoding can be made—likely for holographic states—the algorithm's cost bounds do not carry over.","fun_headline_variants_meta":{"raw":{"variants":["Quantum algorithm simulates modular flow at near-optimal cost","Modular flow efficiently computed by new quantum algorithm","Proven near-optimal quantum algorithm for modular flow","Quantum algorithm for modular flow: efficient and provably tight","Simulate modular flow with quantum algorithm and proven efficiency"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000562,"raw_usage":{"total_tokens":2484,"prompt_tokens":703,"completion_tokens":1781,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":447,"completion_tokens_details":{"reasoning_tokens":1714}},"tokens_in":447,"tokens_out":1781,"duration_ms":14286,"temperature":1.0,"reasoning_tokens":1714,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T17:10:49.192898+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a 2×2 state ρ = diag(1/κ, 1−1/κ), classically compute ρ^{-i}Oρ^i for a fixed traceless operator O, then run the algorithm with a block-encoding circuit and count the queries. If the query count exceeds C κ²|t| log(κ²/ε) for a fixed constant C, or the implemented operator differs from the exact flow by more than ε in spectral norm, Theorem 1 is false.","supporting_citations":[],"review_version":1}