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 163 records · Page 9

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗

YBCO-on-Kapton: Material for High-Density Quan-tum Computer Interconnects with Ultra-Low Thermal Conductance

Development of practical quantum computers would require 1000's of qubits and equally large number of read-outs, bias and drive lines. New materials that combine low passive loss and good RF properties are needed. In this study we report performance of signal interconnects comprised of high-temperature YBCO films that are exfoliated from a metal substrate and transferred to a E-Kapton tape. The technology offers low-loss transition be-tween 60 K to sub-mK environments and interfacing with off-shelf flexible silicon electronics. We demonstrate < 1 dB/m at-tenuation at 6 GHz at 77 K. The microstrip assemblies demon-strated no degradation upon multiple cycles to liquid Nitrogen and conduction cooling down to 18 K. We discuss designs of a practical high-density signal cable with passive heat load well below 1 μW per line. The YBCO-on-Kapton technology offers a practical pathway to large error-corrected quantum computing systems.

47 OTHER INSTRUMENTATION↗

Topological order and entanglement dynamics in the measurement-only XZZX quantum code

We examine the dynamics of a ( 1 + 1 ) -dimensional measurement-only circuit defined by the stabilizers of the [[5,1,3]] quantum error correcting code interrupted by single-qubit Pauli measurements. The code corrects arbitrary single-qubit errors and it stabilizes an area law entangled state with a D 2 = Z 2 × Z 2 symmetry protected topological (SPT) order, as well as a symmetry breaking (SB) order from a twofold bulk degeneracy. The Pauli measurements break the topological order and induce a phase transition into a trivial area law phase. Allowing more than one type of Pauli measurement increases the measurement-induced frustration and the SPT and SB order can be broken either simultaneously or separately at nonzero measurement rate. This yields a rich phase diagram and unanticipated critical behavior at the phase transitions. Although the correlation length exponent ν = 4 3 and the dynamical critical exponent z = 1 are consistent with bond percolation, the prefactor of the logarithmic entanglement growth may take noninteger multiples of the percolation value. Remarkably, we identify a robust transient scaling regime for the purification dynamics of L qubits. It reveals a modified dynamical critical exponent z * ≠ z , which is observable up to times t ~ L z * and is reminiscent of the relaxation of critical systems into a prethermal state.

36 MATERIALS SCIENCE↗

Relational bulk reconstruction from modular flow

Abstract The entanglement wedge reconstruction paradigm in AdS/CFT states that for a bulk qudit within the entanglement wedge of a boundary subregion$$ \overline{A} $$ A ¯ , operators acting on the bulk qudit can be reconstructed as CFT operators on$$ \overline{A} $$ A ¯ . This naturally fits within the framework of quantum error correction, with the CFT states containing the bulk qudit forming a code protected against the erasure of the boundary subregionA. In this paper, we set up and study a framework for relational bulk reconstruction in holography: given two code subspaces both protected against erasure of the boundary regionA, the goal is to relate the operator reconstructions between the two spaces. To accomplish this, we assume that the two code subspaces are smoothly connected by a one-parameter family of codes all protected against the erasure ofA, and that the maximally-entangled states on these codes are all full-rank. We argue that such code subspaces can naturally be constructed in holography in a “measurement-based” setting. In this setting, we derive a flow equation for the operator reconstruction of a fixed code subspace operator using modular theory which can, in principle, be integrated to relate the reconstructed operators all along the flow. We observe a striking resemblance between our formulas for relational bulk reconstruction and the infinite-time limit of Connes cocycle flow, and take some steps towards making this connection more rigorous. We also provide alternative derivations of our reconstruction formulas in terms of a canonical reconstruction map we call the modular reflection operator.

Physics↗

The hybrid topological longitudinal transmon qubit

We introduce a new hybrid qubit consisting of a Majorana qubit interacting with a transmon longitudinally coupled to a resonator. To do so, we equip the longitudinal transmon qubit with topological quasiparticles, supported by an array of heterostructure nanowires, and derive charge- and phase-based interactions between the Majorana qubit and the resonator and transmon degrees of freedom. Inspecting the charge coupling, we demonstrate that the Majorana self-charging can be eliminated by a judicious choice of charge offset, thereby maintaining the Majorana degeneracy regardless of the quasiparticles spatial arrangement and parity configuration. We perform analytic and numerical calculations to derive the effective qubit-qubit interaction elements and discuss their potential utility for state readout and quantum error correction. Further, we find that select interactions depend strongly on the overall superconducting parity, which may provide a direct mechanism to characterize deleterious quasiparticle poisoning processes.

36 MATERIALS SCIENCE↗

Cosmic axions revealed via amplified modulation of the ellipticity of a laser

We propose a new axion dark matter detection strategy that employs optical readout of laser beam ellipticity modulations caused by axion-induced electric fields in a microwave cavity, using electro-optic (EO) crystals, enhanced by externally injected radio-frequency (rf) power. Building upon the variance-based probing method [Phys. Rev. D 107, 103005 (2023).], we extend this concept to the optical domain: A weak probe laser interacts with an EO crystal coupled to the resonant microwave cavity field at cryogenic temperatures, and the axion-induced electric field is revealed through induced ellipticity. The injected rf signal coherently interferes with that of the axion field, amplifying the optical response and significantly improving sensitivity. While our EO-based method employs a Fabry-Pérot resonator, we do not require Michelson interferometers. Our method, hence, enables compact, high-frequency axion searches, across the 0.5–50 GHz range. Operating at cryogenic temperatures not only suppresses thermal backgrounds, but, critically, allows the probing method to mitigate the quantum noise. This approach offers a scalable path forward for axion detection over the ∼(few−200) μ⁢eV mass range—covering the preferred parameter space for the postinflationary Peccei-Quinn axion dark matter—using compact, tunable systems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Achievable Rates for Concatenated Square Gottesman-Kitaev-Preskill Codes

The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure-loss channels, which establishes theoretical foundations for its optimality. However, such optimal rates are only known to be achieved at a discrete set of noise strengths with the current self-dual symplectic lattice construction. In this work, we develop a new coding strategy using concatenated continuous variable-discrete variable encodings to go beyond past results and establish GKP’s optimal rate over all noise strengths. In particular, for displacement noise, the rate is obtained through a constructive approach by concatenating GKP codes with a quantum polar code and analog decoding. For a pure-loss channel, we prove the existence of capacity-achieving GKP codes through a random coding approach. These results highlight the capability of concatenation-based GKP codes and provides new methods for constructing good GKP lattices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-Density Parity-Check Stabilizer Codes as Gapped Quantum Phases: Stability under Graph-Local Perturbations

We generalize the proof of stability of topological order, due to Bravyi, Hastings, and Michalakis, to stabilizer Hamiltonians corresponding to low-density parity-check (LDPC) codes without the restriction of geometric locality in Euclidean space. We consider Hamiltonians 𝐻 0 defined by ⟦𝑁,𝐾,𝑑⟧ LDPC codes, which obey certain topological quantum order conditions: (i) code distance 𝑑 ≥ 𝑐⁢log (𝑁), implying local indistinguishability of ground states, and (ii) a mild condition on local and global compatibility of ground states—these include good quantum LDPC codes and the toric code on a hyperbolic lattice, among others. We consider stability under weak perturbations that are quasilocal on the interaction graph defined by 𝐻 0 and that can be represented as sums of bounded-norm terms. As long as the local perturbation strength is smaller than a finite constant, we show that the perturbed Hamiltonian has well-defined spectral bands originating from the 𝑂⁡(1) smallest eigenvalues of 𝐻 0 . The band originating from the smallest eigenvalue has 2 𝐾 states, is separated from the rest of the spectrum by a finite energy gap, and has exponentially narrow bandwidth 𝛿 =𝐶⁢𝑁⁢𝑒 −Θ⁡(𝑑) , which is tighter than the best-known bounds even in the Euclidean case. We also obtain that the new ground-state subspace is related to the initial-code subspace by a quasilocal unitary, allowing one to relate their physical properties. Our proof uses an iterative procedure that performs successive rotations to eliminate non-frustration-free terms in the Hamiltonian. Our results extend to quantum Hamiltonians built from classical LDPC codes, which give rise to stable symmetry-breaking phases. These results show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting, initiating a systematic study of such phases of matter.

mathematical physics↗

Structure of the Majorana Clifford group

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this study, we study their analogs for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field 𝔽 2 , and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

Computational complexity↗

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗

Fracton models from product codes

We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the resulting quantum product codes. Depending on the properties of the input codes, product codes can realize either Type-I or Type-II fracton models, in both nonlocal and local constructions. For the nonlocal case, we show that a recently proposed model of lineons on nonlocal graphs can be obtained as a hypergraph product code. Interestingly, constrained mobility in this model arises only from energy barriers associated with the graph. For the local case, we introduce a novel type of classical LDPC code defined on a planar aperiodic tiling. By considering the specific example of the pinwheel tiling, we demonstrate the systematic construction of local Type-I and Type-II fracton models as product codes. Our work establishes product codes as a natural setting for exploring fracton order.

Fractons↗

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗

Bounding entanglement entropy with Clifford double cosets

Following on our previous work studying the orbits of quantum states under Clifford circuits via reachability graphs, we introduce contracted graphs whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as 𝑊 states and Dicke states, discussing how the diameter of a state's contracted graph constrains the entropic diversity of its two-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any 𝑛-qubit Clifford circuit, for any quantum state. Here, we speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extending quantum probabilistic error cancellation by noise scaling

Here, we propose a general framework for quantum error mitigation that combines and generalizes two techniques: probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE). Similar to PEC, the proposed method represents ideal operations as linear combinations of noisy operations that are implementable on hardware. However, instead of assuming a fixed level of hardware noise, we extend the set of implementable operations by noise scaling. By construction, this method encompasses both PEC and ZNE as particular cases and allows us to investigate a larger set of hybrid techniques. For example, gate extrapolation can be used to implement PEC without requiring knowledge of the device’s noise model, e.g., avoiding gate-set tomography. Alternatively, probabilistic error reduction can be used to estimate expectation values at intermediate virtual noise strengths (below the hardware level), leading to partially mitigated results at a lower sampling cost. Moreover, multiple results obtained with different noise-reduction factors can be further postprocessed with ZNE to better approximate the zero-noise limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magic state distillation from entangled states

We report that magic can be distributed non-locally in many-body entangled states, such as the low energy states of condensed matter systems. Using the Bravyi-Kitaev magic state distillation protocol, we find that non-local magic is distillable and can improve the distillation outcome. We analyze a few explicit examples and show that spin squeezing can be used to convert non-distillable states into distillable ones. Our analysis also suggests that the conventional product input states assumed by magic distillation protocols are extremely atypical among general states with distillable magic. It further justifies the need for studying a diverse range of entangled inputs that yield magic states with high probability.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum state preparation by adiabatic evolution with custom gates

Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These implementation times can be significantly reduced by realizing these circuits with custom gates. Using classical computing, we model the output of a realistic two-qubit processor implementing the adiabatic evolution of a two-spin system by means of custom gates. This modeled output is then compared with the results of quantum simulations solving the same problem on IBM Quantum (IBMQ) systems. Additionally, when used to emulate the behavior of the IBMQ quantum circuit, our realistic model yields state fidelities ranging from 65% to 85%, similar to the actual performance of a diverse set of IBMQ devices. When we reduced the implementation time by using custom gates, however, the loss of fidelity was reduced by at least a factor of 4, allowing us to accurately extract the energy of the target state. This improvement is enough to render adiabatic evolution useful for quantum state preparation for small systems or as a preconditioner for other state preparation methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗