Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum error correction”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Quantum error correction from complexity in Brownian SYK

We study the robustness of quantum error correction in a one-parameter ensemble of codes generated by the Brownian SYK model, where the parameter quantifies the encoding complexity. The robustness of error correction by a quantum code is upper bounded by the “mutual purity” of a certain entangled state between the code subspace and environment in the isometric extension of the error channel, where the mutual purity of a density matrix ρAB is the difference $\mathcal{F}$ p ($A : B$) ≡ $\mathrm{T}$r $p^{2}_{AB}$ - $\mathrm{T}$r $p^{2}_{A}$ $\mathrm{T}$r $p^{2}_{B}$. We show that when the encoding complexity is small, the mutual purity is O(1) for the erasure of a small number of qubits (i.e., the encoding is fragile). However, this quantity decays exponentially, becoming O(1/N) for O(log N) encoding complexity. Further, at polynomial encoding complexity, the mutual purity saturates to a plateau of O(e -N ). We also find a hierarchy of complexity scales associated to a tower of subleading contributions to the mutual purity that quantitatively, but not qualitatively, adjust our error correction bound as encoding complexity increases. In the AdS/CFT context, our results suggest that any portion of the entanglement wedge of a general boundary subregion A with sufficiently high encoding complexity is robustly protected against low-rank errors acting on A with no prior access to the encoding map. From the bulk point of view, we expect such bulk degrees of freedom to be causally inaccessible from the region A despite being encoded in it.

1/N expansion↗
DOE OSTI2023

Real-time quantum error correction beyond break-even

The ambition of harnessing the quantum for computation is at odds with the fundamental phenomenon of decoherence. The purpose of quantum error correction (QEC) is to counteract the natural tendency of a complex system to decohere. This cooperative process, which requires participation of multiple quantum and classical components, creates a special type of dissipation that removes the entropy caused by the errors faster than the rate at which these errors corrupt the stored quantum information. Previous experimental attempts to engineer such a process faced an excessive generation of errors that overwhelmed the error-correcting capability of the process itself. Whether it is practically possible to utilize QEC for extending quantum coherence thus remains an open question. We answer it by demonstrating a fully stabilized and error-corrected logical qubit whose quantum coherence is significantly longer than that of all the imperfect quantum components involved in the QEC process, beating the best of them with a coherence gain of G=2.27±0.07. Here we achieve this performance by combining innovations in several domains including the fabrication of superconducting quantum circuits and model-free reinforcement learning.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Celestial Quantum Error Correction. Part II. From qudits to celestial CFT

A holographic CFT description of asymptotically flat spacetimes inherits vacuum degeneracies and IR divergences from its gravitational dual. We devise a Quantum Error Correcting (QEC) framework to encode both effects as correctable fluctuations on the CFT dual. The framework is physically motivated by embedding a chain of qudits in the so-called Klein spacetime and then taking a continuum 𝑁 → ∞ limit. At finite 𝑁 the qudit chain 1) enjoys a discrete version of celestial symmetries and 2) supports a Gottesman-Kitaev-Preskill (GKP) code. The limit results in hard states with quantized BMS hair in the celestial torus forming the logical subspace, robust under errors induced by soft radiation. Technically, the construction leverages the recently studied 𝑤 1+∞ hierarchy of soft currents and its realization from a sigma model in twistor space.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Quantum minimal surfaces from quantum error correction

We show that complementary state-specific reconstruction of logical (bulk) operators is equivalent to the existence of a quantum minimal surface prescription for physical (boundary) entropies. This significantly generalizes both sides of an equivalence previously shown by Harlow[1]; in particular, we do not require the entanglement wedge to be the same for all states in the code space. In developing this theorem, we construct an emergent bulk geometry for general quantum codes, defining ``areas'' associated to arbitrary logical subsystems, and argue that this definition is ``functionally unique.'' We also formalize a definition of bulk reconstruction that we call ``state-specific product unitary’’ reconstruction. This definition captures the quantum error correction (QEC) properties present in holographic codes and has potential independent interest as a very broad generalization of QEC; it includes most traditional versions of QEC as special cases. Our results extend to approximate codes, and even to the ``non-isometric codes'' that seem to describe the interior of a black hole at late times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

Current, near-term quantum devices have shown great progress in the last several years culminating recently with a demonstration of quantum supremacy. In the medium-term, however, quantum machines will need to transition to greater reliability through error correction, likely through promising techniques like surface codes which are well suited for near-term devices with limited qubit connectivity. We discover quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5D architecture, can efficiently implement surface codes with substantial hardware savings and performance/fidelity gains. Specifically, we virtualize logical qubits by storing them in layers of qubit memories connected to each transmon. Surprisingly, distributing each logical qubit across many memories has a minimal impact on fault tolerance and results in substantially more efficient operations. Our design permits fast transversal application of CNOT operations between logical qubits sharing the same physical address (same set of cavities) which are 6x faster than standard lattice surgery CNOTs. We develop a novel embedding which saves approximately 10x in transmons with another 2x savings from an additional optimization for compactness. Although qubit virtualization pays a 10x penalty in serialization, advantages in the transversal CNOT and in area efficiency result in fault-tolerance and performance comparable to conventional 2D transmon-only architectures. Our simulations show our system can achieve fault tolerance comparable to conventional two-dimensional grids while saving substantial hardware. Furthermore, our architecture can produce magic states at 1.22x the baseline rate given a fixed number of transmon qubits. Here, this is a critical benchmark for future fault-tolerant quantum computers as magic states are essential and machines will spend the majority of their resources continuously producing them. This architecture substantially reduces the hardware requirements for fault-tolerant quantum computing and puts within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities in total.

quantum computing↗
DOE OSTI2023

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Moonshine, superconformal symmetry, and quantum error correction

Special conformal field theories can have symmetry groups which are interesting sporadic finite simple groups. Famous examples include the Monster symmetry group of a c = 24 twodimensional conformal field theory (CFT) constructed by Frenkel, Lepowsky and Meurman, and the Conway symmetry group of a c = 12 CFT explored in detail by Duncan and Mack-Crane. The Mathieu moonshine connection between the K3 elliptic genus and the Mathieu group M24 has led to the study of K3 sigma models with large symmetry groups. A particular K3 CFT with a maximal symmetry group preserving (4, 4) superconformal symmetry was studied in beautiful work by Gaberdiel, Taormina, Volpato, and Wendland [41]. The present paper shows that in both the GTVW and c = 12 theories the construction of superconformal generators can be understood via the theory of quantum error correcting codes. The automorphism groups of these codes lift to symmetry groups in the CFT preserving the superconformal generators. In the case of the N = 1 supercurrent of the GTVW model our result, combined with a result of T. Johnson-Freyd implies the symmetry group is the maximal subgroup of M24 known as the sextet group. (The sextet group is also known as the holomorph of the hexacode.) Building on [41] the Ramond-Ramond sector of the GTVW model is related to the Miracle Octad Generator which in turn leads to a role for the Golay code as a group of symmetries of RR states. Moreover, (4, 1) superconformal symmetry suffices to define and decompose the elliptic genus of a K3 sigma model into characters of the N = 4 superconformal algebra. The symmetry group preserving (4, 1) is larger than that preserving (4, 4).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Concatenated dual displacement code for continuous-variable quantum error correction

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors. However, when the displacement magnitude becomes large, inevitable lattice-crossing errors arise beyond the correctable range of the GKP state. To address this issue, we concatenate the Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Contrary to conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against displacement errors at different scales: The inner GKP layer employs non-Gaussian resources to suppress continuous Gaussian noise and reduce residual variance, while the outer analog Steane code corrects discrete lattice-crossing events that exceed the GKP correctable range. It is precisely this separation of error-mitigation roles that enables CV error correction. In contrast to prior work on concatenating GKP and repetition codes to establish error correction for discrete qubit/qudit encoding, we provide correction in the continuous encoding space. Analytical studies show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors acting on all qumodes by up to 50%, while enabling unbiased correction of lattice-crossing errors with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture still provides Gaussian-error suppression and lattice-crossing correction. Moreover, the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides insight into the design of concatenated CV error-correcting architectures.

quantum error correction↗
DOE OSTI2024

Quantum Information Encoding and Decoding for Quantum Sensi

This two-year theory project focused on theoretical investigations of novel paradigms for quantum sensing, building on information encoding and techniques from quantum error correction, quantum computing and other quantum information domains. The outcomes facilitate quantum information technology development, especially at the interface of quantum computing and quantum sensing. The results of the project show new use cases and new paradigms for quantum sensing beyond what has so far been considered. One outcome shows how quantum sensing opens new opportunities for fundamental physics such as the capability of single graviton detection. Another outcome reveals a new application of NISQ quantum computers with error correction for metrology, building on recent advances in practical quantum error correction implementation. The third outcome of the project creates new paradigms of back-action-evading sensing inspired by collective quantum information encoding, which achieves quantum sensing beyond the quantum limit without the use of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRSDate not supplied

A NASA Perspective on Quantum AI, Error Correction, and Beyond

Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum computing hardware has advanced rapidly, from tiny laboratory experiments to quantum chips that can outperform even the largest supercomputers on specialized computational tasks, these noisy-intermediate scale quantum (NISQ) processors are still too small and non-robust to be directly useful for any real-world applications. We discuss the prospects for quantum computing and AI, highlighting advances in algorithms, both near- and longer-term. Quantum error correction is critical to the realization of any such vision. The talk with touch on some recent exciting advanced in quantum error correction, particularly in dynamical codes. The talk will conclude with an example of how the combination of quantum computing and artificial intelligence can help probe fundamental aspect of quantum physics.

quantum optimization algorithms and sampling↗
DOE OSTI2020

Digital-analog quantum computation

Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. Here, we construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and M-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

97 MATHEMATICS AND COMPUTING↗