Optimal two-qubit gates in recurrence protocols of entanglement purification
- URL: http://arxiv.org/abs/2205.12091v3
- Date: Tue, 16 Apr 2024 16:50:25 GMT
- Title: Optimal two-qubit gates in recurrence protocols of entanglement purification
- Authors: Francesco Preti, Tommaso Calarco, Juan Mauricio Torres, József Zsolt Bernád,
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates average concurrences where the probabilistic occurrence of mixed entangled states is also taken into account. We show for certain families of states that optimal protocols are not necessarily achieved by bilaterally applied controlled-NOT gates. As we discover several optimal solutions, the proposed method offers some flexibility in experimental implementations of entanglement purification protocols and interesting perspectives in quantum information processing.
Related papers
- Quantum metrology using quantum combs and tensor network formalism [0.0]
We develop an efficient algorithm for determining optimal adaptive quantum estimation protocols with arbitrary quantum control operations between subsequent uses of a probed channel.
We introduce a tensor network representation of an estimation strategy, which drastically reduces the time and memory consumption of the algorithm.
arXiv Detail & Related papers (2024-03-07T19:08:05Z) - Statistical evaluation and optimization of entanglement purification
protocols [0.0]
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.
arXiv Detail & Related papers (2024-02-19T16:58:03Z) - 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) - Finding, mapping and classifying optimal protocols for two-qubit
entangling gates [0.0]
We consider trapped neutral atoms excited to Rydberg states by different pulse sequences as an example of a flexible platform.
We characterize in detail the features of the solutions in parameter space, showing some correlations among the set of parameters.
arXiv Detail & Related papers (2023-04-27T16:48:22Z) - Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly [0.9208007322096532]
We consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model.
In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation.
We show a method to reduce the large search space representing all possible protocols.
arXiv Detail & Related papers (2022-09-07T03:33:09Z) - 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) - 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) - Logistic Q-Learning [87.00813469969167]
We propose a new reinforcement learning algorithm derived from a regularized linear-programming formulation of optimal control in MDPs.
The main feature of our algorithm is a convex loss function for policy evaluation that serves as a theoretically sound alternative to the widely used squared Bellman error.
arXiv Detail & Related papers (2020-10-21T17:14:31Z) - 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) - Planning in Markov Decision Processes with Gap-Dependent Sample
Complexity [48.98199700043158]
We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process.
We prove an upper bound on the number of calls to the generative models needed for MDP-GapE to identify a near-optimal action with high probability.
arXiv Detail & Related papers (2020-06-10T15:05:51Z)
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.