English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Quantum computers will need effective error-correcting codes. Current quantumprocessors require precise control of each particle, so having fewer particlesto control might be beneficial. Although traditionally quantum computers areconsidered as using qubits (2-level systems), qudits (systems with more than2-levels) are appealing since they can have an equivalent computational spaceusing fewer particles, meaning fewer particles need to be controlled. In thiswork we prove how to construct codes with parameters $[[2^N,2^N-1-2N,\geq3]]_q$ for any choice of prime $q$ and natural number $N$. This is accomplishedusing the technique of local-dimension-invariant (LDI) codes. Generally LDIcodes have the drawback of needing large local-dimensions to ensure thedistance is at least preserved, and so this work also reduces this requirementby utilizing the structure of CSS codes, allowing for the aforementioned codefamily to be imported for any local-dimension choice.

Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise