Statistical evaluation and optimization of entanglement purification
protocols
- URL: http://arxiv.org/abs/2402.12287v1
- Date: Mon, 19 Feb 2024 16:58:03 GMT
- Title: Statistical evaluation and optimization of entanglement purification
protocols
- Authors: Francesco Preti, J\'ozsef Zsolt Bern\'ad
- Abstract summary: Two-qubit entanglement purification protocols arecharacterization.
We show that pioneering protocols are unable to improve the estimated initial average concurrence.
We develop a more efficient protocol and investigate it numerically.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantitative characterization of two-qubit entanglement purification
protocols is introduced. Our approach is based on the concurrence and the
hit-and-run algorithm applied to the convex set of all two-qubit states. We
demonstrate that pioneering protocols are unable to improve the estimated
initial average concurrence of almost uniformly sampled density matrices,
however, as it is known, they still generate pairs of qubits in a state that is
close to a Bell state. We also develop a more efficient protocol and
investigate it numerically together with a recent proposal based on an
entangling rank-two projector. Furthermore, we present a class of variational
purification protocols with continuous parameters and optimize their output
concurrence. These optimized algorithms turn out to surpass former proposals
and our new protocol by means of not wasting too many entangled states.
Related papers
- Performance of entanglement purification including maximally entangled
mixed states [0.0]
Entanglement between distant quantum systems is a critical resource for implementing quantum communication.
We propose an entanglement purification protocol based on two entangling two-qubit operations.
Two variants of the core protocol are introduced and shown to be more practical in certain scenarios.
arXiv Detail & Related papers (2024-02-06T18:34:34Z) - Breeding protocols are advantageous for finite-length entanglement
distillation [0.5439020425818999]
We propose a framework of converting a stabilizer quantum error-correcting code to a breeding protocol.
In this paper, we show an example of a stabilizer that gives a breeding protocol better than hashing protocols.
arXiv Detail & Related papers (2024-01-04T13:33:57Z) - Efficient entanglement purification based on noise guessing decoding [0.0]
We propose a novel bipartite entanglement purification protocol built upon hashing and guessing random additive noise decoding (GRAND)
Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs.
arXiv Detail & Related papers (2023-10-30T18:28:09Z) - Entanglement Purification of Hypergraph States [0.0]
Entanglement purification describes a primitive in quantum information processing, where several copies of noisy quantum states are distilled into few copies of nearly-pure states of high quality.
We present optimized protocols for the purification of hypergraph states, which form a family of multi-qubit states that are relevant from several perspectives.
arXiv Detail & Related papers (2023-01-26T19:00:01Z) - Optimal two-qubit gates in recurrence protocols of entanglement purification [0.0]
The proposed method is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm.
We show for certain families of states that optimal protocols are not necessarily achieved by bilaterally applied controlled-NOT gates.
arXiv Detail & Related papers (2022-05-24T14:13:56Z) - Byzantine-Robust Federated Learning with Optimal Statistical Rates and
Privacy Guarantees [123.0401978870009]
We propose Byzantine-robust federated learning protocols with nearly optimal statistical rates.
We benchmark against competing protocols and show the empirical superiority of the proposed protocols.
Our protocols with bucketing can be naturally combined with privacy-guaranteeing procedures to introduce security against a semi-honest server.
arXiv Detail & Related papers (2022-05-24T04:03:07Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Reinforcement learning-enhanced protocols for coherent
population-transfer in three-level quantum systems [50.591267188664666]
We deploy a combination of reinforcement learning-based approaches and more traditional optimization techniques to identify optimal protocols for population transfer.
Our approach is able to explore the space of possible control protocols to reveal the existence of efficient protocols.
The new protocols that we identify are robust against both energy losses and dephasing.
arXiv Detail & Related papers (2021-09-02T14:17:30Z) - Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex
Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network.
We design two optimal algorithms that attain these lower bounds.
We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
arXiv Detail & Related papers (2021-06-08T15:54:44Z) - Entanglement purification by counting and locating errors with
entangling measurements [62.997667081978825]
We consider entanglement purification protocols for multiple copies of qubit states.
We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
arXiv Detail & Related papers (2020-11-13T19:02:33Z) - Adaptive Sampling for Best Policy Identification in Markov Decision
Processes [79.4957965474334]
We investigate the problem of best-policy identification in discounted Markov Decision (MDPs) when the learner has access to a generative model.
The advantages of state-of-the-art algorithms are discussed and illustrated.
arXiv Detail & Related papers (2020-09-28T15:22:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.