Umesh V. Vazirani
Artificial Intelligence · Symposium on the Theory of Computing · 2000–2018
A researcher in the Science corpus: 9 papers; trusts 19 researchers and is trusted by 42 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 66 citations into it; #6,409 of 35,345 by trust here, #6,796 by citations
- Atomic and Molecular Physics, and Optics — 52 citations into it; #3,127 of 7,135 by trust here, #2,705 by citations
- Computational Theory and Mathematics — 17 citations into it; #1,626 of 12,182 by trust here, #1,409 by citations
Whom Umesh V. Vazirani trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Renato Renner
- Thomas Holenstein
- Jonathan Barrett
- Roger Colbeck
- Yoav Freund
- Frank Verstraete
- Lucien Hardy
- Antonio Acín
- Stefano Pironio
- Adrian Kent
Who trusts Umesh V. Vazirani overall
- Miguel Herrero-Collantes
- Sanjeev Arora
- Subhash Khot
- Niv Buchbinder
- Juan Carlos García-Escartín
- Andris Ambainis
- Andreas Noack
- Aranyak Mehta
- Jure Leskovec
- Andrew M. Childs
Papers from Umesh V. Vazirani's perspective
Ordered by how strongly the researchers Umesh V. Vazirani trusts endorse each paper. Same corpus, a different order for every researcher.
- Random numbers certified by Bell’s theorem (Nature)
- Quantum And Relativistic Protocols For Secure Multi-Party Computation
- Security of quantum key distribution (Ausgezeichnete Informatikdissertationen)
- Economic inequality and burden-sharing in the provision of local environmental quality
- Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Proceedings of the Royal Society A)
- Game theory, on-line prediction and boosting
- Complexity-Theoretic Foundations of Quantum Supremacy Experiments (Cybersecurity and Cyberforensics Conference)
- Quantum Computation by Adiabatic Evolution
- A new greedy approach for facility location problems
Their papers
- Expander flows, geometric embeddings and graph partitioning (2004) — 674 citations
- Quantum walks on graphs (2000) — 751 citations
- AdWords and generalized on-line matching (2005) — 944 citations
- On the complexity and verification of quantum random circuit sampling (2018) — 353 citations
- A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians (2015) — 142 citations
- How "Quantum" is the D-Wave Machine? (2014) — 153 citations
- Classical command of quantum systems (2013) — 386 citations
- Fully device independent quantum key distribution (2012) — 478 citations
- How powerful is adiabatic quantum computation? (2001) — 321 citations