1k citations · 2.7k across the 53 of their papers we have counts for
4 papers · 1 filter
Designing ground states of Hopfield networks for quantum state preparation
Clemens Dlaska, Lukas M. Sieberer, Wolfgang Lechner
We present a protocol to store a polynomial number of arbitrary bit strings, encoded as spin configurations, in the approximately degenerate low-energy manifold of an all-to-all co…
Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
Andreas Hartmann, Wolfgang Lechner
We present a coherent counter-diabatic quantum protocol to prepare ground states in the lattice gauge mapping of all-to-all Ising models (LHZ) with considerably enhanced final grou…
A Quantum N-Queens Solver
Valentin Torggler, Philipp Aumann, Helmut Ritsch +1
The N-queens problem is to find the position of N queens on an N by N chess board such that no queens attack each other. The excluded diagonals N-queens problem is a variation wher…
Quantum Approximate Optimization with Parallelizable Gates
Wolfgang Lechner
The quantum approximate optimization algorithm (QAOA) has been introduced as a heuristic digital quantum computing scheme to find approximate solutions of combinatorial problems wi…