Startup NetworxMountain West
DirectoryPeoplePatentsRFPs & GrantsAnalysisSignal
Sign In
Startup Networx

A commons for deep tech in the Mountain West. Built and maintained by the community it serves. Open data, CC-BY.

© 2026 Startup Networx
Discover
DirectoryOpen RFPsEvents
Community
NewsResourcesDashboard
Contribute
Add an orgSuggest an editClaim an org
About
Embed widgetsModerationPrivacySign in
← News
News

High-Rank Encoding Can Improve Approximate Quantum Error Correction

Conventional quantum-code constructions encode pure logical states as pure code states, but this restriction can sacrifice performance. We show that intrinsic encoding randomness can improve optimal entanglement fidelity. We bound the loss from imposi

quantum
Read on arxiv.orgvia RSS

From the feed

Conventional quantum-code constructions encode pure logical states as pure code states, but this restriction can sacrifice performance. We show that intrinsic encoding randomness can improve optimal entanglement fidelity. We bound the loss from imposing a rank-one encoder and prove it is at most quadratic near perfect recovery after joint optimization. The optimized advantage survives small noise perturbations. An explicit noise family requires higher-rank encoders arbitrarily close to perfect recovery, with every optimal encoder mapping pure inputs to mixed code states.

Continue reading on arxiv.org