Self-protected quantum algorithms based on quantum state tomography

Authors:
Lian-Ao Wu;Mark S. Byrd
Affiliations:
Department of Chemistry, Chemical Physics Theory Group, Center for Quantum Information and Quantum Control, University of Toronto, Toronto, Canada M5S 3H6 and Theoretical Physics and History of Sc ...;Department of Physics and Department of Computer Science, Southern Illinois University, Carbondale, USA 62901
Venue:
Quantum Information Processing
Year:
2009

Citing 6
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum computation and quantum information

Quantum computation and quantum information
Why haven't more quantum algorithms been found?

Journal of the ACM (JACM)
Progress in Quantum Algorithms

Quantum Information Processing
Simulation of quantum dynamics with quantum optical systems

Quantum Information & Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new quantum algorithms are given which are based on quantum state tomography. These include an algorithm for the calculation of several quantum mechanical expectation values and an algorithm for the determination of polynomial factors. These quantum algorithms are important in their own right. However, it is remarkable that these quantum algorithms are immune to a large class of errors. We describe these algorithms and provide conditions for immunity.