- Home
- Best Scientists - Computer Science
- Umesh Vazirani

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
52
Citations
17,721
134
World Ranking
3288
National Ranking
1695

2018 - Member of the National Academy of Sciences

2005 - ACM Fellow For contributions to theoretical computer science and quantum computation.

- Quantum mechanics
- Algorithm
- Algebra

Umesh Vazirani mostly deals with Discrete mathematics, Combinatorics, Quantum algorithm, Quantum computer and Quantum capacity. His Discrete mathematics study combines topics in areas such as Super-recursive algorithm, Probabilistic Turing machine, Universal Turing machine, Turing machine and Algebra. Umesh Vazirani has researched Algebra in several fields, including Quantum and NSPACE.

Umesh Vazirani frequently studies issues relating to Embedding and Combinatorics. His study focuses on the intersection of Quantum computer and fields such as Open quantum system with connections in the field of Theoretical computer science. His work in Quantum sort addresses issues such as Grover's algorithm, which are connected to fields such as Quantum Turing machine.

- An Introduction to Computational Learning Theory (1318 citations)
- Quantum Complexity Theory (1254 citations)
- Strengths and Weaknesses of Quantum Computing (1063 citations)

His primary scientific interests are in Discrete mathematics, Quantum, Quantum computer, Combinatorics and Algorithm. His research investigates the connection between Discrete mathematics and topics such as Hamiltonian that intersect with problems in Adiabatic quantum computation. His Quantum research integrates issues from Randomness, Verifiable secret sharing, Degenerate energy levels and Topology.

Umesh Vazirani interconnects Function, Quantum algorithm and Computation in the investigation of issues within Quantum computer. His Quantum algorithm study incorporates themes from Quantum information, Quantum network, Quantum capacity and Algebra. His research integrates issues of Indifference graph, Comparability graph, Probabilistic logic, Polynomial and Interval graph in his study of Algorithm.

- Discrete mathematics (35.71%)
- Quantum (23.81%)
- Quantum computer (24.40%)

- Quantum (23.81%)
- Algorithm (18.45%)
- Theoretical computer science (17.86%)

His primary areas of investigation include Quantum, Algorithm, Theoretical computer science, Quantum computer and Discrete mathematics. The concepts of his Quantum study are interwoven with issues in Hamiltonian, Verifiable secret sharing, Degenerate energy levels and Topology. In general Algorithm, his work in Time complexity is often linked to Systematic error linking many areas of study.

His Theoretical computer science research is multidisciplinary, incorporating elements of Quantum information, Quantum entanglement, Quantum network and Learning with errors, Cryptography. The Quantum computer study combines topics in areas such as Theoretical physics, Wormhole, Probability distribution and One-way function. His Discrete mathematics study combines topics from a wide range of disciplines, such as Measure, Zero-sum game, Matrix product state, Duality gap and Ground state.

- Fully device-independent quantum key distribution. (329 citations)
- Classical command of quantum systems (260 citations)
- An area law and sub-exponential algorithm for 1D systems (89 citations)

- Quantum mechanics
- Algorithm
- Algebra

Umesh Vazirani focuses on Algorithm, Quantum, Theoretical computer science, Quantum computer and Polynomial. His work is dedicated to discovering how Algorithm, Ground state are connected with Matrix product state and Discrete mathematics and other disciplines. His Discrete mathematics research incorporates themes from Bounded function, Spectral gap and Combinatorics.

The Theoretical computer science study which covers Quantum information that intersects with Open quantum system. His study in Open quantum system is interdisciplinary in nature, drawing from both Quantum pseudo-telepathy, Quantum algorithm and Algebra. His studies deal with areas such as Probability distribution and Path as well as Quantum computer.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Quantum Complexity Theory

Ethan Bernstein;Umesh Vazirani.

SIAM Journal on Computing **(1997)**

2197 Citations

An Introduction to Computational Learning Theory

Michael J. Kearns;Umesh V. Vazirani.

**(1994)**

2097 Citations

Strengths and Weaknesses of Quantum Computing

Charles H. Bennett;Ethan Bernstein;Gilles Brassard;Umesh Vazirani.

SIAM Journal on Computing **(1997)**

1622 Citations

Expander flows, geometric embeddings and graph partitioning

Sanjeev Arora;Satish Rao;Umesh Vazirani.

Journal of the ACM **(2009)**

923 Citations

AdWords and generalized online matching

Aranyak Mehta;Amin Saberi;Umesh Vazirani;Vijay Vazirani.

Journal of the ACM **(2007)**

890 Citations

Matching is as easy as matrix inversion

Ketan Mulmuley;Umesh V. Vazirani;Vijay V. Vazirani.

symposium on the theory of computing **(1987)**

879 Citations

An optimal algorithm for on-line bipartite matching

R. M. Karp;U. V. Vazirani;V. V. Vazirani.

symposium on the theory of computing **(1990)**

804 Citations

Quantum walks on graphs

Dorit Aharonov;Andris Ambainis;Julia Kempe;Umesh Vazirani.

symposium on the theory of computing **(2001)**

666 Citations

On Syntactic versus Computational Views of Approximability

Sanjeev Khanna;Rajeev Motwani;Madhu Sudan;Umesh Vazirani.

SIAM Journal on Computing **(1999)**

562 Citations

Fully device independent quantum key distribution

Umesh Vazirani;Thomas Vidick.

Communications of The ACM **(2019)**

531 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of California, Irvine

California Institute of Technology

University of Latvia

University of Pennsylvania

Tel Aviv University

Columbia University

Weizmann Institute of Science

University of California, Berkeley

University of California, Berkeley

University of California, Berkeley

Rulai, Inc.

OEwaves, Inc.

TU Dortmund University

University of Massachusetts Amherst

University of California, Berkeley

University of the Republic

Weizmann Institute of Science

Rothamsted Research

University of Alberta

INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement

University of Oklahoma

Augusta University

University of Arizona

Central European University

University of Alberta

University of Duisburg-Essen

Something went wrong. Please try again later.