Polarization Requirements for Ensemble Implementations of Quantum Algorithms with a Single Bit Output
arXiv:quant-ph/0508061 · doi:10.1103/PhysRevA.72.042337
Abstract
We compare the failure probabilities of ensemble implementations of quantum algorithms which use pseudo-pure initial states, quantified by their polarization, to those of competing classical probabilistic algorithms. Specifically we consider a class algorithms which require only one bit to output the solution to problems. For large ensemble sizes, we present a general scheme to determine a critical polarization beneath which the quantum algorithm fails with greater probability than its classical competitor. We apply this to the Deutsch-Jozsa algorithm and show that the critical polarization is 86.6%.
11 pages, 3 figures
References in corpus (4)
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Preparing high purity initial states for nuclear magnetic resonance quantum computing
- Scaling issues in ensemble implementations of the Deutsch-Jozsa algorithm
- Nuclear magnetic resonance implementation of the Deutsch-Jozsa algorithm using different initial states