Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

The next few years will be exciting as prototype universal quantum processors emerge,
enabling the implementation of a wider variety of algorithms. Of particular interest are …

We review encoding and hardware-independent formulations of optimization problems for
quantum computing. Using this generalized approach, an extensive library of optimization …

Abstract The Job Shop Scheduling Problem (JSSP) has always been considered as one of
the most complex and industry essential scheduling problems. Optimizing the makespan of …

We construct the primitive gate set for the digital quantum simulation of the 108-element Σ
(36× 3) group. This is the first time a non-Abelian crystal-like subgroup of SU (3) has been …

Variational quantum algorithms, a class of quantum heuristics, are promising candidates for
the demonstration of useful quantum computation. Finding the best way to amplify the …

Quantum dynamics can be simulated on a quantum computer by exponentiating elementary
terms from the Hamiltonian in a sequential manner. However, such an implementation of …

We describe the simulation of dihedral gauge theories on digital quantum computers. The
non-Abelian discrete gauge group DN—the dihedral group—serves as an approximation to …

We study the relationship between the Quantum Approximate Optimization Algorithm
(QAOA) and the underlying symmetries of the objective function to be optimized. Our …