Jump to content

Umesh Vazirani

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 18:06, 3 June 2020 (Undid revision 960559397 by Helmholtz10 (talk) unsourced). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Umesh Vazirani
NationalityIndian-American
Alma materMIT, University of California, Berkeley
AwardsFulkerson Prize (2012)
Scientific career
FieldsQuantum computation, Computational complexity
InstitutionsUniversity of California, Berkeley
Thesis Randomness, Adversaries and Computation  (1986)
Doctoral advisorManuel Blum
Doctoral students
Websitewww.cs.berkeley.edu/~vazirani/
Notes
He is the brother of Vijay Vazirani.

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.[1]

Biography

Vazirani received a BS from MIT in 1981[2] and received his Ph.D. in 1986 from UC Berkeley under the supervision of Manuel Blum.[3]

He is the brother of University of California, Irvine professor Vijay Vazirani.

Research

Vazirani is one of the founders of the field of quantum computing. His 1993 paper with his student Ethan Bernstein on quantum complexity theory[4] defined a model of quantum Turing machines which was amenable to complexity based analysis. This paper also gave an algorithm for the quantum Fourier transform, which was then used by Peter Shor within a year in his celebrated quantum algorithm for factoring integers.

Awards and honors

In 2005 both Vazirani and his brother Vijay Vazirani were inducted as Fellows of the Association for Computing Machinery, Umesh for "contributions to theoretical computer science and quantum computation"[5] and his brother Vijay for his work on approximation algorithms.[6] Vazirani was awarded the Fulkerson Prize for 2012 for his work on improving the approximation ratio for graph separators and related problems (jointly with Satish Rao and Sanjeev Arora). In 2018, he was elected to the National Academy of Sciences.

Selected publications

  • Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. (1987), "Matching is as easy as matrix inversion", Combinatorica, 7 (1): 105–113, doi:10.1007/BF02579206, MR 0905157. A preliminary version of this paper was also published in STOC '87.
  • Bernstein, Ethan; Vazirani, Umesh (1993), "Quantum complexity theory", Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC '93), pp. 11–20, CiteSeerX 10.1.1.655.1186, doi:10.1145/167088.167097, ISBN 978-0897915915.
  • Kearns, Michael J.; Vazirani, Umesh V. (1994), An Introduction to Computational Learning Theory, MIT Press, ISBN 9780262111935.
  • Bennett, Charles H.; Bernstein, Ethan; Brassard, Gilles; Vazirani, Umesh (1997), "Strengths and weaknesses of quantum computing", SIAM Journal on Computing, 26 (5): 1510–1523, arXiv:quant-ph/9701001, doi:10.1137/S0097539796300933, MR 1471991.

References

  1. ^ Algorithms: Dasgupta, Papadimitriou, Vazirani
  2. ^ Vazirani, Umesh Virkumar (1986-01-01). Randomness, Adversaries and Computation. University of California, Berkeley.
  3. ^ Umesh Virkumar Vazirani at the Mathematics Genealogy Project.
  4. ^ Bernstein & Vazirani 1993.
  5. ^ ACM Fellows Award: Umesh Vazirani.
  6. ^ ACM Fellows Award: Vijay Vazirani.

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=Umesh_Vazirani&oldid=960573094"