Experimental implementation of an efficient test of quantumness
- 9 January 2024
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (1)
Abstract
The authors implement a noninteractive test of quantumness, or an algorithm for verifying whether an untrusted device is capable of quantum computation, on an ion-trap quantum computer. Their results clearly exceed the classical bound.Keywords
All Related Versions
Funding Information
- Air Force Office of Scientific Research (FA9550-16-1-0495, FA9550-18-1-0161, FA9550-19-1-0399, W911NF1610349)
- Simons Foundation (828076)
- National Science Foundation (OMA-2016245, PHY-1125565)
- Institute for Quantum Information and Matter, California Institute of Technology
- Gordon and Betty Moore Foundation (GBMF-12500028)
- ETH Zürich Foundation
- Army Research Office
- Intelligence Advanced Research Projects Activity
- U.S. Department of Energy
This publication has 21 references indexed in Scilit:
- QIP = PSPACECommunications of the ACM, 2010
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Manipulation and detection of a trappedhyperfine qubitPhysical Review A, 2007
- Deterministic quantum teleportation with atomsNature, 2004
- PSPACE has constant-round quantum interactive proof systemsTheoretical Computer Science, 2003
- Multiparticle Entanglement of Hot Trapped IonsPhysical Review Letters, 1999
- On the power of multi-prover interactive protocolsTheoretical Computer Science, 1994
- IP = PSPACEJournal of the ACM, 1992
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991