Robust and efficient generator of almost maximal multipartite entanglement

Abstract

Quantum chaotic maps can efficiently generate pseudo-random 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.

4 pages, 4 figures. Published version

References in corpus (7)

• Aspects of generic entanglement
• Randomizing quantum states: Constructions and applications
• Superdense coding of quantum states
• Remote preparation of quantum states
• Entangling power of the quantum baker's map
• A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations
• Classical versus quantum errors in quantum computation of dynamical systems