{"id":"89cfb1b8-cd5e-43a8-b987-b5332b00ab0d","arxiv_id":"2501.09610","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":2.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The PTM logical states are the even and odd parity superposition states, so the paper's error correction and noise-resistance results reduce to standard parity-code facts.","lead":"This paper defines quantum states from the Prouhet-Thue-Morse sequence and claims they help with quantum error correction, memory storage, and computing the Riemann zeta function. A generalist might read it to see how a 19th-century binary pattern connects to quantum computing, but the states turn out to be well-known parity states in disguise.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Robust-memory claim conflicts with the paper's own dephasing model: logical coherence between PTM states decays under Eq. (23), so the memory robustness is unsubstantiated.","rationale":"The reader's verdict is CONDITIONAL, and the reader's weakest_assumption identified the restrictive dephasing-only noise model. My concern is closely related but sharper: under the paper's own pure-dephasing model in Eq. (23), the logical superposition of PTM states is not shown to be preserved at all. The memory claim in Section 3.2 is based on first-order insensitivity to global magnetic fields (Property 1.2.1 and 1.2.3), not on the open-system dynamics that the paper itself formulates. Therefore the abstract's 'robust encoding' is an overclaim unless active error correction is integrated into the memory protocol, which the paper does not do. The mathematical properties (Knill-Laflamme for phase flips, X-X eigenstate invariance) appear correct, so the central technical content stands; the issue is the scope of the robustness claim. This does not change the CONDITIONAL verdict, but it strengthens the reason for conditioning: the memory claim should be explicitly limited to the X-X interaction Hamiltonian and global-field insensitivity, or accompanied by a fidelity analysis under the Eq. (23) dynamics. I partially agree with the reader because they focus on the absence of analysis for bit-flip/amplitude-damping channels, whereas I find a gap even for the dephasing channel actually assumed.","tokens_in":19336,"tokens_out":13434,"duration_ms":126949,"concrete_test":"Numerically solve Eq. (23) for N=3 with gamma_k = gamma, H = g sum S_x^k S_x^{k+1}, initial logical state |psi> = (|0_TM> + |1_TM>)/sqrt(2), and compute the logical fidelity F(t) = <psi|rho(t)|psi>. If F(t) decays to ~1/2 on a timescale ~1/gamma, the memory is not robust without active QEC; the paper should then either provide a QEC protocol integrated with the X-X chain or substantially temper the memory claim. This test directly checks the central 'robust encoding' assertion under the paper's own assumptions.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim of a 'robust encoding of quantum memories' in X-X Ising systems is not supported by its own open-system analysis. In Section 2.1, the master equation (23) has local dephasing L_k = S_z^k. For any superposition alpha|0_TM> + beta|1_TM>, the off-diagonal elements between computational basis states from E(N) and O(N) decay, so the logical coherence <0_TM|rho|1_TM> is lost on a timescale ~1/gamma. The paper itself states that if the initial state includes eigenstates from both sets, the final state becomes a mixture of all eigenstates, i.e., the memory decoheres. Section 3.2's 'noise-resistant memory' claim instead relies on Property 1.2.1/1.2.3, which are statements about expectation values of total spin operators (first-order insensitivity to global fields), not about local dephasing. The invariance under X-X rotations (Property 1.2.4, Section 1.4) shows the Hamiltonian is harmless, but it does not counteract the dissipator, since H_X does not commute with L_k. Thus, without active error correction (which Section 3.1 discusses only in the circuit model, not applied to the memory), the proposed memory is not robust under the very noise model the paper introduces. The abstract's 'robust encoding' therefore overclaims what is actually demonstrated.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces two logical states, |0_TM^(N)> and |1_TM^(N)>, formed by equal-amplitude superpositions over the even-parity (E(N)) and odd-parity (O(N)) computational basis states determined by the Prouhet-Thue-Morse sequence. It proves several algebraic properties of these states: vanishing expectation values of total spin operators, Knill-Laflamme-type conditions for products of σ_z operators, and invariance under pair flips σ_x^(k)σ_x^(j). These properties are then used to discuss quantum error correction, a proposed noise-resistant quantum memory in X-X Ising chains, connections to the Walsh-Hadamard transform and the quantum baker's map, and a scheme to measure the Riemann zeta function via states with power-law coefficients in a logarithmic-spectrum oscillator. The derivations are elementary and mostly correct; the central concern is that the advertised applications, especially the robust-memory claim, are not supported by the paper's own open-system analysis.","tokens_in":19579,"tokens_out":11747,"duration_ms":107089,"significance":"If the results were fully established, the paper would offer a compact encoding perspective on phase-flip error correction and on the symmetries of X-X Ising chains. The algebraic core is correct: Eq. (33) correctly describes the QFT amplitudes of the difference state, and Property 1.2.2 is a valid verification of the Knill-Laflamme conditions for products of fewer than N σ_z operators. The paper is self-contained and the proofs in Appendix B are checkable. However, the significance is limited by three issues: the QEC code is the standard phase-flip code, the robust-memory claim is contradicted by the paper's own dephasing model, and the zeta-function proposal is a restatement of a Dirichlet-series identity without a feasibility analysis. These overstatements affect the abstract and the conclusion, not just the presentation.","major_comments":[{"comment":"The 'robust encoding of quantum memories' claim is not supported by the paper's own noise model. The master equation (23) contains local dephasing with L_k = S_z^(k); for a logical superposition α|0_TM> + β|1_TM>, the off-diagonal coherences between E(N) and O(N) basis states decay on a timescale ~1/γ, so the logical coherence <0_TM|ρ|1_TM> is lost. The paper itself states in Section 2.1 that 'if the initial state includes eigenstates from both sets, the final state will be a mixture of all eigenstates.' Property 1.2.1 and the matrix representations in Eq. (26) only establish first-order insensitivity to global magnetic fields, not robustness to the Lindblad dephasing introduced in Eq. (23). The invariance under X-X rotations (Property 1.2.4, Section 1.4) does not protect the memory because H_X does not commute with L_k. The abstract's 'robust encoding' should be withdrawn or explicitly restricted to closed-system Hamiltonian perturbations, or an active error-correction analysis for the memory setting must be supplied.","section":"Sec. 2.1, Eq. (23); Sec. 3.2, Eq. (26)"},{"comment":"The error-correction claim is misstated. Property 1.2.2 verifies the Knill-Laflamme conditions for every product of fewer than N σ_z operators. This means that up to N-1 single-qubit phase-flip errors are detectable, and, because E_a†E_b for two errors of weight ≤ t is a product of at most 2t σ_z operators, up to floor((N-1)/2) errors are correctable. The sentence 'up to (N-1)/2 single-qubit phase flip errors are detectable' should read 'up to floor((N-1)/2) errors are correctable, and up to N-1 errors are detectable.' The distinction matters because the N=3 circuit in Fig. 5 corrects one error, which matches the correctability bound, but the stated detectability bound of (N-1)/2 would incorrectly suggest that only one error can be detected for N=3.","section":"Sec. 3.1, Property 1.2.2"},{"comment":"The zeta-function measurement is not demonstrated as a feasible quantum protocol. The proposal relies on preparing the infinite superpositions |ψ1> and |ψ2> in Eq. (37), with amplitudes t_n (n+1)^{-σ/2}, in a logarithmic-spectrum oscillator, and no truncation, state-preparation, or measurement-error analysis is given. The 'exact value of ζ(s)' obtained from the conjugate autocorrelation is a restatement of the Dirichlet-series identity ζ(s)=(1+1/2^s)Σ_{n≥1} t_{n-1}/n^s + (1-1/2^s)Σ_{n≥1} t_n/n^s, not a new algorithmic result. If the claim is only an in-principle correspondence, the text should say so explicitly; otherwise the resource requirements and finite-dimensional truncation errors should be analyzed.","section":"Sec. 3.4, Eqs. (37)-(38)"}],"minor_comments":[{"comment":"The index range '∀k, j < N' should be '1 ≤ k,j ≤ N' for consistency with the notation in Eq. (17).","section":"Sec. 1.2, Property 1.2.4"},{"comment":"The title 'PTM states as eigenvalues of Sx' should read '... as eigenstates of Sx'; the states are eigenstates, not eigenvalues.","section":"Sec. 1.5"},{"comment":"The index range in the definition of the QFT gate is stated as '0 ≤ j,k < N'; since the gate acts on N qubits, the correct range is 0 ≤ j,k < 2^N.","section":"Sec. 3.3, Eq. (27)"},{"comment":"The initial states are written as |ψ±(0)> = 1/√2 (|(0)_2> ± |(N)_2>), but the context of Eq. (24) indicates the second state should be |(2^N - 1)_2>, the all-ones state.","section":"Fig. 3 caption"},{"comment":"The caption calls the circuit 'Shor's 3-qubit phase-flip error correction code'; the 3-qubit phase-flip code is distinct from Shor's 9-qubit code, so the attribution should be corrected to avoid confusion.","section":"Sec. 3.1, Fig. 4"},{"comment":"The qudit generalization should explicitly restrict d to a power of two (d = 2^N) before defining the PTM states with the prefactor sqrt(2/d), since the equal-size property of E(N) and O(N) used for normalization holds only in that case.","section":"Sec. 3.1, Eq. (25)"},{"comment":"The conclusion states that the logical states exhibit 'resilience to spin flip errors'; the supported property is resilience to phase-flip (σ_z) errors, not spin-flip (σ_x) errors, and the wording should be amended.","section":"Conclusion"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is an elementary compilation of known properties of the Prouhet-Thue-Morse sequence applied to the phase-flip code; the mathematical checks are correct, but the abstract and conclusion substantially overstate the demonstrated results. The robust-memory claim in particular is contradicted by the paper's own dephasing model and must be corrected before the paper can be considered for publication. After such a revision, the paper could be a modest but acceptable contribution to a pedagogically oriented venue, provided the remaining overstatements are also softened."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take. The paper is a well-organized catalog of properties of states it calls PTM states, which are the even/odd parity uniform superpositions — the same states that appear in the phase-flip code as GHZ/cat states in the Hadamard basis. The derivations are elementary and, where I checked, correct. Property 1.2.4 (invariance under two bit flips) is just parity preservation; the Knill-Laflamme check in Property 1.2.2 is right, though the text says 'detectable' when it means 'correctable' for the stated distance. The zeta-function measurement in Section 3.4 is a direct variant of Feiler-Schleich, using the Dirichlet series identity for the PTM sequence; it works as a restatement, but the feasibility of preparing the power-law superposition states is not discussed.\n\nThe bigger problem is the abstract's 'robust encoding of quantum memories' in X-X Ising systems. The stress-test note is correct. Section 2.1 introduces a master equation with local dephasing L_k = S_z^{(k)}. For any logical superposition alpha|0_TM> + beta|1_TM>, the computational-basis components live in both E and O, and the dissipator kills the off-diagonal coherence between those sets. The state decoheres on a timescale ~1/gamma. The paper's own text says exactly this: if the initial state includes eigenstates from both sets, the final state is a mixture of all eigenstates. Section 3.2's 'noise-resistant memory' claim instead leans on Property 1.2.1, which is about expectation values of total spin operators — that covers uniform global fields, not local dephasing. The X-X invariance doesn't help, since H does not commute with the L_k. So the central advertised application is unsubstantiated by the paper's own model.\n\nThat said, the paper is not sloppy at the level of the math. The proofs in the appendices are honest, and the conclusion even admits the novelty is 'tempered.' A careful reader will recognize the parity-state equivalence; the authors should be pushed to make that equivalence explicit and retract the memory claim or supply a real error-correction protocol for the memory.\n\nRecommendation: send to peer review, but expect major revision. The referee should focus on the robustness claim and the novelty framing. This is a borderline case — a desk reject for lack of novelty would not be unreasonable — but the material is sound enough to warrant referee time, and any competent referee will catch the issues above.","headline":"Correct but mostly a rename: the PTM states are the standard parity GHZ states, and the paper's own dephasing model undercuts its central robust-memory claim.","tokens_in":20172,"tokens_out":2677,"would_cite":false,"duration_ms":26109,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68","81P70","11B83","11M06"],"pacs":["03.67.Pp","03.67.Lx","05.45.Mt"],"model":"deepseek-v4-flash","headline":"Prouhet–Thue–Morse states form a phase-flip error-correcting code and a noise-resistant memory in X-X Ising chains.","keywords":["Prouhet-Thue-Morse sequence","quantum error correction","Knill-Laflamme conditions","X-X Ising model","quantum memory","dephasing noise","Walsh-Hadamard transform","Riemann zeta function"],"falsifier":"Prepare $|0_{\\mathrm{TM}}^{(N)}\\rangle$ in an X-X Ising chain, inject a single bit-flip or amplitude-damping error, and compare the decoded logical fidelity with the no-error case; if it decays like an unencoded qubit, the claimed protection is absent. Alternatively, compute the Knill–Laflamme matrix element for a product of all $N$ Pauli $\\sigma_z$ operators: if the diagonal entries for $|0_{\\mathrm{TM}}^{(N)}\\rangle$ and $|1_{\\mathrm{TM}}^{(N)}\\rangle$ differ, the protection stops below $N$ phase flips exactly as the paper's $M<N$ condition states.","tokens_in":19111,"feed_emoji":"⚛️","tokens_out":11257,"duration_ms":96042,"temperature":0.7,"pith_summary":"This paper argues that the binary Prouhet–Thue–Morse sequence, the parity of the binary digit sum, defines two many-qubit logical states with a natural place in quantum computing. The states are equal superpositions over the indices whose Thue–Morse bit is 0 and over those whose bit is 1. The paper shows that these states satisfy the Knill–Laflamme conditions for products of fewer than $N$ phase-flip operators, making up to $(N-1)/2$ single-qubit phase-flip errors detectable and, with ancillas, correctable. It also shows that every X-X spin coupling acts on the two states by a common global phase, so an X-X Ising chain adds no relative decoherence, and that under pure $S_z$ dephasing the Thue–Morse bit is an indicator function confining the mixture to one parity class. On this basis the paper proposes a robust encoding of quantum memories in X-X Ising systems, and it connects the same states to multifractal spectra and to the Riemann zeta function.","feed_headline":"Thue–Morse states guard quantum memory against phase-flip noise","feed_subtitle":"Two logical states built from the Prouhet–Thue–Morse sequence satisfy error-correction conditions and stay robust in X-X Ising chains.","key_machinery":"The load-bearing object is the PTM logical-state pair, $|0_{\\mathrm{TM}}^{(N)}\\rangle \\propto \\sum_{e\\in E(N)} |e\\rangle$ and $|1_{\\mathrm{TM}}^{(N)}\\rangle \\propto \\sum_{o\\in O(N)} |o\\rangle$, where $E(N)$ and $O(N)$ split the first $2^N$ indices by the parity of their binary digit sum. The equal-power-sum identity between these two index sets, the Prouhet–Tarry–Escott property, is what makes the diagonal error expectations equal, and the fact that flipping two qubits preserves the parity class is what makes the states eigenstates of X-X rotations. The Hadamard transform converts $|0\\ldots0\\rangle$ and $|1\\ldots1\\rangle$ into symmetric and antisymmetric combinations of the two PTM states, giving a preparation circuit, while the Lindblad evolution under $S_z$ dephasing preserves each parity class, so the PTM bit functions as the indicator of which mixture survives.","core_discovery":"The central claim is that the two PTM logical states $|0_{\\mathrm{TM}}^{(N)}\\rangle$ and $|1_{\\mathrm{TM}}^{(N)}\\rangle$, built from the equal-power-sum split of the first $2^N$ Thue–Morse indices, form a protected code subspace in an X-X Ising spin chain. For any product of fewer than $N$ Pauli $\\sigma_z$ operators on distinct qubits, the diagonal matrix elements for the two states agree and the off-diagonal elements vanish (Property 1.2.2); the paper identifies this as the Knill–Laflamme condition, so up to $(N-1)/2$ single-qubit phase-flip errors are detectable and, given ancillas, correctable. Every X-X rotation $e^{i\\theta \\sigma_x^{(k)}\\sigma_x^{(j)}}$ leaves each PTM state unchanged up to the same global phase, making the encoded subspace transparent to the X-X Ising Hamiltonian. The two states are also exchanged by $S_x$, the Hadamard transform maps them from simple computational-basis superpositions, and the same Prouhet–Tarry–Escott identity extends the construction to qudits.","pith_inferences":["The protection is tied to the dephasing channel $L_k \\propto S_z^{(k)}$; simulating bit-flip or amplitude-damping noise on the same encoding would likely show rapid loss of logical fidelity, since the proof uses only diagonality of $\\sigma_z$.","Because every pair of $\\sigma_x$ flips stabilizes the code space, concatenating the PTM encoding with a stabilizer code that handles $X$ errors might cover both error types, but the paper does not analyze such a concatenation.","The qudit version of the construction suggests a family of high-dimensional encodings whose noise-detection order grows with $\\log_2 d$, but no decoding circuit or resource count is given.","The proposed $\\zeta(s)$ measurement could be benchmarked classically for small $N$ by simulating the stated superposition states and checking that the computed autocorrelation matches $\\zeta(s)$ to the expected precision."],"forward_implications":["Encoding one logical qubit as $\\alpha|0_{\\mathrm{TM}}^{(N)}\\rangle + \\beta|1_{\\mathrm{TM}}^{(N)}\\rangle$ in an X-X Ising chain with pure dephasing preserves the logical information, because all X-X couplings contribute only a global phase.","Phase-flip errors on up to $(N-1)/2$ qubits are detectable and, with ancillas, correctable, because the PTM states meet the Knill–Laflamme conditions.","The PTM encoding removes first-order sensitivity to uniform external fields along any axis, and superposition states are additionally insensitive to $y$ and $z$ magnetic-field noise.","Applying the quantum Fourier transform to a PTM state yields self-similar, multifractal amplitude profiles, linking the sequence to approximate eigenstates of the quantum baker's map.","The PTM-weighted Dirichlet-series identity for the Riemann zeta function suggests a two-state interference measurement in a logarithmic-spectrum oscillator whose autocorrelation returns $\\zeta(s)$."],"supporting_citations":[{"why":"Supplies the Knill–Laflamme error-correction conditions that the PTM states are claimed to satisfy for phase-flip errors.","marker":"[12]"},{"why":"Provides the Prouhet–Tarry–Escott equal-power-sum result used to equalize the diagonal error matrix elements of the two PTM states.","marker":"[10]"},{"why":"Gives the single-qubit Hamiltonian whose evolution realizes the Hadamard gate, used in the proposed preparation of PTM states from GHZ-type states.","marker":"[11]"},{"why":"Shows that a PTM-modified Walsh–Hadamard row appears in approximate eigenstates of the quantum baker's map, grounding the quantum-chaos connection.","marker":"[16]"},{"why":"Extends the PTM and quantum-Fourier-transform connection used to discuss quantum chaos in circuits such as Shor's algorithm.","marker":"[17]"},{"why":"Provides the interference scheme for evaluating Dirichlet-series sums that the paper adapts to measure the Riemann zeta function with PTM-weighted superpositions.","marker":"[21]"},{"why":"Supplies the logarithmic-spectrum oscillator model used in the proposed zeta-function measurement protocol.","marker":"[22]"},{"why":"Gives the interaction-picture Hamiltonian used to write the zeta-function autocorrelation measurement in the two-state protocol.","marker":"[23]"}],"fun_headline_variants":["PTM codes shield quantum memory from phase-flip errors","Thue-Morse sequence fortifies quantum error correction","Quantum memory hardened by Thue-Morse symmetry","Phase-flip errors corrected with Thue-Morse codes","Prouhet-Thue-Morse qubits resist noise in Ising chains"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire memory-protection and error-correction case assumes the only noise acting on each qubit is pure phase-flip dephasing along $z$; if bit-flip or amplitude-damping errors are present the PTM states are not shown to be protected, and the zeta measurement additionally assumes that power-law superposition states can be prepared in a logarithmic-spectrum oscillator.","fun_headline_variants_meta":{"raw":{"variants":["PTM codes shield quantum memory from phase-flip errors","Thue-Morse sequence fortifies quantum error correction","Quantum memory hardened by Thue-Morse symmetry","Phase-flip errors corrected with Thue-Morse codes","Prouhet-Thue-Morse qubits resist noise in Ising chains"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000494,"raw_usage":{"total_tokens":2418,"prompt_tokens":934,"completion_tokens":1484,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":550,"completion_tokens_details":{"reasoning_tokens":1402}},"tokens_in":550,"tokens_out":1484,"duration_ms":11146,"temperature":1.0,"reasoning_tokens":1402,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T19:51:42.252248+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Prepare $|0_{\\mathrm{TM}}^{(N)}\\rangle$ in an X-X Ising chain, inject a single bit-flip or amplitude-damping error, and compare the decoded logical fidelity with the no-error case; if it decays like an unencoded qubit, the claimed protection is absent. Alternatively, compute the Knill–Laflamme matrix element for a product of all $N$ Pauli $\\sigma_z$ operators: if the diagonal entries for $|0_{\\mathrm{TM}}^{(N)}\\rangle$ and $|1_{\\mathrm{TM}}^{(N)}\\rangle$ differ, the protection stops below $N$ phase flips exactly as the paper's $M<N$ condition states.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Knill–Laflamme error-correction conditions that the PTM states are claimed to satisfy for phase-flip errors."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the Prouhet–Tarry–Escott equal-power-sum result used to equalize the diagonal error matrix elements of the two PTM states."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the single-qubit Hamiltonian whose evolution realizes the Hadamard gate, used in the proposed preparation of PTM states from GHZ-type states."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows that a PTM-modified Walsh–Hadamard row appears in approximate eigenstates of the quantum baker's map, grounding the quantum-chaos connection."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Extends the PTM and quantum-Fourier-transform connection used to discuss quantum chaos in circuits such as Shor's algorithm."},{"cited_title":"Nonlinearity of the Fidelity in Open Qudit Systems: Gate and Noise Dependence in High-dimensional Quantum Computing","cited_arxiv_id":"2406.15141","evidence_quote":"Supplies the logarithmic-spectrum oscillator model used in the proposed zeta-function measurement protocol."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the interaction-picture Hamiltonian used to write the zeta-function autocorrelation measurement in the two-state protocol."}],"review_version":1}