activity
20242026
most citedTriply efficient shadow tomography

17 citations · 47 across the 13 of their papers we have counts for

collaborators

13 papers

quant-ph2026

High-rate qLDPC processors

Aditya Bhardwaj, Muzhou Ma, Nadine Meister +6

Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode…

quant-ph2026★ 2 cited

Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Madelyn Cain, Qian Xu, Robbie King +6

Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and di…

quant-ph2025★ 1 cited

The Grand Challenge of Quantum Applications

Ryan Babbush, Robbie King, Sergio Boixo +6

This perspective outlines promising pathways and critical obstacles on the road to developing useful quantum computing applications, drawing on insights from the Google Quantum AI…

quant-ph2025

A simplified version of the quantum OTOC problem

Robbie King, Robin Kothari, Ryan Babbush +4

This note presents a simplified version of the OTOC problem that was recently experimentally implemented by Google Quantum AI and collaborators. We present a formulation of…

quant-ph2025

Quantum computation of molecular geometry via many-body nuclear spin echoes

C. Zhang, R. G. Cortiñas, A. H. Karamlou +320

Quantum-information-inspired experiments in nuclear magnetic resonance spectroscopy may yield a pathway towards determining molecular structure and properties that are otherwise ch…

quant-ph2025

Constructive interference at the edge of quantum ergodic dynamics

Dmitry A. Abanin, Rajeev Acharya, Laleh Aghababaie-Beni +262

Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, qua…

quant-ph2025

Quantum simulation with sum-of-squares spectral amplification

Robbie King, Guang Hao Low, Ryan Babbush +2

We present sum-of-squares spectral amplification (SOSSA), a framework for improving quantum simulation relevant to low-energy problems. We show how SOSSA can be applied to problems…

quant-ph2025★ 9 cited

Fast quantum simulation of electronic structure by spectrum amplification

Guang Hao Low, Robbie King, Dominic W. Berry +6

The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator throug…

quant-ph2024

A Quantum Approximate Optimization Algorithm for Local Hamiltonian Problems

Ishaan Kannan, Robbie King, Leo Zhou

Local Hamiltonian Problems (LHPs) are important problems that are computationally QMA-complete and physically relevant for many-body quantum systems. Quantum MaxCut (QMC), which eq…

quant-ph2024★ 2 cited

Provable quantum speedups for computing persistence in topological data analysis

Casper Gyurik, Alexander Schmidhuber, Robbie King +2

Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We provide an efficient quan…

quant-ph2024★ 16 cited

Optimization by Decoded Quantum Interferometry

Stephen P. Jordan, Noah Shutty, Mary Wootters +6

Achieving superpolynomial speedups for optimization has long been a central goal for quantum algorithms. Here we introduce Decoded Quantum Interferometry (DQI), a quantum algorithm…

quant-ph2024

Shadow Hamiltonian Simulation

Rolando D. Somma, Robbie King, Robin Kothari +2

Simulating quantum dynamics is one of the most important applications of quantum computers. Traditional approaches for quantum simulation involve preparing the full evolved state o…

quant-ph2024★ 17 cited

Triply efficient shadow tomography

Robbie King, David Gosset, Robin Kothari +1

Given copies of a quantum state , a shadow tomography protocol aims to learn all expectation values from a fixed set of observables, to within a given precision . We say that…