11 citations · 31 across the 10 of their papers we have counts for
13 papers
Protecting Quantum Computers against Untrusted Users
Shiv Akshar Yadavalli, Joel Rajakumar, Alexander Schuckert +1
Publicly accessible fault-tolerant quantum computers must preserve scientific utility while limiting cryptanalytic power. We propose the restricted model of computation, 1/2BQP_1:…
Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
Matthew Coudron, Michael J. Gullans, Jon Nelson +2
We give a deterministic classical algorithm that estimates to additive error in time, where is a co…
A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics
Jon Nelson, Joel Rajakumar, Chao Yin +2
Developing classical simulation algorithms for noisy quantum circuits is essential to delineating the limits of quantum advantage. Existing classical sampling approaches for genera…
Noise-induced contraction of MPO truncation errors in noisy random circuits and Lindbladian dynamics
Zhi-Yuan Wei, Joel Rajakumar, Jon Nelson +3
We study how matrix-product-operator (MPO) truncation errors evolve when simulating two setups: (1) 1D Haar-random circuits under either depolarizing noise or amplitude-damping noi…
Non-Clifford Gates are Required for Long-Term Memory
Jon Nelson, Joel Rajakumar, Michael J. Gullans
We show that all Clifford circuits under interspersed depolarizing noise lose memory of their input exponentially quickly, even when given access to a constant supply of fresh qubi…
Error correction phase transition in noisy random quantum circuits
Jon Nelson, Joel Rajakumar, Michael J. Gullans
In this work, we study the task of encoding logical information via a noisy quantum circuit. It is known that at superlogarithmic depth, the output of any noisy circuit without res…
Limitations of Noisy Geometrically Local Quantum Circuits
Jon Nelson, Joel Rajakumar, Michael J. Gullans
Quantum circuits with a constant rate of depolarizing noise per qubit per time step are known to converge to the uniform distribution at depth , and hence become t…
Measurement-induced entanglement in noisy 2D random circuits
Zhi-Yuan Wei, Jon Nelson, Joel Rajakumar +4
We study measurement-induced entanglement (MIE) generated by column-by-column sampling of noisy 2D random circuits of size and depth . Focusing primarily on Clifford circuit…
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…
Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings
Joel Rajakumar, Jai Moondra, Bryan Gard +2
We present methods for constructing any target coupling graph using limited global controls in an Ising-like quantum spin system. Our approach is motivated by implementing the quan…