Entanglement Breaking of All-Partition Compositions of a PPT Edge-State Channel Family

We exhibit an all-dimensional family of entanglement-breaking compositions built from distinct non-entanglement-breaking PPT edge-state channels of Sacchi type. For arbitrary subsets defining the two partitions, arbitrary positive family parameters, and any positive diagonal intermediate filter, the resulting Choi operator admits an explicit separable decomposition. A complete-positive matrix factorization handles the doubled-coherence blocks, leading to a pairwise entanglement-breaking class of normalized CPTP PPT channels. This is a theorem about a specific family with a common distinguished basis index, not a proof of the unrestricted PPT-cubed conjecture or a classification of general PPT compositions. Exact-rational and independent channel-level checks are included. Historical priority and external peer review remain open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-05
DOI
https://doi.org/10.5281/zenodo.23952123
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Entanglement Breaking of All-Partition Compositions of a PPT Edge-State Channel Family

Kias Henry
Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
preprint

Entanglement Breaking of All-Partition Compositions of a PPT Edge-State Channel Family

Kias Henry
preprint en

Abstract

We exhibit an all-dimensional family of entanglement-breaking compositions built from distinct non-entanglement-breaking PPT edge-state channels of Sacchi type. For arbitrary subsets defining the two partitions, arbitrary positive family parameters, and any positive diagonal intermediate filter, the resulting Choi operator admits an explicit separable decomposition. A complete-positive matrix factorization handles the doubled-coherence blocks, leading to a pairwise entanglement-breaking class of normalized CPTP PPT channels. This is a theorem about a specific family with a common distinguished basis index, not a proof of the unrestricted PPT-cubed conjecture or a classification of general PPT compositions. Exact-rational and independent channel-level checks are included. Historical priority and external peer review remain open.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon