Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum architecture”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Coherence-mediated quantum thermometry in a hybrid circuit quantum electrodynamics architecture

Quantum thermometry plays a critical role in the development of low-temperature sensors and quantum information platforms. Here, in this work, we propose and analyze a hybrid circuit quantum electrodynamics architecture in which a superconducting qubit is dispersively coupled to two distinct bosonic modes: one initialized in a weak coherent state as a phase reference and information buffer and the other coupled to a thermal environment. We show that the qubit serves as a sensitive readout of the probe mode, mapping the interplay between thermal and coherent photon-number fluctuations onto measurable dephasing. This coherence-mediated mechanism enables improved sensitivity to thermal energy fluctuations in the sub-millikelvin regime through Ramsey interferometry. We derive analytic expressions for the probe coherence envelope, compute the quantum Fisher information for temperature estimation, and demonstrate numerically that the presence of a coherent reference enhances the qubit's sensitivity to small changes in thermal photon occupancy. Our results establish a coherence-enabled approach to thermometry and provide a scalable platform for future calorimetric sensing in high-energy physics and quantum metrology.

Zhu, Shaojiang [Fermi National Accelerator Laborat↗
DOE OSTI2026

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2025

QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures

Quantum Error Correction (QEC) codes are essential for achieving fault-tolerant quantum computing (FTQC). However, their implementation faces significant challenges due to disparity between required dense qubit connectivity and sparse hardware architectures. Current approaches often either underutilize QEC circuit features or focus on manual designs tailored to specific codes and architectures, limiting their capability and generality. In response, we introduce QECC-Synth, an automated compiler for QEC code implementation that addresses these challenges. We leverage the ancilla bridge technique tailored to the requirements of QEC circuits and introduces a systematic classification of its design space flexibilities. We then formalize this problem using the MaxSAT framework to optimize these flexibilities. Evaluation shows that our method significantly outperforms existing methods while demonstrating broader applicability across diverse QEC codes and hardware architectures.

Yin, Keyi [University of California, San Diego]↗
DOE OSTI2026

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↗
DOE OSTI2026

Multi-Agent Control Planes for Quantum Networks: A Scalable Architecture for Autonomous Quantum Internet Management

Quantum networks are expected to enable distributed quantum computing, secure communication, and global entanglement distribution. However, operating such networks presents significant challenges, including stochastic quantum processes, fragile entanglement resources, dynamic topology, and cross-layer control requirements. Current quantum network control architectures largely rely on centralized or hierarchical controllers inspired by classical software-defined networking (SDN). While effective for small testbeds, these approaches face scalability, latency, and reliability limitations as quantum networks grow. This paper proposes a multi-agent control plane architecture for quantum networks. In this design, intelligent software agents operate at quantum nodes, repeaters, and orchestration layers, collectively managing entanglement generation, routing, purification, and scheduling. The distributed intelligence of the agent system allows the network to adapt dynamically to quantum hardware variability and environmental noise. We argue that multi-agent systems provide significant advantages over centralized control approaches, including scalability, resilience, local autonomy, and real-time adaptation. The paper discusses architectural design principles, agent coordination mechanisms, and research challenges in deploying multi-agent control planes for the emerging quantum Internet.

Alnajjar, Anees [ORNL] (ORCID:0000000237101601)↗
DOE OSTI2025

Building a quantum computing architecture using 3D superconducting cavities

Quantum computers promise advantages over classical machines for solving certain complex problems, but building processors that truly deliver this advantage remains a central challenge, particularly due to limited coherence times. Three-dimensional superconducting radio-frequency (SRF) cavities offer an attractive platform due to their exceptionally long lifetimes. However, since these harmonic systems require nonlinear elements, such as transmons, for control, additional losses are often introduced. In this talk, I will present a multimode quantum system based on an elliptical SRF cavity hosting two cavity modes weakly coupled to an ancillary transmon circuit. This architecture is carefully engineered to preserve coherence while enabling efficient control. By optimizing the design to mitigate transmon-induced decoherence, we realize single-photon lifetimes of 20.6 ms and 15.6 ms in the two modes, with pure dephasing times exceeding 40 ms. Using sideband interactions and error-resilient protocols, such as measurement-based correction and post-selection, we demonstrate high-fidelity state control, including preparation of Fock states up to N=20 with fidelities above 95% (to our knowledge, the highest reported to date), as well as high-fidelity two-mode entanglement. These results highlight 3D SRF cavities as a robust foundation for qudit-based quantum information processing, harnessing the large Hilbert space of cavity modes. I will conclude by outlining strategies to further enhance coherence in both cavities and ancilla qubits, and discuss pathways toward scaling this architecture into a larger quantum computing platform.

Roy, Tanay [Fermilab]↗
DOE OSTI2025

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↗
NASA NTRS2015

Exploration Architecture with Quantum Inertial Gravimetry and In-Situ ChipSat Sensors

The Dual Exploration Architecture is a mission concept that combines remote sensing and in-situ observations into a single mission to answer planetary science questions that can only be answered with both types of data. Adoption of dual exploration architectures may short circuit the long, slow cycle of missions to inaccessible bodies by eliminating the need for separate precursor and follow-up missions. Additionally, the dual architecture possesses inherent flexibility that enables the design of adaptive, event-driven missions that are very different from traditional, largely pre-planned missions. Five key observations about the state and trends of planetary science exploration lead us to the dual architecture: increasing complexity of observations; scarcity of future mission opportunities; desire to capture transitory events; continued miniaturization of spacecraft components; and the Mars exploration cycle. Our goal in this study is to explore missions that can only happen using the dual architecture concept and find technology development needs that must be filled for those missions to compete. A survey of historical and current missions finds that opportunities for exploration are becoming less frequent, causing the flexibility and dual-nature elements of each mission to become more common. The dual exploration architecture takes these trends to their far conclusion, attempting to eliminate precursor and follow-up missions while still returning more scientific payoff. A study of the future of planetary science goals through the decadal survey reveals broad applicability of dual missions to solve mysteries that cannot be answered with a traditional mission architecture. These missions fall into three broad classes: choosing a local target from a global survey; dynamic/reactive science; and global in-situ networks. Two example missions of each class are notionally described. A deeper look at these dual architecture classes reveals four technology development needs that must be addressed for wide adoption of dual missions: passive landers; guided atmospheric probes; robust sensing packages; and small, precise orbital instruments. This study pursues a specific focus on two examples of such enabling technologies: the ChipSat and cold atom gravimetry. The ChipSat is a fully functional spacecraft-on-a-chip system that has broad versatility in the dual architecture mission space. Initial studies show that ChipSats could survive as passive impactor landers on bodies up to the size of Europa. Furthermore, COTS (Commercial Off-The-Shelf) components could provide an in-situ sensor suite that readily answers a number of pressing planetary science questions. Cold atom gravimetry uses inertial sensors based on light-pulse atom interferometry in a small form factor to map the gravity field of a body to precision equaling what would normally require two full spacecraft to achieve. The cold atom gravimeter provides an example of how advanced remote sensing capability can enable dual missions by providing greater returns in a significantly smaller package. Using the above two technologies, we study an example dual-architecture mission to both characterize and sample the subsurface oceans at Europa. The greatest scientific return in terms of detecting extraterrestrial life is in those regions where Europa’s ice crust is thin. The identification of regions with thin ice should therefore precede the selection of surface targets and dispatch of probes to those targets. This two-step process, if accomplished by separate flagship-scale missions, might take decades. As a result, a combined mission to both identify thin areas of Europa’s ice and follow up with surface observations at those regions is a good candidate for the dual-exploration architecture. This example mission consists of an orbiter spacecraft carrying a cold atom gravimeter capable of sensing or inferring the ice thickness on regional to local scales, along with a number of ChipSat probes capable of landing on the moon. The small size and weight of the ChipSats allows large numbers of them to be carried, ensuring that enough can be dropped to ensure survival of a minimum number of probes and potentially allowing for the in-situ sampling of multiple locations on the moon. The example missions and Europa case study show that amazing scientific return can obtained from dual-exploration architecture missions with a single launch by breaking the long timescales of planetary exploration and providing the flexibility to capturing transitory events and collect data across the local, regional, and global scales.

Exploration↗
DOE OSTI2024

Progress on 3D SRF-based architecture for quantum computing

Superconducting radio frequency (SRF) cavities are excellent choices for storing and manipulating quantum information as quantum d-level systems (qudits) due to their exceptionally long lifetimes and large accessible Hilbert spaces. A common strategy to manipulate the states is to use a nonlinear element like a transmon. We present preliminary experimental results obtained with cavity displacements and selective number dependent arbitrary phase gates for universal qudit control, and its application towards High-energy physics (HEP) simulations and beyond. We discuss the advantages and challenges associated with building a 3D SRF architecture while maintaining long cavity lifetimes in the presence of lossy components. We show how the system coherence properties can be preserved by carefully engineering to minimize the participation of the long coherence modes in different loss channels, while ensuring sufficient quantum controllability. We further discuss the path towards building multi-qudit systems.

Romanenko, Alexander↗
NASA NTRS1997

Novel Highly Parallel and Systolic Architectures Using Quantum Dot-Based Hardware

VLSI technology has made possible the integration of massive number of components (processors, memory, etc.) into a single chip. In VLSI design, memory and processing power are relatively cheap and the main emphasis of the design is on reducing the overall interconnection complexity since data routing costs dominate the power, time, and area required to implement a computation. Communication is costly because wires occupy the most space on a circuit and it can also degrade clock time. In fact, much of the complexity (and hence the cost) of VLSI design results from minimization of data routing. The main difficulty in VLSI routing is due to the fact that crossing of the lines carrying data, instruction, control, etc. is not possible in a plane. Thus, in order to meet this constraint, the VLSI design aims at keeping the architecture highly regular with local and short interconnection. As a result, while the high level of integration has opened the way for massively parallel computation, practical and full exploitation of such a capability in many applications of interest has been hindered by the constraints on interconnection pattern. More precisely. the use of only localized communication significantly simplifies the design of interconnection architecture but at the expense of somewhat restricted class of applications. For example, there are currently commercially available products integrating; hundreds of simple processor elements within a single chip. However, the lack of adequate interconnection pattern among these processing elements make them inefficient for exploiting a large degree of parallelism in many applications.

Fijany, Amir↗
DOE OSTI2025

A fault-tolerant neutral-atom architecture for universal quantum computation

Quantum error correction (QEC) is essential for the realization of large-scale quantum computers. However, owing to the complexity of operating on the encoded ‘logical’ qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we use reconfigurable arrays of up to 448 neutral atoms to implement the key elements of a universal, fault-tolerant quantum processing architecture and experimentally explore their underlying working mechanisms. We first use surface codes to study how repeated QEC suppresses errors, demonstrating 2.14(13)x below-threshold performance in a four-round characterization circuit by leveraging atom loss detection and machine learning decoding. We then investigate logical entanglement using transversal gates and lattice surgery and extend it to universal logic through transversal teleportation with three-dimensional [[15,1,3]] codes, enabling arbitrary-angle synthesis with polylogarithmic overhead. Finally, we develop mid-circuit qubit reuse16, increasing experimental cycle rates by two orders of magnitude and enabling deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations with [[7,1,3]] and high-rate [[16,6,4]] codes while maintaining constant internal entropy. Our experiments show key principles for efficient architecture design, involving the interplay between quantum logic and entropy removal, judiciously using physical entanglement in logic gates and magic state generation, and leveraging teleportations for universality and physical qubit reset. These results establish foundations for scalable, universal error-corrected processing and its practical implementation in neutral atom systems.

atomic and molecular physics↗
DOE OSTI2025

Unraveling spin entanglement using quantum gates with scanning tunneling microscopy-driven electron spin resonance

Quantum entanglement is a fundamental resource for quantum information processing, and its controlled generation and detection remain key challenges in scalable quantum architectures. Here, we numerically demonstrate the deterministic generation of entangled spin states in a solid-state platform by implementing quantum gates via electron spin resonance combined with scanning tunneling microscopy (ESR-STM). Using two titanium atoms on a MgO/Ag(100) substrate as a model, we construct a two-qubit system whose dynamics are coherently manipulated through tailored microwave pulse sequences. We generate Bell states by implementing a Hadamard gate followed by a controlled-NOT gate, and evaluate its fidelity and concurrence using the quantum-master equation-based code TimeESR. Our results demonstrate that ESR-STM can create entangled states with significant fidelity. This study paves the way for the realization of atom-based quantum circuits and highlights ESR-STM as a powerful tool for probing and engineering entangled states on surfaces.

Switzer, Eric D. [Donostia International Physics C↗
DOE OSTI2026

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗