Measurement-Based Classical Computation

Matty J. Hoban, Joel J. Wallman, Hussain Anwar, Naïri Usher, Robert Raussendorf, Dan E. Browne

Research output: Contribution to journalArticlepeer-review

Abstract

Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multiqubit quantum state. It is computationally equivalent to the circuit model. Unlike the circuit model, however, its classical analog is little studied. Here we present a classical analog of MBQC whose computational complexity presents a rich structure. To do so, we identify uniform families of quantum computations [refining the circuits introduced by Bremner Proc. R. Soc. A 467, 459 (2010)] whose output is likely hard to exactly simulate (sample) classically. We demonstrate that these circuit families can be efficiently implemented in the MBQC model without adaptive measurement and, thus, can be achieved in a classical analog of MBQC whose resource state is a probability distribution which has been created quantum mechanically. Such states (by definition) violate no Bell inequality, but, if widely held beliefs about computational complexity are true, they, nevertheless, exhibit nonclassicality when used as a computational resource—an imprint of their quantum origin.
Original languageEnglish
Article number140505
Pages (from-to)1-5
Number of pages5
JournalPhysical Review Letters
Volume112
DOIs
Publication statusPublished - 9 Apr 2014

Fingerprint

Dive into the research topics of 'Measurement-Based Classical Computation'. Together they form a unique fingerprint.

Cite this