Quantum computers are expected to surpass the computational capabilities of classical
computers during this decade and have transformative impact on numerous industry sectors …

Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been
proposed by the author and others. Quantum computation using KPOs is based on quantum …

Quantum annealing is a computing paradigm that has the ambitious goal of efficiently
solving large-scale combinatorial optimization problems of practical importance. However …

This tutorial aims at giving an introductory treatment of the circuit analysis of
superconducting qubits, ie, two-level systems in superconducting circuits. It also touches …

The performance of the quantum approximate optimization algorithm is evaluated by using
three different measures: the probability of finding the ground state, the energy expectation …

We introduce a new approach for the robust control of quantum dynamics of strongly
interacting many-body systems. Our approach involves the design of periodic global control …

Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both
heuristic quantum algorithms intended for sampling optimal solutions of combinatorial …

We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …

The efficient validation of quantum devices is critical for emerging technological
applications. In a wide class of use cases the precise engineering of a Hamiltonian is …

Near-term quantum computers are limited by the decoherence of qubits to only being able to
run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum …