Metraipolis › archive › dc_b823683198cd

Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead — arXiv:2609.39865

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39865
License (as archived)
CC0-1.0
Archived
2026-10-07T15:21:43.964Z
SHA-256 of the archived text
128452caeb5a0f47a413a039603ef6af785121483f4b320a2be385a9644cf4a4
Stable URL of this page
https://metraipolis.com/documento/dc_b823683198cd

How to cite

Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead — arXiv:2609.39865 — arXiv (en), https://arxiv.org/abs/2609.39865 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b823683198cd (Metraipolis archive dc_b823683198cd, sha256 128452caeb5a0f47a413a039603ef6af785121483f4b320a2be385a9644cf4a4)
BibTeX
@misc{dcb823683198cd,
  title = {Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead — arXiv:2609.39865},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39865},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b823683198cd; sha256 128452caeb5a0f47a413a039603ef6af785121483f4b320a2be385a9644cf4a4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39865. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Distributed quantum computation connects multiple quantum processing units (QPUs) through quantum communication to jointly perform large-scale quantum computations. Since the number of qubits available at each QPU is limited, it is important to reduce quantum communication while keeping the qubit overhead small. To this end, we study an entanglement-assisted model, in which entanglement consumption serves as a measure of quantum communication cost. For exact deterministic implementations in this model, the operator Schmidt rank of the target bipartite unitary provides a general lower bound on entanglement cost when qubit overhead is unrestricted. However, it has remained unclear how closely this bound can be approached with constant qubit overhead. In this work, we show that this lower bound is attainable for every bipartite Clifford unitary using at most two auxiliary qubits per QPU. In addition, for non-Clifford unitaries specified by exact Clifford+$T$ decompositions with $T$-count $t$, we construct implementations with the same qubit overhead whose entanglement cost is at most $2t$ Bell pairs above this lower bound.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.39865 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:53:56.744Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).