Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typically relies on a pre-selected wavefunction ansatz that results in approximate wavefunctions and energies. Here we present an arbitrarily accurate variational algorithm that, instead of fixing an ansatz upfront, grows it systematically one operator at a time in a way dictated by the molecule being simulated. This generates an ansatz with a small number of parameters, leading to shallow-depth circuits. We present numerical simulations, including for a prototypical strongly correlated molecule, which show that our algorithm performs much better than a unitary coupled cluster approach, in terms of both circuit depth and chemical accuracy. Our results highlight the potential of our adaptive algorithm for exact simulations with present-day and near-term quantum hardware.

No abstract

We demonstrate a substantial improvement in the spin-exchange gate using symmetric control instead of conventional detuning in GaAs spin qubits, up to a factor of six increase in the quality factor of the gate. For symmetric operation, nanosecond voltage pulses are applied to the barrier that controls the interdot potential between quantum dots, modulating the exchange interaction while maintaining symmetry between the dots. Excellent agreement is found with a model that separately includes electrical and nuclear noise sources for both detuning and symmetric gating schemes. Unlike exchange control via detuning, the decoherence of symmetric exchange rotations is dominated by rotation-axis fluctuations due to nuclear field noise rather than direct exchange noise.

Precise qubit manipulation is fundamental to quantum computing, yet experimental systems generally have stray coupling between the qubit and the environment, which hinders the necessary high-precision control. Here, we report the first theoretical progress in correcting an important class of errors stemming from fluctuations in the magnetic field gradient, in the context of the singlet-triplet spin qubit in a semiconductor double quantum dot. These errors are not amenable to correction via control techniques developed in other contexts, as here the experimenter has precise control only over the rotation rate about the z axis of the Bloch sphere, and this rate is furthermore restricted to be positive and bounded. Despite these strong constraints, we construct simple electrical pulse sequences that, for small gradients, carry out z axis rotations while cancelling errors up to the sixth order in gradient fluctuations, and for large gradients, carry out arbitrary rotations while cancelling the leading order error.

The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to prepare multi-qubit trial states on the quantum processor that either include, or at least closely approximate, the actual energy eigenstates of the problem being simulated while avoiding states that have little overlap with them. Symmetries play a central role in determining the best trial states. Here, we present efficient state preparation circuits that respect particle number, total spin, spin projection, and time-reversal symmetries. These circuits contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace dictated by the chemistry problem while avoiding all irrelevant sectors of Hilbert space. We show how to construct these circuits for arbitrary numbers of orbitals, electrons, and spin quantum numbers, and we provide explicit decompositions and gate counts in terms of standard gate sets in each case. We test our circuits in quantum simulations of the H2 and LiH molecules and find that they outperform standard state preparation methods in terms of both accuracy and circuit depth.

Quantum repeaters are nodes in a quantum communication network that allow reliable transmission of entanglement over large distances. It was recently shown that highly entangled photons in so-called graph states can be used for all-photonic quantum repeaters, which require substantially fewer resources compared to atomic-memory-based repeaters. However, standard approaches to building multiphoton entangled states through pairwise probabilistic entanglement generation severely limit the size of the state that can be created. Here, we present a protocol for the deterministic generation of large photonic repeater states using quantum emitters such as semiconductor quantum dots and defect centers in solids. We show that arbitrarily large repeater states can be generated using only one emitter coupled to a single qubit, potentially reducing the necessary number of photon sources by many orders of magnitude. Our protocol includes a built-in redundancy, which makes it resilient to photon loss.

Analytical solutions to the time-dependent Schrödinger equation describing a driven two-level system are invaluable to many areas of physics, but they are also extremely rare. Here, we present a simple algorithm that generates an unlimited number of exact analytical solutions. We show that a general single-axis driving term and its corresponding evolution operator are determined by a single real function which is constrained only by a certain inequality and initial conditions. Any function satisfying these constraints yields an exact analytical solution. We demonstrate this method by presenting several new exact solutions to the time-dependent Schrödinger equation. Our general method and many of the new solutions we present are particularly relevant to qubit control in quantum computing applications.

The variational quantum eigensolver (VQE) has emerged as one of the most promising near-term quantum algorithms that can be used to simulate many-body systems such as molecular electronic structures. Serving as an attractive ansatz in the VQE algorithm, unitary coupled cluster (UCC) theory has seen a renewed interest in recent literature. However, unlike the original classical UCC theory, implementation on a quantum computer requires a finite-order Suzuki-Trotter decomposition to separate the exponentials of the large sum of Pauli operators. While previous literature has recognized the non-uniqueness of different orderings of the operators in the Trotterized form of UCC methods, the question of whether or not different orderings matter at the chemical scale has not been addressed. In this letter, we explore the effect of operator ordering on the Trotterized UCCSD ansatz, as well as the much more compact k-UpCCGSD ansatz recently proposed by Lee et al. We observe a significant, system-dependent variation in the energies of Trotterizations with different operator orderings. The energy variations occur on a chemical scale, sometimes on the order of hundreds of kcal/mol. This letter establishes the need to define not only the operators present in the ansatz, but also the order in which they appear. This is necessary for adhering to the quantum chemical notion of a "model chemistry", in addition to the general importance of scientific reproducibility. As a final note, we suggest a useful strategy to select out of the combinatorial number of possibilities, a single well-defined and effective ordering of the operators.