REVIEW 3 major objections 5 minor 19 references
A dynamical algebra of protocol-induced transformations on Dicke states
T0 review · 3 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash
Pith's one-line read This paper shows that two elementary measurement protocols for adding or removing a qubit from a symmetric state induce ladder operators realizing the Weyl algebra $W(2)$, and that their composition yields an $\mathfrak{su}(2)$…
desk verdict A genuinely useful W(2) framing of two Dicke-state protocols, undercut by missing central and sign terms in the composition and diagonalization results; worth review after correction. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the two-mode Weyl algebra $W(2)$, with generators $a_1,a_2,a_1^\dagger,a_2^\dagger$ acting on the Dicke basis as $a_1|D_i^n\rangle=\sqrt{n-i}|D_i^{n-1}\rangle$, $a_2|D_i^n\rangle=\sqrt{i}|D_{i-1}^{n-1}\rangle$, $a_1^\dagger|D_i^n\rangle=\sqrt{n+1-i}|D_i^{n+1}\rangle$, $a_2^\dagger|D_i^n\rangle=\sqrt{i+1}|D_{i+1}^{n+1}\rangle$. These obey $[a_i,a_j^\dagger]=\delta_{ij}$ and all other commutators vanish, so Protocol 1 is a combination of annihilators and Protocol 2 a combination of creators. The algebra carries the argument because it turns the probabilistic protocol outcomes into linear operators on $\mathcal{D}$, and its $\mathfrak{su}(2)$ subalgebra supplies the diagonalization of $P_1P_2$ whose eigenvectors are Krawtchouk-labeled fixed points.
What would settle it
Run Protocol 2 on the two-qubit Dicke state $|D_0^2\rangle$ with the Hadamard gate as the one-qubit operation and implement the total-angular-momentum post-selection through quantum phase estimation on the cyclic permutation. The paper's formulas predict the post-selected three-qubit state $(\sqrt{3}/2)|D_0^3\rangle+(1/2)|D_1^3\rangle$; measuring the Dicke-basis populations and comparing them to $3/4$ and $1/4$ would settle the claim. A mismatch would show that the claimed representation is not what the protocol implements.
Extended reading notes
Core claim
Protocol 1 (apply a one-qubit gate, measure one qubit, keep the rest if the outcome is $|0\rangle$) induces, up to normalization, the operator $P_1(\alpha,\beta)=\alpha a_1+\beta a_2$ on the space $\mathcal{D}$ of all Dicke states. Protocol 2 (attach a fresh $|0\rangle$, apply a one-qubit gate, keep the result only if the total angular momentum of the $n+1$ qubits is maximal) induces $P_2(\gamma,\delta)=\gamma a_1^\dagger+\delta a_2^\dagger$. The four generators obey $[a_i,a_j^\dagger]=\delta_{ij}$ with all other commutators zero, so the protocols generate a representation of $W(2)$; the number operator $N=a_1^\dagger a_1+a_2^\dagger a_2$ counts qubits. The composition $P_1P_2$ fixes $N$ and, restricted to the $n$-qubit sector, equals $v_xJ_x+v_yJ_y+v_zJ_z+v_0N$, a complexified $\mathfrak{su}(2)$ action. Diagonalizing this composition yields a basis $B|D_i^n\rangle$ whose Dicke expansion coefficients are Krawtchouk polynomials; when the combined operator is Hermitian, $B$ is a tensor product of identical single-qubit gates.
Load-bearing premise
The whole construction rests on being able to measure the total angular momentum of the enlarged qubit system and keep only the maximal outcome; if that measurement cannot be done reliably for arbitrary $n$, the operator $P_2$ and the Weyl-algebra description stop describing what the protocol actually does.
Editorial extensions
If this is right
- Any totally symmetric $n$-qubit state can be prepared from the vacuum by $n$ successful applications of Protocol 2, with each gate chosen from the roots of the generating polynomial of the target state's Dicke coefficients.
- Repeatedly alternating the two protocols with fixed gates drives an arbitrary symmetric state, up to exponentially small corrections, onto the fixed-point basis $B|D_i^n\rangle$.
- When $P_1P_2$ is proportional to a Hermitian operator, its diagonalizing basis is realized by a tensor product of identical single-qubit gates, $B=(-iU)^{\otimes n}$.
- The Hadamard case, in which all four gate parameters are $1/\sqrt{2}$, recovers the statement that $H^{\otimes n}$ diagonalizes the protocol composition and that the fixed-point basis is the Hadamard transform of Dicke states.
- The algebra gives a parameter dictionary between the gate choices $(\alpha,\beta,\gamma,\delta)$ and the $\mathfrak{su}(2)$ rotation parameters, so composing protocols corresponds to composing rotations.
Reading between the lines
- The authors do not compute the success probabilities of the two protocols, but the algebraic normalization constants contain those acceptance rates; a direct extension is to express the success probability of each composed sequence in terms of $(\alpha,\beta,\gamma,\delta)$ and $n$ and compare it with experiment.
- Because the fixed-point basis is Krawtchouk, a testable application is to engineer symmetric states with a prescribed Hamming-distance profile by choosing gate parameters so that the target lies near a fixed point and letting iteration concentrate the state.
- If Protocol 2 is implemented through quantum phase estimation on the cyclic permutation, the resource count grows with the number of controlled Fredkin gates; the paper does not analyze that overhead, but the algebraic description implies the same circuit can act as a deterministic Dicke-state synthesizer when combined with the root-based preparation.
- The same ladder-operator structure may extend to $q$-Dicke or qudit Dicke states, as the authors suggest; a concrete test would be whether the deformed commutation relations still close into a (possibly $q$-deformed) Weyl algebra.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper considers two measurement-based protocols acting on the subspace of totally symmetric n-qubit states spanned by Dicke states: Protocol 1 removes a qubit after a single-qubit gate and post-selects the |0> outcome, and Protocol 2 adds a qubit in |0>, applies a single-qubit gate, and post-selects on maximal total angular momentum. The authors derive explicit operators P1(alpha,beta) and P2(gamma,delta) for these successful transformations, show that they realize a representation of the two-mode Weyl algebra W(2), and argue that their number-preserving composition yields an action of the complexification of su(2). They diagonalize P1P2 on each Dicke subspace using a basis whose expansion coefficients are Krawtchouk polynomials, and they give applications to Dicke-state preparation from the vacuum and to asymptotic states under repeated iteration. The paper also connects the construction to the Hamming association scheme and the Hadamard transform.
Significance. The paper is a worthwhile algebraic contribution: it identifies a clean W(2) representation behind simple Dicke-state operations, and the explicit formulas for the operators, the Krawtchouk eigenbasis, and the state-preparation construction are transparent and self-contained. The derivation of the W(2) commutation relations in Section 5.1 is sound, and the eigenvector calculation is not invalidated by the issues below. However, the precise operator identification with su(2) and all eigenvalue-dependent statements contain a missing central term, so the central claims need correction before the results can be used as stated. With those corrections, the paper would provide a useful framework for symmetric-state manipulation and a nice illustration of Krawtchouk polynomials in a quantum-information context.
major comments (3)
- [Section 4.3, Eqs. (45)-(48)] The two composition formulas are interchanged relative to the stated operator order, and Eq. (46) is not the coefficient formula for P1(alpha,beta)P2(gamma,delta). Using Eqs. (37) and (44), one obtains P1P2|D_i^n> = [alpha gamma (n+1-i) + beta delta (i+1)] |D_i^n> + beta gamma sqrt{(n-i)(i+1)} |D_{i+1}^n> + alpha delta sqrt{i(n-i+1)} |D_{i-1}^n>, whereas P2P1|D_i^n> has the same off-diagonal terms but diagonal alpha gamma (n-i) + beta delta i. The diagonal written in Eq. (46) is the P2P1 value, and the diagonal written in Eq. (48) is the P1P2 value. The labels and the formula in Eq. (46) should be corrected; this error propagates into the identification made in Eq. (60).
- [Section 5.2, Eqs. (60), (65), (67)] A central constant is omitted in the su(2) identification and in the eigenvalues. Since a1 a1-dagger = N1 + 1 and a2 a2-dagger = N2 + 1, and on D_n one has N1 = N/2 + J_z and N2 = N/2 - J_z, the correct restriction is P1P2|D_n = (alpha gamma - beta delta) J_z + (alpha gamma + beta delta)(N/2 + 1) + off-diagonal terms. Thus Eq. (60) should contain v0 (N + 2I) rather than v0 N. Consequently Eq. (65) should read B^{-1} P1P2 B = (alpha gamma + delta beta)(J_z + N/2 + 1), and Eq. (67) should read lambda_i = (alpha gamma + beta delta)(n + 1 - i). The elementary check alpha = gamma = 1, beta = delta = 0 gives eigenvalue n + 1 - i on |D_i^n>, not n - i. This is load-bearing because Eqs. (77)-(79) and all fixed-point eigenvalue statements depend on lambda_i; the eigenvectors B|D_i^n> and the Krawtchouk coefficients in Eq. (69) survive because the omitted constant cancels in the recurrence (68).
- [Eq. (56)] The commutator [P2, P1] has the wrong sign. Since [a_i-dagger, a_i] = -1, one has [P2(gamma,delta), P1(alpha,beta)] = [gamma a1-dagger + delta a2-dagger, alpha a1 + beta a2] = -(alpha gamma + delta beta). The displayed plus sign is a typographical error, but it should be corrected because this relation is part of the Weyl-algebra identification around Eq. (57).
minor comments (5)
- [Eqs. (1)-(3)] The notation C^{2N} in Eq. (2) should be (C^2)^{otimes n} or C^{2^n}; the symbol N is used for the length in Eq. (1) and for the number operator later, which is confusing.
- [Section 5.1] The two-mode Weyl algebra W(2) is the tensor product W(1) otimes W(1) of two single-mode Weyl algebras, not the direct sum W(1) oplus W(1); the wording should be adjusted to avoid a mathematically incorrect statement.
- [Eq. (63)] The definitions of theta and phi involve sqrt{alpha beta gamma delta} and branch choices. Since the parameters are complex in general, the domain should be specified, or the Euler angles should be expressed directly in terms of the vector (v_x, v_y, v_z) to avoid ambiguity.
- [Appendix B] The quantum phase estimation implementation assumes that phase 0 can be distinguished from the phases 2 pi ell/(n+1) with errors below the gap approx 2 pi/(n+1); the resulting fidelity and qubit overhead are not analyzed. This is an implementation assumption rather than a mathematical error, but it should be stated explicitly as a resource requirement.
- [Eq. (70)] The relation B = (-i U(mu,nu))^{otimes n} should be checked for overall phases; with the stated definitions of mu and nu, the tensor-product form may differ from B on D_n by a global phase.
Circularity Check
No significant circularity: the protocol algebra is derived from explicit operator definitions and verified commutation relations.
full rationale
The derivation is self-contained. The operators P1 and P2 are defined directly from the two measurement protocols in Eqs. (37) and (44), and the Weyl algebra commutation relations in Eqs. (49)-(56) are verified by direct computation on the Dicke-state basis rather than imported from prior work. The su(2) identification in Eqs. (60)-(62) is an algebraic comparison of the computed action of P1P2 with the explicit actions of J_x, J_y, and J_z in Eqs. (21), (22), and (59); the diagonalization in Section 5.3 is carried out within the paper using the Baker-Campbell-Hausdorff formula and the Krawtchouk recurrence. The cited prior works by the same authors, refs. [11], [12], and [14], are used for standard hypercube and Hamming-scheme background and for the Terwilliger algebra, not as the load-bearing justification for the protocol algebra. The fixed-point and Krawtchouk expansion statements are derived from Eqs. (68)-(69) inside the paper. No fitted parameter is renamed as a prediction, no input quantity is defined in terms of the output claim, and no uniqueness or ansatz is imported solely through self-citation. Accordingly, no circular step is exhibited and the score is 0.
Assumptions & free parameters
assumptions (5)
- standard math Dicke states |D_i^n> carry an irreducible spin-n/2 representation of su(2) and form a basis of the fully symmetric subspace
- standard math Clebsch-Gordan decomposition for |j1,m1> tensor |1/2, +/-1/2> as applied in Eq. (39)
- domain assumption The total angular momentum measurement of n+1 qubits can be implemented using quantum phase estimation on the cyclic permutation operator
- standard math Krawtchouk polynomials satisfy the three-term recurrence and self-duality used in Eqs. (29), (68), and (69)
- domain assumption Post-selected successes are treated as ideal projective measurements with no noise or loss
Cite this review
Pith. "Pith review of A dynamical algebra of protocol-induced transformations on Dicke states." pith.science (2026). https://pith.science/paper/DFEOTKKQ
@misc{pith2026241217917,
author = {Pith},
title = {Pith review of: A dynamical algebra of protocol-induced transformations on Dicke states},
year = {2026},
howpublished = {\url{https://pith.science/paper/DFEOTKKQ}},
note = {Machine review of arXiv:2412.17917}
}
abstract
Quantum $n$-qubit states that are totally symmetric under the permutation of qubits are essential ingredients of important algorithms and applications in quantum information. Consequently, there is significant interest in developing methods to prepare and manipulate Dicke states, which form a basis for the subspace of fully symmetric states. Two simple protocols for transforming Dicke states are considered. An algebraic characterization of the operations that these protocols induce is obtained in terms of the Weyl algebra $W(2)$ and $\mathfrak{su}(2)$. Fixed points under the application of the combination of both protocols are explicitly determined. Connections with the binary Hamming scheme, the Hadamard transform, and Krawtchouk polynomials are highlighted.
Figures
Reference graph
Works this paper leans on
-
[1]
Coherence in spontaneous radiation processes,
R. H. Dicke, “Coherence in spontaneous radiation processes,” Physical review 93, 99 (1954)
work page 1954
-
[2]
A quantum approximat e optimization algorithm,
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximat e optimization algorithm,” arXiv preprint arXiv:1411.4028 (2014)
arXiv 2014
-
[3]
Finding cliqu es by quantum adiabatic evolution,
A. M. Childs, E. Farhi, J. Goldstone, and S. Gutmann, “Finding cliqu es by quantum adiabatic evolution,” arXiv preprint quant-ph/0012104 (2000)
arXiv 2000
-
[4]
Deterministic preparation of Dicke states,
A. B¨ artschi and S. Eidenbenz, “Deterministic preparation of Dicke states,” in International Symposium on Fundamentals of Computation Theory , pp. 126–139, Springer. 2019
work page 2019
-
[5]
State preparation by shallow circuits using feed forward,
H. Buhrman, M. Folkertsma, B. Loff, and N. M. Neumann, “State preparation by shallow circuits using feed forward,” Quantum 8, 1552 (2024)
work page 2024
-
[6]
Approximating many-body q uantum states with quantum circuits and measurements,
L. Piroli, G. Styliaris, and J. I. Cirac, “Approximating many-body q uantum states with quantum circuits and measurements,” Physical Review Letters 133, 230401 (2024)
work page 2024
-
[7]
Qudit Dicke state preparation,
R. I. Nepomechie and D. Raveh, “Qudit Dicke state preparation,” arXiv preprint arXiv:2301.04989 (2023)
arXiv 2023
-
[8]
Efficient preparation of Dicke states,
J. Yu, S. R. Muleady, Y.-X. Wang, N. Schine, A. V. Gorshkov, and A. M. Childs, “Efficient preparation of Dicke states,” arXiv preprint arXiv:2411.03428 (2024)
arXiv 2024
Show all 19 references
-
[9]
Low-depth quantum sym metrization,
Z. Liu, A. M. Childs, and D. Gottesman, “Low-depth quantum sym metrization,” arXiv preprint arXiv:2411.04019 (2024)
2024 arXiv
-
[10]
Universal gates for transforming multipartite entangled Dicke st ates,
T. Kobayashi, R. Ikuta, S ¸. K. ¨Ozdemir, M. Tame, T. Yamamoto, M. Koashi, and N. Imoto, “Universal gates for transforming multipartite entangled Dicke st ates,” New Journal of Physics 16, 023005 (2014)
2014
-
[11]
A q-version of the relation between the hypercube, the Krawtchouk chain and Dicke states,
P.-A. Bernard, ´E. Poliquin, and L. Vinet, “A q-version of the relation between the hypercube, the Krawtchouk chain and Dicke states,” Journal of Physics A: Mathematical and Theoretical (2024)
2024
-
[12]
A graph with fractional revival,
P.-A. Bernard, A. Chan, ´E. Loranger, C. Tamon, and L. Vinet, “A graph with fractional revival,” Physics Letters A 382, 259–264 (2018)
2018
-
[13]
The Terwilliger algebra of the hypercube,
J. T. Go, “The Terwilliger algebra of the hypercube,” European Journal of Combinatorics 23, 399–429 (2002)
2002
-
[14]
Entanglement of fr ee fermions on Hamming graphs,
P.-A. Bernard, N. Cramp´ e, and L. Vinet, “Entanglement of fr ee fermions on Hamming graphs,” Nuclear Physics B 986, 116061 (2023)
2023
-
[15]
Perfect transfer of arbitrary states in quantum spin networks,
M. Christandl, N. Datta, T. C. Dorlas, A. Ekert, A. Kay, and A. J. Landahl, “Perfect transfer of arbitrary states in quantum spin networks,” Physical Review A—Atomic, Molecular, and Optical Physics 71, 032312 (2005) . 15
2005
-
[16]
Efficiently constructing a quantum uniform superposition over bit strings near a binary linear code,
E. Farhi and S. P. Jordan, “Efficiently constructing a quantum uniform superposition over bit strings near a binary linear code,” arXiv preprint arXiv:2404.16129 (2024)
2024 arXiv
-
[17]
Entanglement entropy in quasi-symme tric multi-qubit states,
Z.-H. Li and A.-M. Wang, “Entanglement entropy in quasi-symme tric multi-qubit states,” International Journal of Quantum Information 13, 1550007 (2015)
2015
-
[18]
q-analog qudit Dicke states,
D. Raveh and R. I. Nepomechie, “ q-analog qudit Dicke states,” Journal of Physics A: Mathematical and Theoretical 57, 065302 (2024)
2024
-
[19]
Koekoek, P
R. Koekoek, P. A. Lesky, and R. F. Swarttouw, Hypergeometric orthogonal polynomials and their q-analogues. Springer, 2010. 16
2010
Reviewed August 11, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.