This work proposes a distributed variational quantum computing protocol based on deterministic entanglement tuning that deterministically modulates pre-shared entanglement using only local operations and classical communication and suggests a practical alternative for near-term distributed quantum applications.
Abstract
Distributed quantum computing offers a scalable route to quantum information processing by entangling spatially separated processors. Although gate teleportation enables universal computation across distributed nodes, it requires repeated consumption of high-fidelity Bell pairs, ancillary qubits, and real-time feedforward, which imposes significant overhead and reduces fidelity. However, many variational quantum algorithms do not demand full universality; rather, they rely on sufficient expressibility to explore solution spaces effectively. Building on this, we propose a distributed variational quantum computing protocol based on deterministic entanglement tuning. In contrast to probabilistic filtering, our approach deterministically modulates pre-shared entanglement using only local operations and classical communication. We validate the protocol through a proof-of-principle experiment by estimating ground-state energies of the He-H$^+$ molecule and the Schwinger model, showing that diverse entanglement levels can be engineered to match problem-specific requirements. Our results suggest a practical alternative for near-term distributed quantum applications.
A simple repeat-until-success protocol is introduced that makes entanglement consumption adaptive to interaction strength and yields a total entanglement cost that scales linearly with evolution time and remains independent of Trotter error.
Tian-Feng Feng, Jin-Zhao Sun, Yun-Long Xiao et al.· 0 citations
We determine the preshared entanglement required for spatially separated parties, restricted to local operations and classical communication, to attain globally optimal probabilistic two-copy purification of arbitrary bipartite pure states under depolarizing noise. In every local dimension $d\ge 2$, one shared maximall...
Jia-Yi Zhao, Cheng-Kai Zhu, Xin Wang et al.· 0 citations
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 thi...
Kosuke Matsui, Jun-Yi Wu, Min-Hsiu Hsieh et al.· 0 citations
A quantum network architecture based on the Beneš switching topology that provides a universal switching framework for pairwise communications and is compatible in principle with quantum platforms supporting these capabilities is proposed.
Shu-Ming Hu, Jun-Hao Wei, Nuo-Ya Yang et al.· Chinese Physics B· 0 citations
Numerically study the tradeoff between depolarizing noise, entanglement as quantified by the bipartite negativity measure, and HOP in quantum volume circuits and highlight that under depolarizing noise, due to finite system size effects heavy output probabilities can be greater than $0.5$ while the bipartite negativity...
Long-distance entanglement distribution is hindered by photon loss in optical fibers and the nocloning theorem. Optical quantum repeater (QR) protocols rely on Bell state measurements (BSMs), they are intrinsically limited to probabilistic photon operations and fail 50% of the time. We propose a hybrid approach to buil...
Francesco Fiorini, Jing Wu, Andrew R. Cameron et al.· Physical Review A· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.