Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2508.09110

Random Party Distillation on a Superconducting Processor

Alexander C. B. Greenwood, Jackson Russett, Hoi-Kwong Lo, Qian Li

Published Aug 12, 2025• 0 citations
arXivHTMLPDF

Abstract

Random party distillation refers to the process by which Einstein-Podolsky-Rosen pairs are probabilistically extracted from a single copy of a multipartite entangled state after multiple rounds of local operations and classical communications (LOCC). In this work, we propose a qubit-based implementation of a random party distillation protocol and demonstrate it on the superconducting hardware device, ibm_aachen. We implement up to 4-rounds of the protocol, achieving a distillation rate of ~0.85 pairs/ W state, surpassing previous experimental demonstrations. Our results demonstrate the utility of multi-round LOCC protocols in an experimental regime that remains comparatively unexplored.

DOI
10.48550/arxiv.2508.09110

Related papers

The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation

Guangkuo Liu, Ian M. George, Eric Chitambar

A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how many rounds of classical communication are needed to complete the task. Despite some results separating one-round versus two-round protocols, very little is known about higher round complexities. In this paper, we revisit the task of one-shot random-party entanglement distillation as a way to highlight some interesting features of LOCC round complexity. We first show that for random-party distillation in three qubits, the number of communication rounds needed in an optimal protocol depends on the entanglement measure used; for the same fixed state some entanglement measures need only two rounds to maximize whereas others need an unbounded number of rounds. In doing so, we construct a family of LOCC instruments that require an unbounded number of rounds to implement. We then prove explicit tight lower bounds on the LOCC round number as a function of distillation success probability. Our calculations show that the original W-state random distillation protocol by Fortescue and Lo is essentially optimal in terms of round complexity.

arXiv:2204.00781•Quantum•Sep 7, 2023•4 citations

Random-party entanglement distillation in multiparty states

Ben Fortescue, Hoi-Kwong Lo

We describe various results related to the random-party distillation of multiparty entangled states---that is, conversion of such states into entangled states shared between fewer parties, where those parties are not predetermined. In previous work we showed that certain output states (namely Einstein-Podolsky-Rosen pairs) could be reliably acquired from a prescribed initial multipartite state [namely the W state $|\text{W}⟩=\frac{1}{\sqrt{3}}(|100⟩+|010⟩+|001⟩)$] via random-party distillation that could not be reliably created between predetermined parties. Here we provide a more rigorous definition of what constitutes ``advantageous'' random-party distillation. We show that random-party distillation is always advantageous for W-class three-qubit states (but only sometimes for Greenberger-Horne-Zeilinger class states). We show that the general class of multiparty states known as symmetric Dicke states can be readily converted to many other states in the class via random-party distillation. Finally we show that random-party distillation is provably not advantageous in the limit of multiple copies of pure states.

arXiv:0709.4059•Physical Review A•Jul 25, 2008•23 citations

Random Bipartite Entanglement from W and W -Like States

Ben Fortescue, Hoi‐Kwong Lo

We describe a protocol for distilling maximally entangled bipartite states between random pairs of parties from those sharing a tripartite W state |W=(1/sqrt[3])(|100+|010+|001)(ABC), and show that the total distillation rate E(t)(infinity) [the total number of Einstein-Podolsky-Rosen (EPR) pairs distilled per W, irrespective of who shares them] may be done at a higher rate than EPR distillation between specified pairs of parties. Specifically, the optimal rate for distillation to specified parties has been previously shown to be 0.92 EPR pairs per W, while our protocol can asymptotically distill 1 EPR pair per W between random pairs of parties, which we conjecture to be optimal. We thus demonstrate a tradeoff between overall distillation rate and final distribution of EPR pairs. We further show that there exist states with fixed lower-bounded E(t)(infinity), but arbitrarily small distillable entanglement for specified parties.

arXiv:quant-ph/0607126•Physical Review Letters•Jun 28, 2007•56 citations

Bell-pair distillation under imperfect operations

András Kinyó, Tamás Kiss, Orsolya Kálmán

We recently proposed an entanglement distillation protocol based on local operations and classical communication that probabilistically and universally distills a maximally entangled Bell pair from multiple copies of an unknown two-qubit state [Phys. Rev. Lett. 135, 260202 (2025)]. Here, we investigate the robustness of this protocol against imperfections in its implementation. We consider several incoherent and coherent gate-error models, as well as measurement readout errors, and determine the regimes in which distillation enhances the fidelity with the target Bell state. We find that the protocol remains effective over substantial error ranges, although its robustness depends strongly on the type of error. We further analyze asymmetric errors between the two parties and identify conditions under which complementary postselection outcomes yield identical distillation dynamics, allowing the success probability to be enhanced.

quant-pharXiv:2610.35699•Oct 27, 2026•0 citations

Experimental random-party entanglement distillation via weak measurement

Zheng-Da Li, Xiao Yuan, Xu-Fei Yin +9 more

This work shows a proof-of-principle demonstration of the random entanglement distillation of Einstein-Podolsky-Rosen pairs from tripartite W states via weak measurements. The experimental distillation rate between two random parties appears larger than the theoretical limit of any distillation scheme between two specified parties.

Physical Review Research•Apr 16, 2020•7 citations

Practical Entanglement Distillation Protocols with Quadratic Error Suppression

Elisa Bäumer Marty

Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different chips or dilution refrigerators. Such inter-module operations can therefore become a dominant bottleneck, even when quantum error correction is applied. Entanglement distillation provides a natural way to trade additional operations and qubits for higher-fidelity entanglement. Standard distillation protocols, however, are usually formulated in an LOCC resource model, in which several noisy Bell pairs are generated initially and all subsequent processing consists only of local operations and classical communication. Here, we consider a generalized model tailored to modular quantum computing hardware, in which the two modules have access to high-fidelity local operations and to repeated uses of the same noisy inter-module entangling operation during the protocol. We develop practical small-scale entanglement distillation protocols designed to minimize both space and time overhead. Remarkably, our main protocol requires only two qubits per module, yet achieves quadratic error suppression of inter-module errors, assuming local operations are much cleaner. Compared with existing small-scale protocols, our space-optimal protocol provides more space- and time-efficient quadratic error suppression and achieves the best performance in our simulations and experiments on noisy links of current superconducting quantum processors. These results suggest that inter-module-gate-assisted entanglement distillation can be a practical primitive for overcoming noisy links in modular quantum computing architectures.

quant-pharXiv:2605.26757•May 27, 2026•0 citations
Random party distillation refers to the process by which Einstein-Podolsky-Rosen pairs are probabilistically extracted from a single copy of a multipartite entangled state after multiple rounds of local operations and classical communications (LOCC). In this work, we propose a qubit-based implementation of a random party distillation protocol and demonstrate it on the superconducting hardware device, ibm_aachen. We implement up to 4-rounds of the protocol, achieving a distillation rate of ~0.85 pairs/ W state, surpassing previous experimental demonstrations. Our results demonstrate the utility of multi-round LOCC protocols in an experimental regime that remains comparatively unexplored.
A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how many rounds of classical communication are needed to complete the task. Despite some results separating one-round versus two-round protocols, very little is known about higher round complexities. In this paper, we revisit the task of one-shot random-party entanglement distillation as a way to highlight some interesting features of LOCC round complexity. We first show that for random-party distillation in three qubits, the number of communication rounds needed in an optimal protocol depends on the entanglement measure used; for the same fixed state some entanglement measures need only two rounds to maximize whereas others need an unbounded number of rounds. In doing so, we construct a family of LOCC instruments that require an unbounded number of rounds to implement. We then prove explicit tight lower bounds on the LOCC round number as a function of distillation success probability. Our calculations show that the original W-state random distillation protocol by Fortescue and Lo is essentially optimal in terms of round complexity.
We describe various results related to the random-party distillation of multiparty entangled states---that is, conversion of such states into entangled states shared between fewer parties, where those parties are not predetermined. In previous work we showed that certain output states (namely Einstein-Podolsky-Rosen pairs) could be reliably acquired from a prescribed initial multipartite state [namely the W state ∣W⟩=13(∣100⟩+∣010⟩+∣001⟩)|\text{W}⟩=\frac{1}{\sqrt{3}}(|100⟩+|010⟩+|001⟩)∣W⟩=3​1​(∣100⟩+∣010⟩+∣001⟩)] via random-party distillation that could not be reliably created between predetermined parties. Here we provide a more rigorous definition of what constitutes ``advantageous'' random-party distillation. We show that random-party distillation is always advantageous for W-class three-qubit states (but only sometimes for Greenberger-Horne-Zeilinger class states). We show that the general class of multiparty states known as symmetric Dicke states can be readily converted to many other states in the class via random-party distillation. Finally we show that random-party distillation is provably not advantageous in the limit of multiple copies of pure states.
We describe a protocol for distilling maximally entangled bipartite states between random pairs of parties from those sharing a tripartite W state |W=(1/sqrt[3])(|100+|010+|001)(ABC), and show that the total distillation rate E(t)(infinity) [the total number of Einstein-Podolsky-Rosen (EPR) pairs distilled per W, irrespective of who shares them] may be done at a higher rate than EPR distillation between specified pairs of parties. Specifically, the optimal rate for distillation to specified parties has been previously shown to be 0.92 EPR pairs per W, while our protocol can asymptotically distill 1 EPR pair per W between random pairs of parties, which we conjecture to be optimal. We thus demonstrate a tradeoff between overall distillation rate and final distribution of EPR pairs. We further show that there exist states with fixed lower-bounded E(t)(infinity), but arbitrarily small distillable entanglement for specified parties.
We recently proposed an entanglement distillation protocol based on local operations and classical communication that probabilistically and universally distills a maximally entangled Bell pair from multiple copies of an unknown two-qubit state [Phys. Rev. Lett. 135, 260202 (2025)]. Here, we investigate the robustness of this protocol against imperfections in its implementation. We consider several incoherent and coherent gate-error models, as well as measurement readout errors, and determine the regimes in which distillation enhances the fidelity with the target Bell state. We find that the protocol remains effective over substantial error ranges, although its robustness depends strongly on the type of error. We further analyze asymmetric errors between the two parties and identify conditions under which complementary postselection outcomes yield identical distillation dynamics, allowing the success probability to be enhanced.
Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different chips or dilution refrigerators. Such inter-module operations can therefore become a dominant bottleneck, even when quantum error correction is applied. Entanglement distillation provides a natural way to trade additional operations and qubits for higher-fidelity entanglement. Standard distillation protocols, however, are usually formulated in an LOCC resource model, in which several noisy Bell pairs are generated initially and all subsequent processing consists only of local operations and classical communication. Here, we consider a generalized model tailored to modular quantum computing hardware, in which the two modules have access to high-fidelity local operations and to repeated uses of the same noisy inter-module entangling operation during the protocol. We develop practical small-scale entanglement distillation protocols designed to minimize both space and time overhead. Remarkably, our main protocol requires only two qubits per module, yet achieves quadratic error suppression of inter-module errors, assuming local operations are much cleaner. Compared with existing small-scale protocols, our space-optimal protocol provides more space- and time-efficient quadratic error suppression and achieves the best performance in our simulations and experiments on noisy links of current superconducting quantum processors. These results suggest that inter-module-gate-assisted entanglement distillation can be a practical primitive for overcoming noisy links in modular quantum computing architectures.