Demonstration of Erasure Conversion in a Molecular Tweezer Array
- URL: http://arxiv.org/abs/2406.02391v1
- Date: Tue, 4 Jun 2024 15:07:24 GMT
- Title: Demonstration of Erasure Conversion in a Molecular Tweezer Array
- Authors: Connor M. Holland, Yukai Lu, Samuel J. Li, Callum L. Welsh, Lawrence W. Cheuk,
- Abstract summary: We present work on site-resolved detection of internal state errors and quantum erasures, which are qubit errors with known locations.
This enables creating molecular arrays with low defect rates, opening the door to high-fidelity simulation of quantum many-body systems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Programmable optical tweezer arrays of molecules are an emerging platform for quantum simulation and quantum information science. For these applications, reducing and mitigating errors that arise during initial state preparation and subsequent evolution remain major challenges. In this paper, we present work on site-resolved detection of internal state errors and quantum erasures, which are qubit errors with known locations. First, using a new site-resolved detection scheme, we demonstrate robust and enhanced tweezer array preparation fidelities. This enables creating molecular arrays with low defect rates, opening the door to high-fidelity simulation of quantum many-body systems. Second, for the first time in molecules, we demonstrate mid-circuit detection of erasures using a composite detection scheme that minimally affects error-free qubits. We also demonstrate mid-circuit conversion of blackbody-induced errors into detectable erasures. Our demonstration of erasure conversion, which has been shown to significantly reduce overheads for fault-tolerant quantum error correction, could be useful for quantum information processing in molecular tweezer arrays.
Related papers
- Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation.
We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture.
We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
arXiv Detail & Related papers (2024-05-31T16:43:20Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example.
We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
arXiv Detail & Related papers (2023-07-06T18:00:10Z) - Measuring Non-local Brane Order with Error-corrected Parity Snapshots [9.00095895405037]
We develop an error correction method for large-scale neutral atom quantum simulators using optical lattices.
Our method can distinguish correlated particle-hole pairs from uncorrelated holes in the Mott insulator.
Our work provides a promising avenue for investigating and characterizing exotic phases of matters in large-scale quantum simulators.
arXiv Detail & Related papers (2023-05-17T21:56:57Z) - Realizing Repeated Quantum Error Correction in a Distance-Three Surface
Code [42.394110572265376]
We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors.
In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
arXiv Detail & Related papers (2021-12-07T13:58:44Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Counteracting dephasing in Molecular Nanomagnets by optimized qudit
encodings [60.1389381016626]
Molecular Nanomagnets may enable the implementation of qudit-based quantum error-correction codes.
A microscopic understanding of the errors corrupting the quantum information encoded in a molecular qudit is essential.
arXiv Detail & Related papers (2021-03-16T19:21:42Z) - Deterministic correction of qubit loss [48.43720700248091]
Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors.
We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
arXiv Detail & Related papers (2020-02-21T19:48:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.