most citedTowards Quantum Simulations in Particle Physics and Beyond on Noisy Intermediate-Scale Quantum Devices

33 citations · 75 across the 7 of their papers we have counts for

collaborators

7 papers

quant-ph2021

Dimensional Expressivity Analysis, best-approximation errors, and automated design of parametric quantum circuits

Lena Funcke, Tobias Hartung, Karl Jansen +3

The design of parametric quantum circuits (PQCs) for efficient use in variational quantum simulations (VQS) is subject to two competing factors. On one hand, the set of states that…

quant-ph2021★ 33 cited

Towards Quantum Simulations in Particle Physics and Beyond on Noisy Intermediate-Scale Quantum Devices

Lena Funcke, Tobias Hartung, Karl Jansen +4

We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high energy physics and beyond on noisy intermediate-scale quantum (NISQ…

physics.comp-ph2021★ 1 cited

The Hubbard model with fermionic tensor networks

Manuel Schneider, Johann Ostmeyer, Karl Jansen +2

Many electromagnetic properties of graphene can be described by the Hubbard model on a honeycomb lattice. However, this system suffers strongly from the sign problem if a chemical…

quant-ph2021★ 6 cited

Best-approximation error for parametric quantum circuits

Lena Funcke, Tobias Hartung, Karl Jansen +3

In Variational Quantum Simulations, the construction of a suitable parametric quantum circuit is subject to two counteracting effects. The number of parameters should be small for…

physics.comp-ph2021★ 17 cited

Simulating both parity sectors of the Hubbard Model with Tensor Networks

Manuel Schneider, Johann Ostmeyer, Karl Jansen +2

Tensor networks are a powerful tool to simulate a variety of different physical models, including those that suffer from the sign problem in Monte Carlo simulations. The Hubbard mo…

cs.AI2021★ 6 cited

Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World

Florian Laurent, Manuel Schneider, Christian Scheller +24

The Flatland competition aimed at finding novel approaches to solve the vehicle re-scheduling problem (VRSP). The VRSP is concerned with scheduling trips in traffic networks and th…

cs.AI2020★ 12 cited

Flatland-RL : Multi-Agent Reinforcement Learning on Trains

Sharada Mohanty, Erik Nygren, Florian Laurent +11

Efficient automated scheduling of trains remains a major challenge for modern railway systems. The underlying vehicle rescheduling problem (VRSP) has been a major focus of Operatio…