713 citations · 3.1k across the 16 of their papers we have counts for
16 papers
Quantum-enhanced Markov chain Monte Carlo
David Layden, Guglielmo Mazzola, Ryan V. Mishmash +4
Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quant…
Active Learning of Quantum System Hamiltonians yields Query Advantage
Arkopal Dutt, Edwin Pednault, Chai Wah Wu +4
Hamiltonian learning is an important procedure in quantum system identification, calibration, and successful operation of quantum computers. Through queries to the quantum system,…
Hardware-efficient random circuits to classify noise in a multi-qubit system
Jin-Sung Kim, Lev S. Bishop, Antonio D. Corcoles +3
In this work we extend a multi-qubit benchmarking technique known as the Binned Output Generation (BOG) in order to discriminate between coherent and incoherent noise sources in th…
Doubling the size of quantum simulators by entanglement forging
Andrew Eddins, Mario Motta, Tanvi P. Gujarati +4
Quantum computers are promising for simulations of chemical and physical systems, but the limited capabilities of today's quantum processors permit only small, and often approximat…
Quantum advantage for computations with limited space
Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi +2
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provab…
Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
Shelly Garion, Naoki Kanazawa, Haggai Landa +4
Hardware efficient transpilation of quantum circuits to a quantum devices native gateset is essential for the execution of quantum algorithms on noisy quantum computers. Typical qu…