World's Best Scientists 2026 revealed!
Andris Ambainis

Andris Ambainis

D-Index & Metrics

Computer Science

D-Index
54
Citations
12168
World Ranking
4545
National Ranking
1

Research.com Recognitions

  • 2008 - Fellow of Alfred P. Sloan Foundation

Overview

Andris Ambainis is affiliated with the University of Latvia in Latvia. Their research spans predominantly the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Atomic and Molecular Physics and Optics, Nuclear and High Energy Physics, as well as Computer Networks and Communications.

The scientist's work covers multiple main topics, primarily centered around Quantum Computing Algorithms and Architecture. Other areas of research include Quantum Information and Cryptography, Computability, Logic, AI Algorithms, Complexity and Algorithms in Graphs, Machine Learning and Algorithms, Quantum and Electron Transport Phenomena, and Optimization and Search Problems.

Frequent publication venues for Andris Ambainis include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Zenodo (CERN European Organization for Nuclear Research)
  • Nature Reviews Physics
  • Physical review. D/Physical review. D.

Some of the recent papers authored or co-authored by Andris Ambainis are:

  • Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language, 2020, arXiv (Cornell University)
  • Challenges and opportunities in quantum optimization, 2024, Nature Reviews Physics
  • Quantum speedup for track reconstruction in particle accelerators, 2022, Physical review. D/Physical review. D.
  • Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving, 2024, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Andris Ambainis collaborates frequently with several co-authors. Some of the most frequent collaborators include Jevgēnijs Vihrovs, Martins Kokainis, Krišjānis Prūsis, Vyacheslavs Kashcheyevs, and Kaspars Balodis.

In 2008, Andris Ambainis was named a Fellow of the Alfred P. Sloan Foundation.

Best Publications

  • Quantum Walk Algorithm for Element Distinctness

    Andris Ambainis

  • QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS

    Andris Ambainis

  • Quantum walks on graphs

    Dorit Aharonov;Andris Ambainis;Julia Kempe;Umesh Vazirani

  • One-dimensional quantum walks

    Andris Ambainis;Eric Bach;Ashwin Nayak;Ashvin Vishwanath

  • Quantum Search of Spatial Regions

    Scott Aaronson;Andris Ambainis

  • 1-way quantum finite automata: strengths, weaknesses and generalizations

    A. Ambainis;R. Freivalds

  • Coins make quantum walks faster

    Andris Ambainis;Julia Kempe;Alexander Rivosh

  • Quantum lower bounds by quantum arguments

    Andris Ambainis

  • Dense quantum coding and quantum finite automata

    Andris Ambainis;Ashwin Nayak;Amnon Ta-Shma;Umesh Vazirani

  • Private quantum channels

    A. Ambainis;M. Mosca;A. Tapp;R. De Wolf

  • Upper Bound on Communication Complexity of Private Information Retrieval

    Andris Ambainis

  • Two-way finite automata with quantum and classical states

    Andris Ambainis;John Watrous

  • Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer

    A. Ambainis;A. M. Childs;B. W. Reichardt;R. Špalek

  • Polynomial degree vs. quantum query complexity

    A. Ambainis

  • Quantum search algorithms

    A. Ambainis

  • Spatial Search by Quantum Walk is Optimal for Almost all Graphs.

    Shantanav Chakraborty;Leonardo Novo;Andris Ambainis;Yasser Omar

  • ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N1/2+o(1) ON A QUANTUM COMPUTER

    A. Ambainis;A. M. Childs;B. W. Reichardt;R. Spalek

  • Dense quantum coding and a lower bound for 1-way quantum automata

    Andris Ambainis;Ashwin Nayak;Ammon Ta-Shma;Umesh Vazirani

  • Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding

    Andris Ambainis;Ansis Rosmanis;Dominique Unruh

  • Quantum t-designs: t-wise Independence in the Quantum World

    A. Ambainis;J. Emerson

Frequent Co-Authors

Ronald de Wolf
Ronald de Wolf University of Amsterdam
Scott Aaronson
Scott Aaronson The University of Texas at Austin
Kazuo Iwama
Kazuo Iwama Kyoto University
Umesh Vazirani
Umesh Vazirani University of California, Berkeley
Julia Kempe
Julia Kempe New York University
Dominique Unruh
Dominique Unruh University of Tartu
Andrew M. Childs
Andrew M. Childs University of Maryland, College Park
Harry Buhrman
Harry Buhrman University of Amsterdam
Leonard J. Schulman
Leonard J. Schulman California Institute of Technology
Amnon Ta-Shma
Amnon Ta-Shma Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA can lead to many diverse career options. For those seeking flexibility, online degrees offer a pathway to high-demand fields. Beyond technology, online programs in areas like criminal justice and accounting are also growing in popularity.

If you’re interested in law enforcement, a criminal justice degree price can be surprisingly affordable when studied online, making it easier to start a career in public service. Those with a knack for numbers might consider an accounting degree, which opens doors to finance, auditing, and business management roles.

Advanced fields like data master online programs can help professionals break into booming sectors such as data analysis, AI, and research. Alternatively, a construction management degree is ideal for those interested in overseeing large-scale projects and infrastructure.

No matter your interest, online degrees provide flexible, cost-effective routes to exciting and rewarding careers beyond traditional tech fields.

Best Scientists Citing Andris Ambainis

Trending Scientists

Recently Published Articles