{"id":"26483e5f-d0eb-42f0-a86a-96345ae1070d","arxiv_id":"2506.11453","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"The thesis introduces k-GME monotones for pure states, subspaces, and mixed states, and uses manifold-trivialized gradient descent to compute them, enabling certification of entanglement dimensionality.","lead":"This PhD thesis defines k-geometric measures of entanglement that quantify how much entanglement lives in Schmidt ranks, tensor ranks, and Schmidt numbers of quantum states, and proposes a gradient-based numerical framework to compute them. It matters because high-dimensional entanglement is hard to certify, and the new measures plus optimization tools give a unified way to detect it in pure states, subspaces, and mixed states.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Reported values E_G^(6)(Φ2)≈10^-14 and E_G^(7)(Φ2)≈1/8 violate the monotonicity of k-GME (E^(k) is nonincreasing in k); the Φ2 border-rank=7 conclusion cannot follow from these numbers.","rationale":"The reader's weakest assumption was that the non-convex optimizer might not find the global maximum, so near-zero values could be optimization failures. I agree that this is a genuine risk, but I found a sharper, internally checkable problem: the reported Φ2 numbers violate the exact monotonicity E_G^(k) ≥ E_G^(k+1) that follows immediately from Definition 18. This is not a matter of numerical tolerance; it is a logical contradiction. If E_G^(6)=10^-14, then E_G^(7) cannot be 1/8, and the claimed border rank 7 is unsupported. Because the thesis presents the Φ2 result as a flagship validation of the k-GME approach, this inconsistency is load-bearing. The concrete test—an independent recomputation of k=5,...,8 with monotonicity enforced—would settle whether the issue is a typo, an indexing bug, or a genuine failure of the method. I keep the reader's CONDITIONAL verdict because the rest of the thesis (analytic bipartite formulas, subspace results, SDP lower bounds) may be correct, but the numerical border-rank claims require correction or clarification before the paper can be accepted as-is.","tokens_in":60709,"tokens_out":16637,"duration_ms":171441,"concrete_test":"Independently recompute E_G^(k)(|Φ2⟩) for k = 5, 6, 7, 8 using the Eq. (6.24) parameterization in the 2×2×2 system (e.g., with a fresh implementation and, for this small tensor, a certified polynomial-optimization solver). Check (a) monotonicity E^(5) ≥ E^(6) ≥ E^(7) ≥ E^(8), and (b) whether the claimed transition is E^(7)>0 with E^(8)≈0. If the recomputation reproduces E^(6)≈10^-14 and E^(7)≈1/8, then the optimization or the indexing is wrong; if the printed E^(6) was a typo for E^(8), correct the text and rerun the conclusion.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Definition 18, E_G^(k)(|ψ⟩) = 1 − max_{TR(|φ⟩)<k} |⟨φ|ψ⟩|^2. Because the admissible set grows with k, E_G^(k) must be nonincreasing in k: E_G^(6) ≥ E_G^(7) ≥ E_G^(8) for every state. The thesis reports (Sec. 6.1.2) that for the 2×2 matrix multiplication tensor |Φ2⟩, E_G^(7) is very close to 1/8 while E_G^(6) is approximately 10^-14. These two numbers are mutually inconsistent: if E_G^(6) ≈ 10^-14, then monotonicity forces E_G^(7) ≤ 10^-14 as well, contradicting the reported 1/8. Taken literally, E_G^(6)=0 would mean |Φ2⟩ lies in the closure of rank≤5 tensors, i.e., BR(|Φ2⟩) ≤ 5, not 7 — contradicting both the known border rank and the thesis's own conclusion. The likely explanations are a typo (perhaps E_G^(8) ≈ 10^-14 was intended) or an off-by-one indexing error in the numerical parameterization of Eq. (6.24), which uses k−1 product terms. Either way, the central numerical demonstration for the matrix multiplication tensor is not supported as printed. This is more specific and decisive than the general concern that gradient descent only gives upper bounds: even before invoking global optimality, the reported data violate a necessary inequality. A similar monotonicity check should be applied to the Dicke-state transitions reported in Fig. 6.3.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The thesis proposes a family of geometric-measure-based entanglement monotones E_G^(k), defined for pure states, subspaces, and mixed states in both bipartite and multipartite settings, with the goal of characterizing entanglement dimensionality through Schmidt rank, Schmidt number, tensor rank, and border rank. It derives analytic distributions for k-GME and optimal entanglement-distillation probabilities for Haar-random bipartite pure states, and it develops a manifold-trivialization gradient-descent framework, complemented by SDP relaxations, for numerical computation. The central applications are k-GME transitions for Dicke states and for the 2x2 matrix-multiplication tensor |Φ2>, from which border-rank values are inferred.","tokens_in":61072,"tokens_out":6974,"duration_ms":82852,"significance":"If the central claims are corrected and properly supported, the k-GME family would provide a unified quantitative tool for entanglement dimensionality across pure, subspace, and mixed-state settings, with analytic predictions such as Eq. (6.11) that are independently checkable and numerically verified. The hybrid non-convex/SDP computational strategy is practically valuable and substantially cheaper than hierarchical methods in the subspace examples. However, as printed, the headline border-rank demonstration for |Φ2> is internally inconsistent, so the significance presently hinges on a load-bearing correction rather than on the results as stated.","major_comments":[{"comment":"The reported values for |Φ2>_ABC violate the monotonicity that is immediate from Definition 18. Since the admissible set {|φ>: TR(|φ>)<k} is nested, E_G^(k)(|ψ>) must be nonincreasing in k. The text states E_G^(7) ≈ 1/8 and E_G^(6) ≈ 10^-14, which would require E_G^(6) ≥ E_G^(7) and is therefore impossible. Taken literally, E_G^(6) ≈ 10^-14 would imply BR(|Φ2>) ≤ 5, contradicting both the known border rank 7 and the thesis's own conclusion. This appears to be an off-by-one or typographical error, with E_G^(8) ≈ 10^-14 the plausible intended value, but as printed the central numerical demonstration is not supported. The same monotonicity check should be applied to the Dicke-state transitions reported in Fig. 6.3.","section":"Sec. 6.1.2, Eq. (6.21) and the paragraph after Eq. (6.30)"},{"comment":"The gradient-descent method returns an upper bound on E_G^(k), not a two-sided approximation; the thesis states in Sec. 5.2.5 that the non-convex method does not guarantee global convergence. For the border-rank inference, the positivity condition E_G^(k) > 0 requires a lower bound, whereas a positive numerical value such as E_G^(7) ≈ 1/8 only gives E_G^(7)_true ≤ 1/8 and does not certify that the true value is positive. Without an independent certificate (for example, an algebraic border-rank lower bound or an SDP/dual-witness lower bound), the conclusion BR(|Φ2>) = 7 is not established by the reported numerics. Conversely, the near-zero value for E_G^(6), being an upper bound, would certify E_G^(6)_true ≈ 0 and hence BR(|Φ2>) ≤ 5, further reinforcing that the data need correction rather than reinterpretation.","section":"Sec. 5.2.5 and Eq. (6.24)"},{"comment":"The set of states with tensor rank strictly less than k is not closed, and the maximum in Eq. (6.21) need not be attained; the W state is a standard example where the supremum over rank-2 states is 1 but is not achieved. The definition should therefore use a supremum, and the numerical parameterization of Eq. (6.24) must be justified as approximating that supremum. As written, the text silently replaces the supremum by a maximum over a parameterized family, which is a formal gap in the definition of the central monotone and also affects the claimed equivalence between BR(|ψ>) = k and the pair of conditions E_G^(k)(|ψ>) > 0, E_G^(k+1)(|ψ>) = 0.","section":"Definition 18 and Eq. (6.24)"}],"minor_comments":[{"comment":"The Dicke-state transitions would be easier to assess if the numerical values of E_G^(k) and the number of random restarts or other hyperparameters were reported; the caption currently only states that transitions occur.","section":"Fig. 6.3"},{"comment":"The word 'istropic' should be 'isotropic' in the caption of Fig. 6.6.","section":"Fig. 6.6 caption"},{"comment":"The proof of Theorem 6.3.1 is deferred to 'Appendix A, Theorem 2, in Ref. [217]'; since the manuscript is a thesis, including the proof or a self-contained sketch would improve verifiability.","section":"Sec. 6.3.1, Theorem 6.3.1"},{"comment":"The marginal eigenvalue distribution in Eq. (6.10) depends on an unspecified normalization constant N and on polynomials A_j^{(d,d)}(x) that are only partly displayed; the formulas are difficult to reproduce without the cited reference, and the displayed 4x4 example would benefit from a consistency check against the normalization condition.","section":"Sec. 6.1.1, Eq. (6.10)"},{"comment":"The summary table would be clearer if each row explicitly stated the domain of the monotone (pure state, subspace, or mixed state) and the exact rank parameter being bounded.","section":"Table 6.5"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is a PhD thesis with substantial review material; the original contribution is concentrated in Chapter 6. The self-citations for the distance-based representation of k-GME are appropriate, but the numerical border-rank claims need independent verification. The monotonicity violation in the Φ2 data is the kind of error that can likely be fixed by correcting the k-indexing and rerunning the reported computations; however, as it stands it blocks acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the k-GME generalization is a natural and mostly coherent extension of the geometric measure of entanglement, and the random-state analytic distributions are worth a look. But the central numerical demonstration—the border rank of the 2x2 matrix multiplication tensor—is broken by the paper's own definitions. Since E^(k) = 1 - max_{TR<k}|<phi|psi>|^2, the allowed set grows with k, so E^(k) must be nonincreasing in k. The thesis reports E^(7)(Phi2) ~ 1/8 and E^(6)(Phi2) ~ 10^-14, which violates that necessary inequality. If E^(6) is really ~10^-14, then E^(7) must also be ~0, and the claimed BR=7 conclusion cannot follow—the numbers would suggest BR<=5. A typo or off-by-one in the k-1 parameterization is the likely explanation, but as printed the flagship numerical claim doesn't hold up.\n\nWhat is actually new and good: the k-GME family is a clean extension to rank-bounded tensor rank; Theorem 6.1.4 gives an explicit analytic distribution for the smallest Schmidt eigenvalue and the associated distillation success probability, and the numerics agree with that distribution for 4x4 Haar random states. The subspace and mixed-state formulations are coherent, although the key distance-based equivalence is deferred to the author's own Ref. [217]. Numerical checks on Dicke states match known border ranks, and the manifold-trivialization approach scales better than SDP on the tested cases. That is genuine work.\n\nSoft spots beyond the Phi2 problem: the optimization is non-convex gradient descent, which the thesis itself says provides only upper bounds; there is no code or data release, no convergence diagnostics, and no error bars. The border-rank inferences therefore rest on an unverified global-optimality assumption. The internal contradiction is more decisive, but the reproducibility gaps are substantial for a thesis making numerical certification claims.\n\nThis is for quantum information readers interested in entanglement dimensionality measures and Haar random state distributions. The analytic parts are useful; the numerical border-rank claims need correction before anyone should rely on them.\n\nRecommendation: yes, send it to peer review—the framework and analytic results deserve referee time—but a referee should demand a fix for the monotonicity violation, proper convergence diagnostics, and code release. I would not cite the Phi2 result until it is corrected.","headline":"Solid k-GME framework with some nice analytic results, but the flagship border-rank claim for the matrix multiplication tensor is internally inconsistent as printed.","tokens_in":654,"tokens_out":833,"would_cite":false,"duration_ms":52872,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40","81P45"],"pacs":["03.67.Mn","03.67.-a"],"model":"deepseek-v4-flash","headline":"A ladder of geometric entanglement measures splits entanglement dimensionality exactly and is computable by gradient descent.","keywords":["geometric measure of entanglement","k-GME monotones","Schmidt number","border rank","tensor rank","convex roof construction","manifold trivialization","gradient descent"],"falsifier":"For the reported transition $E_G^{(6)}(|\\Phi_2\\rangle)\\approx 10^{-14}$, replace the heuristic gradient-descent search by a certified global maximization over states of tensor rank below 6; a certified positive value would falsify the border-rank claim $\\mathrm{BR}(|\\Phi_2\\rangle)=7$, while a certified zero would confirm it.","tokens_in":60444,"feed_emoji":"🔗","tokens_out":10540,"duration_ms":111720,"temperature":0.7,"pith_summary":"This thesis sets out to show that the geometric measure of entanglement, the squared-overlap distance from a state to the product states, can be promoted into a complete ladder of monotones: the $k$-th member $E_G^{(k)}$ measures the distance to all states of entanglement dimensionality below $k$. For bipartite mixed states the ladder exactly separates Schmidt numbers, and for multipartite pure states it exactly separates tensor-border ranks, provided the quantities can be evaluated. The thesis further argues they can be evaluated: the defining overlap maximization is rewritten as an unconstrained gradient-descent problem on a trivialized manifold, and the same scheme supplies upper bounds for subspace and mixed-state monotones alongside semidefinite-programming lower bounds. If the claims hold, one computational framework covers pure, subspace, and mixed entanglement quantification, including high-dimensional entanglement.","feed_headline":"Geometric ladder detects high-dimensional entanglement exactly","feed_subtitle":"A family of overlap-based measures separates Schmidt and border ranks, computable by gradient descent.","key_machinery":"The central object is the $k$-GME ladder. For each $k$, $E_G^{(k)}$ is the squared-overlap deficit from the given state to all states of Schmidt or tensor rank below $k$; for subspaces it is minimized over the subspace and reduces to the smallest expectation of the orthogonal-complement projector, and for mixed states it is the convex roof, which the thesis identifies with a fidelity distance to states of Schmidt number at most $k-1$. The computational engine is manifold trivialization: states of bounded rank are parameterized by unconstrained real parameters through the SoftPlus map for positive coefficients and normalization maps for local vectors, converting each non-convex overlap maximization into unconstrained gradient descent with automatic differentiation. The same parameterization yields upper bounds, while PPT and generalized-reduction relaxations provide semidefinite-programming lower bounds.","core_discovery":"On the paper's own terms, the discovery is that a one-parameter extension of the geometric measure, $E_G^{(k)}(|\\psi\\rangle)=1-\\max_{\\mathrm{SR}(|\\phi\\rangle)<k}|\\langle\\phi|\\psi\\rangle|^2$, carries exactly the information that distinguishes entanglement dimensionalities. For a mixed state $\\rho$, the convex-roof extension is simultaneously the fidelity distance $1-F(\\rho,\\sigma)$ to the set of states with Schmidt number at most $k-1$, and the thesis establishes that $\\mathrm{SN}(\\rho)=k$ exactly when $E_G^{(k)}(\\rho)>0$ and $E_G^{(k+1)}(\\rho)=0$. For multipartite pure states the same construction with tensor rank gives $\\mathrm{BR}(|\\psi\\rangle)=k$ exactly when $E_G^{(k)}(|\\psi\\rangle)>0$ and $E_G^{(k+1)}(|\\psi\\rangle)=0$. The thesis demonstrates the ladder on Haar-random bipartite states, subspace examples, Werner and isotropic states, Dicke states, and the $2\\times 2$ matrix-multiplication tensor, where the transition of $E_G^{(k)}$ at $k=6$ to a near-zero value is read as border rank $7$.","pith_inferences":["If the ladder characterization is stable under noise, a single fidelity measurement $|\\langle\\phi|\\psi\\rangle|^2$ with an optimized low-rank $\\phi$ could certify an entanglement-dimensionality lower bound without full tomography; the thesis does not develop this experimental witness interpretation.","The trivialized gradient-descent method is not specific to entanglement: the same parameterization could be pointed at tensor-rank and border-rank questions elsewhere in algebraic complexity, where exact answers are known for only a few tensors.","A testable extension is to apply the $k$-GME ladder to bound-entangled families with high Schmidt number and compare the predicted transitions with independent rigorous bounds from $k$-positive maps; agreement would strengthen the numerical optimality assumption.","Because the set of bounded-tensor-rank states is not closed, the max in the multipartite definition is formally a supremum; the numerical transition criteria presuppose that the trivialized search reaches that supremum, something the thesis does not prove."],"forward_implications":["Computing the $k$-GME ladder of a bipartite mixed state reads off its Schmidt number, because the first $k$ with $E_G^{(k)}(\\rho)>0$ and $E_G^{(k+1)}(\\rho)=0$ is exactly $\\mathrm{SN}(\\rho)$.","For multipartite pure states the same ladder determines border rank, giving a numerical probe of tensor border rank, a quantity connected to algebraic complexity.","Because the mixed-state $k$-GME is a fidelity distance, it can be sandwiched between gradient-descent upper bounds and semidefinite-programming lower bounds, so reported values can carry two-sided error estimates.","The subspace version certifies entanglement and its dimensionality in cases where PPT-based relaxations are blind, including completely entangled subspaces and high-dimensional entangled subspaces.","For Haar-random $d\\otimes d$ pure states the top-level value $E_G^{(d)}$ has the closed-form distribution $d(d^2-1)(1-dx)^{d^2-2}$, so high-dimensional entanglement is exponentially rare under uniform sampling and the optimal distillation probability of the maximally entangled state follows the same law."],"supporting_citations":[{"why":"Introduces the geometric measure of entanglement that the k-GME ladder generalizes.","marker":"[47–49]"},{"why":"Provides the general proof that convex-roof entanglement measures are LOCC monotones, making k-GME an entanglement monotone.","marker":"[114]"},{"why":"Contains the theorem identifying the convex-roof k-GME with the fidelity distance to states of bounded Schmidt number.","marker":"[217]"},{"why":"Nielsen's theorem, which the thesis links to k-GME ratios for deterministic and probabilistic entanglement transformation.","marker":"[79]"},{"why":"Gives the closest fully product state to a Dicke state and the resulting analytic GME used as a benchmark.","marker":"[131]"},{"why":"Supplies the proven border rank $m+1$ for Dicke states that the numerical k-GME transitions are checked against.","marker":"[179]"},{"why":"Provides the earlier border-rank value for the 2x2 matrix-multiplication tensor that the numerical result reproduces.","marker":"[182]"},{"why":"Constructs the high-dimensional entangled subspace used to test subspace k-GME in a case where PPT relaxation fails.","marker":"[187]"},{"why":"Defines Schmidt number and the k-positive generalized reduction maps used for semidefinite-programming lower bounds.","marker":"[60]"}],"fun_headline_variants":["New geometric ladder exactly identifies Schmidt number","Overlap ladder separates Schmidt and border ranks","Exact entanglement dimension from geometric measure ladder","Geometric measure extension gives exact dimension test","Ladder of geometric measures quantifies entanglement dimension"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The border-rank and Schmidt-number conclusions stand on the assumption that the non-convex gradient descent over the trivialized parameter space actually finds the global maximum overlap with states of bounded tensor rank, so that reported near-zero values such as $10^{-14}$ are genuine zeros rather than optimization failures.","fun_headline_variants_meta":{"raw":{"variants":["New geometric ladder exactly identifies Schmidt number","Overlap ladder separates Schmidt and border ranks","Exact entanglement dimension from geometric measure ladder","Geometric measure extension gives exact dimension test","Ladder of geometric measures quantifies entanglement dimension"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000983,"raw_usage":{"total_tokens":4176,"prompt_tokens":952,"completion_tokens":3224,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":568,"completion_tokens_details":{"reasoning_tokens":3158}},"tokens_in":568,"tokens_out":3224,"duration_ms":26756,"temperature":1.0,"reasoning_tokens":3158,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T04:07:29.137380+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For the reported transition $E_G^{(6)}(|\\Phi_2\\rangle)\\approx 10^{-14}$, replace the heuristic gradient-descent search by a certified global maximization over states of tensor rank below 6; a certified positive value would falsify the border-rank claim $\\mathrm{BR}(|\\Phi_2\\rangle)=7$, while a certified zero would confirm it.","supporting_citations":[],"review_version":1}