2018 - Member of the National Academy of Sciences
2005 - ACM Fellow For contributions to theoretical computer science and quantum computation.
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.
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.
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.
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)
An Introduction to Computational Learning Theory
Michael J. Kearns;Umesh V. Vazirani.
Strengths and Weaknesses of Quantum Computing
Charles H. Bennett;Ethan Bernstein;Gilles Brassard;Umesh Vazirani.
SIAM Journal on Computing (1997)
Expander flows, geometric embeddings and graph partitioning
Sanjeev Arora;Satish Rao;Umesh Vazirani.
Journal of the ACM (2009)
AdWords and generalized online matching
Aranyak Mehta;Amin Saberi;Umesh Vazirani;Vijay Vazirani.
Journal of the ACM (2007)
Matching is as easy as matrix inversion
Ketan Mulmuley;Umesh V. Vazirani;Vijay V. Vazirani.
symposium on the theory of computing (1987)
An optimal algorithm for on-line bipartite matching
R. M. Karp;U. V. Vazirani;V. V. Vazirani.
symposium on the theory of computing (1990)
Quantum walks on graphs
Dorit Aharonov;Andris Ambainis;Julia Kempe;Umesh Vazirani.
symposium on the theory of computing (2001)
On Syntactic versus Computational Views of Approximability
Sanjeev Khanna;Rajeev Motwani;Madhu Sudan;Umesh Vazirani.
SIAM Journal on Computing (1999)
Fully device independent quantum key distribution
Umesh Vazirani;Thomas Vidick.
Communications of The ACM (2019)
If you think any of the details on this page are incorrect, let us know.
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: