Robust and Efficient Generator of Almost Maximal Multipartite Entanglement

2007/07/31 by Davide Rossini, Giuliano Benenti · 3 citations
Computer Science · Physics and Astronomy · #Chaos-based Image/Signal Encryption #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph

paper · pdf · doi:10.1103/physrevlett.100.060501

published as Phys. Rev. Lett. 100, 060501 (2008) · 4 pages, 4 figures. Published version

openalex publication_date 2008/02/11 · arxiv created 2008/02/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

Quantum chaotic maps can efficiently generate pseudorandom states carrying almost maximal multipartite entanglement, as characterized by the probability distribution of bipartite entanglement between all possible bipartitions of the system. We show that such multipartite entanglement is robust, in the sense that, when realistic noise is considered, distillable entanglement of bipartitions remains almost maximal up to a noise strength that drops only polynomially with the number of qubits.

Citations

• Randomizing Quantum States: Constructions and Applications
• Superdense Coding of Quantum States
• Quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations
• Remote Preparation of Quantum States
• Classical versus quantum errors in quantum computation of dynamical systems

Cited by

• Quantum circuit for three-qubit random states
• Role of chaos in quantum communication through a dynamical dephasing channel
• Statistical mechanics of multipartite entanglement

Related

• Genuine entanglement, distillability and quantum information masking under noise
• Maximally entangling states and dynamics in one dimensional nearest neighbor Floquet systems
• Multipartite Entanglement Measure : Genuine to Absolutely Maximally Entangled
• Maximally multipartite entangled states
• Quantum Pseudoentanglement