Computation with Unitaries and One Pure Qubit

Details Computation with Unitaries and One Pure Qubit Computation with Unitaries and One Pure Qubit

2006-08-17

arxiv.org/abs/quant-ph/0608132v2

Physics

Quantum Physics

16 pages, no figures, submitted to QIC. This version has an improved section on oracles, adds a note on entanglement, includes

Scientific paper

We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large unitary matrix. We show that this problem is complete for the complexity class, and derive some further fundamental features of the class. We conclude with a discussion of some associated open conjectures and new oracle separations between classes.

Affiliated with

Also associated with

No associations

Rating

Computation with Unitaries and One Pure Qubit 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 Computation with Unitaries and One Pure Qubit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation with Unitaries and One Pure Qubit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-388931