Lewis, LauraZhu, DaiweiGheorghiu, AlexandruNoel, CrystalKatz, OrHarraz, BahaaWang, QingfengRisinger, AndrewFeng, LeiBiswas, DebopriyoEgan, LairdVidick, ThomasCetina, MarkoMonroe, Christopher2025-11-132025-11-132025-11-132024-01-0110.1103/PhysRevA.109.0126102-s2.0-85182280261https://infoscience.epfl.ch/handle/20.500.14299/255840A 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.enfalseExperimental implementation of an efficient test of quantumnesstext::journal::journal article::research article