Pith. sign in

REVIEW 2 major objections 4 minor 38 references

Bundling of bipartite entanglement

T0 review · 2 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read In constrained energy subspaces, many distinct bipartitions of a quantum system provably share the same entanglement spectrum.

desk verdict Interesting framework and a genuinely useful polynomial-time verification algorithm, but the mixed-state theorem is false as stated; the pure-state result may survive a repair. read the letter →

arxiv 2512.16979 v3 pith:DRHN32JA submitted 2025-12-18 quant-ph math-phmath.MP

Maike Drieb-Schön , Florian Dreier , Wolfgang Lechner This is my paper · ORCID
classification quant-phmath-phmath.MP
keywords entanglementspectrumbipartiteconstrainedsubspaceparityembeddingquantumannealingbundlingreduceddensitymatrixequivalencerelation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish a structural fact about bipartite entanglement when a quantum state is confined to a subspace spanned by a fixed set of computational basis states: if two subsystems cut the basis set in the same 'pattern' of restrictions, then the reduced density matrices of the two subsystems have identical eigenvalues for every state in the subspace. This makes entanglement entropies of many different bipartitions 'bundle' to a single value under unitary evolution, which the authors observe in quantum annealing and QAOA simulations and then prove theoretically. The proof rests on an equivalence relation that compares, for each subsystem, how the basis states group when restricted to the subsystem and to its complement. As a practical payoff, for the parity embedding used in quantum optimization the paper derives an operator-based characterisation and a polynomial-time algorithm that decides whether two bipartitions belong to the same bundle.

What carries the argument

The load-bearing object is the equivalence relation ~R on subsystems, defined by equality of the unordered pair of quotient sets R/~A and R/~A^c. R is the set of computational basis states generating the constraint subspace; two states in R are in the same class of ~A if their restrictions to A coincide. The relation is sufficient for spectral equality, and Theorem 2 translates it into equality of bipartite operator sets O_A, O_{A^c} built from a commuting generator set of product operators. The operator formulation enables the polynomial-time parity-embedding algorithm; direct checking of ~R costs O(n|R|^2) and is generally exponential.

What would settle it

Take R to be all 3-qubit computational basis states, A1={1}, A2={2}, and |Ψ> = sqrt(0.6)|000> + sqrt(0.1)|100> + sqrt(0.3)|111>. Then A1 ~R A2 holds (both bipartitions give quotient-class counts 2 and 4), but Spec(ρ_A1) = {0.6, 0.4} while Spec(ρ_A2) = {0.7, 0.3}. Showing this difference would contradict Theorem 1 as stated; resolving it requires the ordered-equality assumption.

Watch

Extended reading notes

Core claim

The central claim, Theorem 1, is that for any two non-trivial subsystems A1 and A2 with A1 ~R A2, the entanglement spectra Spec(ρ_A1) and Spec(ρ_A2) coincide for every pure state—and, by Theorem 3, every mixed state—in the subspace spanned by R. The equivalence A1 ~R A2 holds exactly when the pair of quotient sets {R/~A1, R/~A1^c} equals the pair {R/~A2, R/~A2^c}, where two basis states are identified under ~A if their restrictions to A coincide. The theorem extends the elementary fact that A and its complement have identical spectra, and it implies equal values for every spectral entanglement measure. The converse is deliberately one-way: equal spectra for all states does not force A1 ~R A2

Load-bearing premise

The proof of Theorem 3 assumes, without loss of generality, that when the two unordered pairs of quotient sets coincide, they do so in matching order (R/~A1 = R/~A2 and R/~A1^c = R/~A2^c); crossed cases are not covered and can break the spectral equality.

Editorial extensions

If this is right

  • All entropy-based bipartite entanglement measures—von Neumann, Rényi, negativity, and others—take identical values on every bipartition in the same bundle.
  • For the parity embedding, equivalence of two bipartitions can be verified in polynomial time even though the constrained subspace is exponentially large.
  • In embedded quantum optimization, entanglement dynamics of different bipartitions coincide throughout the evolution whenever constraints keep the state inside the subspace.
  • Measuring the entanglement spectrum of one member of a bundle gives the spectrum of every member, potentially reducing experimental measurement effort.
  • For a 'double spanning tree' bipartition, the reduced density matrix spectrum directly reveals the probabilities of the basis states in the superposition.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: the proof of Theorem 3 can be repaired by making the equivalence relation order-sensitive (R/~A1 = R/~A2 and R/~A1^c = R/~A2^c); the current unordered statement overreaches in crossed cases, but the bundle phenomenology and the parity-embedding algorithm do not obviously depend on those cases.
  • Editorial inference: the same quotient-set criterion applies to any basis-set-restricted subspace, so it should transfer to symmetry-restricted or gauge-invariant sectors of other many-body models, not just optimization embeddings.
  • Editorial inference: because the entanglement spectrum is experimentally measurable, bundle classes with trivial operator sets could be used as built-in 'spectrometers' to read off the weights of basis states in a superposition—a use the paper mentions only as a side remark.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper studies bipartite entanglement in constrained subspaces spanned by subsets R of the computational basis. It defines an equivalence relation A1 ∼R A2 via equality of the unordered pair of quotient sets {R/∼A1, R/∼A1c} and {R/∼A2, R/∼A2c}, and claims (Theorem 1) that for every pure superposition in Q_R the reduced density matrices ρ_A1 and ρ_A2 have identical spectra, so all spectral entanglement measures are equal. Theorem 3 extends the claim to all mixed states in Mix(Q_R). The authors also provide an operator-based reformulation (Theorem 2), apply it to the parity and minor embeddings, and give a polynomial-time verification algorithm for the parity embedding. Numerical simulations of annealing processes are presented as evidence of the 'bundling' phenomenon.

Significance. If the pure-state part were proved correctly, the paper would offer a useful structural criterion for when entanglement spectra are identical across bipartitions in constrained Hilbert spaces, with a genuinely non-trivial algorithmic result for the parity embedding. The operator-based framework and the explicit verification algorithm are valuable and appear to be independent of the mixed-state issue. However, the advertised mixed-state generalization is false, and the proof of the pure-state theorem contains a gap that must be repaired. The paper therefore cannot be accepted in its present form; the central claim is defensible only after substantial correction and restriction.

major comments (2)
  1. [Sec. V A, Theorem 3] Theorem 3 is false as stated. Take n=3, R=H_3, A1={1}, A2={2,3}=A1^c. Then A1∼R A2 because the unordered pair {R/∼A1, R/∼A1^c} equals {R/∼A2, R/∼A2^c} by complementation. For ρ=(|000⟩⟨000|+|100⟩⟨100|)/2 ∈ Mix(Q_R), ρ_A1=(|0⟩⟨0|+|1⟩⟨1|)/2 has spectrum {1/2,1/2}, while ρ_A2=|00⟩⟨00| has spectrum {1,0}. Thus Spec(ρ_A1)≠Spec(ρ_A2). The proof's 'without loss of generality' reduction to the ordered case is invalid for mixed states, since pure-state Schmidt symmetry cannot be invoked. This is load-bearing: the abstract and conclusion advertise equal spectra for all mixed states in the subspace.
  2. [Sec. V A, proof of Theorem 3(i)] Even for the pure-state Theorem 1, the opening 'Without loss of generality we may assume R/∼A1=R/∼A2' is not justified by Def. III.2. From A1∼R A2 one may be in the crossed case R/∼A1=R/∼A2^c and R/∼A1^c=R/∼A2. For pure states the crossed case can be handled by applying the ordered argument to A1 and A2^c and then using Spec(ρ_A)=Spec(ρ_A^c), but this step is absent. The manuscript should either supply this argument or explicitly restrict the theorem to the ordered-equality condition.
minor comments (4)
  1. [Sec. III B, after Def. III.2] The text says 'quotient groups' but should read 'quotient sets'; the same typo appears in the table below the definition.
  2. [Sec. V B, Example 1 proof] In the final paragraph, the sentence 'If H|B is disconnected, it is sufficient to consider the case where the vertex set of H|B equals V...' appears twice in slightly different forms; the second occurrence should presumably refer to the connected case.
  3. [Sec. III B] The phrase 'such subspaces are typical exponentially large' is loose: R is a set of computational basis states, not itself a subspace. Rewording would avoid confusion.
  4. [Sec. IV B] The complexity statements would be clearer if the paper distinguished between the general verification cost O(n|R|^2) and the parity-embedding cost O(|V||E|min(|V|,|E|)), and stated precisely which operations are counted.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the central spectrum-bundling theorem is self-contained linear algebra with no fitted inputs.

full rationale

Theorem 1 is derived directly from the quotient-set condition A1 ∼R A2, which is defined independently of the claimed spectrum equality. The proof (Sec. V A) reduces the claim to Lemma 2, where the equality of spectra follows from equality of quotient partitions, and to an explicit coefficient-matrix argument. No parameter is fitted to data and then called a prediction; the numerical bundling is matched to, not used as, the theorem. The parity-embedding algorithm is supported by internally proven Lemmas 1, 5, 6 and 7 rather than by citation alone. Self-citations (Refs. [22], [34], [37]) supply examples and prior embedding terminology, but the load-bearing steps do not reduce to those citations. There is a serious correctness concern in the 'without loss of generality' step in the proof of Theorem 3(i): the ordered-equality reduction is not valid for crossed ∼R pairs and for mixed states, so Theorem 3 appears false as stated. That is a mathematical error, not circularity: the derivation does not assume its conclusion; it makes an unjustified symmetry assumption. Accordingly, no circular step is identified.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central theorem is parameter-free; the listed free parameters are simulation and clustering settings. No new physical entities are introduced; 'bundle' is a mathematical equivalence class.

free parameters (4)
  • DBSCAN radius ε = 10^-4
    Used only for numerical bundle detection; not part of the theorem.
  • Penalty strength C = C=4 (C=1 in Fig. 1c)
    Chosen to keep or allow leakage from the parity subspace in the anneals; demonstrative, not fitted.
  • Annealing times t_f = 800, 100, 11, 500
    Schedule hyperparameters for the three numerical regimes; not fitted.
  • Random field vector J~ = (0.58,-0.5,-0.3,-0.2,0.41,-0.53,0.48,-0.31,-0.19,0.39)^T
    Single problem instance; no averaging or error bars.
assumptions (4)
  • standard math Partial trace and Schmidt decomposition are standard linear algebra.
    Used throughout the proofs of Theorems 1 and 3.
  • domain assumption The annealing state remains in the constrained subspace when the energy gap is large enough.
    Sec. II B and III A; underlies the numerical interpretation of bundling.
  • ad hoc to paper Unordered pair equality of quotient sets can be upgraded to same-order equality in the proof of Theorem 3.
    False; crossed cases break Theorem 1.
  • domain assumption Parity-embedding definitions and the generator property of logical line operators are valid.
    Definitions from [34,37] and Lemma 6; needed for the polynomial algorithm.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Bundling of bipartite entanglement." pith.science (2026). https://pith.science/paper/DRHN32JA

@misc{pith2026251216979,
  author       = {Pith},
  title        = {Pith review of: Bundling of bipartite entanglement},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DRHN32JA}},
  note         = {Machine review of arXiv:2512.16979}
}
read the original abstract

We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We show that in quantum many-body systems the bipartite entanglement entropy is affected in such a way that it forms "bundles" under unitary time evolution. Leveraging the structure of the subspace, we present methods to verify whether the entanglement spectrum of two bipartitions is identical throughout the entire subspace. For the subspace defined by the parity embedding, we further provide an algorithm that can determine this in polynomial time.

Figures

Figures reproduced from arXiv: 2512.16979 by the authors.

Figure 1
Figure 1. Dynamics of von Neumann entanglement entropy SA(s) are presented in the top row for three different annealing processes with linear schedule and final annealing times (a) tf = 800, (b) tf = 100 and (c) tf = 11 of a system with ten physical qubits laid out on a square lattice realizing a parity embedding of a complete graph with five vertices. Here, we used the parity constraint strengths in (a)-(b) C = 4 and in (c) … view at source ↗
Figure 2
Figure 2. Bundles and dynamics of the von Neumann en￾tanglement entropy SA(s) for the example with nine phys￾ical qubits given in [22]. As sum constraint we chose ⟨σ˜ (3,4) z + ˜σ (1,4) z + ˜σ (1,6) z ⟩ = 3 and the initial state is set to |Ψ(0)⟩ = |011111010⟩ [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Parity encoding applied to the optimization prob￾lem used for the numerical simulations in [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Bundles of von Neumann entanglement entropy. On the left, all numerically detected entanglement entropy bundles for all 511 bipartitions for the first numerical example in Sec. III A are represented with bars. The bundles are enumerated from 0 to 50 along the x-axis an…
Figure 5
Figure 5. Figure 5: Entanglement spectrum dynamics for all bipartitions of the largest bipartition class given in the example at the beginning of Sec. III A, which contains all bipartitions of the highest entropy bundle in [PITH_FULL_IMAGE:figures/full_fig_p020_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

38 extracted references · 1 canonical work pages

  1. [1]

    De Chiara and A

    G. De Chiara and A. Sanpera, Reports on Progress in Physics81, 074002 (2018)

    2018

  2. [2]

    Li and F

    H. Li and F. D. M. Haldane, Phys. Rev. Lett.101, 010504 (2008)

    2008

  3. [3]

    J. R. Garrison and T. Grover, Phys. Rev. X8, 021026 (2018)

    2018

  4. [4]

    S. D. Geraedts, R. Nandkishore, and N. Regnault, Phys. Rev. B93, 174202 (2016)

    2016

  5. [5]

    S. D. Geraedts, N. Regnault, and R. M. Nandkishore, New Journal of Physics19, 113021 (2017)

    2017

  6. [6]

    Hauke, H

    P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Reports on Progress in Physics83, 054401 (2020)

    2020

  7. [7]

    Rajak, S

    A. Rajak, S. Suzuki, A. Dutta, and B. K. Chakrabarti, Phil. Trans. R. Soc. A.381, 20210417 (2022)

    2022

  8. [8]

    Farhi, J

    E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, arXiv preprint quant-ph/0001106 (2000)

    arXiv 2000

Show all 38 references
  1. [9]

    Cerezo, A

    M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles,3, 625

  2. [10]

    Or´ us and J

    R. Or´ us and J. I. Latorre, Phys. Rev. A69, 052308 (2004)

    2004

  3. [11]

    Lanting, A

    T. Lanting, A. J. Przybysz, A. Y. Smirnov, F. M. Spedalieri, M. H. Amin, A. J. Berkley, R. Harris, F. Al- tomare, S. Boixo, P. Bunyk, N. Dickson, C. Enderud, J. P. Hilton, E. Hoskinson, M. W. Johnson, E. Ladizin- sky, N. Ladizinsky, R. Neufeld, T. Oh, I. Perminov, C. Rich, M. ...

    2014

  4. [12]

    Hauke, L

    P. Hauke, L. Bonnes, M. Heyl, and W. Lechner, Frontiers in Physics3(2015)

    2015

  5. [13]

    Arute, K

    F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell,et al., Nature574, 505 (2019)

    2019

  6. [14]

    Bernien, S

    H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Om- ran, H. Pichler, S. Choi, A. S. Zibrov, M. Endres, M. Greiner, V. Vuleti´ c, and M. D. Lukin, Nature551, 579 EP (2017)

    2017

  7. [15]

    J. Koch, T. M. Yu, J. Gambetta, A. A. Houck, D. I. Schuster, J. Majer, A. Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, Phys. Rev. A76, 042319 (2007)

    2007

  8. [16]

    Saffman, T

    M. Saffman, T. G. Walker, and K. Mølmer, Rev. Mod. Phys.82, 2313 (2010)

    2010

  9. [17]

    Henriet, L

    L. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G.-O. Reymond, and C. Jurczak, Quan- tum4(2020)

    2020

  10. [18]

    Bloch, J

    I. Bloch, J. Dalibard, and W. Zwerger, Rev. Mod. Phys. 80, 885 (2008)

    2008

  11. [19]

    Vyskocil and H

    T. Vyskocil and H. Djidjev, Algorithms12(2019), 10.3390/a12040077

    2019 doi

  12. [20]

    Hen and F

    I. Hen and F. M. Spedalieri, Phys. Rev. Applied5, 034007 (2016)

    2016

  13. [21]

    Hen and M

    I. Hen and M. S. Sarandy, Phys. Rev. A93, 062312 (2016)

    2016

  14. [22]

    Drieb-Sch¨ on, K

    M. Drieb-Sch¨ on, K. Ender, Y. Javanmard, and W. Lech- ner, Quantum7, 951 (2023)

    2023

  15. [23]

    Binder and A

    K. Binder and A. P. Young, Rev. Mod. Phys.58, 801 (1986)

    1986

  16. [24]

    B. K. Chakrabarti, J.-i. Inoue, R. Tamura, and S. Tanaka,Quantum Spin Glasses, Annealing and Computation(Cambridge University Press, Cambridge, 2017)

    2017

  17. [25]

    R. D. Somma, D. Nagaj, and M. Kieferov´ a, Phys. Rev. Lett.109, 050501 (2012)

    2012

  18. [26]

    A. K. Pati and S. L. Braunstein, Journal of the Indian Institute of Science89, 295 (2009)

    2009

  19. [27]

    Horodecki, P

    R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Rev. Mod. Phys.81, 865 (2009). 18

    2009

  20. [28]

    Vidal and R

    G. Vidal and R. F. Werner, Phys. Rev. A65, 032314 (2002)

    2002

  21. [29]

    Calabrese and A

    P. Calabrese and A. Lefevre, Phys. Rev. A78, 032329 (2008)

    2008

  22. [30]

    Pollmann and J

    F. Pollmann and J. E. Moore, New Journal of Physics 12, 025006 (2010)

    2010

  23. [31]

    Pichler, G

    H. Pichler, G. Zhu, A. Seif, P. Zoller, and M. Hafezi, Phys. Rev. X6, 041033 (2016)

    2016

  24. [32]

    J. I. Cirac, D. Poilblanc, N. Schuch, and F. Verstraete, Phys. Rev. B83, 245134 (2011)

    2011

  25. [33]

    Schuch, D

    N. Schuch, D. Poilblanc, J. I. Cirac, and D. P´ erez-Garc ´ ıa, Phys. Rev. Lett.111, 090501 (2013)

    2013

  26. [34]

    Ender, R

    K. Ender, R. ter Hoeven, B. E. Niehoff, M. Drieb-Sch¨ on, and W. Lechner, Quantum7, 950 (2023)

    2023

  27. [35]

    Lechner, P

    W. Lechner, P. Hauke, and P. Zoller, Sci. Adv.1, 1500838 (2015)

    2015

  28. [36]

    Choi, Quantum Information Processing7, 193 (2008)

    V. Choi, Quantum Information Processing7, 193 (2008)

    2008

  29. [37]

    Dreier and W

    F. Dreier and W. Lechner, (2025), arXiv:2401.11980 [quant-ph]

    2025

  30. [38]

    Johansson, P

    J. Johansson, P. Nation, and F. Nori, Computer Physics Communications184, 1234 (2013). Appendix A: Example - parity embedding The initial optimization problem [Fig. 3, left] of the embedded problem analyzed at the beginning of Sec. III A is given by the Ising spin Hamiltonian ...

    2013

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.