3 papers
quant-ph2026
Arts & crafts: Strong random unitaries and geometric locality
Marten Folkertsma, Lorenzo Grevink, Jonas Helsen +1
We study the problem of constructing strong approximate unitary -designs on -dimensional grids (and more generally on Cartesian products of graphs), building on the work of S…
quant-ph2025
Quantum Catalytic Space
Harry Buhrman, Marten Folkertsma, Ian Mertz +4
Space complexity is a key field of study in theoretical computer science. In the quantum setting there are clear motivations to understand the power of space-restricted computation…
quant-ph2024
State preparation by shallow circuits using feed forward
Harry Buhrman, Marten Folkertsma, Bruno Loff +1
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible).…