pith. sign in

arxiv: quant-ph/0212134 · v1 · submitted 2002-12-23 · 🪐 quant-ph

Experimental application of decoherence-free subspaces in a quantum-computing algorithm

classification 🪐 quant-ph
keywords algorithmsubspacesdecoherence-freedfssquantumapplicationappropriatebeen
0
0 comments X
read the original abstract

For a practical quantum computer to operate, it will be essential to properly manage decoherence. One important technique for doing this is the use of "decoherence-free subspaces" (DFSs), which have recently been demonstrated. Here we present the first use of DFSs to improve the performance of a quantum algorithm. An optical implementation of the Deutsch-Jozsa algorithm can be made insensitive to a particular class of phase noise by encoding information in the appropriate subspaces; we observe a reduction of the error rate from 35% to essentially its pre-noise value of 8%.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.