Physics – Quantum Physics
Scientific paper
2006-09-07
Phys. Rev. A 75, 042311 (2007)
Physics
Quantum Physics
11 pages including 6 figures, revtex4; v2: presentation improved, sections VI and VII added; v3: small changes before publicat
Scientific paper
10.1103/PhysRevA.75.042311
We 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.
Garcia-Ripoll Juan Jose
Tóth Géza
No associations
LandOfFree
Efficient algorithm for multi-qudit twirling for ensemble quantum computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient algorithm for multi-qudit twirling for ensemble quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient algorithm for multi-qudit twirling for ensemble quantum computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-318026