{"id":"f2914972-cff6-4766-8ebc-952a13d575dd","arxiv_id":"2607.28541","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":4,"one_line_summary":"Oracle-free hybrid qubit–qumode circuits simulate polynomial-drift nonlinear ODEs via Fokker–Planck Schrödingerisation with O(d^{L+1} n^{L+2}) gates per Trotter step from an exact bipartite Pauli factorisation.","lead":"A hybrid qubit–qumode algorithm solves nonlinear ODEs by evolving a Fokker–Planck density under Schrödingerisation, with every gate fixed in closed form from the drift polynomials. It gives a proven polylog-in-grid, polynomial-in-dimension per-step cost without sparse oracles, aimed at oscillator–qubit hardware.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"Central structural theorems look sound; the load-bearing soft spot is that the O(d^{L+1}n^{L+2}) count is only a gate count in an idealized CV-native model, not a demonstrated compiled cost.","rationale":"The bipartite carry-length structure, O(log N) commuting families, degree-L Walsh sparsity, and exact D_m⊗Σ factorisation are internally consistent; the 1D classical checks (Pauli supports, rank ≤n, product identity to 10^{-13}, shifted recovery) support the algebra. I do not find a break in Theorems 7.1–7.4 or 6.1. The reader correctly located the soft spot: the gate-count claim is load-bearing on treating multi-controlled qumode displacements as elementary at linear-in-controls cost. That is a modeling assumption, not a proved reduction, and the numerics never exercise the compiled/Trotterised circuit the complexity refers to. This does not justify REJECT—the math contribution stands—but it keeps the verdict at CONDITIONAL until either (i) a concrete hybrid compilation with measured counts or (ii) a Trotterised end-to-end run (both listed by the authors as next steps) shows the stated scaling. No stronger internal inconsistency turned up; advantage-in-d and e^{λ_max T} post-selection are already caveated in §9.4–9.5. Verdict unchanged from the reader’s CONDITIONAL.","tokens_in":42396,"tokens_out":845,"duration_ms":63726,"concrete_test":"For the bistable benchmark (n=5, L=3), explicitly compile one Block-2 family exponential (e.g. S_{2,+}) via the monomial product (8.8) into a concrete hybrid native set (qubit Cliffords/CNOTs + native unconditional and singly-controlled momentum displacements). Count elementary two-qubit gates and native displacements; compare to the paper’s O(n^{L+1}) family bound. Then run full first-order Trotterised Algorithm 8.1 at r set for target ε≈10^{-2} and compare recovered ρ(T) to e^{AT}ρ_0. If compiled cost exceeds the bound by ≫const or Trotterised error far exceeds (9.3), the complexity transfer fails.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The strongest claim’s complexity number rests on subsection 8.3’s convention that a multi-controlled momentum displacement e^{-iλ Π⊗q̂} (up to L+2m controls) is one elementary gate, compiled at O(L+m)=O(n) cost via ancilla ladders, on the same footing as a controlled-phase. Under that model the factorisation H_{S_m}=D_m⊗Σ_m^± → exact product of O(n^L) monomial-controlled displacements is correct, and the per-step count O(d^{L+1}n^{L+2}) follows. The paper justifies elementarity only by platform-nativity remarks (trapped ions, dispersive cQED, photonics), with no reduction to a standard fault-tolerant hybrid gate set and no accounting for the cost of high-weight controls or displacement calibration/noise. Section 10 then validates the algebra by applying e^{-iH(η)t} exactly on a fine η-grid; it never compiles Algorithm 8.1, never runs the outer/inner Trotter splits (8.4)–(8.5), and never measures gate counts. So the structural theorems (7.1–7.4) and the operator identity (8.8) can hold while the headline resource claim remains a count in an unreduced model rather than an implementable cost. If controlled-q̂ operations are substantially more expensive than assumed, the oracle-free complexity claim does not transfer.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper proposes a hybrid qubit–qumode algorithm for polynomial nonlinear ODEs via Fokker–Planck linearisation, spatial discretisation, Jin–Liu–Yu Schrödingerisation, and a continuous-variable LCU that places the Fourier mode η on one qumode. The central technical contribution is a bipartite Pauli structure theorem for the Hermitian parts H1, H2 of the tridiagonal generator: nonzero strings split into O(log N) mutually commuting families, each a degree-≤L prefix diagonal tensored with a fixed rank-two bond operator, so each family exponential factorises exactly into O(n^L) monomial-controlled qumode momentum displacements. This yields a claimed per-Trotter-step cost O(d^{L+1}n^{L+2}) with every gate fixed in closed form by the drift (no sparse-access oracle or block encoding), plus a grid-independent bound on λ_max(H1) that fixes the shifted recovery domain and post-selection cost. Classical 1D simulations on two polynomial benchmarks confirm the structural theorems, the product identity to <10^{-13}, shifted recovery, and an accuracy-per-resource comparison of qumode vs. discretised η-register.","tokens_in":42835,"tokens_out":1614,"duration_ms":28630,"significance":"If the structural results and oracle-free compilation hold as stated, the paper supplies the missing circuit layer for the Tennie–Magri Fokker–Planck route and for Schrödingerisation of non-symmetric tridiagonal generators: an explicit, closed-form Pauli factorisation and an exact intra-family product synthesis that avoids block encodings. The O(log N) commuting-family bound specialised to the carry structure, the degree-L sparsity of prefix diagonals, Theorem 6.1 on the numerical abscissa, and the operator-checked product identity are concrete, checkable contributions. The hybrid CV coupling and the accuracy-per-resource comparison against a discretised mode register are of genuine interest for oscillator–qubit platforms. Strengths that should be credited include explicit proofs (main text + Apps. A–B), operator-wise verification of (8.8), and honest scoping of the 1D numerics in §10 and §12.","major_comments":[{"comment":"Subsection 8.3 and §9 treat a multi-controlled momentum displacement e^{-iλ Π⊗q̂} (up to L+2m controls) as one elementary gate compiled at O(L+m)=O(n) cost via ancilla ladders, on the same footing as a controlled-phase. The headline per-step count O(d^{L+1}n^{L+2}) and the total complexity in Theorem 9.1 rest on this convention. The justification is platform nativity (trapped ions, dispersive cQED, photonics), not a reduction to a standard fault-tolerant hybrid gate set or an accounting of high-weight control and displacement calibration/noise. The oracle-free claim is correct as a closed-form compilation in that model, but the manuscript should state explicitly that the quoted gate counts are native-CV resource counts, not demonstrated compiled costs in a universal gate set, and should qualify the abstract/§9 claims accordingly.","section":"§8.3, §9, Theorem 9.1"},{"comment":"Section 10 validates the algebra by applying e^{-iH(η)t} exactly on a fine η-grid. It does not compile Algorithm 8.1, does not simulate the outer/inner Trotter splits (8.4)–(8.5), and does not measure gate counts. The authors acknowledge this scope limitation, but the abstract and contribution list present end-to-end accuracy and the resource claim together. Either a small Trotterised run (even at n=3–4) or a sharper separation in the abstract/§10 between “mathematics of the pipeline” and “circuit as specified” is needed so that the confirmed ~10^{-3} recovery is not read as validation of the compiled complexity.","section":"§10, Algorithm 8.1"},{"comment":"The claimed per-step compression is polynomial in d and polylog in N^d (§9.4, Corollary 9.2). All reported numerics are one-dimensional (n=5); nothing exhibits the d-scaling that distinguishes the method from a classical grid Fokker–Planck solver. Given that the advantage argument is explicitly about growing d, the manuscript should either supply a minimal 2D structural/resource check (family counts and monomial totals under (5.5)) or reframe the advantage paragraph so that it is clearly asymptotic and not empirically supported in this work.","section":"§9.4, §10, Proposition 7.8"},{"comment":"Corollary 9.2 gives N_gate = Õ(T² d^{L+3} F^4 ε^{-3}) × e^{λ_max T} for a deterministic observable. The exponential post-selection factor and the diffusion-limited stencil norm ∥A∥=Θ(1/ε) are discussed, but the regime of advantage versus a classical grid solver (stable in T, cost O(N^d) per step) remains thin: stiff or long-horizon problems are conceded as unfavourable, and no concrete (d,L,T,ε) window is exhibited where the quantum cost wins. A short, explicit regime statement (or a worked parameter example) would make the complexity claim falsifiable rather than only asymptotic at fixed L.","section":"§9.4–9.5, Corollary 9.2"}],"minor_comments":[{"comment":"Data availability cites “[repository URL]” as a placeholder; provide a real archive link or remove the claim until the code is posted.","section":"Data availability"},{"comment":"In the abstract and intro, “low-order low-order moments” is duplicated; clean up.","section":"Abstract / §1"},{"comment":"Figure 3 caption and §10.3: clarify that the comparison is accuracy per ancilla/register resource, not an asymptotic gate-count separation (the main text says this once; the figure should too).","section":"Fig. 3, §10.3"},{"comment":"Theorem 4.1 is cited for the O(σ) small-noise bias in §9.5 but is not stated as a numbered theorem in §4 (only Remark 4.1). Align numbering or rephrase the citation.","section":"§9.5, §4"},{"comment":"Several related-work arXiv items are very recent or contemporaneous (e.g. Das et al., Kharazi et al.); ensure citation versions and claims remain accurate at revision time.","section":"§2"}],"recommendation":"major_revision","confidential_remarks":"The structural Pauli/carry analysis is the real contribution and looks publishable after the gate-model and validation-scope claims are tightened. I would not reject on the CV-elementary-gate convention alone if the authors fence it clearly; the risk is over-claiming “provable” resource counts in the title/abstract relative to what §10 actually checks. Fit for a quant-ph algorithms audience is good."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The real news here is not Fokker–Planck or Schrödingerisation—those are Tennie–Magri and Jin–Liu–Yu. What is new is the bipartite carry-length Pauli theorem for non-symmetric tridiagonal generators, the O(log N) commuting-family split with degree-L prefix sparsity, and the exact product of monomial-controlled qumode displacements that follows. That package lets them compile every gate from the drift coefficients with no sparse-access oracle and no block encoding. Theorem 6.1 on the grid-independent numerical abscissa is also useful and cleanly proved.\n\nThe math holds up. Theorems 7.1–7.4 and the appendices match the claims; the product identity checks to 1e-13; the 1D end-to-end recovery sits under 1e-3 against e^{AT}ρ0; family counts and ranks saturate or fall below the bounds exactly as predicted. Literature placement is careful rather than territorial. The authors flag their own next steps (Trotterised run, 2D benchmark) instead of papering over them.\n\nThe soft spot the stress-test names is real and load-bearing for the complexity slogan, not for the structural results. The O(d^{L+1}n^{L+2}) count treats multi-controlled momentum displacements as elementary, justified by platform nativity, not by a fault-tolerant hybrid gate set. Section 10 applies e^{-iH(η)t} exactly on a fine η-grid; it never compiles Algorithm 8.1 and never runs the outer/inner Trotter splits. So the algebra can be correct while the resource claim remains a count in an unreduced model. Secondary gaps: only 1D classical proxies, so the per-step compression in d is argued not shown; post-selection still carries e^{λ_max T}. Those are proportionate caveats, not holes in the theorems.\n\nThis is for people working quantum DE solvers and hybrid oscillator–qubit circuits. A serious referee should see it. I would engage: cite the Pauli structure and the abscissa bound, and treat the gate tally as conditional on the CV cost model until someone compiles it.","headline":"Solid structural theorems and an honest oracle-free compilation path; the headline gate count is real only under a CV-native cost model the paper never compiles.","tokens_in":43433,"tokens_out":550,"would_cite":true,"duration_ms":13538,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68","65L05","35Q84"],"pacs":[],"model":"grok-4.5","headline":"A hybrid qubit–oscillator circuit can evolve nonlinear ODEs without oracles by exploiting a bipartite Pauli structure of the Fokker–Planck generator.","keywords":["quantum simulation","nonlinear differential equations","Fokker–Planck equation","Schrödingerisation","qumode","Pauli decomposition","hybrid oscillator-qubit","oracle-free algorithm"],"falsifier":"On a known polynomial drift, exhaustively decompose H1 and H2 into Paulis and check whether every nonzero string is bipartite by carry length, whether they form at most 2n+1 commuting families, and whether the product of the claimed monomial-controlled displacements equals each family exponential to machine precision; any counterexample family breaks the central claim.","tokens_in":43294,"feed_emoji":"⚛️","tokens_out":1163,"duration_ms":18185,"temperature":0.7,"pith_summary":"This paper shows how to turn a nonlinear ordinary differential equation into a quantum circuit that never calls a black-box matrix oracle. The route is to track the probability density of a slightly noisy version of the dynamics, discretise that linear Fokker–Planck equation on a grid, and lift the non-unitary evolution into a family of Schrödinger equations whose continuous mode parameter rides on one physical oscillator (a qumode). The decisive discovery is structural: the Hermitian pieces of the grid generator split into O(log N) commuting Pauli families, each exactly a low-degree diagonal times a fixed two-level bond operator, so each family exponential compiles as an exact product of a polynomial number of monomial-controlled momentum displacements. On a d-dimensional grid the cost per Trotter step is therefore polynomial in dimension and polylogarithmic in the number of points per axis, with every gate written in closed form from the drift coefficients. Classical simulations on two polynomial benchmarks confirm the structure, the shifted recovery of the density, and an accuracy-per-resource edge of the continuum qumode over a discretised mode register.","feed_headline":"Nonlinear ODEs run oracle-free on one oscillator plus qubits","feed_subtitle":"A bipartite Pauli split turns the Fokker–Planck generator into exact monomial-controlled displacements","key_machinery":"Bipartite Pauli structure of H1 and H2 (carry-length split into {I,Z}-prefix and {X,Y}-suffix), which sorts strings into O(log N) commuting families and factorises each family so its exponential is an exact product of monomial-controlled qumode momentum displacements under continuous-variable LCU Schrödingerisation.","core_discovery":"The Hermitian parts H1 and H2 of the discretised Fokker–Planck generator admit a bipartite Pauli decomposition—{I,Z} on a prefix and {X,Y} on a suffix fixed by binary carry length—that partitions all nonzero strings into O(log N) mutually commuting families, each factorising as a degree-at-most-L diagonal tensored with a fixed rank-two bond operator. That factorisation makes every family exponential an exact product of O(n^L) monomial-controlled qumode momentum displacements with no intra-family Trotter error, yielding an oracle-free per-step gate count O(d^{L+1} n^{L+2}) on a d-dimensional N=2^n grid.","pith_inferences":["If native controlled displacements remain cheap under fault-tolerant compilation, hybrid oscillator–qubit chips become a natural niche for density-based nonlinear solvers rather than pure qubit registers.","The same carry-length bipartite pattern likely extends to other non-symmetric tridiagonal or nearest-neighbour Markov generators beyond Fokker–Planck, suggesting a reusable compilation template.","A two-dimensional Trotterised benchmark would be the cleanest public test of the claimed per-step compression in d, which one-dimensional classical proxies cannot exhibit.","Smoothing the Schrödingerisation kernel to Schwartz class trades a small amplitude cost for superalgebraic Fock truncation, which may dominate practical resource estimates more than the Pauli synthesis itself."],"forward_implications":["Nonlinear ODEs with polynomial drift become simulable on hybrid qubit–oscillator processors without sparse-access oracles or block encodings.","Per-step gate cost scales as O(d^{L+1} n^{L+2}), polynomial in dimension and polylogarithmic in grid points per axis, replacing the classical O(N^d) density state space.","The numerical abscissa of the generator is bounded independently of grid spacing by flow compression and wall drift, fixing the shifted recovery domain and the e^{λ_max T} post-selection overhead.","A single continuum qumode can outperform a discretised Fourier-mode qubit register on accuracy per resource for the same Schrödingerisation family.","Any dilation that couples an ancilla to the same Hermitian split of A inherits the Pauli-family structure and the exact product synthesis."],"fun_headline_variants":["Oracle-free nonlinear ODEs on one qumode plus qubits","Bipartite Pauli split yields exact monomial displacements","Hybrid oscillator-qubit algorithm for polynomial ODEs","Fokker-Planck generator factorises into O(log N) families","Nonlinear dynamics via warped-phase qumode coupling"],"cache_read_input_tokens":128,"weakest_assumption_plain":"Multi-controlled momentum displacements of the oscillator must count as elementary gates on the same footing as controlled-phase rotations; if those operations are costly or noisy on real hardware, the stated oracle-free gate counts do not translate into implementable cost.","fun_headline_variants_meta":{"raw":{"variants":["Oracle-free nonlinear ODEs on one qumode plus qubits","Bipartite Pauli split yields exact monomial displacements","Hybrid oscillator-qubit algorithm for polynomial ODEs","Fokker-Planck generator factorises into O(log N) families","Nonlinear dynamics via warped-phase qumode coupling"]},"model":"grok-4.5","effort":"low","cost_usd":0.004644,"raw_usage":{"total_tokens":1483,"prompt_tokens":1009,"num_sources_used":0,"completion_tokens":63,"cost_in_usd_ticks":46444000,"prompt_tokens_details":{"text_tokens":1009,"audio_tokens":0,"image_tokens":0,"cached_tokens":128},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":411,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":1009,"tokens_out":63,"duration_ms":5878,"temperature":1.0,"reasoning_tokens":411,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-31T04:10:38.493342+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"On a known polynomial drift, exhaustively decompose H1 and H2 into Paulis and check whether every nonzero string is bipartite by carry length, whether they form at most 2n+1 commuting families, and whether the product of the claimed monomial-controlled displacements equals each family exponential to machine precision; any counterexample family breaks the central claim.","supporting_citations":[],"review_version":1}