33 citations · 43 across the 5 of their papers we have counts for
11 papers
Perfect non-local quantum computation is impossible
Marten Folkertsma, Dmitry Grinko, Gina Muuss +1
Non-local quantum computation (NLQC) asks two parties to apply a joint operation to their quantum inputs using an entangled resource state and one round of simultaneous quantum com…
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…
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…
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…
Fully Characterizing Lossy Catalytic Computation
Marten Folkertsma, Ian Mertz, Florian Speelman +1
A catalytic machine is a model of computation where a traditional space-bounded machine is augmented with an additional, significantly larger, "catalytic" tape, which, while being…
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).…
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture
Jordi Weggemans, Marten Folkertsma, Chris Cade
We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem, which we call 'Guidable Local Hamiltonian' problems. Unlike their guided counterparts, thes…
Improved Hardness Results for the Guided Local Hamiltonian Problem
Chris Cade, Marten Folkertsma, Sevag Gharibian +4
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum alg…
Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States
Chris Cade, Marten Folkertsma, Jordi Weggemans
Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a -local Hamiltonian when provided with a description of a qua…
Quantum Algorithms for Community Detection and their Empirical Run-times
Chris Cade, Marten Folkertsma, Ido Niesen +1
We apply our recent work on empirical estimates of quantum speedups to the practical task of community detection in complex networks. We design several quantum variants of a popula…
Quantifying Grover speed-ups beyond asymptotic analysis
Chris Cade, Marten Folkertsma, Ido Niesen +1
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms w…