High-threshold and low-overhead fault-tolerant quantum memory.

The accumulation of physical errors1-3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7-10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

Encoding a magic state with beyond break-even fidelity.

To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise1-8. We can complete a universal set of logic gates by producing special resources called magic states9-11. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those that can be prepared using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing12, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.

Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders.

Quantum error correction offers a promising path for performing high fidelity quantum computations. Although fully fault-tolerant executions of algorithms remain unrealized, recent improvements in control electronics and quantum hardware enable increasingly advanced demonstrations of the necessary operations for error correction. Here, we perform quantum error correction on superconducting qubits connected in a heavy-hexagon lattice. We encode a logical qubit with distance three and perform several rounds of fault-tolerant syndrome measurements that allow for the correction of any single fault in the circuitry. Using real-time feedback, we reset syndrome and flag qubits conditionally after each syndrome extraction cycle. We report decoder dependent logical error, with average logical error per syndrome measurement in Z(X)-basis of ~0.040 (~0.088) and ~0.037 (~0.087) for matching and maximum likelihood decoders, respectively, on leakage post-selected data.

Harmonic radar tracking of individual melon flies, Zeugodacus cucurbitae, in Hawaii: Determining movement parameters in cage and field settings.

Tephritid fruit flies, such as the melon fly, Zeugodacus cucurbitae, are major horticultural pests worldwide and pose invasion risks due primarily to international trade. Determining movement parameters for fruit flies is critical to effective surveillance and control strategies, from setting quarantine boundaries after incursions to development of agent-based models for management. While mark-release-recapture, flight mills, and visual observations have been used to study tephritid movement, none of these techniques give a full picture of fruit fly movement in nature. Tracking tagged flies offers an alternative method which has the potential to observe individual fly movements in the field, mirroring studies conducted by ecologists on larger animals. In this study, harmonic radar (HR) tags were fabricated using superelastic nitinol wire which is light (tags weighed less than 1 mg), flexible, and does not tangle. Flight tests with wild melon flies showed no obvious adverse effects of HR tag attachment. Subsequent experiments successfully tracked HR tagged flies in large field cages, a papaya field, and open parkland. Unexpectedly, a majority of tagged flies showed strong flight directional biases with these biases varying between flies, similar to what has been observed in the migratory butterfly Pieris brassicae. In field cage experiments, 30 of the 36 flies observed (83%) showed directionally biased flights while similar biases were observed in roughly half the flies tracked in a papaya field. Turning angles from both cage and field experiments were non-random and indicate a strong bias toward continued "forward" movement. At least some of the observed direction bias can be explained by wind direction with a correlation observed between collective melon fly flight directions in field cage, papaya field, and open field experiments. However, individual mean flight directions coincided with the observed wind direction for only 9 out of the 25 flies in the cage experiment and half of the flies in the papaya field, suggesting wind is unlikely to be the only factor affecting flight direction. Individual flight distances (meters per flight) differed between the field cage, papaya field, and open field experiments with longer mean step-distances observed in the open field. Data on flight directionality and step-distances determined in this study might assist in the development of more effective control and better parametrize models of pest tephritid fruit fly movement.

Calibrated Decoders for Experimental Quantum Error Correction.

Arbitrarily long quantum computations require quantum memories that can be repeatedly measured without being corrupted. Here, we preserve the state of a quantum memory, notably with the additional use of flagged error events. All error events were extracted using fast, midcircuit measurements and resets of the physical qubits. Among the error decoders we considered, we introduce a perfect matching decoder that was calibrated from measurements containing up to size-four correlated events. To compare the decoders, we used a partial postselection scheme shown to retain ten times more data than full postselection. We observed logical errors per round of 2.2±0.1×10^{-2} (decoded without postselection) and 5.1±0.7×10^{-4} (full postselection), which was less than the physical measurement error of 7×10^{-3} and therefore surpasses a pseudothreshold for repeated logical measurements.

Quantum imaging by coherent enhancement.

Conventional wisdom dictates that to image the position of fluorescent atoms or molecules, one should stimulate as much emission and collect as many photons as possible. That is, in this classical case, it has always been assumed that the coherence time of the system should be made short, and that the statistical scaling ∼1/√t defines the resolution limit for imaging time t. However, here we show in contrast that given the same resources, a long coherence time permits a higher resolution image. In this quantum regime, we give a procedure for determining the position of a single two-level system and demonstrate that the standard errors of our position estimates scale at the Heisenberg limit as ∼1/t, a quadratic, and notably optimal, improvement over the classical case.

Fixed-point quantum search with an optimal number of queries.

Grover's quantum search and its generalization, quantum amplitude amplification, provide a quadratic advantage over classical algorithms for a diverse set of tasks but are tricky to use without knowing beforehand what fraction λ of the initial state is comprised of the target states. In contrast, fixed-point search algorithms need only a reliable lower bound on this fraction but, as a consequence, lose the very quadratic advantage that makes Grover's algorithm so appealing. Here we provide the first version of amplitude amplification that achieves fixed-point behavior without sacrificing the quantum speedup. Our result incorporates an adjustable bound on the failure probability and, for a given number of oracle queries, guarantees that this bound is satisfied over the broadest possible range of λ.