Measurement-Based Classical Computation

Research output: Contribution to journalArticleResearchpeer review

Authors

External Research Organisations

  • ICFO – The Institute of Photonic Sciences
  • University of Sydney
  • University College London (UCL)
  • University of British Columbia
View graph of relations

Details

Original languageEnglish
Article number140505
JournalPhysical review letters
Volume112
Issue number14
Publication statusPublished - 9 Apr 2014
Externally publishedYes

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.

ASJC Scopus subject areas

Cite this

Measurement-Based Classical Computation. / Hoban, Matty J.; Wallman, Joel J.; Anwar, Hussain et al.
In: Physical review letters, Vol. 112, No. 14, 140505, 09.04.2014.

Research output: Contribution to journalArticleResearchpeer review

Hoban MJ, Wallman JJ, Anwar H, Usher N, Raussendorf R, Browne DE. Measurement-Based Classical Computation. Physical review letters. 2014 Apr 9;112(14):140505. doi: 10.48550/arXiv.1304.2667, 10.1103/PhysRevLett.112.140505
Hoban, Matty J. ; Wallman, Joel J. ; Anwar, Hussain et al. / Measurement-Based Classical Computation. In: Physical review letters. 2014 ; Vol. 112, No. 14.
Download
@article{faee52e8c95c407bb0ad47a8197e6096,
title = "Measurement-Based Classical Computation",
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.",
author = "Hoban, {Matty J.} and Wallman, {Joel J.} and Hussain Anwar and Na{\"i}ri Usher and Robert Raussendorf and Browne, {Dan E.}",
year = "2014",
month = apr,
day = "9",
doi = "10.48550/arXiv.1304.2667",
language = "English",
volume = "112",
journal = "Physical review letters",
issn = "0031-9007",
publisher = "American Physical Society",
number = "14",

}

Download

TY - JOUR

T1 - Measurement-Based Classical Computation

AU - Hoban, Matty J.

AU - Wallman, Joel J.

AU - Anwar, Hussain

AU - Usher, Naïri

AU - Raussendorf, Robert

AU - Browne, Dan E.

PY - 2014/4/9

Y1 - 2014/4/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84898470712&partnerID=8YFLogxK

U2 - 10.48550/arXiv.1304.2667

DO - 10.48550/arXiv.1304.2667

M3 - Article

AN - SCOPUS:84898470712

VL - 112

JO - Physical review letters

JF - Physical review letters

SN - 0031-9007

IS - 14

M1 - 140505

ER -

By the same author(s)