Optimizing quantum gates towards the scale of logical qubits.

A foundational assumption of quantum error correction theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Two major challenges that could become fundamental roadblocks are manufacturing high-performance quantum hardware and engineering a control system that can reach its performance limits. The control challenge of scaling quantum gates from small to large processors without degrading performance often maps to non-convex, high-constraint, and time-dynamic control optimization over an exponentially expanding configuration space.

Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments.

We propose a quantum algorithm for inferring the molecular nuclear spin Hamiltonian from time-resolved measurements of spin-spin correlators, which can be obtained via nuclear magnetic resonance (NMR). We focus on learning the anisotropic dipolar term of the Hamiltonian, which generates dynamics that are challenging to classically simulate in some contexts. We demonstrate the ability to directly estimate the Jacobian and Hessian of the corresponding learning problem on a quantum computer, allowing us to learn the Hamiltonian parameters.

Time-crystalline eigenstate order on a quantum processor.

Quantum many-body systems display rich phase structure in their low-temperature equilibrium states. However, much of nature is not in thermal equilibrium. Remarkably, it was recently predicted that out-of-equilibrium systems can exhibit novel dynamical phases that may otherwise be forbidden by equilibrium thermodynamics, a paradigmatic example being the discrete time crystal (DTC).

Quantum supremacy using a programmable superconducting processor.

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2 (about 10).

Barren plateaus in quantum neural network training landscapes.

Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum simulation, optimization, and machine learning. Due to its simplicity and hardware efficiency, random circuits are often proposed as initial guesses for exploring the space of quantum states.

Quantum Annealing via Environment-Mediated Quantum Diffusion.

We show that quantum diffusion near a quantum critical point can provide an efficient mechanism of quantum annealing. It is based on the diffusion-mediated recombination of excitations in open systems far from thermal equilibrium. We find that, for an Ising spin chain coupled to a bosonic bath and driven by a monotonically decreasing transverse field, excitation diffusion sharply slows down below the quantum critical region.

Understanding Quantum Tunneling through Quantum Monte Carlo Simulations.

The tunneling between the two ground states of an Ising ferromagnet is a typical example of many-body tunneling processes between two local minima, as they occur during quantum annealing. Performing quantum Monte Carlo (QMC) simulations we find that the QMC tunneling rate displays the same scaling with system size, as the rate of incoherent tunneling. The scaling in both cases is O(Δ^{2}), where Δ is the tunneling splitting (or equivalently the minimum spectral gap).

Determination and correction of persistent biases in quantum annealers.

Calibration of quantum computers is essential to the effective utilisation of their quantum resources. Specifically, the performance of quantum annealers is likely to be significantly impaired by noise in their programmable parameters, effectively misspecification of the computational problem to be solved, often resulting in spurious suboptimal solutions. We developed a strategy to determine and correct persistent, systematic biases between the actual values of the programmable parameters and their user-specified values.

Computational multiqubit tunnelling in programmable quantum annealers.

Quantum tunnelling is a phenomenon in which a quantum state traverses energy barriers higher than the energy of the state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational multiqubit tunnelling has not yet been observed, and a theory of co-tunnelling under high- and low-frequency noises is lacking.

Statistical mechanics of the quantum K -satisfiability problem.

We study the quantum version of the random K -satisfiability problem in the presence of an external magnetic field Gamma applied in the transverse direction. We derive the replica-symmetric free-energy functional within the static approximation and the saddle-point equation for the order parameter: the distribution P[h(m)] of functions of magnetizations. The order parameter is interpreted as the histogram of probability distributions of individual magnetizations.

Inferential framework for nonstationary dynamics. II. Application to a model of physiological signaling.

The problem of how to reconstruct the parameters of a stochastic nonlinear dynamical system when they are time-varying is considered in the context of online decoding of physiological information from neuron signaling activity. To model the spiking of neurons, a set of FitzHugh-Nagumo (FHN) oscillators is used. It is assumed that only a fast dynamical variable can be detected for each neuron, and that the monitored signals are mixed by an unknown measurement matrix.

Inferential framework for nonstationary dynamics. I. Theory.

A general Bayesian framework is introduced for the inference of time-varying parameters in nonstationary, nonlinear, stochastic dynamical systems. Its convergence is discussed. The performance of the method is analyzed in the context of detecting signaling in a system of neurons modeled as FitzHugh-Nagumo (FHN) oscillators.