Papers › Variational LOCC-assisted quantum circuits for long-range entangled states
Variational LOCC-assisted quantum circuits for long-range entangled states
Yuxuan Yan, Muzhou Ma, You Zhou, Xiongfeng Ma
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant experimental challenges. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC). With these classical components, one can communicate outcomes of midcircuit measurements in distant subsystems, substantially reducing circuit depth in many important cases. However, to prepare general long-range entangled states, finding LOCC-assisted circuits of a short depth remains an open question. Here, to address this challenge, we propose a quantum-classical hybrid algorithm to find optimal LOCC protocols for preparing ground states of given Hamiltonians. In our algorithm, we introduce an efficient way to estimate parameter gradients and use such gradients for variational optimization. Theoretically, we establish the conditions for the absence of barren plateaus, ensuring trainability at a large system size. Numerically, the algorithm accurately solves the ground state of long-range entangled models, such as the perturbed Greenberger-Horne-Zeilinger state and surface code. Our results demonstrate the advantage of our method over conventional unitary variational circuits: the practical advantage in the accuracy of estimated ground-state energy and the theoretical advantage in creating long-range entanglement.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections