activity
20172025
most citedEfficient variational contraction of two-dimensional tensor networks with a non-trivial unit cell

22 citations · 51 across the 13 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

quant-ph2025

A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization

Franz J. Schreiber, Maximilian J. Kramer, Alexander Nietner +1

The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type…