Experimental Measurement of Out-of-Time-Ordered Correlators at Finite Temperature.

Out-of-time-ordered correlators (OTOCs) are a key observable in a wide range of interconnected fields including many-body physics, quantum information science, and quantum gravity. Measuring OTOCs using near-term quantum simulators will extend our ability to explore fundamental aspects of these fields and the subtle connections between them. Here, we demonstrate an experimental method to measure OTOCs at finite temperatures and use the method to study their temperature dependence. These measurements are performed on a digital quantum computer running a simulation of the transverse field Ising model. Our flexible method, based on the creation of a thermofield double state, can be extended to other models and enables us to probe the OTOC's temperature-dependent decay rate. Measuring this decay rate opens up the possibility of testing the fundamental temperature-dependent bounds on quantum information scrambling.

Efficient Stabilized Two-Qubit Gates on a Trapped-Ion Quantum Computer.

In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make them robust to drift in experimental parameters, and shorten the gate times. Applicable to all quantum computer architectures whose two-qubit gates rely on phase-space closure, we present here a new gate-optimizing principle according to which negligible amounts of gate fidelity are traded for substantial savings in power, which, in turn, can be traded for substantial increases in gate speed and/or qubit connectivity. As a concrete example, we illustrate the method by constructing optimal pulses for entangling gates on a pair of ions within a trapped-ion chain, one of the leading quantum computing architectures. Our method is direct, noniterative, and linear, and, in some parameter regimes, constructs gate-steering pulses requiring up to an order of magnitude less power than the standard method. Additionally, our method provides increased robustness to mode drift. We verify the new trade-off principle experimentally on our trapped-ion quantum computer.

Experimental comparison of two quantum computing architectures.

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www. RESEARCH: ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

Robust 2-Qubit Gates in a Linear Ion Crystal Using a Frequency-Modulated Driving Force.

In an ion trap quantum computer, collective motional modes are used to entangle two or more qubits in order to execute multiqubit logical gates. Any residual entanglement between the internal and motional states of the ions results in loss of fidelity, especially when there are many spectator ions in the crystal. We propose using a frequency-modulated driving force to minimize such errors. In simulation, we obtained an optimized frequency-modulated 2-qubit gate that can suppress errors to less than 0.01% and is robust against frequency drifts over ±1 kHz. Experimentally, we have obtained a 2-qubit gate fidelity of 98.3(4)%, a state-of-the-art result for 2-qubit gates with five ions.

Many-body thermodynamics on quantum computers via partition function zeros.

Partition functions are ubiquitous in physics: They are important in determining the thermodynamic properties of many-body systems and in understanding their phase transitions. As shown by Lee and Yang, analytically continuing the partition function to the complex plane allows us to obtain its zeros and thus the entire function. Moreover, the scaling and nature of these zeros can elucidate phase transitions. Here, we show how to find partition function zeros on noisy intermediate-scale trapped-ion quantum computers in a scalable manner, using the XXZ spin chain model as a prototype, and observe their transition from XY-like behavior to Ising-like behavior as a function of the anisotropy. While quantum computers cannot yet scale to the thermodynamic limit, our work provides a pathway to do so as hardware improves, allowing the future calculation of critical phenomena for systems beyond classical computing limits.

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer.

The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.

Fault-tolerant quantum error detection.

Quantum computers will eventually reach a size at which quantum error correction becomes imperative. Quantum information can be protected from qubit imperfections and flawed control operations by encoding a single logical qubit in multiple physical qubits. This redundancy allows the extraction of error syndromes and the subsequent detection or correction of errors without destroying the logical state itself through direct measurement. We show the encoding and syndrome measurement of a fault-tolerantly prepared logical qubit via an error detection protocol on four physical qubits, represented by trapped atomic ions. This demonstrates the robustness of a logical qubit to imperfections in the very operations used to encode it. The advantage persists in the face of large added error rates and experimental calibration errors.