{"id":"dc6d5147-83a7-4211-a483-473598b48463","arxiv_id":"2508.14470","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A construction and matching lower bounds showing Hamming-weight-preserving states can be prepared in O(log binom(n,k)) depth and O(binom(n,k)) size.","lead":"This paper describes quantum circuits that prepare Hamming-weight-preserving quantum states in logarithmic depth, using a polynomial number of extra qubits for the general case. If the construction holds, it gives optimal-depth preparation for a state family used in quantum machine learning and graph-related quantum algorithms.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified","rationale":"The abstract presents plausible upper and lower bounds. The size lower bound Ω(C(n,k)) is a straightforward parameter-counting result for arbitrary states in a C(n,k)-dimensional subspace. The depth lower bound Ω(log C(n,k)) is consistent with the need for a connected causal structure to support arbitrary k-body amplitudes. The reader's assumption about coefficient loading is a standard one: in quantum circuit synthesis, coefficients are used as gate parameters and do not contribute depth. This does not constitute a load-bearing flaw. The only substantive uncertainty is the validity of the lower-bound proofs, which are not available in the abstract. Since no concrete technical error can be identified, the appropriate verdict remains UNVERDICTED, matching the reader's initial assessment. The proposed concrete test would resolve the main residual risk once the full paper is available.","tokens_in":942,"tokens_out":16482,"duration_ms":178887,"concrete_test":"Obtain the full manuscript and verify (a) that the upper-bound circuits define each rotation angle directly from the corresponding α_x as a classical parameter, with no additional depth for loading, and (b) that the lower-bound proofs for Ω(log C(n,k)) depth and Ω(C(n,k)) size use standard worst-case complexity arguments (parameter counting and light-cone analysis) that allow arbitrary all-to-all two-qubit gates and unlimited ancilla. If both hold, the optimality claim is sound; if either fails, the claimed optimality is undermined.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim—log-depth, size-optimal preparation of Hamming-weight-preserving states with polynomial ancillary qubits—is internally plausible. The O(log C(n,k)) depth upper bound is consistent with a light-cone/connectivity argument for arbitrary k-body amplitudes, and the Ω(C(n,k)) size lower bound follows from parameter counting. The reader's concern about coefficient loading being interleaved with the circuit does not land in the standard circuit model, where gate angles are free classical parameters set during circuit synthesis. Without the full manuscript, no concrete internal inconsistency or missing proof step is apparent; the main unresolved point is the correctness of the lower-bound proofs, which cannot be checked from the abstract.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper claims efficient quantum circuits for preparing Hamming-weight-preserving (HWP) states on n qubits, i.e., superpositions over computational basis states of fixed Hamming weight k. The abstract reports three results: (i) for graph-structured states (k=2) specified by an m-edge simple undirected graph, a preparation circuit of O(log n) depth with O(m) ancillary qubits, with the ancilla count reduced to zero for tree-structured and grid-structured graphs; (ii) for general HWP states with k >= 3, a preparation circuit of O(log binom(n,k)) depth using O(binom(n,k)) ancillary qubits and O(binom(n,k)) size; and (iii) lower bounds of Omega(log binom(n,k)) depth and Omega(binom(n,k)) size for all k >= 2, establishing that the constructions are asymptotically optimal. The available manuscript contains only the abstract; no circuit constructions, proofs, or gate-level arguments are provided.","tokens_in":1076,"tokens_out":3253,"duration_ms":42698,"significance":"If the claimed results hold, they would constitute a meaningful advance in quantum state preparation. Current generic state preparation can achieve logarithmic depth only at the cost of exponentially many ancillary qubits; the paper promises polynomial-ancilla logarithmic-depth circuits for a structured but nontrivial class of states used in quantum machine learning, together with matching lower bounds. The asymptotic claims are internally consistent and plausible: the size lower bound is consistent with parameter counting, and the depth upper bound is consistent with parallelization of combination amplitudes. The paper also makes precise, falsifiable complexity statements, which is a strength. However, because the review copy contains no technical content beyond the abstract, I cannot verify any of the central constructions or proofs, and the significance assessment must be conditional.","major_comments":[{"comment":"The central claim of O(log n)-depth preparation with O(m) ancillary qubits for arbitrary graph-structured states, and the zero-ancilla specializations for trees and grids, is stated without any algorithmic description. The transition from O(m) ancillas for general graphs to zero ancillas for trees/grids is nontrivial and load-bearing: it requires showing how edge amplitudes are rotated in parallel and how ancillas can be reused or eliminated in these restricted topologies. Without a circuit-level construction or at least a proof sketch, the claim cannot be checked from the submitted text.","section":"Abstract, graph-structured states (k=2)"},{"comment":"The abstract asserts matching lower bounds of Omega(log binom(n,k)) in depth and Omega(binom(n,k)) in size for every k >= 2, and states that the upper bounds 'exactly coincide' with them. No proof of either lower bound appears in the available text. The size lower bound likely follows from parameter counting, but the depth lower bound is not immediate: it requires a formal argument ruling out shallower circuits that use the same number of gates, in a model where classical parameters can set arbitrary gate angles. As submitted, the optimality claim is unverified.","section":"Abstract, lower bounds"}],"minor_comments":[{"comment":"The state is defined with coefficients alpha_x, but the abstract does not specify how these coefficients are supplied. In the standard circuit-synthesis model, gate angles are free classical parameters, so coefficient loading does not add depth; the authors should state this model explicitly to avoid ambiguity, especially since the O(log binom(n,k)) depth bound depends on it.","section":"Abstract, input model"},{"comment":"Several passages are grammatically awkward, e.g., 'the depth of preparation circuit for the most general state has been optimized to approximately optimal' and 'few log-depth preparation algorithms assisted by polynomial ancillary qubits have been come up with.' The text should be polished for clarity.","section":"Abstract, wording"},{"comment":"The phrase 'O(log{{n \\choose k}})-depth' is clear, but the lower bound statement 'Omega(log{{n \\choose k}})-depth and Omega({{n \\choose k}})-size' should specify the gate set and whether ancilla qubits are counted in the size measure.","section":"Abstract, notation"}],"recommendation":"uncertain","confidential_remarks":"My review copy contains only the arXiv abstract. The technical claims are specific and plausible, but no proof text is available for inspection. I cannot certify soundness or raise a definitive objection. I recommend that the editor obtain the full manuscript before making a decision; at that stage, a standard technical review of the circuit constructions and lower-bound proofs should be feasible."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nWhat you should know: this abstract claims optimal-depth preparation of Hamming-weight-preserving (HWP) states with matching lower bounds. I've only seen the abstract, not the full text, so take this as a first impression.\n\nIf correct, the result is clean and genuinely useful. For k=2 (graph states), the authors give O(log n)-depth circuits with O(m) ancilla, and they can drop the ancilla for trees and grids. For k≥3 they get O(log C(n,k)) depth, O(C(n,k)) size and ancilla, and then prove matching Ω(log C(n,k)) depth and Ω(C(n,k)) size lower bounds for all k≥2. That closes the problem for fixed k. The size lower bound is the obvious parameter-counting one; the depth lower bound is the real work. The constructions are plausibly non-adaptive parallel rotations, the standard way to compress depth.\n\nThe soft spots are exactly what we can't see. From the abstract we can't audit the lower-bound proofs, the gate-level design, or the depth/size accounting (for instance, the k=2 circuit size is not stated). The reader's concern about coefficient loading is a non-issue: in the standard model, gate angles are free classical parameters computed offline, so they don't add to quantum depth. The bigger risk is that the depth lower bound might rely on a hidden assumption about the access model; that has to be checked in the full manuscript.\n\nOn balance, this deserves a serious referee. The claims are specific and falsifiable, and the abstract gives no reason to think they are wrong. I'd want to see the proofs before citing it, but I'd rather have an expert referee spend time on it than see it desk-rejected.\n\nBest","headline":"Plausible optimal-depth results for HWP state preparation, but the abstract alone can't carry a verdict; worth sending to referees.","tokens_in":1477,"tokens_out":3195,"would_cite":false,"duration_ms":40135,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68"],"pacs":["03.67.Lx"],"model":"deepseek-v4-flash","headline":"Log-depth circuits prepare Hamming-weight states optimally","keywords":["quantum state preparation","Hamming-weight-preserving states","graph-structured states","circuit depth","ancillary qubits","lower bounds","quantum circuits"],"falsifier":"Find or construct a family of HWP states on n qubits with k=2 (graph states with m=O(n) edges) whose preparation from |0>^n requires circuit depth omega(log n) even when an unbounded number of ancillary qubits is available; this would contradict the claimed O(log n) upper bound. Conversely, exhibiting any k>=2 circuit family with depth o(log binom(n,k)) or size o(binom(n,k)) would refute the claimed lower bounds.","tokens_in":888,"feed_emoji":"⚛️","tokens_out":4370,"duration_ms":45804,"temperature":0.7,"pith_summary":"The paper establishes that Hamming-weight-preserving (HWP) quantum states—superpositions over computational basis states with exactly k ones—can be prepared in logarithmic depth using polynomially many ancillary qubits, and that this is asymptotically optimal. For k=2, these states are graph-structured: basis states correspond to edges and amplitudes to edge weights. For an n-qubit graph with m edges, the paper gives an O(log n)-depth circuit with O(m) ancilla, and shows that for tree- and grid-structured graphs no ancilla are needed. For general k, it gives O(log binom(n,k)) depth and O(binom(n,k)) size, matching lower bounds for every k>=2. A reader should care because these states arise in quantum machine learning and Hamiltonian simulation, and this shows they can be synthesized with near-minimal resources.","feed_headline":"Log-depth circuits prepare Hamming-weight states optimally","feed_subtitle":"Ancilla-assisted synthesis matches proven lower bounds for every fixed Hamming weight, from graphs to general k.","key_machinery":"The central object is the Hamming-weight-preserving state, a superposition supported on all n-bit strings with exactly k ones (for k=2, the edges of a simple undirected graph). The construction uses ancillary qubits to parallelize the assignment of amplitudes across the binom(n,k)-dimensional subspace, reducing circuit depth from polynomial to logarithmic in the number of basis states; the matching Omega(log binom(n,k)) depth and Omega(binom(n,k)) size lower bounds show this parallelization is the best possible.","core_discovery":"On the paper's own terms, the central discovery is a constructive upper bound paired with a matching lower bound: for any fixed Hamming weight k, an n-qubit HWP state |psi> = sum_{HW(x)=k} alpha_x |x> can be prepared from |0>^n by a circuit of depth O(log binom(n,k)) and size O(binom(n,k)) using O(binom(n,k)) ancillary qubits, and no circuit can do asymptotically better in depth or size. For k=2, the graph-structured case, the depth is O(log n) with O(m) ancilla, where m is the number of edges, and this improves to zero ancilla for trees and grids. The lower bounds hold for every k>=2, so the algorithms are near-optimal.","pith_inferences":["The ancilla-assisted parallelization pattern may extend to other state families whose basis set forms a combinatorial class, such as superpositions over matchings or independent sets, though the paper does not claim this.","The zero-ancilla results for trees and grids suggest that sparse or locally structured graphs may generally admit ancilla-free logarithmic-depth preparation, a testable hypothesis for other graph families.","Because the abstract does not specify how the coefficients alpha_x are loaded, the claimed depth is for the synthesis stage; in a practical setting where amplitudes arrive as classical data, the total end-to-end depth may include a coefficient-loading overhead."],"forward_implications":["For any fixed k, HWP states can now be prepared in asymptotically optimal depth and size, removing a bottleneck for algorithms that use these states as inputs.","Graph-structured states with m edges are preparable in O(log n) depth; for tree- and grid-structured graphs the circuit needs no ancillary qubits at all.","The lower bounds close the question for HWP states: any k>=2 requires Omega(log binom(n,k)) depth and Omega(binom(n,k)) size, so further improvements must come from changing the state family or allowing approximations.","These results give concrete resource counts for quantum machine learning and Hamiltonian simulation subroutines that rely on HWP states."],"supporting_citations":[],"fun_headline_variants":["Log-depth circuits for Hamming-weight states match lower bounds","Near-optimal synthesis of Hamming-weight states","Zero-ancilla log-depth circuits for tree and grid states","Optimal-depth preparation of weighted graph states"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The logarithmic depth guarantee assumes the amplitude coefficients can be supplied to the circuit as precomputed parameters free of depth cost; if the coefficients must be loaded into the circuit during execution, the stated depth could be exceeded.","fun_headline_variants_meta":{"raw":{"variants":["Log-depth circuits for Hamming-weight states match lower bounds","Near-optimal synthesis of Hamming-weight states","Zero-ancilla log-depth circuits for tree and grid states","Optimal-depth preparation of weighted graph states"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000219,"raw_usage":{"total_tokens":1361,"prompt_tokens":905,"completion_tokens":456,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":649,"completion_tokens_details":{"reasoning_tokens":402}},"tokens_in":649,"tokens_out":456,"duration_ms":5568,"temperature":1.0,"reasoning_tokens":402,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T18:29:56.753971+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find or construct a family of HWP states on n qubits with k=2 (graph states with m=O(n) edges) whose preparation from |0>^n requires circuit depth omega(log n) even when an unbounded number of ancillary qubits is available; this would contradict the claimed O(log n) upper bound. Conversely, exhibiting any k>=2 circuit family with depth o(log binom(n,k)) or size o(binom(n,k)) would refute the claimed lower bounds.","supporting_citations":[],"review_version":1}