Quantum / CONCEPT
Equivalence of bipartite encoder forms
For graphs with only input–output edges, equivalence generated by local complementation, the two vertex permutations, binary input-row addition and input-edge removal implies reachability by the two permutations and row additions alone.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES0
PROOF DEPTH6
DOCUMENT LINKS0
Output cut ranks determine the bipartite row space
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A product decomposition of the generalized CHSH groupsstructural-affinity · Closed
- Bipartite Hermitian Sector Decompositionstructural-affinity · Closed
- Connected encoder classes and powers of threestructural-affinity · Closed
- Exponential Square Weights and Catalan Paritystructural-affinity · Closed
- Five-mode local density fibresstructural-affinity · Closed
- Joint Observer Visible Space and Residualstructural-affinity · Closed
- Local B Readout Residual Dimensionstructural-affinity · Closed
- Multifactor Correlation Sector Decompositionstructural-affinity · Closed
- Reconstruction from even-legged hyperlinksstructural-affinity · Closed
- The forbidden-subgraph conjecture for MMI in graph statesstructural-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