Embedding classical into quantum computation

Simple item page
dc.creatorJozsa, Richard
dc.date2008-12-24
dc.date.accessioned2026-07-07T12:21:56Z
dc.date.available2026-07-07T12:21:56Z
dc.descriptionWe 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.
dc.descriptionInvited paper for MMICS 2008 - Thomas Beth memorial conference
dc.identifierhttps://arxiv.org/abs/0812.4511
dc.identifierhttp://arxiv.org/abs/0812.4511
dc.identifierLNCS 5393 Beth Festschrift, J Calmet, W. Geiselmann, J. Mueller-Quade (Eds.), pp43-49 (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213489
dc.subjectQuantum Physics
dc.titleEmbedding classical into quantum computation
dc.typetext

Files

Collections

arXiv