Distributed Variational Quantum Optimisation by Entanglement-Selective Transport

Abstract:Distributed quantum optimisation is challenging because computing the problem cost function across multiple quantum processors requires non-local gates, which can incur overhead in latency and fidelity. Here we introduce QESTO, a distributed variational ansatz for graph-based discrete optimisation that requires only persistent pre-shared Bell pairs for remote operations. Using local operations, it encodes local constraint information in the Bell pairs that is leveraged to produce amplitude transfer towards globally valid distributed solution states. QESTO requires one Bell pair per distributed edge of the problem graph and, after initialisation of the Bell states, uses no non-local gates. On two bounded weighted Wang tile-matching problem ensembles, QESTO achieves stronger convergence to low-cost tilings than equivalently partitioned QAOA with no distributed gates at ansatz depths of two or higher, and exceeds the mean performance of monolithic QAOA at the deepest studied depth in both ensembles. These results suggest that persistent entanglement can support useful variational communication while reducing per-layer non-local gate overhead.

arXiv:2606.04548 [quant-ph]

(or arXiv:2606.04548v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2606.04548 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.