arXiv:2609.25571 · Physical Review A
A scalable entanglement distribution framework for hybrid quantum networks
Yaqi Zhao, Kan He, Jinchuan Hou, Yongtao Zhang, Nicolò Lo Piparo, Xiangyi Meng
Abstract
The realization of a scalable quantum network (QN) hinges on the efficient distribution of entanglement across heterogeneous hardware platforms. While traditional QN frameworks are often restricted to single-encoding schemes, relying exclusively on either discrete (DV) or continuous (CV) variables, such segregated architectures limit the capacity and interoperability of large-scale systems. Here, we propose a scalable hybrid entanglement distribution scheme that bridges these domains by mapping hybrid entanglement swapping and concentration at DV--CV interfaces onto a unified set of series and parallel graph rules. We demonstrate that our hybrid approach exhibits a {potential} performance advantage over traditional point-to-point generation of maximally entangled states, achieving enhanced end-to-end entanglement within series-parallel topologies. These results provide a theoretical foundation for designing resource-efficient, interpretable architectures for the future quantum internet.
AI Summary
The paper studies entanglement distribution in networks combining pure two-qubit DV links and CV two-mode squeezed vacuum links. It proposes recursively reducing homogeneous subgraphs using existing deterministic series/parallel rules, then processing the remaining DV–CV interfaces with majorization-based LOCC. For series connections, each CV resource with squeezing parameter $\chi$ is deterministically converted to a two-qubit state with largest Schmidt coefficient $\eta=\max\{1/2,1-\chi^2\}$, followed by deterministic DV swapping. The output concurrence is the product of elementary concurrences, independent of swapping order, giving singlet conversion probability $p=1-\sqrt{1-c^2}$. For a parallel DV–CV pair, joint concentration gives largest Schmidt coefficient $\zeta=\max\{1/2,\lambda(1-\chi^2)\}$ and $p=2(1-\zeta)$. Majorization and algebraic comparisons establish that these elementary series and parallel protocols perform at least as well as independently converting every link to a singlet. The rules are assembled recursively for series-parallel networks. For a double-link honeycomb lattice, finite-size Monte Carlo calculations and infinite-lattice percolation thresholds show no advantage from the proposed deterministic-swapping preprocessing. An alternative conditional Bell-measurement protocol can outperform the benchmark near specified threshold parameters, but direct exact chain analysis can require tracking up to $2^N$ conditional branches. The framework assumes pure resources and ideal operations; it does not establish global optimality or an optimal reduction order. Loss and noise are treated only through approximate effective pure-state parameters. Illustrative attenuation calculations omit postselection success probabilities, and realistic mixed-state, rate, memory and hardware models remain outside the analysis.
Error found: The homogeneous-first framework need not outperform PSC on the original network: a CV(χ=0.8)–CV(χ=0.8)–DV-singlet chain has original-network PSC probability 1 but yields SCP 0.8192 under the proposed preprocessing and distribution rules.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.