Efficient algorithm for multi-qudit twirling for ensemble quantum computation

Simple item page
dc.creatorToth, Geza
dc.creatorGarcia-Ripoll, Juan Jose
dc.date2006-09-07
dc.date2007-04-26
dc.date.accessioned2026-07-07T07:58:18Z
dc.date.available2026-07-07T07:58:18Z
dc.descriptionWe present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can also be used for computing the twirled density matrix on a classical computer. The method is based on a simple non-unitary operation involving a random unitary. When applying this basic building block iteratively, the mean squared error of the approximation decays exponentially. In contrast, when averaging over random unitary matrices the error decreases only algebraically. We present evidence that the unitaries in our algorithm can come from a very imperfect random source or can even be chosen deterministically from a set of cyclically alternating matrices. Based on these ideas we present a quantum circuit realizing twirling efficiently.
dc.description11 pages including 6 figures, revtex4; v2: presentation improved, sections VI and VII added; v3: small changes before publication
dc.identifierhttps://arxiv.org/abs/quant-ph/0609052
dc.identifierhttp://arxiv.org/abs/quant-ph/0609052
dc.identifierPhys. Rev. A 75, 042311 (2007)
dc.identifierdoi:10.1103/PhysRevA.75.042311
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127957
dc.subjectQuantum Physics
dc.titleEfficient algorithm for multi-qudit twirling for ensemble quantum computation
dc.typetext

Files

Collections

arXiv