Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum computing”

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 1,261 records · Page 70

Signatures of chiral superconductivity in rhombohedral graphene

Chiral superconductors are unconventional superconducting states that break time-reversal symmetry spontaneously and typically feature Cooper pairing at non-zero angular momentum. Such states may host Majorana fermions and provide an important platform for topological physics research and fault-tolerant quantum computing. Despite intensive search and prolonged studies of several candidate systems, chiral superconductivity has remained elusive so far. Here we report the discovery of robust unconventional superconductivity in rhombohedral tetralayer and pentalayer graphene without moiré superlattice effects. We observed two superconducting states in the gate-induced flat conduction bands with T c up to 300 mK and charge density n e down to 2.4 ×10 11 cm −2 in five devices. Spontaneous time-reversal-symmetry breaking (TRSB) owing to orbital motion of the electron is found and several observations indicate the chiral nature of these superconducting states, including: (1) in the superconducting state, R xx shows magnetic hysteresis in varying out-of-plane magnetic field B ⊥ —absent from all other superconductors; (2) the superconducting states are robust against in-plane magnetic field and are developed within a spin-polarized and valley-polarized quarter-metal (QM) phase; (3) the normal states show anomalous Hall signals at zero magnetic field and magnetic hysteresis. Here, we also observed a critical B ⊥ of 1.4 T, higher than any graphene superconductivity, which indicates a strong-coupling superconductivity close to the Bardeen–Cooper–Schrieffer (BCS)–Bose–Einstein condensate (BEC) crossover. Our observations establish a pure carbon material for the study of topological superconductivity, with the promise to explore Majorana modes and topological quantum computing.

36 MATERIALS SCIENCE↗

Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories

We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve these improvements through two optimizations. First, we consider a finite volume approach for estimating the elements of the S-matrix. This approach is appropriate in general for 1+1D and for certain low-energy elastic collisions in higher dimensions. Second, we implement our approach using a series of different fault-tolerant simulation algorithms for Hamiltonians formulated both in the field occupation basis and field amplitude basis. Our algorithms are based on either second-order Trotterization or qubitization. The cost of Trotterization in occupation basis scales as O ( λ N 7 | Ω | 3 / ( M 5 / 2 ϵ 3 / 2 ) ) where λ is the coupling strength, N is the occupation cutoff, | Ω | is the volume of the spatial lattice, M is the mass of the particles and ϵ is the uncertainty in the energy calculation used for the S -matrix determination. Qubitization in the field basis scales as O ( | Ω | 2 ( k 2 Λ + k M 2 ) / ϵ ) , where k is the cutoff in the field and Λ is a scaled coupling constant. We find in both cases that the bounds suggest physically meaningful simulations can be performed using on the order of 4 × 10 6 physical qubits and 10 12 T -gates which corresponds to roughly one day on a superconducting quantum computer with surface code and a cycle time of 100 ns. This places the simulation of scalar field theory within striking distance of the gate counts for the best available chemistry simulation results.

Hardy, Andrew [Toronto U.] (ORCID:0000000235817382↗

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O ( n ) to O (√ n ). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06% for [[18,4,4]] BB code, 2.6× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

Liu, Kun [Yale Univ., New Haven, CT (United States↗

Nearly Optimal Lattice Simulation by Product Formulas

We consider simulating an n-qubit Hamiltonian with nearest-neighbor interactions evolving for time t on a quantum computer. We show that this simulation has gate complexity (nt)1+o(1) using product formulas, a straightforward approach that has been demonstrated by several experimental groups. While it is reasonable to expect this complexity—in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill—we are not aware of a straightforward proof. Furthermore, our approach is based on an analysis of the local error structure of product formulas, as introduced by Descombes and Thalhammer and significantly simplified here. We prove error bounds for canonical product formulas, which include well-known constructions such as the Lie-Trotter-Suzuki formulas. We also develop a local error representation for time-dependent Hamiltonian simulation, and we discuss generalizations to periodic boundary conditions, constant-range interactions, and higher dimensions. Combined with a previous lower bound, our result implies that product formulas can simulate lattice Hamiltonians with nearly optimal gate complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perfect quantum state transfer on diamond fractal graphs

In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. Here, we use methods from fractal analysis and probability to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer and which have a wide range of different Hausdorff and spectral dimensions. The resulting systems are spin networks combining Dyson hierarchical model structure with transverse permutation symmetries of varying order.

97 MATHEMATICS AND COMPUTING↗

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗

Asymptotic errors in adiabatic evolution

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved Hamiltonian. Understanding corrections to the adiabatic result that arise when the evolution of the Hamiltonian is slow—but not arbitrarily slow—has become increasingly important, especially since adiabatic evolution has been proposed as a method of state preparation in quantum computing. Here, this paper identifies two regimes, an adiabatic regime in which corrections are generically small and can depend on details of the evolution throughout the path, and a hyperadiabatic regime in which the error is given by a form similar to an asymptotic expansion in the inverse of the evolution time with the coefficients depending principally on the behavior at the endpoints. However, the error in this hyperadiabatic regime is neither given by a true asymptotic series nor solely dependent on the endpoints: the coefficients combine the contributions from both endpoints, with relative phase factors that depend on the average spectral gaps along the trajectory, multiplied by the evolution time. The central result of this paper is to identify a quantity, referred to as the typical error, which is obtained by appropriately averaging the error over evolution times that are small compared to the evolution time itself. This typical error is characterized by an asymptotic series and depends solely on the endpoints of the evolution, remaining independent of the details of the intermediate evolution.

adiabatic approximation↗

Elucidating the local atomic and electronic structure of amorphous oxidized superconducting niobium films

Qubits made from superconducting materials are a mature platform for quantum information science application, such as quantum computing. However, material-based losses are now a limiting factor in reaching the coherence times needed for applications. In particular, knowledge of the atomistic structure and properties of the circuit materials is needed to identify, understand, and mitigate material-based decoherence channels. Here, we characterize the atomic structure of the native oxide film formed on Nb resonators by comparing fluctuation electron microscopy experiments to density functional theory calculations, finding that an amorphous layer is consistent with an Nb 2 O 5 stoichiometry. Comparing x-ray absorption measurements at the Oxygen K edge with first-principles calculations, we find evidence of d-type magnetic impurities in our sample, known to cause impedance in proximal superconductors. This work identifies the structural and chemical composition of the oxide layer grown on Nb superconductors and shows that soft x-ray absorption can fingerprint magnetic impurities in these superconducting systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Faster spectral density calculation using energy moments

Abstract Accurate predictions of inclusive scattering cross sections in the linear response regime require efficient and controllable methods to calculate the spectral density in a strongly-correlated many-body system. In this work we reformulate the recently proposed Gaussian Integral Transform technique in terms of Fourier moments of the system Hamiltonian which can be computed efficiently on a quantum computer. One of the main advantages of this framework is that it allows for an important reduction of the computational cost by exploiting previous knowledge about the energy moments of the spectral density. For a simple model of medium mass nucleus like $$^{40}$$ 40 Ca and target energy resolution of 1 MeV we find an expected speed-up of $$\approx 125$$ ≈ 125 times for the calculation of the giant dipole response and of $$\approx 50$$ ≈ 50 times for the simulation of quasi-elastic electron scattering at typical momentum transfers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A 1-km photonic link connecting superconducting circuits in two dilution refrigerators

Superconducting quantum processors are a leading platform for implementing practical quantum computation algorithms. Although superconducting quantum processors with hundreds of qubits have been demonstrated, their further scale-up is constrained by the physical size and cooling power of dilution refrigerators. This constraint can be overcome by constructing a quantum network to interconnect qubits hosted in different refrigerators, which requires microwave-to-optical transducers to enable low-loss signal transmission over long distances. Although various designs and demonstrations have achieved high-efficiency and low-added-noise transducers, a coherent photonic link between separate refrigerators has not yet been realized. Here, in this work, we experimentally demonstrate coherent signal transfer between two superconducting circuits housed in separate dilution refrigerators, enabled by a pair of frequency-matched aluminium nitride electro-optic transducers connected via a 1-km telecom optical fibre. The optical frequency matching between two transducers is realized by an asymmetric photonic molecule design, and an overall 80 dB improvement in transduction efficiency over commercial electro-optic modulators is achieved, paving the way towards a fully quantum-enabled link. This work provides critical design guidelines for scalable superconducting quantum networks interconnected by photonic links.

nonlinear optics↗

Conceptual study of a two-layer silicon pixel detector to tag the passage of muons from cosmic sources through quantum processors

Abstract Recent studies in quantum computing have shown that quantum error correction with large numbers of physical qubits are limited by ionizing radiation from high-energy particles. Depending on the physical setup of the quantum processor, the contribution of muons from cosmic sources can constitute a significant fraction of these interactions. As most of these muons are difficult to stop, we perform a conceptual study of a two-layer silicon pixel detector to tag their hits on a solid-state quantum processor instead. With a typical dilution refrigerator geometry model, we find that efficiencies greater than 50% are most likely to be achieved if at least one of the layers is operated at the deep-cryogenic (<1 K) flanges of the refrigerator. Following this finding, we further propose a novel research program that could allow the development of silicon pixel detectors that are fast enough to provide input to quantum error correction algorithms, can operate at deep-cryogenic temperatures, and have very low power consumption.

Instruments & Instrumentation↗

Quantum information or entanglement transfer between subsystems

The size of quantum information -- or entanglement -- transfer rates between subsystems is a generic question in problems ranging from decoherence in quantum computation and sensing, to quantum underpinnings of thermodynamics, to the behavior of quantum black holes. We investigate such rates for given couplings between subsystems, for sufficiently random subsystem evolution, and find evidence for a conjectured relation of these rates to the size of the couplings. Finally, this provides a direct connection between entanglement transfer and the microphysical couplings responsible for it.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward a Ginsparg-Wilson lattice Hamiltonian

To address quantum computation of quantities in quantum chromodynamics (QCD) for which chiral symmetry is important, it would be useful to have the Hamiltonian for a fermion satisfying the Ginsparg-Wilson (GW) equation. I work with a solution to the GW equation which is fractional linear in time derivatives. The resulting Hamiltonian is nonlocal and has ghosts, but is free of doublers and has the correct continuum limit. This construction works in general odd spatial dimensions, and I provide an explicit expression for the Hamiltonian in one spatial dimension. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Low-Frequency Correlated Charge-Noise Measurements Across Multiple Energy Transitions in a Tantalum Transmon

Transmon qubits fabricated with tantalum metal have been shown to possess energy relaxation times greater than 400 𝜇⁢s and, as such, present an attractive platform for high precision, correlated noise studies across multiple higher-energy transitions. Tracking the multilevel fluctuating qudit frequencies with a precision enabled by the high coherence of the device allows us to extract the charge offset and quasiparticle dynamics. We observe qualitatively different charge-offset behavior in the tantalum device than those measured in previous low-frequency charge-noise studies. In particular, we find the charge-offset dynamics are dominated by rare, discrete jumps between a finite number of quasistationary charge configurations, a previously unobserved charge-noise process in superconducting qubits.

3-dimensional systems↗

Millimeter-Wave Superconducting Qubit

Manipulating the electromagnetic spectrum at the single-photon level is fundamental for quantum experiments. In the visible and infrared ranges, this can be accomplished with atomic quantum emitters, and with superconducting qubits such control is extended to the microwave range (below 10 GHz). Meanwhile, the region between these two energy ranges presents an unexplored opportunity for innovation. We bridge this gap by scaling up a superconducting qubit to the millimeter-wave range (near 100 GHz). Working in this energy range greatly reduces sensitivity to thermal noise compared to microwave devices, enabling operation at significantly higher temperatures, up to 1 K. This has many advantages by removing the dependence on rare 3⁢ He for refrigeration, simplifying cryogenic systems, and providing orders-of-magnitude higher cooling power, lending the flexibility needed for novel quantum sensing and hybrid experiments. Using low-loss niobium trilayer junctions, we realize a qubit at 72 GHz cooled to 0.87 K using only 4 ⁢He. We perform Rabi oscillations to establish control over the qubit state, and measure relaxation and dephasing times of 15.8 and 17.4 ns, respectively. This demonstration of a millimeter-wave quantum emitter offers exciting prospects for enhanced sensitivity thresholds in high-frequency photon detection, provides new options for quantum transduction and for scaling up and speeding up quantum computing, enables integration of quantum systems where 3 ⁢He refrigeration units are impractical, and, importantly, paves the way for quantum experiments exploring a novel energy range.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗