DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Umesh Vazirani
Umesh Vazirani
The Multiplicative Weights Update Method: a Meta-Algorithm and Applications
Limits on Efficient Computation in the Physical World
Expander Flows, Geometric Embeddings and Graph Partitioning
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the Ads/CFT Duality
Quantum Computing : a Gentle Introduction / Eleanor Rieffel and Wolfgang Polak
Limits on Efficient Computation in the Physical World by Scott Joel
Flows, Cuts and Integral Routing in Graphs - an Approximation Algorithmist’S Perspec- Tive
Classical Verification and Blind Delegation of Quantum
Depth-Efficient Proofs of Quantumness
Quantum Leap a New Proof Supports a 25-Year-Old Claim N of the Unique Power of Quantum Computing
Adam Bouland
(Sub) Exponential Advantage of Adiabatic Quantum Computation with No Sign Problem
Decoherence, Control, and Symmetry in Quantum Computers
Computational Complexity: an Empirical View Maël Pégny
Adwords and Generalized On-Line Matching
Causality and Graph Isomorphism
Emerging Insights on Limitations of Quantum Computing Shape Quest for Fast Algorithms
Dense Quantum Coding and Quantum Finite Automata
Top View
Thomas Vidick B
[email protected]
Í Cms.Caltech.Edu/ Vidick/ Professor Nationality: Belgian California Institute of Technology Born: 07/13/1982
Quantum Computation, Volume 58
The Limits of Quantum Computers
Computational Pseudorandomness, the Wormhole Growth Paradox, And
Strengths and Weaknesses of Quantum Computing
Innovations in Theoretical Computer Science (ITCS)
Quantum Complexity Theory 1 Introduction