Experimental implementation of an efficient test of quantumness

Laura Lewis; Daiwei Zhu; Alexandru Gheorghiu; Crystal Noel; Or Katz; Bahaa Harraz; Qingfeng Wang; Andrew Risinger; Lei Feng; Debopriyo Biswas; Laird Egan; Thomas Vidick; Marko Cetina; Christopher Monroe

doi:10.1103/PhysRevA.109.012610

Experimental implementation of an efficient test of quantumness

Laura Lewis, Daiwei Zhu, Alexandru Gheorghiu, Crystal Noel, Or Katz, Bahaa Harraz, Qingfeng Wang, Andrew Risinger, Lei Feng, Debopriyo Biswas, Laird Egan, Thomas Vidick, Marko Cetina, Christopher Monroe

Research output: Contribution to journal › Article › peer-review

Abstract

A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits nonclassical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification or noninteractive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient noninteractive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.

Original language	English
Article number	012610
Number of pages	8
Journal	Physical Review A
Volume	109
Issue number	1
DOIs	https://doi.org/10.1103/PhysRevA.109.012610
State	Published - 9 Jan 2024
Externally published	Yes

All Science Journal Classification (ASJC) codes

Atomic and Molecular Physics, and Optics

Access to Document

10.1103/PhysRevA.109.012610

https://arxiv.org/abs/2209.14316License: Other

Cite this

@article{3d639954caf64d38a017f05d2ca1f590,

title = "Experimental implementation of an efficient test of quantumness",

abstract = "A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits nonclassical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification or noninteractive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient noninteractive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.",

author = "Laura Lewis and Daiwei Zhu and Alexandru Gheorghiu and Crystal Noel and Or Katz and Bahaa Harraz and Qingfeng Wang and Andrew Risinger and Lei Feng and Debopriyo Biswas and Laird Egan and Thomas Vidick and Marko Cetina and Christopher Monroe",

note = "Publisher Copyright: {\textcopyright} 2024 American Physical Society.",

year = "2024",

month = jan,

day = "9",

doi = "10.1103/PhysRevA.109.012610",

language = "الإنجليزيّة",

volume = "109",

journal = "Physical Review A",

issn = "2469-9926",

publisher = "American Physical Society",

number = "1",

}

TY - JOUR

T1 - Experimental implementation of an efficient test of quantumness

AU - Lewis, Laura

AU - Zhu, Daiwei

AU - Gheorghiu, Alexandru

AU - Noel, Crystal

AU - Katz, Or

AU - Harraz, Bahaa

AU - Wang, Qingfeng

AU - Risinger, Andrew

AU - Feng, Lei

AU - Biswas, Debopriyo

AU - Egan, Laird

AU - Vidick, Thomas

AU - Cetina, Marko

AU - Monroe, Christopher

PY - 2024/1/9

Y1 - 2024/1/9

N2 - A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits nonclassical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification or noninteractive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient noninteractive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.

AB - A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits nonclassical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification or noninteractive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient noninteractive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.

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

U2 - 10.1103/PhysRevA.109.012610

DO - 10.1103/PhysRevA.109.012610

M3 - مقالة

SN - 2469-9926

VL - 109

JO - Physical Review A

JF - Physical Review A

IS - 1

M1 - 012610

ER -

Experimental implementation of an efficient test of quantumness

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this