Embedding classical into quantum computation

Details Embedding classical into quantum computation Embedding classical into quantum computation

2008-12-24

arxiv.org/abs/0812.4511v1

LNCS 5393 Beth Festschrift, J Calmet, W. Geiselmann, J. Mueller-Quade (Eds.), pp43-49 (2008)

Physics

Quantum Physics

Invited paper for MMICS 2008 - Thomas Beth memorial conference

Scientific paper

We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits (Valiant's theorem) appear as two special cases. Viewing these simulatable classes as subsets of the space of all quantum computations, we may consider minimal extensions that suffice to regain full quantum computational power, which provides an approach to exploring the efficacy of quantum over classical computation.

Affiliated with

Also associated with

No associations

Rating

Embedding classical into quantum computation 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 Embedding classical into quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding classical into quantum computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-395928