Exponential speedup with a single bit of quantum information: measuring the average fidelity decay.

@article{Poulin2004ExponentialSW,
  title={Exponential speedup with a single bit of quantum information: measuring the average fidelity decay.},
  author={D. Poulin and R. Blume-Kohout and R. Laflamme and H. Ollivier},
  journal={Physical review letters},
  year={2004},
  volume={92 17},
  pages={
          177906
        }
}
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation. Thus for those maps admitting an efficient gate decomposition, it provides an exponential speedup over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of eigenvector… Expand
55 Citations

Figures and Topics from this paper

Experimental approximation of the Jones polynomial with one quantum bit.
  • 30
  • PDF
Some Theory and Applications of Probability in Quantum Mechanics
Quantum dissonance and deterministic quantum computation with a single qubit
  • M. Ali
  • Computer Science, Physics
  • 2014
  • 6
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
Fidelity decay as an efficient indicator of quantum chaos.
  • 112
  • PDF
Efficient quantum computing of complex dynamics.
  • 56
  • PDF
Exponential gain in quantum computing of quantum chaos and localization.
  • 44
  • PDF
Classicality of quantum information processing
  • 9
  • PDF
Power of One Bit of Quantum Information
  • 563
  • PDF
Simulating quantum systems on a quantum computer
  • Christof Zalka
  • Physics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
  • 236
Quantum and classical correlations in quantum Brownian motion.
  • 53
  • PDF
...
1
2
3
4
5
...