Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead

@misc{matsui2026reducing,
  title = {{Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead}},
  author = {Kosuke Matsui and Jun-Yi Wu and Min-Hsiu Hsieh and Mio Murao},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.39865},
  eprint = {2609.39865},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.39865},
  note = {CC BY 4.0},
}

TY  - UNPB
TI  - Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
AU  - Kosuke Matsui
AU  - Jun-Yi Wu
AU  - Min-Hsiu Hsieh
AU  - Mio Murao
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.39865
UR  - https://arxiv.org/abs/2609.39865
AB  - 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.
ER  -