2007/02/28 by Marko Znidaric, Marko Žnidarič · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum many-body systems #quant-ph
paper · pdf · doi:10.1103/physreva.76.012318
published as Phys. Rev. A 76, 012318 (2007) · 9 pages, 9 PS figures; published version
openalex publication_date 2007/07/17 · arxiv created 2007/07/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We numerically study protocols consisting of repeated applications of two qubit gates used for generating random pure states. A necessary number of steps needed in order to generate states displaying bipartite entanglement typical of random states is considered. Numerics indicates that for a generic two qubit entangling gate the decay of purity is exponential with the decay time scaling as \ensuremath∼n, implying that of order \ensuremath∼n2 steps are needed to reach random bipartite entanglement. We also numerically identify the optimal two qubit gate for which the convergence is the fastest. Perhaps surprisingly, applying the same good two qubit gate in addition to a random single qubit rotations at each step leads to a faster generation of entanglement than applying a random two qubit transformation at each step.