Andris Ambainis
Professor, Faculty of Science and Technology — University of Latvia
Andris Ambainis researches quantum algorithms, query complexity and the limits of quantum speedups at the University of Latvia. He coauthored the paper that introduced the Aaronson–Ambainis conjecture with Scott Aaronson.
In the library
Nothing of theirs is filed in the hub yet. Browse the full library.
Recommended next
Hand-picked from the hub based on what Andris Ambainis covers.
A proof of the Aaronson–Ambainis conjecture
PSI reports that its internal research system, using a non-public Anthropic model, produced a proof of the Aaronson–Ambainis conjecture and a Lean formalization. The announcement explains the claimed implications for quantum query speedups and links to a paper and proof repository.
Why this: Also about quantum computing
Testing the Conjecture That Quantum Processes Create Conscious Experience
Peer-reviewed paper in Entropy (28 May 2024) by Hartmut Neven and Adam Zalcman of Google Quantum AI with Christof Koch of the Allen Institute and others, proposing that conscious experience arises whenever a quantum superposition forms, and laying out quantum-biology experiments to test the idea. Open access; the full text is free at PubMed Central (PMC11203236).
Why this: Also about quantum computing
Quantum Computing Needs Software Engineers
LeadDev piece on why quantum computing's bottleneck is software, not hardware, and what conventional engineers can learn to move into the field.
Why this: Also about quantum computing