Conditionally Rigorous Mitigation of Multiqubit Measurement Errors.

Several techniques have been recently introduced to mitigate errors in near-term quantum computers without the overhead required by quantum error correcting codes. While most of the focus has been on gate errors, measurement errors are significantly larger than gate errors on some platforms. A widely used transition matrix error mitigation (TMEM) technique uses measured transition probabilities between initial and final classical states to correct subsequently measured data. However from a rigorous perspective, the noisy measurement should be calibrated with perfectly prepared initial states, and the presence of any state-preparation error corrupts the resulting mitigation. Here we develop a measurement error mitigation technique, a conditionally rigorous TMEM, that is not sensitive to state-preparation errors and thus avoids this limitation. We demonstrate the importance of the technique for high-precision measurement and for quantum foundations experiments by measuring Mermin polynomials on IBM Q superconducting qubits. An extension of the technique allows one to correct for both state-preparation and measurement (SPAM) errors in expectation values as well; we illustrate this by giving a protocol for fully SPAM-corrected quantum process tomography.

Qubit Architecture with High Coherence and Fast Tunable Coupling.

We introduce a superconducting qubit architecture that combines high-coherence qubits and tunable qubit-qubit coupling. With the ability to set the coupling to zero, we demonstrate that this architecture is protected from the frequency crowding problems that arise from fixed coupling. More importantly, the coupling can be tuned dynamically with nanosecond resolution, making this architecture a versatile platform with applications ranging from quantum logic gates to quantum simulation. We illustrate the advantages of dynamical coupling by implementing a novel adiabatic controlled-z gate, with a speed approaching that of single-qubit gates. Integrating coherence and scalable control, the introduced qubit architecture provides a promising path towards large-scale quantum computation and simulation.

Proposal for a Lorenz qubit.

Nonlinear qubit master equations have recently been shown to exhibit rich dynamical phenomena such as period doubling, Hopf bifurcation, and strange attractors usually associated with classical nonlinear systems. Here we investigate nonlinear qubit models that support tunable Lorenz attractors. A Lorenz qubit could be realized experimentally by combining qubit torsion, generated by real or simulated mean field dynamics, with linear amplification and dissipation. This would extend engineered Lorenz systems to the quantum regime, allowing for their direct experimental study and possible application to quantum information processing.

Quantum simulation of operator spreading in the chaotic Ising model.

There is great interest in using near-term quantum computers to simulate and study foundational problems in quantum mechanics and quantum information science, such as the scrambling measured by an out-of-time-ordered correlator (OTOC). Here we use an IBM Q processor, quantum error mitigation, and weaved Trotter simulation to study high-resolution operator spreading in a four-spin Ising model as a function of space, time, and integrability. Reaching four spins while retaining high circuit fidelity is made possible by the use of a physically motivated fixed-node variant of the OTOC, allowing scrambling to be estimated without overhead. We find clear signatures of a ballistic operator spreading in a chaotic regime, as well as operator localization in an integrable regime. The techniques developed and demonstrated here open up the possibility of using cloud-based quantum computers to study and visualize scrambling phenomena, as well as quantum information dynamics more generally.

Hot electrons and electron-phonon coupling in a cylindrical nanoshell.

We use a standard model for the low-temperature electron-phonon interaction in metals to calculate the rate of thermal energy transfer between electrons and acoustic phonons in suspended metallic nanoshells. The electrons are treated as three-dimensional and noninteracting, whereas the vibrational modes are that of an thin cylindrical elastic shell of radius R with a free surface and thickness h. Disorder is neglected. The temperature dependence of the thermal power is obtained analytically for this model, and a crossover from the T3 dependence expected for one-dimensional phonons to a T3/(1 - v2) + 9gammaT4/[T*(1 - v2)(3/2)] dependence is obtained.

Fusing the single-excitation subspace with [Formula: see text].

There is a tremendous interest in developing practical applications for noisy intermediate-scale quantum processors without the overhead required by full error correction. Near-term quantum information processing is especially challenging within the standard gate model, as algorithms quickly lose fidelity as the problem size and circuit depth grow. This has lead to a number of non-gate-model approaches such as analog quantum simulation and quantum annealing. These come with specific hardware requirements that are different than that of a universal gate-based quantum computer. We have previously proposed an approach called the single-excitation subspace (SES) method, which uses a complete graph of superconducting qubits with tunable coupling. Without error correction the SES method is not scalable, but it offers several algorithmic components with constant depth, which is highly desirable for near-term use. The challenge of the SES method is that it requires a physical qubit for every basis state in the computer's Hilbert space. This imposes exponentially large resource costs for algorithms using registers of ancillary qubits, as each ancilla would double the required graph size. Here we show how to circumvent this doubling by leaving the SES and fusing it with a multi-ancilla Hilbert space. Specifically, we implement the tensor product of an SES register holding "data" with one or more ancilla qubits, which are able to independently control arbitrary [Formula: see text] unitary operations on the data in a constant number of steps. This enables a hybrid form of quantum computation where fast SES operations are performed on the data, traditional logic gates and measurements are performed on the ancillas, and controlled-unitaries act between. As example applications, we give ancilla-assisted SES implementations of quantum phase estimation and the quantum linear system solver of Harrow, Hassidim, and Lloyd.

Logical error rate in the Pauli twirling approximation.

The performance of error correction protocols are necessary for understanding the operation of potential quantum computers, but this requires physical error models that can be simulated efficiently with classical computers. The Gottesmann-Knill theorem guarantees a class of such error models. Of these, one of the simplest is the Pauli twirling approximation (PTA), which is obtained by twirling an arbitrary completely positive error channel over the Pauli basis, resulting in a Pauli channel. In this work, we test the PTA's accuracy at predicting the logical error rate by simulating the 5-qubit code using a 9-qubit circuit with realistic decoherence and unitary gate errors. We find evidence for good agreement with exact simulation, with the PTA overestimating the logical error rate by a factor of 2 to 3. Our results suggest that the PTA is a reliable predictor of the logical error rate, at least for low-distance codes.

Factoring 51 and 85 with 8 qubits.

We construct simplified quantum circuits for Shor's order-finding algorithm for composites N given by products of the Fermat primes 3, 5, 17, 257, and 65537. Such composites, including the previously studied case of 15, as well as 51, 85, 771, 1285, 4369, … have the simplifying property that the order of a modulo N for every base a coprime to N is a power of 2, significantly reducing the usual phase estimation precision requirement. Prime factorization of 51 and 85 can be demonstrated with only 8 qubits and a modular exponentiation circuit consisting of no more than four CNOT gates.

Emulation of a quantum spin with a superconducting phase qudit.

In quantum information processing, qudits (d-level systems) are an extension of qubits that could speed up certain computing tasks. We demonstrate the operation of a superconducting phase qudit with a number of levels d up to d = 5 and show how to manipulate and measure the qudit state, including simultaneous control of multiple transitions. We used the qudit to emulate the dynamics of single spins with principal quantum number s = 1/2, 1, and 3/2, allowing a measurement of Berry's phase and the even parity of integer spins (and odd parity of half-integer spins) under 2pi-rotation. This extension of the two-level qubit to a multilevel qudit holds promise for more-complex quantum computational architectures and for richer simulations of quantum mechanical systems.