When absolute maximal entanglement is unavailable in a state family, different objectives can select different distributions of residual entanglement. We determine exact trade-offs for qutrit stabilizer states and binary--ternary product states. For eight qutrits, evaluation of the complete published classification gives three nondominated balanced-cut entanglement profiles, characterized by the probabilities of obtaining three or four maximally entangled qutrit pairs. We relate the squared entropy-deficit objective to code weight enumerators and use a uniformity-forcing bound to prove that its eleven-qutrit minimum is six. The unique minimizing Clifford class is an already classified code, whose entropy profile also attains a sharp bound on average reference--erasure mutual information among four-uniform eleven-qutrit stabilizer states. In local dimension six, explicit sector alignments attain 56 maximally mixed four-party reductions, the maximum for arbitrary binary--ternary product states. Within the stabilizer product family, the exact cost--count Pareto boundary consists of $(44,48)$ and $(48,56)$. These results identify when aggregate optimization determines operational entanglement properties and when it does not. Published classifications supply coverage; analytical bounds, explicit witnesses, and independent arithmetic checks establish the stated consequences.
Comments
Substantially revised with new results and reproducibility materials. Title and author list updated
When absolute maximal entanglement is unavailable in a state family, different objectives can select different distributions of residual entanglement. We determine exact trade-offs for qutrit stabilizer states and binary--ternary product states. For eight qutrits, evaluation of the complete published classification gives three nondominated balanced-cut entanglement profiles, characterized by the probabilities of obtaining three or four maximally entangled qutrit pairs. We relate the squared entropy-deficit objective to code weight enumerators and use a uniformity-forcing bound to prove that its eleven-qutrit minimum is six. The unique minimizing Clifford class is an already classified code, whose entropy profile also attains a sharp bound on average reference--erasure mutual information among four-uniform eleven-qutrit stabilizer states. In local dimension six, explicit sector alignments attain 56 maximally mixed four-party reductions, the maximum for arbitrary binary--ternary product states. Within the stabilizer product family, the exact cost--count Pareto boundary consists of (44,48) and (48,56). These results identify when aggregate optimization determines operational entanglement properties and when it does not. Published classifications supply coverage; analytical bounds, explicit witnesses, and independent arithmetic checks establish the stated consequences.
Understanding and classifying multipartite entanglement is fundamental to quantum information processing. This work focuses on absolutely maximally entangled (AME) states, a class of highly entangled states characterized by their maximal entanglement across any bipartitions. To analyze and classify AME states, we employ the minimal decomposition entropy, defined as the minimum Rényi entropy Sq associated with the state's decomposition over all local product bases. This quantity identifies the product bases in which the state is maximally localized, thereby yielding optimal representations for analyzing properties of AME states.
We develop an efficient algorithm for computing the minimal decomposition entropy for finite q>1 and compare AME and Haar-random states for q=2 and q=∞ in qubit, qutrit, and ququad systems. For q=2, AME states of four qutrits and ququads show lower minimal entropy than generic states, indicating sparser optimal forms. For q=∞ -- related to the geometric measure of entanglement -- AME states exhibit higher entanglement. The algorithm also simplifies known AME states into sparser representations, aiding in distinguishing genuinely quantum AME states from those constructible from classical combinatorial designs. Our results advance the classification of AME states and demonstrate the utility of minimal decomposition entropy as both a local unitary invariant and a tool for state simplification.
Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems.
Achieving a genuine quantum advantage relies on two distinct non-classical resources that restrict efficient classical simulation: entanglement and magic (nonstabilizerness). We investigate the interplay between these resources by characterizing the Pareto frontiers of extreme magic at fixed entanglement for systems of two qutrits (d=3) and two ququints (d=5). Unlike the case of two qubits, the Schmidt spectrum for two qutrits features two independent entanglement parameters, resulting in two-dimensional Pareto surfaces. For the lower frontier, we recast the minimal magic as a compact function of concurrence and negativity, with a maximal value of ln2. For the upper frontier, we determine the maximal stabilizer Rényi entropy to be M2=ln(81/17)≈1.561, which tightens the previous theoretical bound of ln5≈1.609 and improves on earlier numerical estimates. The maximum magic is achieved at eighteen distinct maxima categorized into three families of six permutation-equivalent spectra. We provide analytical expressions for the maximal magic in the neighborhood of each maximum and for the corresponding maximally magical states which turn out to be Weyl-Heisenberg-covariant fiducial states for mutually unbiased bases. Finally, numerical analysis of two ququints (d=5) reveals six permutation-inequivalent maxima with a peak magic value of M2=ln(625/49)≈2.546. Based on these findings, we conjecture that the maximal magic for a bipartite system of two qudits with prime dimension d is given by ln[d4/(2d2−1)], which reproduces the previously known value for qubits, as well as the values derived here for qutrits and ququints.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
The direct static capacity region of a bipartite quantum state describes its asymptotic conversion into classical communication, quantum communication, and entanglement, with all communication directed from Alice to Bob. This paper gives a unified entropic converse for this region. The proof treats generated and consumed resources simultaneously and derives all three information inequalities for one local instrument. Its main ingredients are no-signalling, the chain rule, strong subadditivity, and continuity of conditional entropy. A supporting-hyperplane characterization leads to the static capacity formula, which is helpful in determining single-letterization of the capacity region. For a pure state of entanglement entropy h subjected to erasure with probability p, the complete region is the convex hull of 0 and (0,−ph,(1−p)h), plus the unit-resource cone. This statement holds for arbitrary collective instruments by using subset-entropy inequalities related to earlier methods used for the dynamic capacity region of the erasure channel. Complete characterizations also hold for symmetrically extendible states and locally flagged pure-state mixtures. For maximally correlated states, the optimization over local instruments admits an exact matrix formulation and an additive outer bound. An explicit qubit example shows that a nonorthogonal discarded quantum memory can outperform every efficient instrument and every instrument with conditionally commuting discarded states. For states obtained by qubit dephasing of Schmidt-aligned pure states, an exact threshold characterizes when the static capacity formula vanishes, at every blocklength and after regularization. Full single-letter characterizations for general Hadamard states and for the remaining trade-offs for dephased states remain open, with sufficient additivity conditions identified.
We determine the least Greenberger-Horne-Zeilinger (GHZ) extractability compatible with a Mermin-Ardehali-Belinskii-Klyshko (MABK) Bell score for every n≥3. Extractability is the largest squared overlap with a GHZ state obtainable by separate local quantum channels. Between the biseparable bound and the quantum maximum, its exact minimum is the affine interpolation from one half to one. This proves the bound conjectured for six or more parties. The result holds for arbitrary binary measurements and density operators on tensor products of finite- or infinite-dimensional local spaces. We also determine the exact minimum for qubits, which is strictly higher at every interior score. One qutrit and qubits elsewhere attain the unrestricted minimum with measurements fixed as the score varies and, at interior scores, realize the smallest product of ranks of the local reduced states among states attaining that minimum. For n≥4, the attaining state with this rank product is unique at each interior score, up to local isometries and party permutations. On one qutrit and qubits elsewhere, for n≥4 and scores a fixed fraction away from both endpoints, a sufficiently small excess of extractability above the minimum controls trace-norm distance to the attaining state of the same score, up to local unitaries. The dependence is of square-root order, with optimal exponent and explicit constants depending only on that fraction, uniformly in n. Equality and stability concern actual extractability; identical Bell statistics can accompany different extractabilities.