Robust and efficient generator of almost maximal multipartite entanglement

TL;DR

This paper demonstrates that quantum chaotic maps can efficiently generate highly entangled states that are robust against noise, maintaining near-maximal bipartite entanglement even under realistic conditions.

Contribution

It introduces a method using quantum chaotic maps to produce robust, almost maximal multipartite entanglement suitable for practical quantum information tasks.

Findings

Multipartite entanglement remains almost maximal under noise

Distillable entanglement is robust against realistic noise levels

Noise tolerance decreases polynomially with the number of qubits

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.