CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Vazirani-Umesh-V"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2019 | 2018 | 2017 | 2015 | 2014 | 2013 | 2012 | 2011 | 2008 | 2006 | 2004 | 2003 | 2002 | 2001 | 1998
Number of items: 19.

2019

Schulman, Leonard J. and Vazirani, Umesh V. (2019) The duality gap for two-team zero-sum games. Games and Economic Behavior, 115 . pp. 336-345. ISSN 0899-8256. https://resolver.caltech.edu/CaltechAUTHORS:20190328-112416478

Vazirani, Umesh and Vidick, Thomas (2019) Fully device independent quantum key distribution. Communications of the ACM, 62 (4). p. 133. ISSN 0001-0782. https://resolver.caltech.edu/CaltechAUTHORS:20190321-152633091

2018

Brakerski, Zvika and Christiano, Paul and Mahadev, Urmila et al. (2018) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE , Piscataway, NJ, pp. 320-331. ISBN 9781538642306. https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032

2017

Arad, Itai and Landau, Zeph and Vazirani, Umesh et al. (2017) Rigorous RG algorithms and area laws for low energy eigenstates in 1D. Communications in Mathematical Physics, 356 (1). pp. 65-105. ISSN 0010-3616. https://resolver.caltech.edu/CaltechAUTHORS:20160321-072746620

Schulman, Leonard J. and Vazirani, Umesh V. (2017) The duality gap for two-team zero-sum games. In: 8th Innovations in Theoretical Computer Science Conference. Leibniz International Proceedings in Informatics. No.67. Dagstuhl Publishing , Saarbrücken, Germany, Art. No. 56. ISBN 978-3-95977-029-3. https://resolver.caltech.edu/CaltechAUTHORS:20190402-143205523

2015

Landau, Zeph and Vazirani, Umesh and Vidick, Thomas (2015) A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians. Nature Physics, 11 (7). pp. 566-569. ISSN 1745-2473. https://resolver.caltech.edu/CaltechAUTHORS:20150422-093309397

2014

Vazirani, Umesh and Vidick, Thomas (2014) Fully Device-Independent Quantum Key Distribution. Physical Review Letters, 113 (14). Art. No. 140501. ISSN 0031-9007. https://resolver.caltech.edu/CaltechAUTHORS:20150108-142044094

Vazirani, Umesh and Vidick, Thomas (2014) Robust device independent quantum key distribution. In: Proceedings of the 5th conference on Innovations in theoretical computer science. Association for Computing Machinery , New York, pp. 35-36. ISBN 978-1-4503-2698-8. https://resolver.caltech.edu/CaltechAUTHORS:20140909-145320191

Landau, Zeph and Vazirani, Umesh and Vidick, Thomas (2014) An efficient algorithm for finding the ground state of 1D gapped local hamiltonians. In: Proceedings of the 5th conference on Innovations in theoretical computer science. Association for Computing Machinery , New York, p. 301. ISBN 978-1-4503-2698-8. https://resolver.caltech.edu/CaltechAUTHORS:20140909-142344205

2013

Arad, Itai and Kitaev, Alexei and Landau, Zeph et al. (2013) An area law and sub-exponential algorithm for 1D systems. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20140130-142058060

2012

Vazirani, Umesh and Vidick, Thomas (2012) Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries. In: STOC'12 Symposium on Theory of Computing Conference. ACM , New York, NY, pp. 61-76. ISBN 978-1-4503-1245-5. https://resolver.caltech.edu/CaltechAUTHORS:20140910-141425231

2011

Vazirani, Umesh and Vidick, Thomas (2011) Certifiable Quantum Dice - Or, testable exponential randomness expansion. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-104707093

2008

Orecchia, Lorenzo and Schulman, Leonard J. and Vazirani, Umesh V. et al. (2008) On partitioning graphs via single commodity flows. In: STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 461-470. ISBN 978-1-60558-047-0. https://resolver.caltech.edu/CaltechAUTHORS:20161206-174428027

2006

Ambainis, Andris and Schulman, Leonard J. and Vazirani, Umesh (2006) Computing with Highly Mixed States. Journal of the ACM, 53 (3). pp. 507-531. ISSN 0004-5411. https://resolver.caltech.edu/CaltechAUTHORS:20160419-113716190

2004

Grigni, Michelangelo and Schulman, Leonard J. and Vazirani, Monica et al. (2004) Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. Combinatorica, 24 (1). pp. 137-154. ISSN 0209-9683. https://resolver.caltech.edu/CaltechAUTHORS:20190829-131534342

2003

Ambainis, Andris and Schulman, Leonard J. and Ta-Shma, Amnon et al. (2003) The quantum communication complexity of sampling. SIAM Journal on Computing, 32 (6). pp. 1570-1585. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:AMBsiamjc03

2002

Ambainis, Andris and Nayak, Ashwin and Ta-Shma, Amnon et al. (2002) Dense Quantum Coding and Quantum Finite Automata. Journal of the ACM, 49 (4). pp. 496-511. ISSN 0004-5411. https://resolver.caltech.edu/CaltechAUTHORS:20160419-112812430

2001

Grigni, Michaelangelo and Schulman, Leonard J. and Vazirani, Monica et al. (2001) Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In: STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 68-74. ISBN 1-58113-349-9. https://resolver.caltech.edu/CaltechAUTHORS:20161031-162455553

1998

Ambainis, Andris and Schulman, Leonard J. and Ta-Shma, Amnon et al. (1998) The quantum communication complexity of sampling. In: 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society , Los Alamitos, CA, pp. 342-351. ISBN 0-8186-9172-7 . https://resolver.caltech.edu/CaltechAUTHORS:20111213-142315946

This list was generated on Thu Nov 14 04:53:21 2019 PST.