Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Three-copy undistillability of the boundary qutrit Werner state

Anonymous

Published Oct 4, 2026• 2 citations
Publisher

Abstract

Candidate computer-assisted proof of the unrestricted three-copy qutrit Werner endpoint and its full physical-parameter threshold, with exact rational data and a portable verifier. Supplied alternative-arithmetic audit has bounded implementation-diversity scope. Not journal peer review, exhaustive priority certification or an all-copy result. Original code is MIT; supplied review material retains its original terms.

DOI
10.5281/zenodo.23134453

Related papers

Undistillability of Werner states from three, four and five copies

Tejasvi Singh Tomar

A Werner state is three-copy distillable exactly when it is one-copy distillable. For every local dimension d ≥ 3, the Werner state ρ(d,α) = (I + αF)/(d² + αd) is three-copy distillable if and only if α < −1/2. The same threshold for two-copy distillability was proved in July 2026, and the qutrit case of the three-copy problem had been settled by an archived certificate. In every dimension we prove four-copy undistillability for α ≥ −79/160 and five-copy undistillability for α ≥ −9/20; for qutrits (d = 3) the bounds improve to −0.4979 and −0.47. Applied to disjoint groups of copies, the results for up to five copies give k-copy undistillability for α ≥ −11/(5k) when k ≥ 6, again in all dimensions. The endpoint α = −1/2 remains open from four copies on, and numerically the four-copy relaxation is not exact there. By a criterion of P. Costa Rico, each statement is equivalent to an inequality for complex matrices of rank at most two. We prove these inequalities with quartic moment relaxations and exact rational certificates. For three copies there is one certificate for each dimension up to 16, and one certificate whose entries are polynomials in 1/d covers every dimension d ≥ 9. For four and for five copies, one certificate each covers all dimensions from 1.25·10⁹ and from 10¹⁰ on, respectively, and zero padding passes both results to all smaller dimensions. The bound for many copies comes from a linear program over averaged partial-trace norms, with exact rational certificates. Version 3 adds results on the zeros of the endpoint form. For two copies, the range and co-range of any matrix at which the form vanishes lie in tensor products of two-dimensional subspaces, and each such plane carries a zero; in dimension four this gives all equality cases of a singular-value bound for Kronecker sums. For any number of copies the form is nonnegative near its generic zeros of this kind and, when it is nonnegative for one copy fewer, near product zeros. If k − 1 copies are settled, a failure at k copies would first appear below the endpoint, at a minimiser whose range and co-range have equal local supports of dimension at least three. A quantitative conjecture that would imply undistillability for all numbers of copies is stated and proved for two copies on one class of planes. The record contains the paper, seven verification packages with the certificates, verifiers and checks, and two Lean 4 formalizations: of the three-copy result for d = 3, …, 8, checked by Lean's kernel alone, and of the four-copy qutrit bound, in which the checks of the certificate identity are evaluated by compiled code.

•Oct 23, 2026•1 citation

Sums of Squares and Purity Splits at the Many-Copy Werner Endpoint

Washburn

•Sep 9, 2026•0 citations

Concentratable entanglement: counterexamples and sharp repairs

Anonymous

Unrefereed mathematical candidate. Exact counterexamples to a proposed universal mixed-state total concentratable-entanglement upper bound, including full-rank noisy and genuinely tripartite-entangled families; sharp uniform and fixed-size concave-roof impurity repairs. Analytic proofs and producer-side exact arithmetic checks are provided. AI-assisted internal review does not establish external peer review, independent reproduction, formal verification, priority or impact. Original prose and data CC0-1.0; original code MIT. Source literature retains its own terms.

•Oct 13, 2026•0 citations

A spectral-gap classification for flat Schmidt-rank-two chains

Anonymous

For homogeneous open nearest-neighbour chains with a normalised rank-one local projector whose forbidden vector has exactly two equal nonzero Schmidt probabilities, a written proof candidate classifies gappedness in every finite local dimension. Gaplessness is equivalent to a balanced-marker form and has exact finite-length gap 1−cos(π/N). All other interactions in the class have explicit uniform lower bounds. A complete qutrit short-spectrum fibre has fixed Schmidt probabilities, two- and three-site spectra and ground-space dimension at every length, yet only its endpoint is gapless. The proof distinguishes compatible propagation from an obstruction to four-site saturation. Unrefereed candidate. Producer-side exact and numerical replay corroborates finite statements, not universal analytic proofs. Supplied referee implementation and review are not authenticated unaffiliated reproduction or peer review. No exhaustive priority, experimental or impact claim. Version 1.0.1 repairs the symbolic classifier domain and adds precise antecedent locators and a named full Gram-decomposition lemma with explicit basis appendix. Original prose/data CC0-1.0; original code MIT; third-party exceptions in LICENSES.md.

•Sep 28, 2026•0 citations

Dimension Lifting of Finite-Copy Werner Undistillability

Xinjun Wang

•Oct 5, 2026•1 citation

Scheme for cloning an unknown single qutrit state with assistance

Zhang-Yin Wang, Hao Yuan, Shi Shou-Hua

Physica A Statistical Mechanics and its Applications•Aug 8, 2006•21 citations
Candidate computer-assisted proof of the unrestricted three-copy qutrit Werner endpoint and its full physical-parameter threshold, with exact rational data and a portable verifier. Supplied alternative-arithmetic audit has bounded implementation-diversity scope. Not journal peer review, exhaustive priority certification or an all-copy result. Original code is MIT; supplied review material retains its original terms.
A Werner state is three-copy distillable exactly when it is one-copy distillable. For every local dimension d ≥ 3, the Werner state ρ(d,α) = (I + αF)/(d² + αd) is three-copy distillable if and only if α < −1/2. The same threshold for two-copy distillability was proved in July 2026, and the qutrit case of the three-copy problem had been settled by an archived certificate. In every dimension we prove four-copy undistillability for α ≥ −79/160 and five-copy undistillability for α ≥ −9/20; for qutrits (d = 3) the bounds improve to −0.4979 and −0.47. Applied to disjoint groups of copies, the results for up to five copies give k-copy undistillability for α ≥ −11/(5k) when k ≥ 6, again in all dimensions. The endpoint α = −1/2 remains open from four copies on, and numerically the four-copy relaxation is not exact there. By a criterion of P. Costa Rico, each statement is equivalent to an inequality for complex matrices of rank at most two. We prove these inequalities with quartic moment relaxations and exact rational certificates. For three copies there is one certificate for each dimension up to 16, and one certificate whose entries are polynomials in 1/d covers every dimension d ≥ 9. For four and for five copies, one certificate each covers all dimensions from 1.25·10⁹ and from 10¹⁰ on, respectively, and zero padding passes both results to all smaller dimensions. The bound for many copies comes from a linear program over averaged partial-trace norms, with exact rational certificates. Version 3 adds results on the zeros of the endpoint form. For two copies, the range and co-range of any matrix at which the form vanishes lie in tensor products of two-dimensional subspaces, and each such plane carries a zero; in dimension four this gives all equality cases of a singular-value bound for Kronecker sums. For any number of copies the form is nonnegative near its generic zeros of this kind and, when it is nonnegative for one copy fewer, near product zeros. If k − 1 copies are settled, a failure at k copies would first appear below the endpoint, at a minimiser whose range and co-range have equal local supports of dimension at least three. A quantitative conjecture that would imply undistillability for all numbers of copies is stated and proved for two copies on one class of planes. The record contains the paper, seven verification packages with the certificates, verifiers and checks, and two Lean 4 formalizations: of the three-copy result for d = 3, …, 8, checked by Lean's kernel alone, and of the four-copy qutrit bound, in which the checks of the certificate identity are evaluated by compiled code.
Unrefereed mathematical candidate. Exact counterexamples to a proposed universal mixed-state total concentratable-entanglement upper bound, including full-rank noisy and genuinely tripartite-entangled families; sharp uniform and fixed-size concave-roof impurity repairs. Analytic proofs and producer-side exact arithmetic checks are provided. AI-assisted internal review does not establish external peer review, independent reproduction, formal verification, priority or impact. Original prose and data CC0-1.0; original code MIT. Source literature retains its own terms.
For homogeneous open nearest-neighbour chains with a normalised rank-one local projector whose forbidden vector has exactly two equal nonzero Schmidt probabilities, a written proof candidate classifies gappedness in every finite local dimension. Gaplessness is equivalent to a balanced-marker form and has exact finite-length gap 1−cos(π/N). All other interactions in the class have explicit uniform lower bounds. A complete qutrit short-spectrum fibre has fixed Schmidt probabilities, two- and three-site spectra and ground-space dimension at every length, yet only its endpoint is gapless. The proof distinguishes compatible propagation from an obstruction to four-site saturation. Unrefereed candidate. Producer-side exact and numerical replay corroborates finite statements, not universal analytic proofs. Supplied referee implementation and review are not authenticated unaffiliated reproduction or peer review. No exhaustive priority, experimental or impact claim. Version 1.0.1 repairs the symbolic classifier domain and adds precise antecedent locators and a named full Gram-decomposition lemma with explicit basis appendix. Original prose/data CC0-1.0; original code MIT; third-party exceptions in LICENSES.md.