Quantum / CONCEPT
Pure targets prevent general square-root savings
Pure-target quantum Cerny complexity grows linearly on constant binary words. The word consisting of m zeros has complexity m+1, so no uniform square-root bound holds.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
A realization for every constant word
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
- CanonicalFlagCompressionstructural-affinity · Closed
- Finite Kraus Quantum Channelsstructural-affinity · Closed
- Finite Kraus Representationsstructural-affinity · Closed
- Finite Reference Channel Distancestructural-affinity · Closed
- Finite Sector Channel Modelstructural-affinity · Closed
- Fu-Luo decoherence convexity is refutedstructural-affinity · Closed
- Operational sparse-probe compression boundstructural-affinity · Closed
- OrthogonalCoherentEmbeddingstructural-affinity · Closed
- ProbeComponentRigiditystructural-affinity · Closed
- The least trace-distance contraction coefficient over a classical channelstructural-affinity · Closed
- The overlap-to-purity part of Kopel's equality theoremstructural-affinity · Closed
- The Thue-Morse prefix 01101001 needs more than one qubitstructural-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