Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchComunicații cuantice

analiza aiqbench

This research introduces a novel lossless source coding scheme for quantum networks, enabling compact hierarchical addressing through prefix-suffix address spaces. By utilizing an isometric encoder-decoder with Huffman-based procedures, the study ensures unique decodability and perfect fidelity in scalable network architectures. The work bridges information theory and quantum physics to solve critical resource management challenges as interconnected quantum systems evolve.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Lossless Address Coding for Quantum Networks

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2607.23510v1 Announce Type: cross Abstract: As quantum systems advance toward interconnected architectures, the ability to identify nodes, manage resources, and support network-level functions becomes increasingly critical. In this work, we propose a lossless source coding scheme for addressing in quantum networks that enables compact, hierarchical, and coherently processable quantum address states. Specifically, we introduce a prefix-suffix address space and develop an isometric hierarchical encoder-decoder that guarantees unique decodability. We further provide a practical Huffman-based procedure that embeds prefix-free, length-eigenstate codewords into the address space, thereby preserving isometry. The scheme is particularly designed for networks with hierarchical structure, heterogeneous cluster sizes, and configurable address assignment to accommodate dynamic network conditions. A numerical example on a 13-node network demonstrates that the proposed hierarchical encoding scheme is feasible and achieves perfect fidelity. This work establishes a rigorous connection between source coding theory and quantum network design, offering a practical framework towards scalable and coherent quantum addressing.

Abstract:As quantum systems advance toward interconnected architectures, the ability to identify nodes, manage resources, and support network-level functions becomes increasingly critical. In this work, we propose a lossless source coding scheme for addressing in quantum networks that enables compact, hierarchical, and coherently processable quantum address states. Specifically, we introduce a prefix-suffix address space and develop an isometric hierarchical encoder-decoder that guarantees unique decodability. We further provide a practical Huffman-based procedure that embeds prefix-free, length-eigenstate codewords into the address space, thereby preserving isometry. The scheme is particularly designed for networks with hierarchical structure, heterogeneous cluster sizes, and configurable address assignment to accommodate dynamic network conditions. A numerical example on a 13-node network demonstrates that the proposed hierarchical encoding scheme is feasible and achieves perfect fidelity. This work establishes a rigorous connection between source coding theory and quantum network design, offering a practical framework towards scalable and coherent quantum addressing.

Information Theory (cs.IT); Networking and Internet Architecture (cs.NI); Quantum Physics (quant-ph)

arXiv:2607.23510 [cs.IT]

(or arXiv:2607.23510v1 [cs.IT] for this version)

https://doi.org/10.48550/arXiv.2607.23510 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 250 cuvinte

Subiecte conexe