Engineering Papers⌕ Search

SEARCH · Engineering Papers

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,783 records · Page 99
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations. Published by the American Physical Society 2025

Liu, Zhenning (ORCID:000000020794419X)↗
DOE OSTI2020

Extending XACC for Quantum Optimal Control

Quantum computing vendors are beginning to open up application programming interfaces for direct pulse-level quantum control. With this, programmers can begin to describe quantum kernels of execution via sequences of arbitrary pulse shapes. This opens new avenues of research and development with regards to smart quantum compilation routines that enable direct translation of higher-level digital assembly representations to these native pulse instructions. In this work, we present an extension to the XACC system-level quantum-classical software framework that directly enables this compilation lowering phase via user-specified quantum optimal control techniques. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences that are optimal with respect to the backend system dynamics. Our work is modular and extensible, enabling third party optimal control techniques and strategies in both C++ and Python. We demonstrate this extension with familiar gradient-based methods like gradient ascent pulse engineering (GRAPE), gradient optimization of analytic controls (GOAT), and Krotov's method. Our work serves as a foundational component of future quantum-classical compiler designs that lower high-level programmatic representations to low-level machine instructions.

Nguyen, Thien↗
DOE OSTI2021

Growth of topological insulator Bi 2 Se 3 particles on GaAs via droplet epitaxy

The discovery of topological insulators (TIs) and their unique electronic properties has motivated research into a variety of applications, including quantum computing. It has been proposed that TI surface states will be energetically discretized in a quantum dot nanoparticle. These discretized states could then be used as basis states for a qubit that is more resistant to decoherence. In this work, prototypical TI Bi2Se3 nanoparticles are grown on GaAs (001) using the droplet epitaxy technique, and we demonstrate the control of nanoparticle height, area, and density by changing the duration of bismuth deposition and substrate temperature. Within the growth window studied, nanoparticles ranged from 5 to 15 nm in height with an 8–18 nm equivalent circular radius, and the density could be relatively well controlled by changing the substrate temperature and bismuth deposition time.

Materials Science↗
DOE OSTI2023

Theory and Simulations of Emergent Geometry in Quantum Gravity (Final Technical Report)

This is the final technical report for the QuantISED Award to PIs Hartman, Ginsparg, and McMahon at Cornell University, outlining the goals of the research project and summarizing its main technical achievements. These include the discovery of new non-perturbative effects in quantum gravity known as replica wormholes which play an important role in the black hole information paradox, new methods to study cosmological spacetimes using the tools of holographic duality, and new experimental results on error mitigation in quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum Networks for High Energy Physics

Quantum networks of quantum objects promise to be exponentially more powerful than the objects considered independently. To live up to this promise will require the development of error mitigation and correction strategies to preserve quantum information as it is initialized, stored, transported, utilized, and measured. The quantum information could be encoded in discrete variables such as qubits, in continuous variables, or anything in-between. Quantum computational networks promise to enable simulation of physical phenomena of interest to the HEP community. Quantum sensor networks promise new measurement capability to test for new physics and improve upon existing measurements of fundamental constants. Such networks could exist at multiple scales from the nano-scale to a global-scale quantum network.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Limitations for Quantum Algorithms to Solve Turbulent and Chaotic Systems

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Simulations of subatomic many-body physics on a quantum frequency processor

Simulating complex many-body quantum phenomena is a major scientific impetus behind the development of quantum computing, and a range of technologies are being explored to address such systems. We present the results of the largest photonics-based simulation to date, applied in the context of subatomic physics. Using an all-optical quantum frequency processor, the ground-state energies of light nuclei including the triton ( 3 H), 3 He, and the alpha particle ( 4 He) are computed. Complementing these calculations and utilizing a 68-dimensional Hilbert space, our photonic simulator is used to perform subnucleon calculations of the two- and three-body forces between heavy mesons in the Schwinger model. Furthermore, this work is a first step in simulating subatomic many-body physics on quantum frequency processors—augmenting classical computations that bridge scales from quarks to nuclei.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Parallelization techniques for quantum simulation of fermionic systems

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum Kerr learning

Quantum machine learning is a rapidly evolving field of research that could facilitate important applications for quantum computing and also significantly impact data-driven sciences. In our work, based on various arguments from complexity theory and physics, we demonstrate that a single Kerr mode can provide some 'quantum enhancements' when dealing with kernel-based methods. Using kernel properties, neural tangent kernel theory, first-order perturbation theory of the Kerr non-linearity, and non-perturbative numerical simulations, we show that quantum enhancements could happen in terms of convergence time and generalization error. Furthermore, we make explicit indications on how higher-dimensional input data could be considered. Finally, we propose an experimental protocol, that we call quantum Kerr learning, based on circuit QED.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

SU(n) and Quantum SU(n) Symmetries in Physical Systems [Slides]

Presence of SU(n) or other Lie group symmetry in a physical system is its powerful, usually underutilized property. In many cases it allows for finding analytical solutions to nonlinear differential equations describing this system. Power of the method is presented on diversified examples from mathematical physics: Lie-group symmetries in finding solutions of generalized, multidimensional theory of gravity; analytical Dirac–equation solutions for description of conducting polymers; stability of qubit states in quantum computers; spatial defects in condensed matter; reconstruction of 3D object from its 2D tomographic image; significant improvement of numerical solutions stability for Euler equations. The next question after obtaining such Lie group symmetric solution is: does a generalized solution with appropriate quantum group symmetry exists for the given physical system, and if yes what is the physical meaning of the deformation parameter q introduced by such solution. In many cases it can be identified. Any SU(n) solution is by its nature singular, assuming a perfect symmetry of the physical system discussed. Such solution gives a powerful insight to theoretical physics, yet the assumption may be too demanding for experimental applications. Deformation parameter q from a quantum group symmetry allows for a continuum of solutions, more applicable to experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

High-fidelity remote entanglement of trapped atoms mediated by time-bin photons

Abstract Photonic interconnects between quantum processing nodes are likely the only way to achieve large-scale quantum computers and networks. The bottleneck in such an architecture is the interface between well-isolated quantum memories and flying photons. We establish high-fidelity entanglement between remotely separated trapped atomic qubit memories, mediated by photonic qubits stored in the timing of their pulses. Such time-bin encoding removes sensitivity to polarization errors, enables long-distance quantum communication, and is extensible to quantum memories with more than two states. Using a measurement-based error detection process and suppressing a fundamental source of error due to atomic recoil, we achieve an entanglement fidelity of 97% and show that fundamental limits due to atomic recoil still allow fidelities in excess of 99.9%.

Science & Technology - Other Topics↗
DOE OSTI2021

Correlated charge noise and relaxation errors in superconducting qubits

In This report, the central challenge in building a quantum computer is error correction. Unlike classical bits, which are susceptible to only one type of error, quantum bits (“qubits”) are susceptible to two types of error, corresponding to flips of the qubit state about the X- and Z-directions. While the Heisenberg Uncertainty Principle precludes simultaneous monitoring of X- and Z-flips on a single qubit, it is possible to encode quantum information in large arrays of entangled qubits that enable accurate monitoring of all errors in the system, provided the error rate is low. Another crucial requirement is that errors cannot be correlated. Here, we characterize a superconducting multiqubit circuit and find that charge fluctuations are highly correlated on a length scale over 600 µm; moreover, discrete charge jumps are accompanied by a strong transient suppression of qubit energy relaxation time across the millimeter-scale chip. The resulting correlated errors are explained in terms of the charging event and phonon-mediated quasiparticle poisoning associated with absorption of gamma rays and cosmic-ray muons in the qubit substrate. Robust quantum error correction will require the development of mitigation strategies to protect multiqubit arrays from correlated errors due to particle impacts.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Integrating subsystem embedding subalgebras and coupled cluster Green’s function: a theoretical foundation for quantum embedding in excitation manifold

Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Sparse non-Markovian Noise Modeling of Transmon-Based Multi-Qubit Operations

The influence of noise on quantum dynamics is one of the main factors preventing current quantum processors from performing accurate quantum computations. Sufficient noise characterization and modeling can provide key insights into the effect of noise on quantum algorithms and inform the design of targeted error protection protocols. However, constructing effective noise models that are sparse in model parameters, yet predictive can be challenging. In this work, we present an approach for effective noise modeling of multi-qubit operations on transmon-based devices. Through a comprehensive characterization of seven devices offered by the IBM Quantum Platform, we show that the model can capture and predict a wide range of single- and two-qubit behaviors, including non-Markovian effects resulting from spatiotemporally correlated noise sources. The model’s predictive power is further highlighted through multi-qubit dynamical decoupling demonstrations and an implementation of the variational quantum eigensolver. As a training proxy for the hardware, we show that the model can predict expectation values within a relative error of 0.5%; this is a sevenfold improvement over default hardware noise models. Through these demonstrations, we highlight key error sources in superconducting qubits and illustrate the utility of reduced noise models for predicting hardware dynamics.

open quantum systems & decoherence↗
DOE OSTI2019

Cage-Net Fracton Models

We introduce a class of gapped three-dimensional models, dubbed “cage-net fracton models,” which host immobile fracton excitations in addition to non-Abelian particles with restricted mobility. Starting from layers of two-dimensional string-net models, whose spectrum includes non-Abelian anyons, we condense extended one-dimensional “flux strings” built out of pointlike excitations. Flux-string condensation generalizes the concept of anyon condensation familiar from conventional topological order and allows us to establish properties of the fracton-ordered (equivalently, flux-string-condensed) phase, such as its ground-state wave function and spectrum of excitations. Through the examples of doubled-Ising and SU ( 2 ) k cage-net models, we demonstrate the existence of strictly immobile Abelian fractons and of non-Abelian particles restricted to move only along one dimension. In the doubled-Ising cage-net model, we show that these restricted-mobility non-Abelian excitations are a fundamentally three-dimensional phenomenon, as they cannot be understood as bound states among two-dimensional non-Abelian anyons and Abelian particles. We further show that the ground-state wave function of such phases can be understood as a fluctuating network of extended objects—cages—and strings, which we dub a cage-net condensate. Besides having implications for topological quantum computation in three dimensions, our work may also point the way towards more general insights into quantum phases of matter with fracton order.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Post Moore's Law Report

Moore's law is driving an information revolution, worldwide economic growth, and is a tool for national security. This report explains how dire proclamations that "Moore's law is ending" are due to a natural redefinition of the phrase, but computing remains positioned to both drive economic growth and support national security. The computer industry used to be led by the semiconductor companies that made ever faster microprocessors with larger memories. However, control is shifting to new ways of designing computers, notably based on 3D chips and new analog and digital architectures. While artificial intelligence and quantum computing research have become mainstream pursuits, these latter two areas seem destined split off from Moore's law rather than become a part of it. We include a discussion of recent developments and opportunities in optical communications and computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Baylor University Campus-Wide Deep Dive

In January 2020, staff members from the Engagement and Performance Operations Center (EPOC) and the Lonestar Education And Research Network (LEARN) met with researchers and staff at Baylor University for the purpose of a Campus-Wide Deep Dive into research drivers. The goal of this meeting was to help characterize the requirements for five campus research use cases and to enable cyberinfrastructure support staff to better understand the needs of the researchers they support. Profiled scientific use cases included: - Experimental High Energy Physics (HEP) - Proton Computed Tomography (pCT) - Nutrition and Relation to Digestive Microbiome - Baylor University Core Research Facilities - Molecular Quantum-dot Cellular Automata (QCA), and Material Science of Quantum Computing - Modeling and Simulation of Low-Dimensional and Nano-Structured Materials - Computational Fluid Dynamics Material for this event included the written documentation from each of the research areas at Baylor University, documentation about the current state of technology support, and a write-up of the discussion that took place in person. The Case Studies highlighted the ongoing challenges that Baylor University has in supporting a cross-section of established and emerging research use cases. Each Case Study mentioned unique challenges which were summarized into common needs. These included: - Tradeoffs for network/software security, and usability of the resulting infrastructure. Better communication to set expectations and understand realities is required. - Computation use on campus is widespread and healthy. While no major problems were uncovered, upgrades to maintain current usage patterns and encourage growth will be required. - Storage is a critical need for enterprise use cases and research. In particular, a campus wide ‘storage architecture’ to support research use cases (e.g. instruments, data sharing) is required in the 2-5 year time window. - Instrumentation on campus is healthy and expanding. Technology must scale with this in the form of computation and storage. - Working with LEARN to upgrade network capacity (in multiples of 10G, or upgrades to 100G) will be required in the 1-3 year time frame. - Network monitoring and visibility will help to establish external science use cases. - Data sharing via portal systems is not currently a critical need, but growing in scope. EPOC can assist Baylor with options.

99 GENERAL AND MISCELLANEOUS↗