Quantum computational advantage attested by nonlocal games with the cyclic cluster state
arXiv:2110.04277 · doi:10.1103/PhysRevResearch.4.033068
Abstract
We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-readout errors, respectively. Our experimental results indicate that while this fidelity readily passes conventional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstrating a higher probability of success than what is possible by depth-1 classical circuits. Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases.
arXiv commentPublished in Physical Review Research, 12 + 9 pages, 4 figures, 3 tables
References in corpus (41)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
- Bell nonlocality
- Quantum computational advantage using photons
- Persistent entanglement in arrays of interacting particles
- Significant-loophole-free test of Bell's theorem with entangled photons
- A strong loophole-free test of local realism
- Strong quantum computational advantage using a superconducting quantum processor
- Multi-particle entanglement of hot trapped ions
- Demonstration of a small programmable quantum computer with atomic qubits
- Validating quantum computers using randomized model circuits
- Experimental entanglement of six photons in graph states
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Direct Fidelity Estimation from Few Pauli Measurements
- Manipulation and Detection of a Trapped Yb+ Ion Hyperfine Qubit
- Event-Ready Bell Test Using Entangled Atoms Simultaneously Closing Detection and Locality Loopholes
- Quantum advantage with shallow circuits
- Verified Quantum Information Scrambling
- Mitigating measurement errors in multi-qubit experiments
- Detecting Genuine Multipartite Entanglement with Two Local Measurements
- Graphical description of the action of local Clifford transformations on graph states
- Practical characterization of quantum devices without tomography
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Beyond Bell's Theorem: Correlation Scenarios
- Bell Inequalities for Graph States
- Nonlocality of cluster states of qubits
- Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
- Quantum advantage with noisy shallow circuits in 3D
- A unifying framework for relaxations of the causal assumptions in Bell's theorem
- Causal hierarchy of multipartite Bell nonlocality
- Non-adaptive Measurement-based Quantum Computation and Multi-party Bell Inequalities
- Efficient, stabilized two-qubit gates on a trapped-ion quantum computer
- Mermin inequalities for perfect correlations
- Correcting detection error in quantum computation and state engineering through data processing
- Beat note stabilization of mode-locked lasers for quantum information processing
- Modeling Pauli measurements on graph states with nearest-neighbor classical communication
- Quantum computational advantage with string order parameters of 1D symmetry-protected topological order
- Correlations for computation and computation for correlations
- Playing quantum nonlocal games with six noisy qubits on the cloud
- Benchmarks of Nonclassicality for Qubit Arrays