11 citations · 31 across the 10 of their papers we have counts for
4 papers · 1 filter
Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
Jon Nelson, Joel Rajakumar, Dominik Hangleiter +1
We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-…
Gibbs Sampling gives Quantum Advantage at Constant Temperatures with O(1)-Local Hamiltonians
Joel Rajakumar, James D. Watson
Sampling from Gibbs states -- states corresponding to system in thermal equilibrium -- has recently been shown to be a task for which quantum computers are expected to achieve supe…
Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
Joel Rajakumar, James D. Watson, Yi-Kai Liu
Sampling from the output distributions of quantum computations comprising only commuting gates, known as instantaneous quantum polynomial (IQP) computations, is believed to be intr…
Trainability Barriers in Low-Depth QAOA Landscapes
Joel Rajakumar, John Golden, Andreas Bärtschi +1
The Quantum Alternating Operator Ansatz (QAOA) is a prominent variational quantum algorithm for solving combinatorial optimization problems. Its effectiveness depends on identifyin…