{"id":"2b0fecf9-a0f0-4cb3-a6aa-a1feefb2e9a7","arxiv_id":"2505.05468","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"A lifted Solovay-Kitaev argument proves that density of QSP ansätze in function spaces implies the existence of short approximating circuits, with examples for several QSP variants.","lead":"This paper proves a Solovay-Kitaev theorem for quantum signal processing, showing that density of a parameterized circuit ansatz in a function class implies the existence of short approximating circuits. A smart generalist might read it to see a new bridge between quantum gate compilation and quantum signal processing, though the proof has gaps.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Nested commutator cannot be surjective onto S_{ε^{1/4}}(F) because its Π-image vanishes at x=±1; net refinement fails for functions with nonzero endpoint values.","rationale":"The reader identified the surjectivity of the nested commutator as the weakest assumption; this pass agrees and supplies a concrete failure mode: the endpoint behavior of the nested commutator prevents surjectivity onto S_{ε^{1/4}}(F). This is load-bearing because the net-refinement recursion cannot proceed without preimages at every step, and the issue is not repaired by the paper's terse 'boundary conditions' remark, since the required shift is larger than the claimed improvement. The density-theorem concerns raised by the reader are secondary; even if the density assumptions were accepted, the proved lemmas do not yield the central theorem.","tokens_in":43094,"tokens_out":18666,"duration_ms":230362,"concrete_test":"Fix a small ε and target h(x)=ε^{1/4}/2. Numerically search over low-degree symmetric QSP phase lists to minimize sup_{x∈[-1,1]} |Π([[U0,U1],[U0†,U1†]])(x) − h(x)|, where the nested commutator is built from the four conjugated symmetric protocols of Lem. III.4. If the minimal uniform error is Ω(ε^{1/4}) rather than O(ε^{5/4}), the claimed ε^{5/4}-net refinement and the surjectivity assertion of Thm. III.1 step (1) fail for a function in S_{ε^{1/4}}(F(X,ξ)). A simpler analytical check is to evaluate Eq. (50) at x=±1: the overall √(1-x²) factor forces the leading-order Π-image to vanish there, so no bounded, parity-compatible polynomials P0,Q0,P1,Q1 can produce a constant target.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central recursion (Thm. III.1/III.2) requires the nested commutator of Lem. III.4 to be surjective on S_{ε^{1/4}}(F(X,ξ)), the ball of functions with sup-norm ≤ ε^{1/4} in the common QSP function space (Def. III.4). This surjectivity is asserted in Thm. III.1 step (1) and encoded as property (1) of Def. III.5, but it is false for the concrete commutator used in the paper.\n\nFor the symmetric QSP ansatz of Thm. I.3, phases are z-rotations and W(±1)=±I, so at x=±1 every factor of any symmetric protocol is diagonal; the nested commutator is exactly the identity at the endpoints, and its image under Π is zero there. This is visible in the leading-order formula (50): both the σz and σx coefficients carry an overall factor √(1-x²). Now choose a target h(x)=ε^{1/4}/2, which lies in S_{ε^{1/4}}(F(X,ξ)) but has h(±1)=ε^{1/4}/2. No element of the nested-commutator image can uniformly approximate h at the endpoints; the endpoint error is Ω(ε^{1/4}), not O(ε^{5/4}).\n\nThe paper acknowledges 'boundary conditions' and says they can be fixed by 'shifting by a constant of order ε,' but that shift is not part of the nested commutator used in the surjectivity claim, and the endpoint mismatch is of order ε^{1/4}, far larger than the ε^{5/4} refinement accuracy. Unless the commutator is modified to include endpoint-moving shifts, the net-refinement step cannot be continued for general f∈F(X). Thus Theorem III.2 does not follow from the given lemmas.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a lifted Solovay–Kitaev theorem for quantum signal processing. It defines QSP instruction sets, a common QSP function space, planar QSP protocols, a nested group commutator, and a notion of compatible commutators. The main theorem (Thm. III.2) claims that if an instruction set is Π-dense in a compact function space, then every target function has an ε-uniform approximation with phase and oracle length O(log^c(1/ε)). The proof is built on a shrinking lemma (Thm. III.1) that requires the nested commutator to be surjective on balls about the identity function, together with a 'retroactive definition' step to pass from component-wise closeness to operator-norm closeness. Section IV provides density results for several ansätze, including an LCU-based construction and a constant-space QSVT result.","tokens_in":43536,"tokens_out":12556,"duration_ms":135970,"significance":"If correct, the proposed framework would be a valuable new proof technique for QSP/QSVT: it would decouple the existence of short good protocols from constructive phase-finding, and it would extend naturally to modified ansätze for which standard QSP proofs fail. The paper is clearly written, and the definitions of QSP instruction sets, the common function space, and compatible commutators are useful organizational devices. The density statements in Section IV, especially the LCU-based and constant-space constructions, are creative and potentially interesting in their own right. However, the central net-refinement step contains a load-bearing gap, and the main theorem is not established by the arguments given.","major_comments":[{"comment":"The surjectivity assertion in Thm. III.1 step (1), encoded as property (1) of Def. III.5, is false for the nested commutator constructed in Lem. III.4. In the leading-order formula (50), both the σz and σx coefficients carry an explicit factor √(1−x²); consequently the Π-image of every nested commutator vanishes at x=±1. The ball S_{ε^{1/4}}(F(X,ξ)) contains constant functions such as h(x)=ε^{1/4}/2, which have h(±1)≠0. No element of the commutator image can approximate such an h to better than Ω(ε^{1/4}) at the endpoints, whereas the refinement step claims accuracy ε^{5/4}. The remark that these boundary conditions can be removed by 'shifting by a constant of order ε' does not repair the argument, because the shift is not part of the commutator map G whose surjectivity Def. III.5(1) requires, and the endpoint discrepancy is O(ε^{1/4}), not O(ε). Therefore the net-refinement step cannot be continued for general f∈F(X), and Thm. III.2 does not follow from the given lemmas.","section":"Sec. III, Eq. (50); Thm. III.1; Def. III.5(1)"},{"comment":"Property (2) of Def. III.5 is load-bearing for translating Π-closeness into operator-norm closeness, but it is not proved and as stated it appears false for natural choices of the planar protocol space. The justification in Thm. III.1 step (2) claims that ℑ[P(x)] uniquely determines the off-diagonal element iQ(x)√(1−x²); this is incorrect, since near the identity the unitary has independent σz and σx components to first order, and ℑ[P] controls only the σz component. The proof of Thm. III.2 step (2) simply assumes ∥I−A0(U0 U R0)^†∥<ε0, which is not a consequence of Π-density alone. A repair would require either a genuinely stronger approximation statement or a revised commutator that controls both components; as it stands, the translation step is unjustified.","section":"Sec. III, Def. III.5(2); Thm. III.1 step (2); Thm. III.2 step (2)"},{"comment":"Several of the density results claimed as preconditions for the main theorem do not produce elements of the QSP instruction set Σ* as defined in Def. I.3. Thm. IV.3 uses LCU with additional qubits and a QSVT protocol to isolate the desired matrix element, and Thm. IV.4 explicitly concerns QSVT protocols with 'constant additional space'; neither is a finite pointwise product of the oracle and phase unitaries only. Thus these theorems do not establish Π-density of a QSP instruction set in the sense required by Thm. III.2, and the applications section does not currently supply the claimed instruction sets.","section":"Sec. IV, Thm. IV.3 and Thm. IV.4"}],"minor_comments":[{"comment":"The complexity formula in Eq. (78) is garbled: the displayed expression for n should be cleaned up, and the exponent should follow explicitly from ε_n=ε_{n-1}^{5/4} and ℓ_n=17ℓ_{n-1}.","section":"Sec. III, Eq. (78)"},{"comment":"The term 'retroactive definition' is used repeatedly but never formally defined; a precise definition of when and how unspecified matrix elements are chosen would improve the presentation and could clarify the intended repair of the translation step.","section":"Sec. III, Thm. III.1 step (2)"},{"comment":"The proof of Lem. III.7 is a sketch: the constant 32∆δ is obtained by adding contributions from four commutators without displaying the second-order terms. Since this lemma is used with ∆=ε^{1/4}, a fully detailed proof would help.","section":"Sec. III, Lem. III.7"}],"recommendation":"reject","confidential_remarks":"I agree with the stress-test assessment: the endpoint failure of the nested commutator is real and is visible in the paper's own Eq. (50). This is not a matter of tightening constants; the stated surjectivity property is false. The idea of a lifted Solovay–Kitaev theorem is attractive, and the paper may be salvageable with a substantially different commutator and a rigorous treatment of the translation step, but in its present form the central theorem is not proved."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Rossi has written a clever paper, and the core idea is real: instead of re-proving dense-achievable function classes for every QSP variant, show density and then run a lifted Solovay-Kitaev recursion in function space. The nested commutator that preserves planarity is a nontrivial construction, and the exposition of standard SKT (Sec. II) is clear and genuinely useful. Credit where due: the literature review is careful, the constants are reported honestly, and the paper is upfront that its complexity exponent is much worse than standard QSP. The framework of 'compatible commutators' (Def. III.5) is a reasonable abstraction even if it is only instantiated once.\n\nBut the main theorem has a load-bearing gap, and the stress-test note is right. The nested commutator's leading-order action (Eq. 50) carries an overall factor sqrt(1-x^2) in both Pauli components. For symmetric QSP, every factor at x=±1 is diagonal, so the commutator image is exactly the identity at the endpoints; the Π-image is zero there. A constant target h(x)=ε^{1/4}/2 lies in S_{ε^{1/4}}(F(X,ξ)) but has endpoint value ε^{1/4}/2. No element of the commutator image can be ε^{5/4}-close to it. The paper acknowledges 'boundary conditions' and says shifting by a constant of order ε fixes this, but that shift is not part of the nested commutator used in the surjectivity claim, and the endpoint mismatch is order ε^{1/4}, not ε^{5/4}. So Theorem III.1 step (1), and therefore Theorem III.2, do not follow from the given lemmas.\n\nThere is a second, related problem: the function class in Def. III.4 omits the endpoint condition f(±1)=0, which standard symmetric QSP actually imposes. That makes the density claims in Thm I.3 and Rem IV.3 overstated. The new density results in Sec. IV are mostly for QSVT/LCU constructions, not for QSP instruction sets of the form needed by Thm III.2.\n\nWho is this for? People working on QSP proof techniques and on generalized SKT methods will find the construction thought-provoking, and the failure mode is instructive. But the central theorem is not established. I don't think you can cite it as a theorem yet. If serious referee time is invested, the endpoint issue may be fixable by enlarging the instruction set or redefining the nets, but that is real work.\n\nRecommendation: send to peer review, because the idea is novel and the flaw is specific enough to be worth a revision cycle. My own verdict on the current version: reject.","headline":"A genuinely novel QSP/SKT bridge, but the load-bearing surjectivity claim fails at the endpoints, so the main theorem does not follow as written.","tokens_in":43987,"tokens_out":4034,"would_cite":false,"duration_ms":44050,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68","68Q12"],"pacs":["03.67.Ac"],"model":"deepseek-v4-flash","headline":"For quantum signal processing, density of an ansatz in a compact function class guarantees short approximating protocols with $O(\\log^c(1/\\varepsilon))$ phases.","keywords":["quantum signal processing","Solovay-Kitaev theorem","gate approximation","net refinement","nested commutator","planar QSP protocols","uniform approximation","function space density"],"falsifier":"Restrict Theorem III.1 to a constant-Lipschitz function space and inspect the leading-order image (50) of the nested commutator. For a candidate low-degree target such as $g(x)=\\varepsilon x^2\\sqrt{1-x^2}$ in the ball $S_{\\varepsilon^{1/4}}(F(X,\\xi))$, solve the coupled equations for symmetric-QSP polynomials $P_0,Q_0,P_1,Q_1$ implied by (46)–(49) and (50); if no definite-parity, norm-bounded solutions exist, the claimed surjectivity fails and the recursion stops. A simpler numerical version: sample low-degree Chebyshev targets in the ball, run the preimage construction, and check whether the image covers the ball to leading order.","tokens_in":42927,"feed_emoji":"⚫️","tokens_out":9445,"duration_ms":95760,"temperature":0.7,"pith_summary":"This paper proves a Solovay-Kitaev theorem for quantum signal processing: whenever a QSP-style instruction set is dense in a compact class of functions under a fixed projection of a unitary matrix element, it automatically contains short products that uniformly approximate any target function to precision $\\varepsilon$, with phase and oracle length $O(\\log^c(1/\\varepsilon))$. The proof lifts the standard Solovay-Kitaev net-refinement argument from the group $SU(2)$ to the space of $SU(2)$-valued functions of a signal, using a specially nested commutator that preserves planar QSP structure. If correct, this makes density the sufficient condition for efficient QSP protocols, potentially opening analysis of ansätze whose exact achievable-function theory is unknown or fragile.","feed_headline":"QSP gets a Solovay-Kitaev theorem","feed_subtitle":"If a QSP ansatz is dense, short circuits approximate every target function to precision epsilon.","key_machinery":"The load-bearing object is the nested commutator of Lemma III.4: for four planar QSP protocols related by $U_2=U_0^\\dagger$ and $U_3=U_1^\\dagger$, the product $[[U_0,U_1],[U_2,U_3]]$ is again an XZ-planar protocol near the SU(2) identity, and to leading order in $\\varepsilon$ it acts like an $\\varepsilon^4$ rotation whose $\\sigma_z$ and $\\sigma_x$ coefficients are products of the $\\Im[P]$ and $\\Im[Q]$ components of the input protocols. This shrinking step converts an $\\varepsilon$-net for functions of norm at most $\\varepsilon^{1/4}$ into an $\\varepsilon^{5/4}$-net with length multiplied by a constant factor. Around it, Definition III.5 abstracts the needed properties—surjectivity on balls about the identity, closeness under the projection implying closeness in the ambient group, and error self-correction—into a 'compatible commutator,' so the net-refinement theorem can be transferred to other QSP-like ansätze once such a commutator is supplied.","core_discovery":"The central discovery is that density under a projection $\\Pi$ in a compact function space $F(X)$ is enough to guarantee efficient uniform approximation of functions, not just pointwise approximation of gates. The paper constructs a compatible commutator for symmetric QSP: a nested group commutator $[[U_0,U_1],[U_2,U_3]]$ of four planar protocols near the identity, with $U_2=U_0^\\dagger$ and $U_3=U_1^\\dagger$, which is again planar, shrinks distance to the identity from $\\varepsilon$ to $\\varepsilon^{5/4}$, and self-corrects approximation error better than naively expected. Iterating this refinement step converts a constant-precision net into nets of exponentially improving precision, yielding protocols of length $O(\\log^c(1/\\varepsilon))$ for a constant $c$; for the symmetric QSP instance, $c=\\log 17/\\log(5/4)\\approx 12.7$.","pith_inferences":["The 'retroactive definition' of the uncontrolled $\\sigma_x$ component suggests a general recipe: when approximating a single matrix element, one can absorb all uncontrolled components into the target at each refinement step. This may let similar theorems be proved for other projections $\\Pi$, such as real parts or off-diagonal elements, by finding any planar-preserving commutator rather than the s","The same proof skeleton should transplant to G-QSP or multivariable QSP: one needs only a density statement plus a compatible commutator preserving the ansatz's planarity. Constructing such commutators is the bottleneck the paper leaves open.","For target functions that are only once-differentiable, the paper's average-case counting argument suggests unavoidable length growth of order $\\xi/\\varepsilon$; the $\\operatorname{polylog}(1/\\varepsilon)$ guarantee is essentially reserved for analytic targets on a Bernstein ellipse. A testable prediction is that any efficient variant must either exploit smoothness or accept a smoothness-dependent","If a better compatible commutator with error amplification $\\varepsilon\\mapsto\\varepsilon^{1+b}$ for $b>1/4$ exists, the length exponent $c$ would drop toward the standard SKT value; systematically searching over planar protocol products with larger $b$ is a concrete route to improving Theorem III.2."],"forward_implications":["If Theorem III.2 is correct, then for any QSP-like ansatz one can replace the hard task of exactly characterizing achievable functions with an easier density check: density in the relevant compact function space automatically yields $O(\\log^c(1/\\varepsilon))$ approximating protocols under the chosen projection.","The theorem gives a formal rationale for numerical phase-finding: existence of short phases is guaranteed by net refinement, while actual phases can be computed by stable numerical optimization, decoupling proof of existence from construction.","For symmetric QSP, density follows for absolutely summable Chebyshev expansions (Theorem IV.3) and for analytic functions via a constant-space LCU construction (Theorem IV.4), both supplying the preconditions of the main theorem in settings where standard completion-and-layer-stripping proofs fail.","The method yields 'QSP without phases' and 'QSP without polynomials': replacing the continuous phase set by any SU(2)-dense instruction set (plus a $\\pi/2$ rotation) or replacing the oracle by any smooth invertible $f(x)\\sigma_x$ oracle leaves the density conclusions unchanged (Theorem IV.5).","For the symmetric QSP instantiation, the length exponent is $c=\\log 17/\\log(5/4)\\approx 12.7$, worse than the standard Solovay-Kitaev exponent because the nested commutator self-corrects errors less efficiently ($\\varepsilon\\mapsto\\varepsilon^{5/4}$, not $\\varepsilon\\mapsto\\varepsilon^{3/2}$)."],"supporting_citations":[{"why":"Supplies the standard Solovay-Kitaev proof structure—generate net, refine by commutator, shift—that Theorems III.1–III.2 lift to SU(2)-valued functions.","marker":"[DN06]"},{"why":"Textbook SKT presentation whose geometric proof picture is directly adapted in the QSP setting.","marker":"[NC11]"},{"why":"Earlier SKT treatment providing the near-identity commutator expansions on which Lemma III.4 builds.","marker":"[KSV02]"},{"why":"Defines QSP unitaries and the characterization of achievable polynomials that the QSP-SKT bypasses.","marker":"[GSLW19]"},{"why":"Defines symmetric QSP and the uniqueness and planarity properties the nested commutator is engineered to preserve.","marker":"[WDL22]"},{"why":"Provides the small-phase linear Fourier limit used in Theorem IV.3 to show density of symmetric QSP over absolutely summable functions.","marker":"[AMT23]"},{"why":"Supplies the Fourier-coefficient condition and infinite-QSP framework behind the $\\ell^1$-bounded coefficient assumption in Theorem IV.3.","marker":"[ALM+24]"},{"why":"Provides the Arzelà–Ascoli theorem, the compactness criterion that makes the function spaces $F(X,\\xi)$ and their nets finite in Theorem III.1.","marker":"[DS88]"}],"fun_headline_variants":["Density in QSP gives short circuits: a lifted SKT","SKT for QSP: density ensures efficient approximation","Quantum signal processing: a Solovay-Kitaev for functions","Dense QSP ansätze approximate fast: SKT analog"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The recursion depends on the claim that the nested commutator can hit every function in a small ball about the identity—with the unmonitored $\\sigma_x$ component freely redefined at each step—but this surjectivity is only sketched, and if it fails the net refinement cannot continue.","fun_headline_variants_meta":{"raw":{"variants":["Density in QSP gives short circuits: a lifted SKT","SKT for QSP: density ensures efficient approximation","Quantum signal processing: a Solovay-Kitaev for functions","Dense QSP ansätze approximate fast: SKT analog"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000623,"raw_usage":{"total_tokens":2887,"prompt_tokens":946,"completion_tokens":1941,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":562,"completion_tokens_details":{"reasoning_tokens":1870}},"tokens_in":562,"tokens_out":1941,"duration_ms":13494,"temperature":1.0,"reasoning_tokens":1870,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T23:02:48.661583+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Restrict Theorem III.1 to a constant-Lipschitz function space and inspect the leading-order image (50) of the nested commutator. For a candidate low-degree target such as $g(x)=\\varepsilon x^2\\sqrt{1-x^2}$ in the ball $S_{\\varepsilon^{1/4}}(F(X,\\xi))$, solve the coupled equations for symmetric-QSP polynomials $P_0,Q_0,P_1,Q_1$ implied by (46)–(49) and (50); if no definite-parity, norm-bounded solutions exist, the claimed surjectivity fails and the recursion stops. A simpler numerical version: sample low-degree Chebyshev targets in the ball, run the preimage construction, and check whether the image covers the ball to leading order.","supporting_citations":[],"review_version":1}