Аннотация

The authors introduce a search algorithm aimed at optimizing the arrangement of quantum gates, leveraging different sampling techniques to dynamically grow a graph that represents potential quantum circuits. They demonstrate efficacy in reducing the quantum gate count, both theoretically and numerically, albeit with acknowledged computational challenges as the graph expands.

Линки и ресурсы

тэги

сообщество

  • @tobiasosborne
  • @l3s
@l3s- тэги данного пользователя выделены