Universal Fault-Tolerant Computation on Decoherence-Free Subspaces

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, no figures. Many small changes and clarifications. Expanded discussion of relevance to solid-state implementations. T

Scientific paper

10.1103/PhysRevLett.85.1758

A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the properties that (i) only one- and two-qubit interactions are required, and (ii) the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under "collective decoherence" (qubit-permutation-invariant system-bath coupling). Our results have immediate relevance to a number of solid-state quantum computer implementations, in particular those in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled GaAs quantum dot arrays and the Si:$^{31}$P nuclear spin arrays.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Universal Fault-Tolerant Computation on Decoherence-Free Subspaces 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 Universal Fault-Tolerant Computation on Decoherence-Free Subspaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Fault-Tolerant Computation on Decoherence-Free Subspaces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-349922

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.