Exact convergence times for generation of random bipartite entanglement

Simple item page
dc.creatorZnidaric, Marko
dc.date2008-09-03
dc.date2008-09-26
dc.date.accessioned2026-07-07T10:05:10Z
dc.date.available2026-07-07T10:05:10Z
dc.descriptionWe calculate exact convergence times to reach random bipartite entanglement for various random protocols. The eigenproblem of a Markovian chain governing the process is mapped to a spin chain, thereby obtaining exact expression for the gap of the Markov chain for any number of qubits. For protocols coupling nearest neighbor qubits and CNOT gate the mapping goes to XYZ model while for U(4) gate it goes to an integrable XY model. For coupling between a random pair of qubits the mapping is to an integrable Lipkin-Meshkov-Glick model. In all cases the gap scales inversely with the number of qubits, thereby improving on a recent bound in [Phys.Rev.Lett. 98, 130502 (2007)].
dc.description5 pages; v2.: few typos corrected
dc.identifierhttps://arxiv.org/abs/0809.0554
dc.identifierhttp://arxiv.org/abs/0809.0554
dc.identifierPhys. Rev. A 78, 032324 (2008)
dc.identifierdoi:10.1103/PhysRevA.78.032324
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169932
dc.subjectQuantum Physics
dc.subjectOther Condensed Matter
dc.subjectChaotic Dynamics
dc.titleExact convergence times for generation of random bipartite entanglement
dc.typetext

Files

Collections

arXiv