The following pages link to Thomas Vidick (Q356691):
Displaying 50 items.
- Explicit lower and upper bounds on the entangled value of multiplayer XOR games (Q356692) (← links)
- Using entanglement in quantum multi-prover interactive proofs (Q626625) (← links)
- All Schatten spaces endowed with the Schur product are \(Q\)-algebras (Q652427) (← links)
- Entanglement in non-local games and the hyperlinear profile of groups (Q1991513) (← links)
- Classical proofs of quantum knowledge (Q2056758) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources (Q2292697) (← links)
- A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries (Q2292881) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- Rigorous RG algorithms and area laws for low energy eigenstates in 1D (Q2412377) (← links)
- Trading locality for time: certifiable randomness from low-depth circuits (Q2662080) (← links)
- Survey on nonlocal games and operator space theory (Q2786626) (← links)
- Quantum proofs (Q2808277) (← links)
- Three-player entangled XOR games are NP-hard to approximate (Q2816299) (← links)
- Quantum XOR games (Q2828211) (← links)
- Robust Randomness Amplifiers: Upper and Lower Bounds (Q2851878) (← links)
- Near-optimal extractors against quantum storage (Q2875142) (← links)
- Certifiable quantum dice (Q2941597) (← links)
- Non-Signaling Parallel Repetition Using de Finetti Reductions (Q2976980) (← links)
- A Multiprover Interactive Proof System for the Local Hamiltonian Problem (Q2989019) (← links)
- Quantum Algorithms (Q3078111) (← links)
- Entangled Games Are Hard to Approximate (Q3093626) (← links)
- Trevisan's Extractor in the Presence of Quantum Side Information (Q3143297) (← links)
- Efficient Rounding for the Noncommutative Grothendieck Inequality (Q3191601) (← links)
- Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate (Q3387765) (← links)
- Interactive Proofs with Approximately Commuting Provers (Q3448798) (← links)
- Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money (Q3455197) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Hauteur asymptotique des points de Heegner (Q3548382) (← links)
- Better Gap-Hamming Lower Bounds via Better Round Elimination (Q3588428) (← links)
- Simple and Tight Device-Independent Security Proofs (Q4629390) (← links)
- Parallel repetition via fortification: analytic view and the quantum case (Q4638072) (← links)
- Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. (Q4638101) (← links)
- (Q4638103) (← links)
- Hardness amplification for entangled games via anchoring (Q4977980) (← links)
- A quantum linearity test for robustly verifying entanglement (Q4978041) (← links)
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device (Q5056420) (← links)
- Almost synchronous quantum correlations (Q5056872) (← links)
- Anchored Parallel Repetition for Nonlocal Games (Q5067446) (← links)
- Bounds on Dimension Reduction in the Nuclear Norm (Q5115972) (← links)
- (Q5121908) (← links)
- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability (Q5167796) (← links)
- Elementary proofs of Grothendieck theorems for completely bounded norms (Q5169833) (← links)
- Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
- From Operator Algebras to Complexity Theory and Back (Q5207391) (← links)
- Quantum proof systems for iterated exponential time, and beyond (Q5212788) (← links)
- (Q5414596) (← links)
- Certifiable quantum dice (Q5415465) (← links)
- Parallel repetition of entangled games (Q5419105) (← links)
- Efficient rounding for the noncommutative grothendieck inequality (Q5495777) (← links)
