Quantum advantage from any non-local game
From MaRDI portal
Publication:6499327
DOI10.1145/3564246.3585164WikidataQ130871605 ScholiaQ130871605MaRDI QIDQ6499327FDOQ6499327
Authors: Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang 
Publication date: 8 May 2024
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Proposed experiment to test local hidden-variable theories
- Simple unified form for the major no-hidden-variables theorems
- Bell’s theorem without inequalities
- Nonlocality for two particles without inequalities for almost all entangled states
- The computational complexity of linear optics
- How to delegate computations
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum FHE (almost) as secure as classical
- Classical verification of quantum computations
- Succinct classical verification of quantum computation
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Delegation for bounded space
- Efficient Universal Quantum Circuits
- Classical vs quantum random oracles
- Title not available (Why is that?)
- The theory of hash functions and random oracles. An approach to modern cryptography
- Classical homomorphic encryption for quantum circuits
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Quantum Supremacy and the Complexity of Random Circuit Sampling
This page was built for publication: Quantum advantage from any non-local game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499327)
