1.1k citations · 1.2k across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024★ 1 cited
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-…
quant-ph2024★ 7 cited
Fault-tolerant compiling of classically hard IQP circuits on hypercubes
Dominik Hangleiter, Marcin Kalinowski, Dolev Bluvstein +6
Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to redu…