Quantum Computation
A fully connected quantum annealing architecture;
Sci. Adv. 1, 9, e1500838 (2015)
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.
Philipp Hauke
Professor
Haifeng Lang
Postdoc
Julius Mildenberger
PhD Student
Gopal Chandra Santra
PhD Student
Veronica Panizza
PhD Student
Alberto Bottarelli
PhD Student
Sebastian Nagies
PhD Student
Publications
Squeezing and quantum approximate optimization
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital …
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 …
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 …
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 …
Polymer Physics by Quantum Computing
Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in …
Dominant Reaction Pathways by Quantum Computing
Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical …
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 …
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 …
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 …
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 …
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, …