Umesh V. Vazirani

Roger A. Strauch Professor of EECS
Director, Berkeley Quantum Computation Center (BQIC)
671 Soda Hall
Computer Science Division
University of California at Berkeley
Berkeley, CA 94720, U.S.A.
(510) 642-0572
my_last_name@cs.berkeley.edu




Contents: Selected Publications / Courses / Students

Selected Publications

  1. Certifiable Quantum Dice. with T. Vidick, Philosophical Transactions of the Royal Society, A 2012, 370, 3432-3448.

  2. An improved 1D area law for frustration-free systems. with I.Arad, Z.Landau, Phys. Rev. B 85, 195145 (2012).

  3. A computational perspective on the foundations of Quantum Mechanics. with D. Aharonov, Computability: Turing, Godel, Church and Beyond, MIT Press, in print.

  4. Certifiable Quantum Dice: or, true random number generation secure against quantum adversaries. with T. Vidick, Proceedings of the ACM Symposium on the Theory of Computing (2012).

  5. The 1D Area Law and the Complexity of Quantum States: A combinatorial approach. with D.Aharonov, I.Arad, Z.Landau, Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (2011).

  6. The detectability lemma and its applications to Quantum Hamiltonian complexity. with D.Aharonov, I.Arad, Z.Landau, New J. Phys. 13 (2011).

  7. The detectability lemma and quantum gap amplification. with D.Aharonov, I.Arad, Z.Landau, Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 417-426 (2009).

  8. Expander Flows, Geometric Embeddings and Graph Partitioning. with S. Arora, S. Rao, Journal of ACM, 56(2), 2009.

  9. Geometry, Flows and Graph Partitioning Algorithms. with S. Arora, S. Rao, Commun. ACM, 51(10):96-105, 2008.

  10. Graph partitioning using single commodity flows. with R. Khandekar, S. Rao, Proceedings of Symposium on the Theory of Computing, 2006.

  11. AdWords and the Generalized Bipartite Matching Problem. with A. Mehta, A. Saberi, V. Vazirani, Proceedings of Symposium on the Foundations of Computer Science, 2005. Journal of ACM, 54(5), 2007.
    SIAM News Article by Sara Robinson pdf

  12. Expander Flows, Geometric Embeddings and Graph Partitioning. with S. Arora, S. Rao, Proceedings of Symposium on the Theory of Computing, 2004.

  13. Quantum Mechanical Algorithms for the Non-Abelian Hidden Subgroup Problem. with M. Grigni, L. Schulman, M. Vazirani, Proceedings of Symposium on the Theory of Computing, 2001; Combinatorica, Volume 24, Number 1, pp 137-154, January 2004.

  14. Limits on Quantum Adiabatic Optimization. with W. van Dam, manuscript.

  15. Dense Quantum Coding and Quantum Finite Automata. with A. Ambainis, A. Nayak, A. Ta-Shma, Proceedings of Symposium on the Theory of Computing, 1999; Journal of the ACM, Volume 49, Issue 4, 2002.

  16. How Powerful is Adiabatic Quantum Computation. with W. van Dam, M. Mosca, Proceedings of Symposium on the Foundations of Computer Science, 2001.

  17. Quantum Walks on Graphs. with D. Aharonov, A. Ambainis, J. Kempe, Proceedings of Symposium on the Theory of Computing, 1999.

  18. Computing with Highly Mixed States. with A. Ambainis, L. Schulman, Proceedings of Symposium on the Theory of Computing, 2000. Journal of the ACM Volume 53, Issue 3 (May 2006), Pages: 507 - 531.

  19. Quantum Bit Escrow. with D. Aharonov, A. Ta-Shma, A. Yao, Proceedings of Symposium on the Theory of Computing, 2000.

  20. Molecular Scale Heat Engines and Scalable Quantum Computation. with L. Schulman, Proceedings of Symposium on the Theory of Computing, 1999.

  21. The Quantum Communication Complexity of Sampling. with A. Ambainis, L. Schulman, A. Ta-Shma, A. Wigderson, Proceedings of Symposium on the Foundations of Computer Science, 1998. Siam J. Comput., Vol. 32, No. 6, pp. 1570-1585, 2003.

  22. On the Power of Quantum Computation. Philosophical Transactions of the Royal Society London A (1998) 356, 1759-1768.

  23. Go With the Winners Algorithms. with D. Aldous, Proceedings of Symposium on the Foundations of Computer Science, 1994.

  24. On syntactic versus computational views of approximability. with S. Khanna, R. Motwani, M. Sudan, Proceedings of Symposium on the Foundations of Computer Science, 1994. SIAM Journal on Computing, 28(1): 164-191, February 1999.

  25. Simple and Efficient Leader Election in the Full Information Model. with R. Ostrowsky, S. Rajagopalan, Proceedings of Symposium on the Theory of Computing, 1994.

  26. Simulating Quadratic Dynamical Systems is PSPACE-hard. with S. Arora, Y. Rabani, Proceedings of Symposium on the Theory of Computing, 1994.

  27. Quantum Complexity Theory. with E. Bernstein, Proceedings of Symposium on the Theory of Computing, 1993. Special issue on Quantum Computation of the Siam Journal of Computing, Oct. 1997.

  28. Strengths and Weaknesses of Quantum Computation. with C. Bennett, E. Bernstein, G. Brassard, Special issue on Quantum Computation of the Siam Journal of Computing, Oct. 1997.

  29. A Mildly Exponential Algorithm for Approximating the Permanent. with M. Jerrum, Proceedings of Symposium on the Foundations of Computer Science, 1992. invited paper, special issue of Algorithmica 16 (1996), 392-401.

  30. Choosing a Reliable Hypothesis. with W. Evans, S. Rajagopalan, Proceedings of the Symposium on Computational Learning Theory}, 1993.

  31. A Markovian Extension of Valiant's Learning Model. with D. Aldous, Proceedings of Symposium on the Foundations of Computer Science, 1990. Information and Computation, Vol. 117, No. 2, pp~181-186, 1995.

  32. Relativizing versus Nonrelativizing Techniques: the Role of Local Checkability. with S. Arora, R. Impagliazzo; early draft.

  33. An Optimal Online Bipartite Matching Algorithm. with R. Karp, V. Vazirani, Proceedings of Symposium on the Theory of Computing, 1990.

  34. Matching is as Easy as Matrix Inversion. with K. Mulmuley, V. Vazirani, Proceedings of Symposium on the Theory of Computing, 1987. Combinatorica, Vol. 7, No. 1, 1987.

  35. Efficiency Considerations in Using Semi-Random Sources. Proceedings of Symposium on the Theory of Computing, 1987.

  36. Random Polynomial Time is Equal to Semi-Random Polynomial Time. with V. Vazirani, Proceedings of Symposium on the Foundations of Computer Science, 1985.

  37. Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Semi-Random Sources. Proceedings of Symposium on the Theory of Computing, 1985. Combinatorica, Vol. 7, No. 4, 1987.

  38. Generating Quasi-Random Sequences from Semi-Random Sources. with M. Santha, Proceedings of Symposium on the Foundations of Computer Science, 1984, Journal Comput. Sys. Sci., Vol. 33, No. 1, 1986.

  39. Efficient and Secure Pseudo-Random Number Generation. with V. Vazirani, Proceedings of Symposium on the Foundations of Computer Science, 1984.

  40. Trapdoor Pseudo-Random Number Generators, with Applications to Protocol Design. with V. Vazirani, Proceedings of Symposium on the Foundations of Computer Science, 1983.

Selected Courses











Current Ph.D. Students

    Jonah Sherman

    Guoming Wang

    Anupam Prakash

    Urmila Mahadev

    Seung Woo Shin

Former Ph.D. Students

    1989 Milena Mihail (Associate Professor, Georgia Tech)

    1991 David Zuckerman (Professor, U.T. Austin)

    1992 Madhu Sudan (Professor, M.I.T.)

    1994 Sridhar Rajagopalan (research scientist at IBM, Almaden)

    1994 Sanjeev Arora (Professor, Princeton University)

    1997 Ethan Bernstein (Research scientist, Microsoft Corporation)

    1999 Ashwin Nayak (Assoc. Professor, Waterloo University and Perimeter Institute)

    2000 Sanjoy Dasgupta (Professor, U.C. San Diego)

    2000 Sean Hallgren (Professor, Penn. State University)

    2001 Andris Ambainis (Professor, University of Latvia)

    2002 Lisa Hales (Orinda Park Pool, Swim Team Director)

    2004 Lawrence Ip (Researcher, Google)

    2004 Scott Aaronson (Assoc. Professor, MIT)

    2004 Jordan Kerenidis (Assoc. Professor, University of Paris, Orsay)

    2006 Ben Reichardt (Assoc. Professor, University of Southern California)

    2009 Alexandra Kolla (Asst. Professor, University of Illinois, Urbana-Champaign)

    2011 Daniel Preda

    2011 Thomas Vidick (Postdoctoral fellow, MIT).