Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic
algorithm, which it can approximate with sufficient depth. However, it is unclear to what …

We propose and analyze the use of Bayesian optimization techniques to design quantum
annealing schedules with minimal user and resource requirements. We showcase our …

The quantum alternating operator ansatz (QAOA) is a heuristic hybrid quantum-classical
algorithm for finding high-quality approximate solutions to combinatorial optimization …

This paper focuses on the maximum speed at which biological evolution can occur. I derive
inequalities that limit the rate of evolutionary processes driven by natural selection …

We present a hybrid classical-quantum computing paradigm where the quantum part strictly
runs within the coherence time of a quantum annealer, a method we call variational …

This paper explores the application of Quadratic Unconstrained Binary Optimization (QUBO)
models in solving the Travelling Salesman Problem (TSP) through Quantum Annealing …

Quantum computing is one of the most enticing computational paradigms with the potential
to revolutionize diverse areas of future-generation computational systems. While quantum …

We address the problem of optimal quantum state preparation. We propose a protocol
based on a stroboscopic driving of the system in its parameter space combined with …

Leveraging quantum information geometry, we derive generalized quantum speed limits on
the rate of change of the expectation values of observables. These bounds subsume and, for …

We generalize Farhi et al.'s 0.6924-approximation result technique of the Max-Cut Quantum
Approximate Optimization Algorithm (QAOA) on 3-regular graphs to obtain provable lower …