arXiv:2609.39865
Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
Kosuke Matsui, Jun-Yi Wu, Min-Hsiu Hsieh, Mio Murao
Abstract
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.
AI Summary
The paper asks whether bipartite unitaries can be implemented with low entanglement consumption when each quantum processor has only constant auxiliary-qubit space. It considers exact, deterministic LOCC protocols supplied with perfect Bell pairs, allowing mid-circuit measurement, reset, and qubit reuse. Entanglement cost counts consumed Bell pairs; auxiliary hardware for generating them is excluded from the space accounting. For every bipartite Clifford unitary $U_c$, it establishes an implementation consuming exactly $\log_2\operatorname{OpSch}(U_c)$ Bell pairs, attaining the operator-Schmidt-rank lower bound with at most two auxiliary qubits per processor. The construction uses the identity $\log_2\operatorname{OpSch}(U_c)=\operatorname{rank}S^{BA}$ for the Clifford’s binary symplectic representation. A recursive rank-reduction procedure decomposes the unitary into local Clifford operations and locally dressed CZ and SWAP blocks whose entanglement costs add to the lower bound. Implementing these blocks sequentially permits auxiliary-qubit reuse. For a unitary $U$ given by an exact Clifford+$T$ decomposition with $T$-count $t$, it gives the same space bound and Bell-pair cost $K\leq\lfloor\log_2\operatorname{OpSch}(U)\rfloor+2t$. This follows by collecting Clifford factors, implementing each resulting Pauli rotation with at most one Bell pair, and bounding the collected Clifford’s operator Schmidt rank by submultiplicativity. The non-Clifford bound is not generally tight and depends on the supplied decomposition. Determining minimum non-Clifford entanglement costs, and whether space constraints increase them, remains open; even the unrestricted-space minimum is not characterized in general.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 15 pages, 6 figures, 1 table