#4,257

Most Influential Person

Indian theoretical computer scientist

According to Wikipedia, Umesh Virkumar Vazirani is an Indian-American academic who is the Roger A. Strauch Professor of Electrical Engineering and Computer Science at the University of California, Berkeley, and the director of the Berkeley Quantum Computation Center. His research interests lie primarily in quantum computing. He is also a co-author of a textbook on algorithms.

- An Introduction to Computational Learning Theory (1994) (1802)
- Strengths and Weaknesses of Quantum Computing (1997) (1200)
- Quantum complexity theory (1993) (880)
- Quantum Complexity Theory (1997) (849)
- An optimal algorithm for on-line bipartite matching (1990) (692)
- Matching is as easy as matrix inversion (1987) (607)
- Quantum walks on graphs (2001) (569)
- Expander flows, geometric embeddings and graph partitioning (2004) (546)
- Expander flows, geometric embeddings and graph partitioning (2009) (322)
- AdWords and Generalized On-line Matching (2005) (307)
- AdWords and generalized on-line matching (2005) (289)
- Generating Quasi-random Sequences from Semi-random Sources (1986) (283)
- Classical command of quantum systems (2013) (273)
- On Syntactic versus Computational Views of Approximability (1995) (267)
- Fully device-independent quantum key distribution. (2014) (248)
- How powerful is adiabatic quantum computation? (2001) (247)
- Dense quantum coding and quantum finite automata (2002) (193)
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem (2001) (147)
- On Two Geometric Problems Related to the Traveling Salesman Problem (1984) (141)
- Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) (1984) (135)
- Fully device independent quantum key distribution (2019) (130)
- Dense quantum coding and a lower bound for 1-way quantum automata (1999) (128)
- An area law and sub-exponential algorithm for 1D systems (2013) (116)
- Quantum bit escrow (2000) (112)
- "Go with the winners" algorithms (1994) (112)
- On the complexity and verification of quantum random circuit sampling (2018) (111)
- How "Quantum" is the D-Wave Machine? (2014) (108)
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (1987) (107)
- Random polynomial time is equal to slightly-random polynomial time (1985) (107)
- A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games (2013) (98)
- Efficient and Secure Pseudo-Random Number Generation (1984) (96)
- Algorithms, games, and evolution (2014) (92)
- Graph partitioning using single commodity flows (2006) (89)
- Quantum Algorithms (2002) (87)
- Molecular scale heat engines and scalable quantum computation (1999) (83)
- Certifiable quantum dice: or, true random number generation secure against quantum adversaries (2012) (82)
- A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians (2015) (79)
- The detectability lemma and quantum gap amplification (2009) (79)
- On partitioning graphs via single commodity flows (2008) (75)
- Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources (1985) (70)
- Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) (1984) (66)
- Efficiency considerations in using semi-random sources (1987) (65)
- NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching (1985) (63)
- Improved one-dimensional area law for frustration-free systems (2012) (62)
- Polytopes, permanents and graphs with large factors (1988) (61)
- Another way to approach zero entropy for a finite system of atoms (2004) (55)
- Certifiable quantum dice (2012) (55)
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device (2018) (54)
- On the power of quantum computation (1998) (54)
- Scalable NMR Quantum Computation (1998) (54)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (1993) (54)
- The quantum communication complexity of sampling (1998) (53)
- Graph partitioning using single commodity flows (2009) (52)
- Trapdoor pseudo-random number generators, with applications to protocol design (1983) (51)
- Quantum Supremacy and the Complexity of Random Circuit Sampling (2019) (51)
- Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) (1983) (50)
- A Markovian Extension of Valiant's Learning Model (1995) (48)
- The Quantum Communication Complexity of Sampling (2003) (47)
- Quantum algorithms and the fourier transform (2004) (46)
- Graph products and chromatic numbers (1989) (45)
- Simple and efficient leader election in the full information model (1994) (42)
- Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D (2016) (42)
- Certifiable Quantum Dice - Or, testable exponential randomness expansion (2011) (40)
- Quantum Algorithms for Hidden Nonlinear Structures (2007) (38)
- Geometry, flows, and graph-partitioning algorithms (2008) (38)
- Random Polynomial Time is Equal to Semi-Random Polynomial Time (1988) (38)
- A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians (2013) (37)
- Computing with highly mixed states (2006) (35)
- Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) (1994) (33)
- Randomness, adversaries and computation (random polynomial time) (1986) (32)
- The detectability lemma and its applications to quantum Hamiltonian complexity (2011) (32)
- A mildly exponential approximation algorithm for the permanent (2005) (31)
- Perfect pattern formation of neutral atoms in an addressable optical lattice (2005) (27)
- Multiplicative updates in coordination games and the theory of evolution (2013) (25)
- Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics (2012) (25)
- Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem (2004) (25)
- Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality (2020) (21)
- Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D (2017) (19)
- Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law (2014) (18)
- A natural encoding scheme proved probabilistic polynomial complete (1982) (18)
- Efficiency Considerations in Using Semi-random Sources (Extended Abstract) (1987) (17)
- Quantum Information Processing and Quantum Computing Roadmap a Quantum Information Science and Technology Roadmap (2004) (17)
- RSA bits are .732 + ε secure (1984) (17)
- Classical command of quantum systems via rigidity of CHSH games (2012) (17)
- Relativizing versus Nonrelativizing Techniques: The Role of Local Checkability (1992) (17)
- The two-processor scheduling problem is in R-NC (1985) (17)
- Robust device independent quantum key distribution (2014) (16)
- Comment on "Distinguishing Classical and Quantum Models for the D-Wave Device" (2014) (16)
- On the learnability of finite automata (1988) (16)
- Learning probability distributions (2000) (16)
- Certifiable Randomness from a Single Quantum Device (2018) (16)
- Simpler Proofs of Quantumness (2020) (16)
- The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach (2011) (14)
- A classical one-way function to confound quantum adversaries (2007) (14)
- Lower bounds for quantum computation and communication (1999) (14)
- A Natural Encoding Scheme Proved Probabilistic Polynomial Complete (1983) (14)
- NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings (1986) (13)
- The Two-Processor Scheduling Problem is in Random NC (1989) (13)
- Quantum Hamiltonian complexity and the detectability lemma (2010) (13)
- Graph partitioning using single commodity flows (2006) (12)
- Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States (2018) (10)
- Reducibility Among Protocols (1983) (9)
- Computing with highly mixed states (extended abstract) (2000) (9)
- Rapidly mixing markov chains (1992) (8)
- A mildly exponential approximation algorithm for the permanent (1992) (7)
- Quantum encodings and applications to locally decodable codes and communication complexity (2004) (7)
- Classically-Verifiable Quantum Advantage from a Computational Bell Test (2021) (7)
- On the space efficiency of one way quantum finite automata (1998) (6)
- (Sub)Exponential advantage of adiabatic Quantum computation with no sign problem (2021) (6)
- Computational Learning Theory (1995) (6)
- Fourier Transforms and Quantum Computation (2000) (5)
- Sampling a Population with a Semi-Random Source (1986) (5)
- Introduction to Special Section on Quantum Computation (1997) (4)
- Choosing a reliable hypothesis (1993) (4)
- LIMITS ON QUANTUM ADIABATIC OPTIMIZATION WARNING : ROUGH MANUSCRIPT ! (2003) (4)
- The Duality Gap for Two-Team Zero-Sum Games (2017) (4)
- An efficient algorithm for finding the ground state of 1D gapped local hamiltonians (2014) (4)
- The Probably Approximately Correct Learning Model (1994) (4)
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device (2021) (2)
- Erratum: Fully Device-Independent Quantum Key Distribution [Phys. Rev. Lett. 113, 140501 (2014)]. (2016) (2)
- Interactive Protocols for Classically-Verifiable Quantum Advantage (2021) (2)
- RSA Bits are 732+epsilon Secure (1983) (2)
- Performance of the rigorous renormalization group for first-order phase transitions and topological phases (2021) (2)
- The Vapnik-Chervonenkis Dimension (1994) (1)
- Perfect initialization of a quantum computer of neutral atoms in an optical lattice of large lattice constant (2003) (1)
- An Optimal Algorithm for On-lineBipartite Matching (2015) (1)
- Go-With-The-Winners Heuristic (1999) (1)
- The duality gap for two-team zero-sum games (2019) (1)
- Communication costs in the performance of unrelated tasks: Continuum models and finite models (1991) (1)
- A polynomial-time algorithm for the ground state of 1 D gapped local Hamiltonians Supplementary material (2015) (1)
- Quantum Physics and the Nature of Computation (2005) (1)
- Keynote Speech: Quantum Physics and the Nature of Computation (2007) (1)
- Algorithms, Games, and Evolution (Invited Talk) (2014) (0)
- Appendix: Some Tools for Probabilistic Analysis (1994) (0)
- Quantum Information Processing (2004) (0)
- Quantum State Description Complexity (Invited Talk) (2011) (0)
- Global Wire Routing in Two-Dimensional Arrays 1 (1987) (0)
- Quantum Computation and Information (1998) (0)
- Learning Natural Language : A review of formal and computational approachesNancy (2007) (0)
- A Final Assignment: (2019) (0)
- Dynamic Programming 6.1 Shortest Paths in Dags, Revisited (0)
- Quantum computing and quantum complexity theory (2000) (0)
- Merging techniques for combinatorial optimization: spectral graph theory and semidefinite programming (2009) (0)
- An efficiently-verifiable test of quantum advantage (2020) (0)
- Scalability, Complexity and Reliability in Quantum Information Processing (2007) (0)
- A Quantum Algorithm for the Ferromagnetic Ising Model (Manuscript in preparation) (2008) (0)
- Parallel searching of multidimensional cubes (1993) (0)
- Rigorous renormalization group at first-order phase transitions (2018) (0)
- The Quantum Algorithms -final Report (2012) (0)
- Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences: 356 (1743) (1998) (0)
- Decoding Ag-codes and Let W Be a Vector Having Acknowledgments Decoding Ag-codes (2007) (0)
- Center for Quantum Algorithms and Complexity (2014) (0)
- Annotated Bibliography of Selected Publications (2005) (0)
- Today's Topics: Lower Bounds for Constant Depth Circuits Razborovvsmolensky a Learning Algorithm for Constant Depth Circuits Hastad Has866 and Liniallmansourrnisan Lmn899 4.1 Lower Bounds for Constant Depth Circuits (1999) (0)
- Quantum State Description Complexity (2011) (0)
- OCCAM'S RAZOR (1975) (0)
- Randomized Algorithms (Dagstuhl Seminar 9124) (2021) (0)
- Weak and Strong Learning (1994) (0)
- " Center for Quantum Algorithms and Complexity " Report Title (2014) (0)
- Non-local correlations and interactive games (2011) (0)
- Deniable Encryption in a Quantum World (2021) (0)
- Grover's Search Algorithm and Quantum Lower Bounds (2000) (0)
- Learning Finite Automata by Experimentation (1994) (0)
- A Classical Leash for a Quantum Tiger: Key Distribution with Miminmal Assumptions (2015) (0)
- DP Solution Guidelines (2020) (0)
- Quantum Algorithms (2001) (0)
- Reducibility in PAC Learning (1994) (0)
- Learning in the Presence of Noise (1994) (0)

This paper list is powered by the following services:

Umesh Vazirani is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.

Subscribe To Newsletter?Yes!