296 citations · 436 across the 5 of their papers we have counts for
5 papers
Adaptive constant-depth circuits for manipulating non-abelian anyons
Sergey Bravyi, Isaac Kim, Alexander Kliesch +1
We consider Kitaev's quantum double model based on a finite group and describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated b…
Twisted hybrid algorithms for combinatorial optimization
Libor Caha, Alexander Kliesch, Robert Koenig
Proposed hybrid algorithms encode a combinatorial cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. Clas…
Hybrid quantum-classical algorithms for approximate graph coloring
Sergey Bravyi, Alexander Kliesch, Robert Koenig +1
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX--CUT, the problem of finding an approximate -vertex coloring of a graph. We compa…
Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Sergey Bravyi, Alexander Kliesch, Robert Koenig +1
Local Hamiltonians with topological quantum order exhibit highly entangled ground states that cannot be prepared by shallow quantum circuits. Here, we show that this property may e…
Continuum limits of homogeneous binary trees and the Thompson group
Alexander Kliesch, Robert Koenig
Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is nat…