# Quantum Computation

Last updated on
May 18, 2020

Quantum computers show the potential of outperforming classical computers in a variety of applications. We are interested in developing algorithms for solving relevant practical problems, ranging from the simulation of quantum many-body systems to the solution of NP-complete optimization problems. Besides gate-based quantum computers, we also investigate adiabatic quantum optimization and quantum annealing.

## Publications

### Squeezing and quantum approximate optimization

Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital …

arXiv:2205.10383 [quant-ph]
(2022)

### Quantum approximate optimization algorithm for qudit systems with long-range interactions

A frequent starting point of quantum computation platforms are two-state quantum systems, i.e., qubits. However, in the context of …

Yannick Deller, Sebastian Schmitt, Maciej Lewenstein, Steve Lenk, Marika Federer, Fred Jendrzejewski, Philipp Hauke, Valentin Kasper

arXiv:2204.00340 [quant-ph]
(2022)
### Probing confinement in a $\mathbb{Z}_2$ lattice gauge theory on a quantum computer

Digital quantum simulators provide a table-top platform for addressing salient questions in particle and condensed-matter physics. A …

arXiv:2203.08905 [quant-ph]
(2022)

### Sampling Rare Conformational Transitions with a Quantum Computer

Spontaneous structural rearrangements play a central role in the organization and function of complex biomolecular systems. In …

arXiv:2201.11781 [quant-ph]
(2022)

### Polymer Physics by Quantum Computing

Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in …

arXiv:2104.10102 [cond-mat.soft]
(2021)

### Dominant Reaction Pathways by Quantum Computing

Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical …

Phys. Rev. Lett.

**126**, 028104 (2021)### Perspectives of quantum annealing: Methods and implementations

Quantum annealing is a computing paradigm that has the ambitious goal of efficiently solving large-scale combinatorial optimization …

Rep. Prog. Phys.

**83**054401 (2020)### Quantum localization bounds Trotter errors in digital quantum simulation

A fundamental challenge in digital quantum simulation (DQS) is the control of an inherent error, which appears when discretizing the …

Sci. Adv. 2019;

**5**:eaau8342 (2019)### Real-time dynamics of lattice gauge theories with a few-qubit quantum computer

Gauge theories are fundamental to our understanding of interactions between the elementary constituents of matter as mediated …

Esteban A. Martinez, Christine A. Muschik, Philipp Schindler, Daniel Nigg, Alexander Erhard, Markus Heyl, Philipp Hauke, Marcello Dalmonte, Thomas Monz, Peter Zoller, Rainer Blatt

Nature **534**, 516–519 (2016)

### A quantum annealing architecture with all-to-all connectivity from local interactions

Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic …

Sci. Adv. 2015;

**1**:e1500838 (2015)## Talks

### Mirradio - Le chicche di Mirradio: Puntata 1 | Quantum Computing

Di quantum computing si sente parlare da un po’ di tempo, ma non sempre viene presentato con chiarezza.
Per raccontarlo come si deve, …

May 12, 2021