In this paper, we show the application of the Quantum Metropolis Sampling (QMS) algorithm to a toy gauge theory with discrete non-Abelian gauge group $D_4$ in (2+1)-dimensions, discussing in general how some components of hybrid quantum-classical …

Combinatorial optimization problems have attracted much interest in the quantum computing community in the recent years as a potential testbed to showcase quantum advantage. In this paper, we show how to exploit multilevel carriers of quantum …

Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein …

A frequent starting point of quantum computation platforms is the two-state quantum system, i.e., the qubit. However, in the context of integer optimization problems, relevant to scheduling optimization and operations research, it is often more …

Digital quantum simulators provide a table-top platform for addressing salient questions in particle and condensed-matter physics. A particularly rewarding target is given by lattice gauge theories (LGTs). Their constituents, e.g., charged matter and …

Spontaneous structural rearrangements play a central role in the organization and function of complex biomolecular systems. In principle, physics-based computer simulations like Molecular Dynamics (MD) enable us to investigate these thermally …

Di quantum computing si sente parlare da un po’ di tempo, ma non sempre viene presentato con chiarezza.
Per raccontarlo come si deve, ci siamo affidati al Professor Philipp Hans Juergen Hauke, professore associato del Dipartimento di Fisica …

Sampling equilibrium ensembles of dense polymer mixtures is a paradigmatically hard problem in computational physics, even in lattice-based models. Here, we develop a formalism based on interacting binary tensors that allows for tackling this problem …

Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical computers. Here, we develop a quantum annealing scheme to solve this problem. First, the task of finding the most …

In recent years, the infinite time-evolution block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time-evolution in one-dimensional quantum many-body systems. However, a major …

Powered by the Academic theme for Hugo.