Quantum computation

Boosting quantum annealing performance through direct polynomial unconstrained binary optimization

Quantum annealing aims at solving optimization problems of practical relevance using quantum computing hardware. Problems of interest are typically formulated in terms of quadratic unconstrained binary optimization (QUBO) Hamiltonians. However, many …

The role of higher-order terms in trapped-ion quantum computing with magnetic gradient induced coupling

Trapped-ion hardware based on the Magnetic Gradient Induced Coupling (MAGIC) scheme is emerging as a promising platform for quantum computing. Nevertheless, in this (as in any other) quantum-computing platform, many technical questions still have to …

A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack

The search for quantum algorithms to tackle classical combinatorial optimization problems has long been one of the most attractive yet challenging research topics in quantum computing. In this context, variational quantum algorithms (VQA) are a …

Qudit-native measurement protocol for dynamical correlations using Hadamard tests

Dynamical correlations reveal important out-of-equilibrium properties of the underlying quantum many-body system, yet they are notoriously difficult to measure in experiments. While measurement protocols for dynamical correlations based on Hadamard …

Quantum Computation of Thermal Averages for a Non-Abelian D4 Lattice Gauge Theory via Quantum Metropolis Sampling

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 …

Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic

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 …

Implementing a $\mathbb{Z}_2$ Lattice Gauge Theory in a Digital Quantum Simulator

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

Squeezing and quantum approximate optimization

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 …

Quantum approximate optimization algorithm for qudit systems

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 …

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 particularly rewarding target is given by lattice gauge theories (LGTs). Their constituents, e.g., charged matter and …