Classical command of quantum systems via rigidity of CHSH games
arXiv:1209.0449
Abstract
Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random key, with security based on the correctness of quantum mechanics. It would also allow for testing whether a claimed quantum computer is truly quantum. Here we report a technique by which a classical system can certify the joint, entangled state of a bipartite quantum system, as well as command the application of specific operators on each subsystem. This is accomplished by showing a strong converse to Tsirelson's optimality result for the Clauser-Horne-Shimony-Holt (CHSH) game: the only way to win many games is if the bipartite state is close to the tensor product of EPR states, and the measurements are the optimal CHSH measurements on successive qubits. This leads directly to a scheme for device-independent quantum key distribution. Control over the state and operators can also be leveraged to create more elaborate protocols for reliably realizing general quantum circuits.
16 pages, 4 figures. Sketches of proofs with all major ideas
References in corpus (25)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Quantum Teleportation is a Universal Computational Primitive
- Device-independent security of quantum cryptography against collective attacks
- Quantum Computing with Very Noisy Devices
- Hacking commercial quantum cryptography systems by tailored bright illumination
- No Signalling and Quantum Key Distribution
- Device-independent quantum key distribution secure against collective attacks
- Quantum Hacking: Experimental demonstration of time-shift attack against practical quantum key distribution systems
- Full-field implementation of a perfect eavesdropper on a quantum cryptography system
- Coding Theorem and Strong Converse for Quantum Channels
- Experimental Demonstration of Blind Quantum Computing
- Secure device-independent quantum key distribution with causally independent measurement devices
- Unconditionally verifiable blind computation
- Robust Self Testing of the Singlet
- Universally-composable privacy amplification from causality constraints
- Device independent state estimation based on Bell's inequalities
- Interactive Proofs For Quantum Computations
- Full security of quantum key distribution from no-signaling constraints
- Device-Independent Quantum Key Distribution with Commuting Measurements
- A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games
- Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
- Optimal robust quantum self-testing by binary nonlocal XOR games
- Quantum Information Processing with Adversarial Devices
- A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory
Cited by in corpus (6)
- Memory Attacks on Device-Independent Quantum Cryptography
- Unconditionally secure device-independent quantum key distribution with only two devices
- How to Verify a Quantum Computation
- Device-independent quantum key distribution secure against adversaries with no long-term quantum memory
- Limitations of semidefinite programs for separable states and entangled games
- Notes on Adiabatic Quantum Computers