{"id":"e842d5bb-ab16-46f9-86bc-5cfb5d7d4740","arxiv_id":"2608.01144","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Exact constant-depth adaptive protocols prepare any Dicke-(n,k) state with O(n^2 + k^2 log^2 n + k n log n log log n) ancillas, and any n-qubit symmetric state with O(n^3 sqrt(log n)) ancillas.","lead":"Constant-depth quantum circuits with measurements and classical feedforward are shown to prepare Dicke states and arbitrary permutation-symmetric states with explicit polynomial ancillary-qubit counts. The work introduces a uniform-subset-superposition primitive and a lifting framework that reduces symmetric-state preparation to Dicke-state preparation.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 2's unproven fixed-point condition η+k−1−d(η)=n is load-bearing for Theorem 1; Appendix A even concedes a possible miss, leaving exactness and the 1/k bound unsupported.","rationale":"The reader's weakest assumption identifies the unproven existence of η with η+k−1−d(η)=n, and I agree that this is the most load-bearing point: Theorem 1's exactness and the 1/k success bound both pass through this fixed point. I do not find a more serious flaw elsewhere. The combinatorial core—ordering by pairwise comparisons, descent-number branching, the lifting offsets, and the dyadic-block erasure—is internally consistent, and the erasure step's 'discard rather than reset' wording is a constant-depth-repairable accounting issue rather than a threat to the target state's purity. The fixed-point concern is real as a proof gap, but I have verified analytically that it does not land as a falsehood: from Eq. (A1), the ratio R_η(d) increases pointwise with η, while R_{η+1}(d+1)≤R_η(d) follows from Eulerian-number log-concavity, so the largest mode moves by at most one per unit increase of η. Consequently F(η)=η+k−1−d(η) is continuous in the discrete sense and sweeps every integer between F(n−k+1)≤n and F(n)≥n, guaranteeing the required fixed point for all n,k. The missing derivation is short and should be added; until then the conditional verdict is appropriate. The reader also flags the coherent erasure step, but this is secondary: after the phase-removal step the index registers are in a known product state |+⟩^{⊗kL}, so applying Hadamards resets them to |0⟩ in constant depth without changing the ancillary-qubit asymptotics. Thus no verdict change is warranted.","tokens_in":22752,"tokens_out":44725,"duration_ms":362289,"concrete_test":"Run an exact integer-arithmetic exhaustive search over all 2≤k≤n≤200: for every η∈[n−k+1,n], compute p(d) from Eq. (A1) using the Eulerian numbers, find the largest mode d(η), and check whether some η satisfies η+k−1−d(η)=n. Independently verify the two ratio inequalities R_{η+1}(d)>R_η(d) and R_{η+1}(d+1)≤R_η(d) for all d and η in the same range. If any (n,k) fails the fixed-point check, Theorem 1 is refuted; if the check and the ratio inequalities both pass, the paper needs only to add the short crossing argument to make Lemma 2 complete.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 1 inherits its exactness and success-probability claims from Lemma 2, and Lemma 2 rests on the assertion that one can choose η∈[n−k+1,n] with η+k−1−d(η)=n, where d(η) is the mode of the descent-number distribution p(d) in Eq. (A1). This fixed-point condition is never proved. The Lemma 2 proof says only that 'a suitable value of η can be found by scanning,' and Appendix A explicitly hedges: 'some suboptimal solutions of d≈d(η) is acceptable if there happens to be no exact match.' If no exact match exists for the mode, then either the protocol outputs USS_{n′,k} for n′≠n, breaking the exactness claim of Theorem 1, or one accepts a non-mode d, in which case the proof's p(d(η))≥1/k bound does not apply and Corollary 2's 1−e^{−c} statement is unsupported. The gap is a genuine fixed-point problem, not a cosmetic detail. It is, however, repairable: setting R_η(d)=p_η(d+1)/p_η(d), Eq. (A1) gives R_{η+1}(d)/R_η(d)>1 and R_{η+1}(d+1)/R_η(d)=A(k,d+2)A(k,d)/A(k,d+1)^2≤1 by log-concavity of the Eulerian numbers. These inequalities imply the largest mode d(η) satisfies d(η+1)−d(η)∈{0,1}, so F(η)=η+k−1−d(η) is nondecreasing with increments 0 or 1. Since F(n−k+1)≤n≤F(n), the fixed point exists for every n,k. Thus the concern is a missing proof rather than a demonstrated counterexample, but the paper as written does not supply the proof and its appendix openly contemplates failure.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an adaptive constant-depth protocol for exact preparation of Dicke states and, via a lifting theorem, arbitrary symmetric states. The main primitive is the uniform subset superposition (USS), prepared by generating k independent uniform registers, measuring pairwise comparisons to induce an ordering, and applying classically computed offsets so that each measurement branch with descent number d yields USS_{η+k-1-d,k}. The authors claim Theorem 1: exact Dicke-(n,k) preparation in O(1) quantum depth with O(n^2+k^2 log^2 n+kn log n log log n) ancillary qubits and success probability at least 1/k, with parallel repetition reducing the failure probability to e^{-c}. They also prove Theorem 2, a lifting framework that coherently combines clean unitary Dicke circuits to prepare arbitrary symmetric states, and combine it with Ref. [36] to obtain Corollary 3: exact constant-depth symmetric-state preparation with O(n^3 sqrt(log n)) ancillary qubits. The paper includes detailed resource accounting, a correction to prior width estimates, and an appendix analyzing the descent-number distribution p(d) via Eulerian numbers.","tokens_in":23097,"tokens_out":9143,"duration_ms":86647,"significance":"If the central claims hold, the paper offers a genuinely new mechanism—ordering by intermediate measurement as an alternative to Grover-based filtering—and a general reduction from symmetric-state preparation to unitary Dicke-state preparation that is of independent interest. The USS primitive is also relevant to quantum-walk and topological-data-analysis algorithms. The resource accounting is careful and the success-probability derivation via Eulerian numbers is parameter-free and checks out on small cases; the paper also flags a real discrepancy in a cited width estimate. However, the exactness and success-probability claims of the Dicke protocol depend on an unproven arithmetic fixed-point condition in Lemma 2, and the appendix explicitly contemplates a failure mode. The significance is therefore real but cannot be fully assessed until that gap is closed.","major_comments":[{"comment":"The proof of Lemma 2 asserts that 'a suitable value of η can be found by scanning' the interval n−k+1 ≤ η ≤ n and picking d(η) so that η+k−1−d(η)=n. No proof is given that such an integer exists, and Appendix A explicitly concedes that 'some suboptimal solutions of d≈d(η) is acceptable if there happens to be no exact match.' If no exact match exists, the post-lifting branch produces USS_{n',k} with n'≠n rather than the target USS_{n,k}, so the 'conditioned on success, exact' statement of Theorem 1 fails. Moreover, the proof's lower bound p(d(η))≥1/k uses the mode d(η); selecting a non-mode d invalidates the success-probability bound in Corollaries 1 and 2. This is a load-bearing gap, not a cosmetic issue, and it must be repaired by a proof of existence of the fixed point or by a constructive selection rule that provably satisfies both exactness and the 1/k bound.","section":"III, Lemma 2 and Appendix A, Eq. (A1)"},{"comment":"The threshold-based selection rule in Appendix A does not supply the claimed failure bound. The algorithm returns the first η with p(d~)>p_th for d~=η+k−1−n, and Table IV shows cases where d~ differs from the mode d(η). Since Corollary 1/2 computes α=1/p(d(η)) and then bounds the failure probability by e^{-c}, applying these bounds to a non-mode d~ is unjustified. The paper needs either a theorem that the selected d~ satisfies the exactness condition and p(d~)≥1/k, or a revision that separates the conjectural numerical discussion from the rigorous statements.","section":"III, Corollaries 1–2 and Appendix A, threshold rule"},{"comment":"Lemma 5 proves that p(d) is unimodal for fixed η and k, and the surrounding discussion observes that the peak moves with η. However, unimodality plus a moving mode does not by itself imply the existence of η with η+k−1−d(η)=n. The paper should explicitly prove monotonicity of F(η)=η+k−1−d(η), for example by showing that d(η+1)−d(η)∈{0,1} from the log-concavity of the Eulerian numbers, and then use F(n−k+1)≤n≤F(n). Without such an argument, the numerical evidence in Table IV (only four parameter sets) cannot support the exactness claim of Theorem 1.","section":"Appendix A, Lemma 5 and fixed-point discussion"}],"minor_comments":[{"comment":"The displayed summation 'X_{j r1≤···≤j rk}' should be written with explicit bounds and normalization; as typeset it is ambiguous and hard to parse.","section":"III, Eq. (12)"},{"comment":"The expansion contains repeated 'des = 0' terms and the line 'J-register with des = 1' appears to be a typo for 'order-register'; please correct.","section":"Appendix A, Eq. (A2)"},{"comment":"The index convention is inconsistent: Eq. (1) sums over x∈{0,1}^n, while the target-filling and index-erasure procedures index positions 0,...,n−1; a sentence fixing the convention would help the reader.","section":"Throughout"},{"comment":"Several inline formulas (e.g., O(k2 log2n) in the abstract and Table I notes) lose superscripts in the preprint rendering; the final typeset version should use proper math formatting.","section":"Tables and abstract"},{"comment":"The sentence 'After the controlled circuit has been applied' should clarify that the fan-out copies of the control qubits are uncomputed before proceeding to the next layer, since otherwise the per-layer control width could accumulate.","section":"IV, proof of Theorem 2"}],"recommendation":"major_revision","confidential_remarks":"The fixed-point condition in Lemma 2 is the principal substantive obstruction. It appears repairable by a monotonicity argument for F(η)=η+k−1−d(η), and the rest of the protocol is carefully argued, so I would support acceptance after that proof is supplied and the appendix's hedged language is removed from the rigorous claims. The authors might also be asked to verify that Ref. [36], which underpins Corollary 3, is sufficiently established for citation as a 'recent constant-depth construction'; the manuscript itself is honest about the fact that its own adaptive protocol cannot be used as a clean subcircuit in the lifting framework."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing to know: this paper gives a genuinely different constant-depth route to Dicke states. Instead of Grover filtering, it prepares a uniform superposition over ordered k-element subsets using adaptive relative-order measurements, then converts that to the Dicke state and erases the index. The lifting framework (Theorem 2) cleanly separates unitary Dicke preparation from coherent symmetric-state assembly, which is a useful conceptual step. The combinatorial core—the descent-number probability p(d) via Eulerian numbers—checks out on small cases, and the unimodality argument is sound. The paper also does a service by flagging the resource discrepancy in Ref [30]'s Hammingweight width.\n\nThe main protocols are probably correct, but two things need attention before I'd call Theorem 1 airtight. First, Lemma 2 asserts—without proof—that the most probable descent mode d(η) satisfies η + k − 1 − d(η) = n for some η in the allowed interval. The appendix openly says a suboptimal d 'is acceptable' if no exact match exists, which would change the output to a different USS_{n',k}. I believe the fixed-point condition actually always holds: log-concavity of the Eulerian numbers plus monotonicity of the ratio imply d(η+1) − d(η) is 0 or 1, so the function η + k − 1 − d(η) increments by steps of at most 1 and crosses n. But the paper doesn't prove that, and the appendix's hedge suggests the authors didn't see the easy argument. This is a missing proof, not a counterexample. A referee should ask for it.\n\nSecond, the index-erasure step: the text says the register is reset to |0>, but the described procedure leaves it in Σ_i |i>, which is a fixed product state. You can discard or measure-and-reset that register, so it's not a real problem, but the notation and wording should be tightened.\n\nCorollary 3 rests on the cited Ref [36] unitary Dicke construction; that's standard practice, though it means the symmetric-state corollary inherits whatever scrutiny that paper doesn't pass.\n\nWho's this for? People working on shallow adaptive circuits and state-preparation primitives. The USS as an independent state is a nice contribution. It deserves a serious referee, with a request to fill the η proof and clean up the erasure step.","headline":"Genuinely new adaptive ordering route to constant-depth Dicke and symmetric state preparation; the main gap is a repairable missing proof in Lemma 2, so this deserves a serious referee but not unconditional acceptance yet.","tokens_in":23666,"tokens_out":5377,"would_cite":true,"duration_ms":49831,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68"],"pacs":["03.67.-a","03.67.Lx"],"model":"deepseek-v4-flash","headline":"This paper establishes that every Dicke state, and with a further lifting step every permutation-symmetric state, can be prepared exactly by constant-depth adaptive circuits using polynomial ancillary qubits, with the uniform subset…","keywords":["adaptive quantum circuits","constant-depth state preparation","Dicke states","symmetric states","uniform subset superposition","ancillary qubits","classical feedforward","Eulerian numbers"],"falsifier":"Fix any $(n,k)$ and compute $p(d)=A(k,d)\\binom{\\eta+k-1-d}{k}/\\eta^k$ for all $\\eta\\in[n-k+1,n]$ and all $d$ using the Eulerian-number recursion $A(k,d)=(k-d)A(k-1,d-1)+(d+1)A(k-1,d)$; check whether there is an $\\eta$ whose mode $d(\\eta)$ equals $\\eta+k-1-n$. A single $(n,k)$ with no such $\\eta$ would show that the exactness statement of Theorem 1 does not follow from the given proof.","tokens_in":22487,"feed_emoji":"⚛️","tokens_out":10192,"duration_ms":81237,"temperature":0.7,"pith_summary":"The paper's goal is to show that measurements and classical feedforward make exact state preparation much shallower than purely unitary circuits: every Dicke state $|D_n^k\\rangle$, and in fact every $n$-qubit permutation-symmetric state, can be produced exactly in constant quantum depth using only polynomial ancillary qubits. The construction goes through a new primitive, the uniform subset superposition $|\\mathrm{USS}_{n,k}\\rangle$, an equal-weight coherent encoding of all $k$-element subsets as ordered tuples. The authors prove that $|\\mathrm{USS}_{n,k}\\rangle$ itself is preparable in constant adaptive depth with $O(k^2\\log^2 n)$ ancillary qubits and success probability at least $1/k$, and that this suffices for exact Dicke states with $O(n^2+k^2\\log^2 n+kn\\log n\\log\\log n)$ ancillary qubits. A separate lifting theorem converts any clean unitary Dicke-state circuit of depth $O(L)$ and width $\\xi$ into a symmetric-state circuit of depth $O(L)$ and width $O(n^2\\log n+n\\xi)$; combined with a recent unitary construction, this prepares arbitrary symmetric states in constant depth with $O(n^3\\sqrt{\\log n})$ ancillary qubits. If correct, these results replace logarithmic-depth lower-bound intuition with a constant-depth adaptive route for a broad class of metrologically and algorithmically relevant states.","feed_headline":"Constant-depth circuits prepare all Dicke states exactly","feed_subtitle":"Ordering trick yields uniform subset superpositions, lifts preparation to symmetric states with polynomial overhead.","key_machinery":"The central object is the uniform subset superposition $|\\mathrm{USS}_{n,k}\\rangle$, whose basis states are ordered tuples $0\\le j_1<\\cdots<j_k\\le n-1$; it is also the uniform vertex state of the Johnson graph. The load-bearing mechanism is an adaptive ordering filter: the protocol creates $k$ independent uniform superpositions over $\\{0,\\ldots,\\eta-1\\}$, evaluates all pairwise comparisons, measures the comparison outcomes, and reads off each element's rank. For a rank permutation with $d$ descents (drops between consecutive ranks), the branch is lifted by adding offsets $a_i=|\\{s<i:r_s<r_{s+1}\\}|$, producing a strict chain whose endpoint is $|\\mathrm{USS}_{\\eta+k-1-d,k}\\rangle$. The probability of each descent count is $p(d)=A(k,d)\\binom{\\eta+k-1-d}{k}/\\eta^k$, where $A(k,d)$ are Eulerian numbers, the counts of permutations with exactly $d$ descents; choosing $\\eta$ so that the most probable branch satisfies $\\eta+k-1-d(\\eta)=n$ yields the target USS. All comparison, addition, filling, and erasure steps are constant-depth adaptive circuits built from unbounded fan-out and classical feedforward.","core_discovery":"On the paper's own terms, the discovery is a constructive exact reduction: constant-depth adaptive computation can prepare $|D_n^k\\rangle$ by first preparing $|\\mathrm{USS}_{n,k}\\rangle$, using the ordered indices to write the excitations into a target register, and then coherently erasing the index register. The USS preparation is the main new ingredient: $k$ uniform index registers over a larger alphabet are compared pairwise, the comparison outcomes are measured, and the resulting branch, labelled by the descent count $d$ of the rank permutation, is lifted by adding fixed offsets to become exactly $|\\mathrm{USS}_{\\eta+k-1-d,k}\\rangle$. Postselecting on the most probable descent count, whose probability is at least $1/k$, gives the target USS and hence the Dicke state. The second contribution is a lifting theorem: any family of clean unitary Dicke-state preparation circuits of depth $O(L)$ and width $O(\\xi)$ yields exact preparation of arbitrary symmetric states at depth $O(L)$ and width $O(n^2\\log n+n\\xi)$, and with the current best unitary construction this becomes constant depth and $O(n^3\\sqrt{\\log n})$ qubits.","pith_inferences":["The exact-match condition $\\eta+k-1-d(\\eta)=n$ is a purely classical arithmetic statement about Eulerian-number distributions; it can be checked exhaustively by polynomial-time dynamic programming, so the protocol's exactness is decidable independently of the quantum circuit.","If no exact match exists for some $(n,k)$, the paper's stated fallback of accepting suboptimal descent numbers would output $|\\mathrm{USS}_{n',k}\\rangle$ for some $n'\\neq n$, which is not the target Dicke state; a rigorous theorem would need to prove existence or relax the exactness claim.","A deterministic unitary USS preparation in constant depth would remove postselection entirely and allow the USS to be controlled coherently, which, by the lifting theorem, would yield deterministic symmetric-state preparation independent of the cited unitary Dicke construction.","The adaptive ordering technique may transfer to other combinatorial superposition states beyond Dicke states, such as Schur-basis or symmetry-resolved sectors, by replacing the comparison-and-descent filter with the appropriate symmetry measurement."],"forward_implications":["For every $n$ and $k\\le n$, the Dicke state $|D_n^k\\rangle$ can be produced exactly by a $O(1)$-depth adaptive circuit with $O(n^2+k^2\\log^2 n+kn\\log n\\log\\log n)$ ancillary qubits and success probability at least $1/k$.","Parallel repetition suppresses the failure probability to $1-e^{-c}$ using $O(c\\alpha k^2\\log^2 n)$ ancillary qubits without increasing the quantum depth.","Any $n$-qubit permutation-symmetric state can be prepared exactly in constant depth with $O(n^3\\sqrt{\\log n})$ ancillary qubits, assuming the paper's cited unitary Dicke-state construction.","Through the lifting theorem, any improvement in clean unitary Dicke-state preparation automatically improves the ancilla cost for arbitrary symmetric-state preparation.","The uniform subset superposition itself becomes a constant-depth primitive for Johnson-graph quantum walks and for the uniform set-register superpositions used in topological-data-analysis algorithms."],"supporting_citations":[{"why":"Supplies Lemma 1 for constant-depth uniform superposition over $q$ basis states and the standard filling and erasure constructions that the Dicke protocol adapts.","marker":"[30]"},{"why":"Provides the exact constant-depth implementations of OR, AND, equality, Hammingweight, fan-out, and the collapse result used throughout the comparison and erasure stages.","marker":"[28]"},{"why":"Provides the recent constant-depth unitary Dicke-state construction that Corollary 3 composes with the lifting theorem for symmetric states.","marker":"[36]"},{"why":"Supplies Lemma 3, the constant-depth preparation of arbitrary one-hot superpositions, used in step 1 of the symmetric-state lifting framework.","marker":"[26]"},{"why":"Supplies the deterministic Grover-search amplitude amplification inside Lemma 1 that restricts a uniform superposition to the first $q$ basis states.","marker":"[45]"}],"fun_headline_variants":["Constant-depth adaptive prep for all Dicke and symmetric states","Exact constant-depth adaptive protocol for every Dicke state","Adaptive constant-depth trick prepares all symmetric states","Exact constant-depth circuits for all Dicke and symmetric states"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that for every $n$ and $k$ there is an $\\eta\\in[n-k+1,n]$ whose most probable descent count $d(\\eta)$ satisfies $\\eta+k-1-d(\\eta)=n$; the paper scans for such an $\\eta$ and, if none is found, accepts an approximate match, which would prepare $|\\mathrm{USS}_{n',k}\\rangle$ for a different $n'$ instead of the announced exact Dicke state.","fun_headline_variants_meta":{"raw":{"variants":["Constant-depth adaptive prep for all Dicke and symmetric states","Exact constant-depth adaptive protocol for every Dicke state","Adaptive constant-depth trick prepares all symmetric states","Exact constant-depth circuits for all Dicke and symmetric states"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001015,"raw_usage":{"total_tokens":4332,"prompt_tokens":1039,"completion_tokens":3293,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":655,"completion_tokens_details":{"reasoning_tokens":3227}},"tokens_in":655,"tokens_out":3293,"duration_ms":21797,"temperature":1.0,"reasoning_tokens":3227,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T15:14:40.276240+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Fix any $(n,k)$ and compute $p(d)=A(k,d)\\binom{\\eta+k-1-d}{k}/\\eta^k$ for all $\\eta\\in[n-k+1,n]$ and all $d$ using the Eulerian-number recursion $A(k,d)=(k-d)A(k-1,d-1)+(d+1)A(k-1,d)$; check whether there is an $\\eta$ whose mode $d(\\eta)$ equals $\\eta+k-1-n$. A single $(n,k)$ with no such $\\eta$ would show that the exactness statement of Theorem 1 does not follow from the given proof.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Lemma 1 for constant-depth uniform superposition over $q$ basis states and the standard filling and erasure constructions that the Dicke protocol adapts."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the exact constant-depth implementations of OR, AND, equality, Hammingweight, fan-out, and the collapse result used throughout the comparison and erasure stages."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the recent constant-depth unitary Dicke-state construction that Corollary 3 composes with the lifting theorem for symmetric states."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Lemma 3, the constant-depth preparation of arbitrary one-hot superpositions, used in step 1 of the symmetric-state lifting framework."}],"review_version":2}