Vidick, Thomas
Thomas Vidick
Vidick, Thomas 1982-
וידיק, תומאס, 1982-
VIAF ID: 74154739823452990017 (Personal)
Permalink: http://viaf.org/viaf/74154739823452990017
Preferred Forms
- 100 0 _ ‡a Thomas Vidick
-
-
-
- 100 1 _ ‡a Vidick, Thomas
-
- 100 1 _ ‡a Vidick, Thomas
- 100 1 _ ‡a Vidick, Thomas
-
- 100 1 _ ‡a Vidick, Thomas ‡d 1982-
-
-
4xx's: Alternate Name Forms (4)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
All Schatten spaces endowed with the Schur product are Q-algebras | |
Better Gap-Hamming Lower Bounds via Better Round Elimination | |
Certifiable quantum dice | |
Does ignorance of the whole imply ignorance of the parts? Large violations of noncontextuality in quantum theory. | |
Efficient rounding for the noncommutative grothendieck inequality | |
Elementary proofs of Grothendieck theorems for completely bounded norms | |
Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games | |
Guest column: the quantum PCP conjecture | |
Hardness amplification for entangled games via anchoring | |
Hauteur asymptotique des points de Heegner | |
Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians | |
Interactive Proofs with Approximately Commuting Provers | |
Introduction to Quantum Cryptography | |
More nonlocality with less entanglement | |
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers | |
A Multiprover Interactive Proof System for the Local Hamiltonian Problem | |
Near-optimal extractors against quantum storage | |
Non-Signaling Parallel Repetition Using de Finetti Reductions | |
Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money | |
Parallel repetition of entangled games | |
A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians | |
QCMA hardness of ground space connectivity for commuting Hamiltonians | |
Quantum Algorithms | |
A quantum linearity test for robustly verifying entanglement | |
Quantum proofs | |
Quantum XOR Games | |
Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D | |
Robust device independent quantum key distribution | |
Robust Randomness Amplifiers: Upper and Lower Bounds | |
Sieve algorithms for the shortest vector problem are practical | |
Simple proof of the detectability lemma and spectral gap amplification | |
Survey on nonlocal games and operator space theory | |
Three-Player Entangled XOR Games Are NP-Hard to Approximate | |
Trevisan's Extractor in the Presence of Quantum Side Information | |
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability |