Quantum / CONCEPT
Half-trace bounds for partial transposition
Finite bipartite partial transposes satisfy a universal half-trace lower bound.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH10
DOCUMENT LINKS0
Partial transpose of finite sums
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A partial-transpose floor for symmetric tensorsstructural-affinity · Closed
- Actual support coordinates of Petz recoverystructural-affinity · Closed
- Canonical Quantum Channel Data Processingstructural-affinity · Closed
- Dicke diagonal extension conesstructural-affinity · Closed
- Lieb overlap and the weighted resolvent budgetstructural-affinity · Closed
- Lieb overlap equality and a fixed Petz recoverystructural-affinity · Closed
- Schwarz and trace rigidity give actual Petz recoverystructural-affinity · Closed
- Supported entropy equality exactly characterizes fixed Petz recoverystructural-affinity · Closed
- Symmetric qudit states with an absolutely PPT spectrumstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance