Pith. sign in

REVIEW 1 major objections 8 minor 83 references

Treating symmetries as fixed points of quantum channels upgrades constrained de Finetti theorems to near-optimal rates and makes their inner approximations polynomial-time.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.5

2026-07-30 15:46 UTC pith:LDKM3BB2

load-bearing objection Solid theory paper that closes the efficient-inner gap for constrained de Finetti hierarchies and upgrades double-sided rates to nearly 1/n with constructive, constraint-compatible candidates. the 1 major comments →

arxiv 2607.23689 v1 pith:LDKM3BB2 submitted 2026-07-26 quant-ph math-phmath.MP

Fixed points in de Finetti hierarchies

Gereon Kossmann , Julius A. Zeiss This is my paper
classification quant-ph math-phmath.MP
keywords de Finetti theoremsfixed points of quantum channelsconditional expectationsconstrained separabilitySchur-Weyl dualityapproximate quantum error correctionentanglement-assisted capacitysymmetric extensions
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

De Finetti theorems turn permutation symmetry into approximate mixtures of product states, which is the engine behind many reductions in quantum statistics and separability hierarchies. This paper treats a broader class of constraints—states that are fixed points of quantum channels, including invariance under any compact group—as the same algebraic object: the range of a conditional expectation onto a finite-dimensional C*-algebra. With that normal form the authors bound mutual information by the block data of the fixed-point algebra, build measurements whose distortion depends only on the largest block, and compress the self-decoupling chain rule to polynomially many types. The payoff is a double-sided de Finetti theorem that converges as O(√(log n)/n), an interpolation theorem that recovers classical dimension-free behaviour for maximal tori, and a constructive rounding scheme that produces certifiably good separable candidates in time polynomial in 1/ε for fixed local dimensions. Together with existing efficient outer hierarchies this closes the loop for additive-error algorithms on constrained separability, bilinear optimization under symmetries, and approximate quantum error correction.

Core claim

When feasible states are fixed points of channels that admit a full-rank invariant state, the entanglement-assisted classical capacity of the dual conditional expectation is exactly log of the sum of squared block dimensions; combining that bound with block-adapted distortion constants and a type-compressed chain rule yields de Finetti theorems whose rates improve from O(1/√n) to O(√(log n)/n) for double-sided and Bose-symmetric extensions, while the measurement-based separable candidates remain feasible under the constraints and can be computed in poly(n) time from the compressed Schur form.

What carries the argument

The identification, via the mean-ergodic theorem, of fixed-point sets of channels with ranges of conditional expectations onto finite-dimensional C*-algebras; this supplies both the capacity bound CEA(E*) ≤ log(∑ d_i²) and the block-wise distortion bound c(M) ≤ 2 d_max that drive every subsequent rate.

Load-bearing premise

Every improved bound assumes the channel has a full-rank fixed point so that the ergodic projection is a conditional expectation onto a C*-algebra; without that the algebraic normal form and the capacity and distortion estimates fail.

What would settle it

Compute the mutual information of an explicit S_n-invariant state on (C^d)^⊗n whose block distribution is supported on partitions other than the symmetric subspace and check whether it exceeds log m_{(n)}²; if it does, the Bose-symmetric capacity claim is false. Alternatively, run the Schur-basis rounding of Theorem 6.9 on a known non-separable extension and verify that the produced candidates stay outside the claimed trace-distance ball.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Double-sided and Bose-symmetric de Finetti hierarchies now converge as O(√(log n)/n) while remaining constructive and constraint-compatible.
  • For fixed local dimensions, additive ε-error inner and outer approximations to SEP and cSEP can both be obtained in poly(1/ε) time.
  • Bilinear optimization under joint compact-group and permutation symmetries inherits the block-data convergence rate of the interpolation theorem.
  • Approximate quantum error correction admits a Bose-symmetric SDP hierarchy that avoids Kronecker-coefficient couplings and still converges as O(√(log n)/n).
  • Classical subsystems (maximal tori) recover dimension-independent rates inside the same information-theoretic framework.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same fixed-point toolbox should extend, with mixed Schur–Weyl duality, to fully double-sided algorithmic rounding, which the paper leaves open.
  • Lower bounds matching the √(log n)/n upper bound under nontrivial fixed-point constraints remain unexplored and would settle optimality.
  • Channels without full-rank fixed points (e.g., strictly contractive noise) may still admit approximate conditional expectations; quantifying the rate loss would widen applicability to realistic noise models.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 8 minor

Summary. The paper develops de Finetti hierarchies whose feasible states are fixed points of quantum channels, subsuming compact-group symmetries via Haar twirls. Its main technical ingredients are: (1) a tight entanglement-assisted capacity bound log(Σ_i d_i²) for duals of conditional expectations (Prop. 4.4), identified via the mean-ergodic theorem with the maximal mutual information of bipartite states obeying a fixed-point constraint, plus a classical-side-information variant log(Σ_i d_i) (Prop. 4.5); (2) block-wise distortion bounds for informationally complete measurements adapted to fixed-point algebras (Prop. 4.9, Cor. 4.10); (3) an exact compression of the self-decoupling chain rule to type registers for permutation-invariant states (Prop. 4.11, 4.13). From these the authors derive a double-sided de Finetti theorem with error 4d_Ad_B·√(2 ln 2 (d_A²-1) log(n+d_A)/n) (Thm. 5.1), an interpolation theorem whose dimension dependence is carried by the block structure of the constraint algebras (Thm. 5.3), a k-copy version with side information (Thm. 5.4), and a Bose-symmetric variant (Thm. 5.6). Section 6 shows the measurement-based rounding producing certifiably good separable inner approximations can be implemented in time polynomial in n (hence poly(1/ε)) for fixed local dimensions, working entirely in the Schur–Weyl/Gelfand–Tsetlin block picture (Thm. 6.9, with Bose-symmetric and constrained corollaries). Applications to symmetry-reduced bilinear optimization and to a Bose-sym.

Significance. If the results stand — and the main ones appear to — the paper makes real contributions: (i) an identification of constrained mutual-information maxima with entanglement-assisted capacities of conditional-expectation duals, with equality established by an explicit optimizer; (ii) a genuinely new interpolation theorem (Thm. 5.3/5.4) in which fixed-point constraints replace ambient dimensions by block data of the fixed-point algebra, recovering classical-like behavior for maximal tori; (iii) an exact type-based chain rule (Prop. 4.13); and (iv) a constructive, certifiable inner rounding sequence computable in time polynomial in the hierarchy level for fixed local dimensions (Thm. 6.9, Cor. 6.10–6.11), closing a concrete gap left by the efficient outer hierarchies of [56,82]. The Sec. 7 application to approximate quantum error correction, avoiding Kronecker-coefficient couplings via the Bose-symmetric variant, is a useful deliverable. Proofs are supplied in full and the constants are explicit, making the rates checkable and falsifiable.

major comments (1)
  1. [§5.1 / Abstract / §2.1] Abstract/§2.1, and §5.1 (Eq. 145–146): the central motivational claim — that the fixed-point techniques 'upgrade the information-theoretic rate to O(\sqrt{\log n/n})' and thereby 'recover the convergence rates provided by the unconstrained group-theoretic de Finetti theorems' — needs substantial qualification. A double-sided n-extension trivially yields a one-sided one by tracing out A_2...A_n (permutation invariance over the B-systems w.r.t. A_1 is preserved, as the paper's own definitions imply). The information-theoretic argument of §3.1 (Eq. 22) then already gives a separable approximant at distance ≤ 2d_B\sqrt{2\ln 2\cdot\log d_A/n} = O(n^{-1/2}) for fixed local dimensions — asymptotically better in n than Thm. 5.1's O(\sqrt{\log n/n}), and with smaller dimension constants. The 'obstacle' of linearly growing I(A^n:B^n) in Eq. 146 is thus an artifact of bounding that quantity rather
minor comments (8)
  1. [§4.5, Eq. (97)] Prop. 4.11, Eq. (97): the joint outcome probability is written p(y_2^{m_A+1}, z_2^{m_A+1}); the second string should be z_2^{m_B+1}.
  2. [§4.2 vs App. A.1] Lem. 4.3 and Lem. A.3 are the same statement with the same proof, stated twice (§4.2 and App. A.1). Please merge into a single reference.
  3. [§4.4, proof of Prop. 4.9] Prop. 4.9, proof, final chain of inequalities: the justifications are attached to the wrong lines ('in Eq. 86 the isometric invariance, in Eq. 87 the fact from Eq. 82, in Eq. 88 the Eq. 84'). Reading off the actual steps, Eq. 80/85 uses isometric invariance, Eq. 86 uses Eq. 82, and Eq. 88 uses Eq. 84 — please relabel.
  4. [§4.2, Rem. 4.6] Rem. 4.6 asserts improved exponents via Prop. 4.5 'e.g. ... in Thm. 5.1', but in Thm. 5.1 both sides are measured, so the post-measurement state no longer satisfies a fixed-point constraint on the unmeasured side and Prop. 4.5 does not obviously apply. Either give the derivation (presumably a two-stage one-sided argument) or restrict the remark to the settings where it is immediate (Thm. 5.3, 5.6).
  5. [§5.1, Thm. 5.1] Thm. 5.1's bound is asymmetric in (A,B) — the log carries (d_A^2-1) but the prefactor carries d_Ad_B — although the hypothesis is symmetric. Taking the minimum over the two sides is free and should be stated. Relatedly, please state explicitly which results need the full-rank hypothesis (Prop. 4.4, 4.9, Thm. 5.3, 5.4) versus where it is automatic (Haar twirls; Thm. 5.1, 5.6).
  6. [§6, Thm. 6.9] Thm. 6.9's certificate ϵ(d_A,n) uses the standard log d_A one-sided bound, so the improved bounds of §5 (Prop. 4.4/4.5, block-wise distortion) do not propagate into the rounding guarantee. A remark on whether the fixed-point improvements can tighten the inner-certificate rate would be valuable.
  7. [§6] §6 complexity statements are qualitative ('polynomial in n'). Since block dimensions scale as (n+d)^{d(d-1)/2} (Lem. C.1) and the final algorithm needs n = O(\|H\|^2/ε^2), please state explicit polynomial degrees in n (and their dependence on d_A, d_B) for Prop. 6.5/6.8/Thm. 6.9, so readers can judge practicality.
  8. [References / Acknowledgements] Reference list: [2] 'Antrophic' should presumably read 'Anthropic', and the acknowledgement 'the authors acknowledge the use of [2]' should specify the nature of the tool's use per journal disclosure policy. [44] lacks year/venue; [68] has inconsistent author formatting; [27] is unpublished lecture notes.

Circularity Check

0 steps flagged

No significant circularity: de Finetti rates and poly-time rounding are derived from stated lemmas, not forced by definition or self-citation chains.

full rationale

This is a self-contained mathematical derivation paper. The central claims (Thm. 5.1 double-sided rate, Thm. 5.3 interpolation, Thm. 5.6 Bose variant, Thm. 6.9 efficient rounding) are obtained by composing independently proved tools: the mean-ergodic identification of fixed-point sets with ranges of conditional expectations (Lem. 4.2 / Prop. A.1), the capacity/MI bound for duals of conditional expectations (Prop. 4.4, with a full elementary proof even though related direct-sum formulas are acknowledged from [40,42]), blockwise distortion (Prop. 4.9), and the type-compressed chain rule (Prop. 4.11–4.13). None of these steps defines the target quantity in terms of itself, fits a parameter to data then re-labels it as a prediction, or imports a uniqueness theorem that forbids alternatives. Self-citations to the authors’ [56,82,83] supply outer-hierarchy and Bose-purification ingredients that are extended (efficient inner sequence; Kronecker-free AQEC hierarchy) rather than assumed equivalent to the new rates. Standard external inputs (Pinsker, Schur–Weyl, MIC distortion of [51], classical type counting) are used as ordinary lemmas. No circular reduction is present.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

The work sits inside finite-dimensional quantum information theory. It inherits standard operator-algebra and representation-theory facts, plus the full-rank fixed-point hypothesis that turns ergodic projections into conditional expectations. No free parameters are fitted; the only modeling choice that is load-bearing and not forced by the ambient theory is the full-rank assumption on the channel fixed points.

axioms (5)
  • standard math Finite-dimensional C*-algebras are direct sums of full matrix algebras (Wedderburn); conditional expectations onto unital *-subalgebras admit the block form of Prop. 4.1.
    Used throughout Sec. 4 to obtain capacity and distortion bounds.
  • standard math Mean-ergodic theorem: for a unital 2-positive map whose dual has a full-rank fixed point, the Cesàro averages converge to a conditional expectation onto the fixed-point algebra (Prop. A.1).
    Lem. 4.2 identifies Fix(Φ*⊗id) with ran(E*⊗id), converting the constrained mutual-information program into the entanglement-assisted capacity of E*.
  • standard math Schur–Weyl duality and polynomial dimension bounds on Weyl modules / number of partitions with ≤d rows (Lem. C.1, Thm. D.11).
    Controls both the mutual-information bounds for permutation-invariant states and the poly(n) size of the compressed Schur form used in Sec. 6.
  • domain assumption Channels appearing as constraints admit a full-rank fixed point.
    Stated explicitly before Prop. 4.4, Prop. 4.9, Thm. 5.3; without it the algebraic normal form fails and the paper’s rates do not apply.
  • domain assumption Distortion bound c(M)≤2d for the MIC measurements of [51, Lem. 8], used block-wise.
    Imported from prior work; the paper only improves the ambient dimension d to the largest block size d_max.

pith-pipeline@v1.2.0-grok45-kimik3 · 76813 in / 2974 out tokens · 65509 ms · 2026-07-30T15:46:56.276263+00:00 · methodology

0 comments
read the original abstract

De Finetti theorems convert permutation symmetry into approximate mixtures of product states and thereby justify a wide range of reductions in classical and quantum statistics. In this work we study de Finetti hierarchies in which the feasible states are additionally constrained to be fixed points of quantum channels, a condition that subsumes invariance under arbitrary compact symmetry groups. Combining the mean-ergodic theorem with the structure theory of conditional expectations, we prove a tight bound on the entanglement-assisted classical capacity of the dual of a conditional expectation, block-wise distortion bounds for informationally complete measurements adapted to fixed point algebras, and an exact type-based refinement of the chain rule for permutation-invariant states. From these tools we derive several de Finetti theorems: a double-sided extension theorem with $O\left(\sqrt{\log n}/n\right)$ convergence, an interpolation theorem whose dimension dependence is governed solely by the block structure of the fixed point algebras and which recovers the dimension-independent classical behavior for maximal tori, and a Bose-symmetric variant. Exploiting Schur-Weyl duality and Gelfand-Tsetlin bases, we further show that the rounding scheme producing certifiably good separable inner approximations for (constrained) separability problems can be implemented in time polynomial in $1/\epsilon$ for fixed local dimensions, complementing the known efficient outer hierarchies. Applications to bilinear optimization under symmetries and to approximate quantum error correction are discussed.

Figures

Figures reproduced from arXiv: 2607.23689 by Gereon Kossmann, Julius A. Zeiss.

Figure 1
Figure 1. Figure 1: The Bratteli diagram of the family of symmetric group algebras C [S0] ,→ C [S1] ,→ · · · ,→ C [S4], also known as the Young lattice (cf. Ex. D.4). The Bratteli diagram of the permutation matrix algebras Ad k  k is obtained by removing all vertices violating ℓ (λ) ≤ d. Proposition D.6 ([35, Prop. 1.6 & Cor. 1.7]; see also [44, Prop. 2.7.6]). The collection {ϵT | T ∈ Paths (A )} is a family of pairwise orth… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

83 extracted references · 3 canonical work pages · 1 internal anchor

  1. [1]

    A translation of

    D. Alvarez-Melis and T. Broderick.“A translation of ”The characteristic function of a random phenome- non” by Bruno de Finetti”, (2015). Available online:https://arxiv.org/abs/1512.01229

    Pith/arXiv arXiv 2015

  2. [2]

    Available online:https://claude.ai

    Antrophic.“Fable 5”. Available online:https://claude.ai

  3. [3]

    Fixed points of quantum operations

    A. Arias, A. Gheondea, and S. Gudder.“Fixed points of quantum operations”. Journal of Mathematical Physics43(12): 5872–5881 (2002)

    2002

  4. [4]

    Monogamy of entanglement between cones

    G. Aubrun, A. M¨ uller-Hermes, and M. Pl´ avala.“Monogamy of entanglement between cones”. Mathematis- che Annalen391(1): 1591–1609 (2024)

    2024

  5. [5]

    Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms

    D. Bacon, I. L. Chuang, and A. W. Harrow.“Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms”. Physical Review Letters97(17) (2006). FIXED POINTS IN DE FINETTI HIERARCHIES49

    2006

  6. [6]

    The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits

    D. Bacon, I. L. Chuang, and A. W. Harrow.“The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits”. InProceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Al- gorithms, SODA ’07, page 1235–1244, USA(2007)

    2007

  7. [7]

    Permutationally invariant processes in open multiqudit systems

    T. Bastin and J. Martin.“Permutationally invariant processes in open multiqudit systems”. Journal of Physics A: Mathematical and Theoretical58(27): 275301 (2025)

    2025

  8. [8]

    Beck and S

    M. Beck and S. Robins.Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra. Springer New York (2015)

    2015

  9. [9]

    Entanglement-Assisted Classical Capacity of Noisy Quantum Channels

    C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal.“Entanglement-Assisted Classical Capacity of Noisy Quantum Channels”. Physical Review Letters83(15): 3081–3084 (1999)

    1999

  10. [10]

    Semidefinite programming hierarchies for constrained bilinear optimization

    M. Berta, F. Borderi, O. Fawzi, and V. B. Scholz.“Semidefinite programming hierarchies for constrained bilinear optimization ”. Mathematical Programming194(1–2): 781–829 (2021)

    2021

  11. [11]

    Multiplicity-free Kronecker products of characters of the symmetric groups

    C. Bessenrodt and C. Bowman.“Multiplicity-free Kronecker products of characters of the symmetric groups”. Advances in Mathematics322: 473–529 (2017)

    2017

  12. [12]

    A pattern calculus for tensor operators in the unitary groups

    L. C. Biedenharn and J. D. Louck.“A pattern calculus for tensor operators in the unitary groups”. Com- munications in Mathematical Physics8(2): 89–131 (1968)

    1968

  13. [13]

    Information-preserving structures: A general framework for quantum zero-error information

    R. Blume-Kohout, H. K. Ng, D. Poulin, and L. Viola.“Information-preserving structures: A general framework for quantum zero-error information ”. Physical Review A82(6) (2010)

    2010

  14. [14]

    Product-State Approximations to Quantum States

    F. G. S. L. Brand˜ ao and A. W. Harrow.“Product-State Approximations to Quantum States”. Communi- cations in Mathematical Physics342(1): 47–80 (2016)

    2016

  15. [15]

    Quantum de Finetti Theorems Under Local Measurements with Applications

    F. G. S. L. Brand˜ ao and A. W. Harrow.“Quantum de Finetti Theorems Under Local Measurements with Applications”. Communications in Mathematical Physics353(2): 469–506 (2017)

    2017

  16. [16]

    Inductive limits of finite dimensionalC ∗-algebras

    O. Bratteli.“Inductive limits of finite dimensionalC ∗-algebras”. Transactions of the American Mathemat- ical Society171(0): 195–234 (1972)

    1972

  17. [17]

    Bump.Lie Groups

    D. Bump.Lie Groups. Springer New York (2013)

    2013

  18. [18]

    High- dimensional quantum Schur transforms

    A. Burchardt, J. Fei, D. Grinko, M. Larocca, M. Ozols, S. Timmerman, and V. Visnevskyi.“High- dimensional quantum Schur transforms”, (2025). Available online:https://arxiv.org/abs/2509.22640

    arXiv 2025

  19. [19]

    B¨ urgisser, M

    P. B¨ urgisser, M. Clausen, and M. A. Shokrollahi.Algebraic Complexity Theory. volume 315 ofGrundlehren der mathematischen Wissenschaften, Springer Berlin Heidelberg (1997)

    1997

  20. [20]

    Carlen.Inequalities in Matrix Algebras

    E. Carlen.Inequalities in Matrix Algebras. American Mathematical Society (2025)

    2025

  21. [21]

    Weak Schur sampling with logarithmic quantum memory

    E. Cervero and L. Manˇ cinska.“Weak Schur sampling with logarithmic quantum memory”, (2023). Available online:https://arxiv.org/abs/2309.11947

    Pith/arXiv arXiv 2023

  22. [22]

    A memory and gate efficient algorithm for unitary mixed Schur sampling

    E. Cervero-Mart ´ ın, L. Manˇ cinska, and E. Theil.“A memory and gate efficient algorithm for unitary mixed Schur sampling”, (2024). Available online:https://arxiv.org/abs/2410.15793

    Pith/arXiv arXiv 2024

  23. [23]

    An Efficient Parameterized Algorithm for Computing Quantum Channel Fidelity via Symmetries Exploitation

    Y. M. Chee, H. Ta, and V. K. Vu.“An Efficient Parameterized Algorithm for Computing Quantum Channel Fidelity via Symmetries Exploitation ”. IEEE Transactions on Information Theory71(9): 7003–7015 (2025)

    2025

  24. [24]

    One-and-a-Half Quantum de Finetti Theorems

    M. Christandl, R. K¨ onig, G. Mitchison, and R. Renner.“One-and-a-Half Quantum de Finetti Theorems”. Communications in Mathematical Physics273(2): 473–498 (2007)

    2007

  25. [25]

    D. L. Cohn.Measure Theory: Second Edition. Springer New York (2013)

    2013

  26. [26]

    T. M. Cover and J. A. Thomas.Elements of Information Theory 2nd Edition (Wiley Series in Telecom- munications and Signal Processing). Wiley-Interscience (2006)

    2006

  27. [27]

    Representation theory of finite dimensional algebras

    A. Cox.“Representation theory of finite dimensional algebras”. Notes for the London Taught Course Centre , (2008)

    2008

  28. [28]

    Informationally complete measurements and group representation

    G. M. D Ariano, P. Perinotti, and M. F. Sacchi.“Informationally complete measurements and group representation ”. Journal of Optics B: Quantum and Semiclassical Optics6(6): S487–S491 (2004)

    2004

  29. [29]

    Funzione caratteristica di un fenomeno aleatorio

    B. de Finetti.“Funzione caratteristica di un fenomeno aleatorio”, (1931). memoirs of Bruno de Finetti

    1931

  30. [30]

    Emulation Capacity between Idempotent Channels

    I. Delsol, O. Fawzi, L. Gao, and M. Rahaman.“Emulation Capacity between Idempotent Channels”, (2025). Available online:https://arxiv.org/abs/2511.16299

    arXiv 2025

  31. [31]

    Finite forms of de Finetti’s theorem on exchangeability

    P. Diaconis.“Finite forms of de Finetti’s theorem on exchangeability”. Synthese36(2): 271–281 (1977)

    1977

  32. [32]

    Finite Exchangeable Sequences

    P. Diaconis and D. Freedman.“Finite Exchangeable Sequences”. The Annals of Probability8(4) (1980)

    1980

  33. [33]

    V. Dlab, Y. A. Drozd, and V. V. Kirichenko.Finite Dimensional Algebras. Springer Berlin/Heidelberg (1994)

    1994

  34. [34]

    Complete family of separability criteria

    A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri.“Complete family of separability criteria”. Physical Review A69(2) (2004)

    2004

  35. [35]

    Canonical idempotents of multiplicity-free families of algebras

    S. Doty, A. Lauve, and G. H. Seelinger.“Canonical idempotents of multiplicity-free families of algebras”. L’Enseignement Math´ ematique64(1): 23–63 (2019)

    2019

  36. [36]

    Dr´ abek and J

    P. Dr´ abek and J. Milota.Methods of Nonlinear Analysis: Applications to Differential Equations. Springer Basel (2013)

    2013

  37. [37]

    Sur les poly` edres rationnels homoth´ etiques ` a n dimensions

    E. Ehrhart.“Sur les poly` edres rationnels homoth´ etiques ` a n dimensions”. CR Acad. Sci. Paris254: 616, (1962)

    1962

  38. [38]

    Capacities of quantum Markovian noise for large times

    O. Fawzi, M. Rahaman, and M. Taheri.“Capacities of quantum Markovian noise for large times”, (2024). Available online:https://arxiv.org/abs/2408.00116. 50FIXED POINTS IN DE FINETTI HIERARCHIES

    Pith/arXiv arXiv 2024

  39. [39]

    Stationary states of quantum dynamical semigroups

    A. Frigerio.“Stationary states of quantum dynamical semigroups”. Communications in Mathematical Physics63(3): 269–276 (1978)

    1978

  40. [40]

    Simplifying additivity problems using direct sum constructions

    M. Fukuda and M. M. Wolf.“Simplifying additivity problems using direct sum constructions”. Journal of Mathematical Physics48(7) (2007)

    2007

  41. [41]

    Fulton and J

    W. Fulton and J. Harris.Representation Theory. Springer New York (2004)

    2004

  42. [42]

    Capacity Estimates via Comparison with TRO Channels

    L. Gao, M. Junge, and N. LaRacuente.“Capacity Estimates via Comparison with TRO Channels”. Com- munications in Mathematical Physics364(1): 83–121 (2018)

    2018

  43. [43]

    Matrix elements for the unitary groups

    I. Gelfand and M. Tsetlin.“Matrix elements for the unitary groups”. InDokl. Akad. Nauk SSSR, volume 71, pages 825–828, (1950)

    1950

  44. [44]

    Mixed Schur-Weyl duality in quantum information

    D. Grinko.“Mixed Schur-Weyl duality in quantum information ”, (2025)

    2025

  45. [45]

    Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information

    D. Grinko, A. Burchardt, and M. Ozols.“Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information ”, (2023). Available online:https://arxiv.org/abs/2310.02252

    Pith/arXiv arXiv 2023

  46. [46]

    Applications of coherent classical communication and the Schur transform to quantum information theory

    A. W. Harrow.“Applications of coherent classical communication and the Schur transform to quantum information theory”, (2005). Available online:https://arxiv.org/abs/quant-ph/0512255

    Pith/arXiv arXiv 2005

  47. [47]

    The Church of the Symmetric Subspace

    A. W. Harrow.“The Church of the Symmetric Subspace”, (2013). Available online:https://arxiv.org/ abs/1308.6595

    Pith/arXiv arXiv 2013

  48. [48]

    Structure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality

    P. Hayden, R. Jozsa, D. Petz, and A. Winter.“Structure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality”. Communications in Mathematical Physics246(2): 359–374 (2004)

    2004

  49. [49]

    Reduction criterion of separability and limits for a class of distillation protocols

    M. Horodecki and P. Horodecki.“Reduction criterion of separability and limits for a class of distillation protocols”. Physical Review A59(6): 4206–4216 (1999)

    1999

  50. [50]

    G. D. James.The representation theory of the symmetric groups. Springer (2006)

    2006

  51. [51]

    Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension

    H. H. Jee, C. Sparaciari, O. Fawzi, and M. Berta.“Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension ”, (2021).DOI: 10.4230/LIPICS.ICALP.2021.82

    work page doi:10.4230/lipics.icalp.2021.82 2021

  52. [52]

    Symmetric polynomials and the center of the symmetric group ring

    A.-A. Jucys.“Symmetric polynomials and the center of the symmetric group ring”. Reports on Mathemat- ical Physics5(1): 107–112 (1974)

    1974

  53. [53]

    A practical quantum algorithm for the Schur transform

    W. M. Kirby and F. W. Strauch.“A practical quantum algorithm for the Schur transform”. Quantum Information and Computation18(9 & 10): 721–742 (2018)

    2018

  54. [54]

    Almost-idempotent quantum channels and approximateC ∗-algebras

    A. Kitaev.“Almost-idempotent quantum channels and approximateC ∗-algebras”, (2025). Available online: https://arxiv.org/abs/2405.02434

    Pith/arXiv arXiv 2025

  55. [55]

    A de Finetti representation for finite symmetric quantum states

    R. K¨ onig and R. Renner.“A de Finetti representation for finite symmetric quantum states”. Journal of Mathematical Physics46(12) (2005)

    2005

  56. [56]

    On approximate quantum error correction for symmetric noise

    G. Koßmann, J. A. Zeiss, O. Fawzi, and M. Berta.“On approximate quantum error correction for symmetric noise”, (2025).DOI: 10.48550/ARXIV.2507.12326

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2507.12326 2025

  57. [57]

    A continuity theorem for Stinespring’s dilation

    D. Kretschmann, D. Schlingemann, and R. F. Werner.“A continuity theorem for Stinespring’s dilation ”. Journal of Functional Analysis255(8): 1889–1904 (2008)

    1904

  58. [58]

    An efficient high dimensional quantum Schur transform

    H. Krovi.“An efficient high dimensional quantum Schur transform”. Quantum3: 122 (2019)

    2019

  59. [59]

    Ultimate Data Hiding in Quantum Mechanics and Beyond

    L. Lami, C. Palazuelos, and A. Winter.“Ultimate Data Hiding in Quantum Mechanics and Beyond”. Communications in Mathematical Physics361(2): 661–708 (2018)

    2018

  60. [60]

    Semidefinite bounds for nonbinary codes based on quadruples

    B. Litjens, S. Polak, and A. Schrijver.“Semidefinite bounds for nonbinary codes based on quadruples”. Designs, Codes and Cryptography84(1–2): 87–100 (2016)

    2016

  61. [61]

    Combinatorics and Geometry of Transportation Polytopes: An Update

    J. A. D. Loera and E. D. Kim.“Combinatorics and Geometry of Transportation Polytopes: An Update”, (2013). Available online:https://arxiv.org/abs/1307.0124

    Pith/arXiv arXiv 2013

  62. [62]

    A new construction of Young’s seminormal representation of the symmetric groups

    G. Murphy.“A new construction of Young’s seminormal representation of the symmetric groups”. Journal of Algebra69(2): 287–297 (1981)

    1981

  63. [63]

    Theory for Equivariant Quantum Neural Networks

    Q. T. Nguyen, L. Schatzki, P. Braccia, M. Ragone, P. J. Coles, F. Sauvage, M. Larocca, and M. Cerezo. “Theory for Equivariant Quantum Neural Networks”. PRX Quantum5(2) (2024)

    2024

  64. [64]

    A new approach to representation theory of symmetric groups

    A. Okounkov and A. Vershik.“A new approach to representation theory of symmetric groups”. Selecta Mathematica2(4) (1996)

    1996

  65. [65]

    Petz.Quantum Information Theory and Quantum Statistics

    D. Petz.Quantum Information Theory and Quantum Statistics. Springer (2008)

    2008

  66. [66]

    The polarization hierarchy for polynomial optimization over con- vex bodies, with applications to nonnegative matrix rank

    M. Pl´ avala, L. T. Ligthart, and D. Gross.“The polarization hierarchy for polynomial optimization over con- vex bodies, with applications to nonnegative matrix rank”. Linear Algebra and its Applications723: 15–32 (2025)

    2025

  67. [67]

    New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity

    S. Polak.“New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity”, (2020). DOI: 10.48550/ARXIV.2005.02945

    Pith/arXiv arXiv doi:10.48550/arxiv.2005.02945 2020

  68. [68]

    Quantum statistical mechanics of general mean field systems

    Raggio, G.A. and Werner, R.F.“Quantum statistical mechanics of general mean field systems”, (1989). DOI: 10.5169/SEALS-116175

    work page doi:10.5169/seals-116175 1989

  69. [69]

    B. E. Sagan.The Symmetric Group. Springer New York (2001)

    2001

  70. [70]

    Information transmission under Markovian noise

    S. Singh and N. Datta.“Information transmission under Markovian noise”, (2024). Available online: https://arxiv.org/abs/2409.17743

    Pith/arXiv arXiv 2024

  71. [71]

    Zero-error communication under discrete-time Markovian dynam- ics

    S. Singh, M. Rahaman, and N. Datta.“Zero-error communication under discrete-time Markovian dynam- ics”. Quantum9: 1910 (2025). FIXED POINTS IN DE FINETTI HIERARCHIES51

    1910

  72. [72]

    Stratila and L

    S.-V. Stratila and L. Zsido.Lectures on von Neumann Algebras. Cambridge University Press (2019)

    2019

  73. [73]

    Takesaki.Theory of Operator Algebras I

    M. Takesaki.Theory of Operator Algebras I. volume 124 ofEncyclopaedia of Mathematical Sciences, Springer (2001)

    2001

  74. [74]

    Tomamichel.Quantum Information Processing with Finite Resources

    M. Tomamichel.Quantum Information Processing with Finite Resources. Springer International Publishing (2016)

    2016

  75. [75]

    Quantum coding with finite resources

    M. Tomamichel, M. Berta, and J. M. Renes.“Quantum coding with finite resources”. Nature Communica- tions7(1) (2016)

    2016

  76. [76]

    A New Approach to the Representation Theory of the Symmetric Groups. II

    A. M. Vershik and A. Y. Okounkov.“A New Approach to the Representation Theory of the Symmetric Groups. II”. Journal of Mathematical Sciences131(2): 5471–5494 (2005)

    2005

  77. [77]

    N. J. Vilenkin and A. U. Klimyk.Representations in the Gel’fand-Tsetlin Basis and Special Functions, page 361–446. Springer Netherlands (1992)

    1992

  78. [78]

    M. M. Wilde.Quantum Information Theory. Cambridge University Press (2016)

    2016

  79. [79]

    Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform

    A. Wills and S. Strelchuk.“Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform”, (2024). Available online:https://arxiv.org/abs/2305.04069

    Pith/arXiv arXiv 2024

  80. [80]

    Quantum Channels & Operations: Guided Tour

    M. M. Wolf.“Quantum Channels & Operations: Guided Tour”, (2012). Available online:https: //mediatum.ub.tum.de/download/1701036/1701036.pdf. Lecture notes (grey literature)

    arXiv 2012

Showing first 80 references.