arXiv subjects

Daniel Crow

Publications and source records attributed to Daniel Crow.

6 recordsLinked to original sources

arXiv2024

Fault-tolerant quantum computation with a neutral atom processor

Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.

quant-ph↗

arXiv2023

Quantum Subspace Correction for Constraints

We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated measurements given a set of constraints. The stabilizer measurements allow the detection of constraint violations, and provide a route to recovery back into the constrained subspace. We call this technique ''quantum subspace correction". As an example, we explicitly investigate the stabilizers using the simplest local constraint subspace: Independent Set. We find an algorithm that is guaranteed to produce a perfect uniform or weighted distribution over all constraint-satisfying states when paired with a stopping condition: a quantum analogue of partial rejection sampling. The stopping condition can be modified for sub-graph approximations. We show that it can prepare exact Gibbs distributions on $d-$regular graphs below a critical hardness $\lambda_d^*$ in sub-linear time. Finally, we look at a potential use of quantum subspace correction for fault-tolerant depth-reduction. In particular we investigate how the technique detects and recovers errors induced by Trotterization in preparing maximum independent set using an adiabatic state preparation algorithm.

quant-ph↗

arXiv2019

2-Designs and Redundant Syndrome Extraction for Quantum Error Correction

Imperfect measurement can degrade a quantum error correction scheme. A solution that restores fault tolerance is to add redundancy to the process of syndrome extraction. In this work, we show how to optimize this process for an arbitrary ratio of data qubit error probability to measurement error probability. The key is to design the measurements so that syndromes that correspond to different errors are separated by the maximum distance in the signal space, in close analogy to classical error correction codes. We find that the mathematical theory of 2-designs, appropriately modified, is the right tool for this. Analytical and simulation results for the bit-flip code, the 5-qubit code, and the Steane code are presented. The results show that design-based redundancy protocols show improvement in both cost and performance relative to conventional fault-tolerant error-correction schemes in situations, quite important in practice, where measure errors are common. In the near term, the construction of a fault-tolerant logical qubit with a small number of noisy physical qubits will benefit from targeted redundancy in syndrome extraction.

quant-ph↗

arXiv2017

Measurement-free implementations of small-scale surface codes for quantum dot qubits

The performance of quantum error correction schemes depends sensitively on the physical realizations of the qubits and the implementations of various operations. For example, in quantum dot spin qubits, readout is typically much slower than gate operations, and conventional surface code implementations that rely heavily on syndrome measurements could therefore be challenging. However, fast and accurate reset of quantum dot qubits--without readout--can be achieved via tunneling to a reservoir. Here, we propose small-scale surface code implementations for which syndrome measurements are replaced by a combination of Toffoli gates and qubit reset. For quantum dot qubits, this enables much faster error correction than measurement-based schemes, but requires additional ancilla qubits and non-nearest-neighbor interactions. We have performed numerical simulations of two different coding schemes, obtaining error thresholds on the orders of $10^{-2}$ for a 1D architecture that only corrects bit-flip errors, and $10^{-4}$ for a 2D architecture that corrects bit- and phase-flip errors.

quant-ph↗

arXiv2015

Improved error thresholds for measurement-free error correction

Motivated by limitations and capabilities of neutral atom qubits, we examine whether measurement-free error correction can produce practical error thresholds. We show that this can be achieved by extracting redundant syndrome information, giving our procedure extra fault tolerance and eliminating the need for ancilla verification. The procedure is particularly favorable when multi-qubit gates are available for the correction step. Simulations of the bit-flip, Bacon-Shor, and Steane codes indicate that coherent error correction can produce threshold error rates that are on the order of $10^{-3}$ to $10^{-4}$---comparable with or better than measurement-based values, and much better than previous results for other coherent error correction schemes. This indicates that coherent error correction is worthy of serious consideration for achieving protected logical qubits.

quant-ph↗

arXiv2013

Classical Simulation of Quantum Noise

Dephasing decoherence induced by interaction of one qubit with a quantum bath can be simulated classically by random unitary evolution without the need for a bath and this random unitary evolution is equivalent to the quantum case. For a general dephasing model and a single qubit system, we explicitly construct the noise functional and completely specify the random unitary evolution. To demonstrate the technique, we applied our results to three paradigmatic models: spin-boson, central spin, and quantum impurity. For multiple qubits, we identify a class of generalized quantum dephasing models that can be simulated classically. Finally we show that depolarizing quantum models can be simulated classically for all dimensionalities of the principal system.

quant-ph↗