{"id":"ffa9759d-f81e-4cf9-8637-4080063a78c2","arxiv_id":"2508.06355","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"A quantum algorithm for local dimension and curvature estimation is proposed, but the claimed exponential speedup rests on unproven spectral-gap assumptions and an incorrect least-squares derivation.","lead":"This paper translates a classical estimator of local intrinsic dimension and scalar curvature into a quantum algorithm, claiming exponential speedups. The main theorems omit spectral-gap and normalization constants that the appendix admits can be exponentially small, so the headline speedup claim is not supported as stated.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Curvature estimate is built on an algebraic error: Eq. G.3–G.5/III.10 do not give the least-squares fit parameter, so the claimed S(x_i) accuracy fails independently of spectral gaps.","rationale":"The most load-bearing concern is the algebraic error in the curvature fit, because it invalidates the curvature half of the central claim unconditionally: no dataset, gap constant, or error tolerance can fix a wrong normal equation. The reader's weakest_assumption was the dataset-dependent spectral gaps Delta and delta; that is a valid and important concern about the complexity claim, but it is secondary to the internal inconsistency in Eq. G.3-G.5. The reader did mention the fit derivation error in the rationale, so my agreement is partial rather than full. Since the reader's verdict was already REJECT and this stress-test only strengthens that rejection, no verdict adjustment is needed. A resubmission would need to correct the fit derivation and restate the theorems with explicit dependence on Delta, delta, and the analogous diffusion-map constants.","tokens_in":37469,"tokens_out":8838,"duration_ms":104943,"concrete_test":"Re-derive the normal equations for Eq. G.3 and substitute a concrete two-point example. Let |N_i|=2, r_1=1, r_2=2, and normalized volumes V_1=0.9, V_2=1.1. The exact minimizer of Eq. G.3 is A* = [r_1^2(V_1-1)+r_2^2(V_2-1)]/(r_1^4+r_2^4) = [1(-0.1)+4(0.1)]/(1+16) = 0.3/17 ≈ 0.01765. Equation III.10 gives A_paper = (V_1+V_2)/(2+r_1^2+r_2^2) = 2.0/7 ≈ 0.2857. These differ by more than an order of magnitude, so the algorithm in Fig. 2 does not implement the stated quadratic fit; consequently S(x_i) is not estimated to the advertised accuracy.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Appendix G defines the least-squares cost as C(A) = sum_j (1 + A r_j^2 - Volnor(B_rj(x_i)))^2 (Eq. G.3). Differentiating with respect to A gives 2 sum_j r_j^2 (1 + A r_j^2 - Volnor(B_rj(x_i))) = 0, i.e. A = [sum_j r_j^2 (Volnor(B_rj(x_i)) - 1)] / sum_j r_j^4. Instead, Eq. G.4 drops the factor r_j^2, and Eq. G.5 (repeated as Eq. III.10) states A = (sum_j Volnor(B_rj(x_i))) / (|N_i| + sum_j d_G(x_i,x_j)^2). This is not the minimizer of Eq. G.3. Since the paper defines S(x_i) = -6(d_i+2)A, the curvature output is not the claimed best-fit estimate. This is an internal algebraic inconsistency, not a parameter-dependence issue: it breaks the correctness claim of Theorem III.1 even if all spectral gaps are O(1). The gap-dependence problem flagged by the reader is real, but it affects the complexity claim; the fit error affects correctness itself.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a quantum algorithm that, given pairwise Euclidean distances of a point cloud, estimates the local intrinsic dimension d_i and local scalar curvature S(x_i) at each point. The method uses diffusion geometry to approximate geodesic distances, then applies block-encoding/QSVT-based quantum PCA to find local neighborhoods and dimensions, estimates geodesic-ball volumes by inverse-density weighting, and obtains curvature from a quadratic fit of normalized volume versus squared radius. The authors claim an exponential speedup over the classical O(N^3) estimator and extend the technique to diffusion maps. Theorem III.1 states polylogarithmic complexity in N and m under the stated data-access assumptions, with details deferred to appendices.","tokens_in":37682,"tokens_out":9629,"duration_ms":115344,"significance":"A genuinely efficient quantum algorithm for local intrinsic dimension and curvature would be a meaningful advance in quantum geometric data analysis, complementing recent quantum TDA work. The paper is well structured, makes use of standard block-encoding/QSVT tools, and includes a detailed complexity table, which is a strength. However, the central curvature-estimation step contains an algebraic error, and the claimed polylogarithmic speedup rests on unproven dataset-dependent assumptions about spectral gaps and normalization constants. As written, the main correctness and complexity claims are not supported; the potential significance is therefore contingent on substantial revision.","major_comments":[{"comment":"The quadratic fit is incorrect. The cost in Eq. (G.3) is C(A) = Σ_j (1 + A r_j^2 - Volnor(B_{r_j}(x_i)))^2. Differentiating with respect to A gives 2 Σ_j r_j^2(1 + A r_j^2 - Volnor(B_{r_j}(x_i))) = 0, so A = Σ_j r_j^2(Volnor(B_{r_j}(x_i)) - 1) / Σ_j r_j^4. Eq. (G.4) omits the factor r_j^2, and Eq. (G.5), repeated as Eq. (III.10), is not the minimizer of Eq. (G.3). Since the paper defines S(x_i) = -6(d_i+2)A, the algorithm does not output the best-fit curvature defined by the classical estimator. This breaks the correctness claim of Theorem III.1 independently of spectral-gap assumptions. The authors must replace the formula and supply a quantum procedure for the correct sums, or prove that the formula used approximates the intended minimizer under explicit assumptions.","section":"Appendix G / Eq. (III.10)"},{"comment":"The polylogarithmic speedup is not established. The detailed complexity in Eq. (H.11) depends on 1/Δ^{|N_i|}, 1/δ^{d_i}, and on norms/condition numbers; Appendix I contains analogous factors 1/(q_min w_min) and related constants. Eq. (H.12) simplifies by asserting that Δ, δ and other quantities 'can be safely considered to be O(1)'. No argument is provided for this assertion, and near-duplicate geodesic distances can make Δ exponentially small. Theorems III.1 and IV.1 as stated omit these conditions, so the main complexity claims are unsupported unless the theorems are restated with explicit dependence on gaps and normalization constants, or the O(1) assumptions are proved.","section":"Appendix H, Eq. (H.11)-(H.12); Theorems III.1 and IV.1"},{"comment":"The quantum geodesic-distance construction uses the unnormalized kernel K (Appendix C, Eq. C.14) and forms a block-encoding of ∝ K^†K, which is then used in Eq. (D.5) to obtain d_G. However, the classical geodesic approximation in Appendix B (Eqs. B.2-B.4) uses the row-stochastic diffusion operator P, not K. The eigenvalues and eigenvectors of K are not those of P in general, so the 'geodesic distances' entering the quantum algorithm are not the same as those in the classical estimator being translated. No proof of equivalence under the stated assumptions is given. This affects the input to both the dimension and curvature estimation, so the correctness of the whole pipeline is called into question.","section":"Section III, Eq. (III.2)-(III.3); Appendices C-D vs Appendix B"},{"comment":"The first complexity expression in Theorem III.1 has exponent N+3, where N is the total number of data points, whereas Appendix H and Table I consistently use |N_i|+3 with |N_i| the local neighborhood size. Taken literally, the theorem claims a cost exponential in N, which would contradict the claimed polylogarithmic speedup. If this is a typo, it must be corrected in the theorem statement; if not, the theorem is false. The same notational overloading of N appears in the definition of Δ in Table I and should be cleaned up.","section":"Theorem III.1, Eq. (III.11)"}],"minor_comments":[{"comment":"The symbol N is used both for the total dataset size and for the local neighborhood size |N_i| (e.g., Eq. (III.4) and Appendix B). This makes theorem statements and complexity expressions unnecessarily hard to parse; please use distinct notation.","section":"Notation throughout"},{"comment":"There is a typo: 'twe use' should be 'we use'. Also 'logN 1/ϵ' in Table I should have parentheses for clarity.","section":"Appendix H, step 2"},{"comment":"The approximation d_G ≈ D_t with t=1 is used without a quantified error bound for finite N or noisy data. The paper should state this as an explicit assumption or provide a bound, since the downstream accuracy claims depend on the quality of this approximation.","section":"Eq. (III.3) / Appendix B"},{"comment":"The box 'Fit the quadratic curve Br(xi) versus r^2' should specify 'normalized volume' and the fit function 1+A r^2, to match Eq. (II.1) and Appendix G.","section":"Figure 2"}],"recommendation":"major_revision","confidential_remarks":"The paper has a promising framework, but the incorrect curvature-fit formula is a load-bearing algebraic error, and the complexity theorems omit unproved dataset-dependent constants. I do not think the current version can be accepted. If the authors can correct the fit, justify or explicitly condition on the spectral-gap/normalization assumptions, and reconcile the diffusion-operator construction with the classical estimator, a resubmission could be considered. The diffusion-operator mismatch in particular needs serious attention before the algorithm can be claimed to estimate the intended geometric quantities."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things you should know before reading this one. First, the authors do something genuinely useful: they give the first quantum algorithm for local intrinsic dimension and scalar curvature, with a detailed block-encoding/QSVT construction and a diffusion-map corollary. Second, the central claim is not supported as written, and there is a concrete algebraic error in the curvature fit that breaks the algorithm's correctness independently of any spectral-gap worries.\n\nThe new content is real but modest. The algorithm is a quantum translation of the classical Hickok–Blumberg estimator, using standard block-encoding arithmetic plus the first author's quantum PCA lemma. The appendices are unusually complete: they show how to block-encode the geodesic-distance diagonal operator, find nearest neighbors via quantum PCA, estimate local dimension, and handle density estimation. That detail is valuable—it means a referee can actually check the claims, and some of the constructions (e.g., the diagonal-filtering lemma in Appendix D) may be reusable. I also credit the authors for putting the full complexity in Appendix H, even though that detail undermines their headline theorem.\n\nNow the soft spots. The bigger one is the fit error. In Appendix G, the cost is explicitly C(A)=Σ(1+A r_j²−Vol_nor_j)². The minimizer is A=(Σ r_j²(Vol_nor_j−1))/(Σ r_j⁴). Instead, Eq. G.4 drops the r_j² factor and Eq. G.5 (repeated as Eq. III.10) gives A=ΣVol_nor_j/(N+Σd_G²). That is not the least-squares fit, so the curvature output S(x_i)=−6(d_i+2)A is not the estimator the paper claims to implement. This is an internal algebraic inconsistency, not a parameter-dependence issue.\n\nThe second soft spot is the complexity claim. Theorem III.1 states polylogarithmic complexity, but Appendix H.12 shows dependence on 1/Δ^{|N_i|} and 1/δ^{d_i}. The authors assert Δ and δ are O(1) based on the dataset. That is unjustified. For noisy or near-duplicate data, these gaps can be exponentially small, eliminating the speedup. The diffusion-map result carries the same caveat with q_min, w_min, λ_min. There is also a likely typo in the exponent N+3 (should be |N_i|+3), and no propagated error analysis for the geodesic-distance approximation.\n\nThe paper is not circular: it computes the output from the input distances via quantum routines, and the benchmark against the classical estimator is legitimate. Self-citation of the quantum PCA lemma is fine.\n\nWho is this for? Researchers in quantum TDA/GDA who want a detailed template for translating geometric estimators into quantum algorithms. It deserves a serious referee—the algebraic error is fixable, and the parameter dependence can be restated honestly. But as it stands, the advertised exponential speedup is an overclaim. My recommendation: reject with major revision, and ask for a corrected derivation and theorems that carry the full dataset-dependent parameters.","headline":"Solid quantum translation of a classical geometric estimator, but a load-bearing algebraic error in the fit formula and hidden dataset-dependent spectral gaps make the advertised speedup unsupported.","tokens_in":38277,"tokens_out":2585,"would_cite":false,"duration_ms":31140,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A quantum algorithm estimates local intrinsic dimension and scalar curvature of a point cloud from pairwise distances exponentially faster than the classical $O(N^3)$ pipeline, with a diffusion-map extension that also improves on prior quan","keywords":["quantum algorithm","intrinsic dimension","scalar curvature","manifold learning","block encoding","quantum singular value transformation","diffusion maps","point cloud"],"falsifier":"Compute $\\Delta$ and $\\delta$ for a point cloud in which two points are separated by $2^{-k}$ times the local scale; as $k$ grows, the refined complexity bound (H.12) grows like $1/\\Delta^{|N_i|}$ and $1/\\delta^{d_i}$, so the empirical query count should diverge from polylog. A targeted test is to run the nearest-neighbor eigenvalue-finding step and observe how the precision needed to resolve the top eigenvalues blows up as the gap shrinks.","tokens_in":37255,"feed_emoji":"📐","tokens_out":11479,"duration_ms":103561,"temperature":0.7,"pith_summary":"The paper sets out to show that a quantum computer can read off two basic geometric quantities of a point cloud — the local intrinsic dimension and the local scalar curvature at a chosen point — directly from the pairwise distances between points, and can do so exponentially faster than the standard classical pipeline. The main theorem claims that, given the classical matrix of pairwise distances, estimating these quantities to additive accuracy $\\epsilon$ costs $O((1/\\epsilon)\\log^{N+3}(N/\\epsilon))$ when the ambient dimension $m$ is small and $O((1/\\epsilon)\\log^{d_i+1}m)$ when $m$ is large, against $O(N^3)$ classically. The same circuit construction also yields a quantum diffusion-map embedding with polylogarithmic complexity, improving on an earlier quantum diffusion-map algorithm. If correct, this turns geometric data analysis — not just topological summaries — into a target for quantum advantage on large point clouds.","feed_headline":"Quantum circuit extracts point-cloud geometry exponentially faster","feed_subtitle":"Local dimension and curvature from pairwise distances, at polylog cost instead of the classical N^3 diagonalization.","key_machinery":"The load-bearing tool is the block-encoding/quantum singular value transformation (QSVT) formalism: a unitary whose top-left block is a scaled matrix, together with routines that multiply, add, invert, and apply polynomials to such encoded matrices. The algorithm starts by encoding the Gaussian affinity kernel $K_{ij}=\\exp(-d(x_i,x_j)^2/\\sigma^2)$ from the classical distances, uses the spectrum of $K^\\dagger K$ to build a diagonal operator whose entries are powers of the diffusion-approximated geodesic distances $d_G(x_i,x_j)$, then applies a refined quantum PCA (Lemma E.1) to find the nearest neighbors of a point and the top singular values of the local covariance matrix $C_i$. Density esti","core_discovery":"On its own terms, the paper claims that intrinsic geometry estimation for point clouds is quantumly tractable. It constructs a quantum algorithm that takes a point cloud $X=\\{x_i\\}\\subset\\mathbb{R}^m$ together with classical values of the pairwise distances $\\{d(x_i,x_j)\\}$ and returns estimates of the local intrinsic dimension $d_i$ and the local scalar curvature $S(x_i)$ at any queried point, up to additive error $\\epsilon$. Theorem III.1 states the cost is $O((1/\\epsilon)\\log^{N+3}(N/\\epsilon))$ for $N\\gg m$ and $O((1/\\epsilon)\\log^{d_i+1}m)$ for $m\\gg N$; the appendix's refined complexity (H.12) writes the first exponent as $|N_i|+3$ and makes the dependence on the spectral gaps $\\$\\Delta$,","pith_inferences":["Beyond the paper's claims, the dataset-dependent constants $\\Delta$ and $\\delta$ are the practical pivot: on adversarial data with near-duplicate distances the refined bound grows as $1/\\Delta^{|N_i|}$ and $1/\\delta^{d_i}$, so the real-world speedup is conditional on well-separated geodesic spectra.","The block-encoded geodesic-distance operator built here is a reusable primitive; the same construction could plausibly estimate other local invariants such as tangent-space angles, Ricci curvature, or heat-kernel signatures without re-encoding the data.","The theorem's $N+3$ exponent appears inconsistent with the appendix's $|N_i|+3$; if the corrected form is intended, the dominant scaling depends on the neighborhood size $|N_i|$ (typically $O(1)$), not on the total number of points.","A direct experimental check would feed synthetic point clouds with controlled singular-value gaps into the quantum PCA subroutine and watch the precision requirement climb as the gaps shrink; the $1/\\delta^{d_i}$ factor predicts a sharp cliff once gaps approach machine precision."],"forward_implications":["If Theorem III.1 holds, per-point estimates of local dimension and scalar curvature cost $O((1/\\epsilon)\\log^{O(1)}(N/\\epsilon))$ instead of $O(N^3)$, so the geometric preprocessing of huge point clouds is no longer dominated by classical matrix diagonalization.","The speedup improves as the local dimension $d_i$ shrinks, so low-dimensional manifold data — the regime where the manifold hypothesis is most plausible — is where the algorithm is fastest.","The same pipeline yields a quantum diffusion-map embedding with complexity $O(\\log^{n+1}(N)+\\log^{2n+6}(1/\\epsilon))$ for $n\\ll m$ coordinates, improving on the prior quantum diffusion-map cost of $O(N^2\\log^3 N)$ and requiring no matrix oracle.","Because the output is local, the method can flag regions of high curvature or anomalous sampling density rather than returning only a global dimension estimate; the authors note the curvature estimate remains informative even when the data is a union of manifolds."],"supporting_citations":[{"why":"Supplies the classical six-step estimator for local dimension and scalar curvature that the quantum algorithm translates into block-encoded circuits.","marker":"[9]"},{"why":"Defines diffusion maps and the diffusion-distance approximation the paper uses to turn Euclidean pairwise distances into geodesic distances.","marker":"[18]"},{"why":"Provides the geodesic-ball volume expansion that connects the normalized volume ratio to scalar curvature, the formula the quadratic fit is based on.","marker":"[21]"},{"why":"Supplies the block-encoding and quantum singular value transformation toolkit used for matrix products, linear combinations, inverses, and polynomial transforms.","marker":"[22]"},{"why":"Optimal state preparation routine used to encode classical distance data and point lists into quantum states.","marker":"[32]"},{"why":"Refined quantum PCA algorithm, cited as Lemma E.1, used to find the largest eigenvalues and eigenvectors for nearest-neighbor search and local dimension estimation.","marker":"[34]"},{"why":"Original quantum PCA algorithm that motivates the eigenvalue estimation step underlying Lemma E.1.","marker":"[35]"},{"why":"Earlier quantum diffusion-map algorithm whose $O(N^2\\log^3 N)$ complexity the paper's diffusion-map corollary improves upon.","marker":"[20]"}],"fun_headline_variants":["Exponential speedup for quantum point-cloud geometry estimation","Quantum algorithm for local dimension and curvature: exponential speedup","Point-cloud geometry: quantum exponential speedup","Exponential speedup for local geometry inference from point clouds","Quantum speedup for estimating point-cloud intrinsic geometry"],"cache_read_input_tokens":2816,"weakest_assumption_plain":"The algorithm's polylog cost rests on the spectral gaps $\\Delta$ (the minimum separation between sorted geodesic distances from $x_i$) and $\\delta$ (the minimum gap among the top singular values of the local covariance matrix) being $O(1)$; if the data are noisy or contain near-duplicate distances, these gaps can be exponentially small and the claimed speedup collapses.","fun_headline_variants_meta":{"raw":{"variants":["Exponential speedup for quantum point-cloud geometry estimation","Quantum algorithm for local dimension and curvature: exponential speedup","Point-cloud geometry: quantum exponential speedup","Exponential speedup for local geometry inference from point clouds","Quantum speedup for estimating point-cloud intrinsic geometry"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001406,"raw_usage":{"total_tokens":5512,"prompt_tokens":728,"completion_tokens":4784,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":472,"completion_tokens_details":{"reasoning_tokens":4709}},"tokens_in":472,"tokens_out":4784,"duration_ms":40407,"temperature":1.0,"reasoning_tokens":4709,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T22:46:12.339350+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute $\\Delta$ and $\\delta$ for a point cloud in which two points are separated by $2^{-k}$ times the local scale; as $k$ grows, the refined complexity bound (H.12) grows like $1/\\Delta^{|N_i|}$ and $1/\\delta^{d_i}$, so the empirical query count should diverge from polylog. A targeted test is to run the nearest-neighbor eigenvalue-finding step and observe how the precision needed to resolve the top eigenvalues blows up as the gap shrinks.","supporting_citations":[{"cited_title":"Riemannian geometry as determined by the volumes of small geodesic balls","cited_arxiv_id":null,"evidence_quote":"Provides the geodesic-ball volume expansion that connects the normalized volume ratio to scalar curvature, the formula the quadratic fit is based on."},{"cited_title":"Quantum diffu- sion map for nonlinear dimensionality reduction.Physical Review A, 104(5):052410, 2021","cited_arxiv_id":null,"evidence_quote":"Earlier quantum diffusion-map algorithm whose $O(N^2\\log^3 N)$ complexity the paper's diffusion-map corollary improves upon."}],"review_version":1}