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

TL;DR
This paper demonstrates an efficient, non-interactive test of quantumness on an ion-trap quantum computer, showing clear quantum behavior beyond classical limits, advancing quantum cryptography verification methods.
Contribution
It presents the first implementation of an efficient, non-interactive quantumness test on a real quantum device, surpassing classical success bounds.
Findings
Successfully executed the test on an ion-trap quantum computer.
Achieved results that exceed classical success bounds.
Demonstrated practical feasibility of non-interactive quantumness testing.
Abstract
A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification, or non-interactive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient non-interactive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
