Quick Navigation
Topics
Quantum Algorithms
Optimal entanglement generation in GHZ-type states
arXiv
Authors: N. Giovenale, L. Hernandez-Martinez, A. P. Majtey, A. Valdés-Hernández
Year
2023
Paper ID
57182
Status
Preprint
Abstract Read
~2 min
Abstract Words
212
Citations
N/A
Abstract
The entanglement production is key for many applications in the realm of quantum information, but so is the identification of processes that allow to create entanglement in a fast and sustained way. Most of the advances in this direction have been circumscribed to bipartite systems only, and the rate of entanglement in multipartite system has been much less explored.Here we contribute to the identification of processes that favor the fastest and sustained generation of tripartite entanglement in a class of 3-qubit GHZ-type states. By considering a three-party interaction Hamiltonian, we analyse the dynamics of the 3-tangle and the entanglement rate to identify the optimal local operations that supplement the Hamiltonian evolution in order to speed-up the generation of three-way entanglement, and to prevent its decay below a predetermined threshold value. The appropriate local operation that maximizes the speed at which a highly-entangled state is reached has the advantage of requiring access to only one of the qubits, yet depends on the actual state of the system. Other universal (state-independent) local operations are found that conform schemes to maintain a sufficiently high amount of 3-tangle. Our results expand our understanding of entanglement rates to multipartite systems, and offer guidance regarding the strategies that improve the efficiency in various quantum information processing tasks.
Why This Paper Matters
- It adds a 2023 reference point for readers tracking recent quantum research.
- The entanglement production is key for many applications in the realm of quantum information, but so is the identification of processes that allow to create entanglement in a...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.