Showing 2026Show all
2 papers · 1 filter
quant-ph2026
Fast Cliffords When Your Quantum Memory Is Full
Marten Folkertsma, Ian Mertz, Sergii Strelchuk +1
Additional qubits can reduce the depth of a quantum circuit by providing workspace for parallel computation, but standard constructions assume that this workspace is initialized in…
cs.CC2026
Understanding Robust Catalytic Computing
Michal Koucký, Ian Mertz, Sasha Sami
Catalytic computing concerns space bounded computation which starts with memory full of data that have to be restored by the end of the computation. Lossy catalytic computing, defi…