Skip to main content

The latest research from Google

A new quantum algorithm for classical mechanics with an exponential speedup

Quantum computers promise to solve some problems exponentially faster than classical computers, but there are only a handful of examples with such a dramatic speedup, such as Shor’s factoring algorithm and quantum simulation. Of those few examples, the majority of them involve simulating physical systems that are inherently quantum mechanical — a natural application for quantum computers. But what about simulating systems that are not inherently quantum? Can quantum computers offer an exponential advantage for this?

Summary report optimization in the Privacy Sandbox Attribution Reporting API

Unsupervised speech-to-speech translation from monolingual data

Improving simulations of clouds and their effects on climate

Open sourcing Project Guideline: A platform for computer vision accessibility technology

Emerging practices for Society-Centered AI

Responsible AI at Google Research: Adversarial testing for generative AI safety

Scaling multimodal understanding to long videos

Enabling large-scale health studies for the research community

Responsible AI at Google Research: Context in AI Research (CAIR)

Overcoming leakage on error-corrected quantum processors