Quantum algorithms which accept hot qubit inputs

Details Quantum algorithms which accept hot qubit inputs Quantum algorithms which accept hot qubit inputs

1999-06-29

arxiv.org/abs/quant-ph/9906112v1

Physics

Quantum Physics

4 pages, revtex, submitted June 29, 1999

Scientific paper

Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial question is whether they fundamentally limit the computational capacity of such machines. We study the limitations of a quantum computation model in which only ensemble averages of measurement observables are accessible. Furthermore, we stipulate that input qubits may only be prepared in highly random, ``hot'' mixed states. In general, these limitations are believed to dramatically detract from the computational power of the system. However, we construct a class of algorithms for this limited model, which, surprisingly, are polynomially equivalent to the ideal case. This class includes the well known Deutsch-Jozsa algorithm.

Affiliated with

Also associated with

No associations

Rating

Quantum algorithms which accept hot qubit inputs 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 Quantum algorithms which accept hot qubit inputs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum algorithms which accept hot qubit inputs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-422604