Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum time”

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

Fast quantum ghost imaging with a single-photon-sensitive time-stamping camera

Quantum ghost imaging (QGI) leverages correlations between entangled photon pairs to reconstruct an image using light that has never physically interacted with an object. Despite extensive research interest, this technique has long been hindered by slow acquisition speeds, due to the use of raster-scanned detectors or the slow response of intensified cameras. Here, we utilize a single-photon-sensitive time-stamping camera to perform QGI at ultra-low-light levels with rapid data acquisition and processing times, achieving high-resolution and high-contrast images in under 1 min. Our work addresses the trade-off between image quality, optical power, data acquisition time, and data processing time in QGI, paving the way for practical applications in biomedical and quantum-secured imaging.

Mavian, Alex (ORCID:0000000279448830)↗
DOE OSTI2024

High-rate multiplexed entanglement source based on time-bin qubits for advanced quantum networks

Entanglement distribution based on time-bin qubits is an attractive option for emerging quantum networks. We demonstrate a 4.09-GHz repetition rate source of photon pairs entangled across early and late time bins separated by 80 ps. Simultaneous high rates and high visibilities are achieved through frequency multiplexing the spontaneous parametric down conversion output into eight time-bin entangled channel pairs. We demonstrate entanglement visibilities as high as 99.4%, total entanglement rates up to 3.55×10 6 coincidences/s, and predict a straightforward path towards achieving up to an order of magnitude improvement in rates without compromising visibility. Finally, we resolve the density matrices of the entangled states for each multiplexed channel and express distillable entanglement rates in ebit/s, thereby quantifying the trade-off between visibility and coincidence rates that contributes to useful entanglement distribution. This source is a fundamental building block for high-rate entanglement-based quantum key distribution systems or advanced quantum networks.

Mueller, Andrew (ORCID:0000000265989732)↗
DOE OSTI2021

A Comparison of Three Ways to Measure Time-Dependent Densities With Quantum Simulators

Quantum algorithms are touted as a way around some classically intractable problems such as the simulation of quantum mechanics. At the end of all quantum algorithms is a quantum measurement whereby classical data is extracted and utilized. In fact, many of the modern hybrid-classical approaches are essentially quantum measurements of states with short quantum circuit descriptions. Here, we compare and examine three methods of extracting the time-dependent one-particle probability density from a quantum simulation: direct Z -measurement, Bayesian phase estimation, and harmonic inversion. We have tested these methods in the context of the potential inversion problem of time-dependent density functional theory. Our test results suggest that direct measurement is the preferable method. We also highlight areas where the other two methods may be useful and report on tests using Rigetti's quantum virtual device. This study provides a starting point for imminent applications of quantum computing.

Yang, Jun↗
DOE OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Simple and General Unitarity Conserving Numerical Real-Time Propagators of the Time-Dependent Schrödinger Equation Based on Magnus Expansion

Magnus expansion (ME) provides a general way to expand the real-time propagator of a time-dependent Hamiltonian within the exponential such that the unitarity is satisfied at any order. Here, we use this property and explicit integration of Lagrange interpolation formulas for the time-dependent Hamiltonian within each time interval and derive approximations that preserve unitarity for the differential time evolution operators of general time-dependent Hamiltonians. The resulting second-order approximation is the same as using the average of Hamiltonians for two end points of time. We identify three fourth-order approximations involving commutators of Hamiltonians at different times and also derive a sixth-order expression. A test of these approximations along with other available expressions for a two-state time-dependent Hamiltonian with sinusoidal time dependences provides information on the relative performance of these approximations and suggests that the derived expressions can serve as useful numerical tools for time evolution in time-resolved spectroscopy, quantum control, quantum sensing, real-time ab initio quantum dynamics, and open system quantum dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1995

Characterization of the transport properties of channel delta-doped structures by light-modulated Shubnikov-de Haas measurements

The transport properties of channel delta-doped quantum well structures were characterized by conventional Hall effect and light-modulated Shubnikov-de Haas (SdH) effect measurements. The large number of carriers that become available due to the delta-doping of the channel, leads to an apparent degeneracy in the well. As a result of this degeneracy, the carrier mobility remains constant as a function of temperature from 300 K down to 1.4 K. The large amount of impurity scattering, associated with the overlap of the charge carriers and the dopants, resulted in low carrier mobilities and restricted the observation of the oscillatory magneto-resistance used to characterize the two-dimensional electron gas (2DEG) by conventional SdH measurements. By light-modulating the carriers, we were able to observe the SdH oscillation at low magnetic fields, below 1.4 tesla, and derive a value for the quantum scattering time. Our results for the ratio of the transport and quantum scattering times are lower than those previously measured for similar structures using much higher magnetic fields.

Mena, R. A.↗
DOE OSTI2025

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Exact block encoding of imaginary time evolution with universal quantum neural networks

We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary time propagator is implemented through an exact block encoding by means of a unitary, restricted Boltzmann machine architecture. Marginalization over the hidden-layer neurons (auxiliary qubits) creates the nonunitary action on the visible layer. Then, we introduce a unitary deep Boltzmann machine architecture in which the hidden-layer qubits are allowed to couple laterally to other hidden qubits. We prove that this wave-function is closed under the action of the imaginary time propagator and, more generally, can represent the action of a universal set of quantum gate operations. We provide analytic expressions for the coefficients for both architectures, thus enabling exact network representations of thermal states without stochastic optimization of the network parameters. In the limit of large imaginary time, the yields the ground state of the system. The number of qubits grows linearly with the number of interactions and total imaginary time for a fixed interaction order. Both networks can be readily implemented on quantum hardware via midcircuit measurements of auxiliary qubits. If only one auxiliary qubit is measured and reset, the circuit depth scales linearly with imaginary time and number of interactions, while the width is constant. Alternatively, one can employ a number of auxiliary qubits linearly proportional to the number of interactions, and circuit depth grows linearly with imaginary time only. Every midcircuit measurement has a postselection success probability, and the overall success probability is equal to the product of the probabilities of the midcircuit measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quantum simulation of nuclear inelastic scattering

We present a time-dependent quantum algorithm for nuclear inelastic scattering in the time-dependent basis function on qubits approach. This algorithm aims to quantum simulate a subset of the nuclear inelastic scattering problems that are of physical interest in which the internal degrees of freedom of the reaction system are excited by time-dependent external interactions. We expect that our algorithm will enable an exponential speedup in simulating the dynamics of the subset of the inelastic scattering problems, which would also be advantageous for the applications to more complicated scattering problems. For a demonstration problem, we solve for the Coulomb excitation of the deuteron, where the quantum simulations are performed with IBM Qiskit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Spin-transparent storage rings for quantum computing

Spin-transparent storage rings, where any spin direction repeats after one full turn, can be used in conjunction with ion traps as a new quantum computing platform [1]. Advantages of spin-transparent rings for quantum computing include: large numbers of stored qubits; long quantum coherence times of up to several hours; long storage lifetimes; and room temperature operation. These exceptional qualities mean rings could provide a scalable way to implement algorithms with deep complexity requiring many quantum operations while simultaneously providing a large number of qubits. This new platform where the qubit has long quantum coherence time can also be used as a quantum sensor or a part of a quantum memory.

Accelerator Physics↗
DOE OSTI2025

Time-resolved detectors for quantum ghost imaging

Quantum ghost imaging is a method that utilizes the correlated detection of two photons to generate an image. One photon is detected by an imaging sensor and the other by a single-element bucket detector. The selection of the imaging sensor and its capabilities relative to the bucket detector impact the quality of the ghost images. This work examines a SPAD array and a photocathode detector as imaging sensors for quantum ghost imaging. We discuss how to achieve optimal images using these two technologies. We also demonstrate that these devices are able to generate ghost images at 1Hz frame rates, expanding the technique to biologically relevant time scales.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Noise-canceling quantum feedback: Non-Hermitian dynamics with applications to state preparation and magic state distillation

Time-continuous quantum measurement allows for the tracking of a quantum system in real time via sequences of short, and individually weak, measurement intervals. Such measurements are necessarily invasive, imparting backaction to the system, and allowing the observer to update their state estimate based on stochastic measurement outcomes. Feedback control then involves real-time interventions by an observer, conditioned on the time-continuous measurement signal that they receive. Here, we consider here diffusive quantum trajectories and focus on the “noise-canceling” subset of feedback protocols that aim to minimize the degree of stochasticity in the dynamics. We derive such a class of feedback operations, showing that under the idealized assumptions of pure states, unit measurement efficiency, and zero time delay in implementing feedback operations, perfectly noise-canceling feedback always exists. We consider the resulting noise-canceled dynamics generated by an effective non-Hermitian Hamiltonian; while non-Hermitian Hamiltonians from continuous monitoring generally describe rare dynamics (accessible by costly postselection), the use of noise-canceling feedback here leads to non-Hermitian dynamics that occur deterministically. We demonstrate this via examples of entangled state preparation and stabilization. We then illustrate the potential for the application of noise cancellation to boost success rates in magic state distillation protocols. We show that adding feedback based on noise cancellation into a time-continuous five-to-one distillation protocol leads to higher probabilities of successful distillation across a range of input errors and increases the threshold on input errors for which the protocol is effective. Our results highlight the efficacy of noise-canceling feedback-aided protocols for quantum state preparation and stabilization tasks.

Karmakar, Tathagata [University of California, Ber↗
DOE OSTI2025

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗
DOE OSTI2023

Quantum Computing – Real-Time Data Processing from a Dilution Refrigerator

This poster presents a real-time data visualization system for monitoring and displaying data from a Bluefors control unit connected to a dilution refrigerator. The goal is to provide an aesthetically pleasing and user-friendly web-based interface that continuously updates and displays critical data such as temperature and flow rates at various points within the refrigerator. Leveraging WebSocket technology, the system establishes multiple connections to the dilution refrigerators, enabling simultaneous monitoring of several units. The interactive webpage dynamically updates the data, providing researchers and operators with instant insights into the system's performance. The system's ability to stream and visualize data in real-time enhances the understanding of the dilution refrigerator's behavior, aiding in optimizing its operation and ensuring efficient scientific experiments. The application's web-based nature makes it easily accessible from any device with internet connectivity, promoting seamless collaboration and remote monitoring capabilities. Overall, this poster offers a comprehensive solution for real-time data visualization and analysis of dilution refrigerators, catering to the needs of researchers and scientists working in low-temperature physics and quantum computing fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput

Undoubtedly, quantum computing offers valuable acceleration for solving intricate problems. One of the primary hurdles lies in executing large-scale quantum applications on backend machines. Qubit noise, among other factors, dramatically influences the execution process. Implementing effective scheduling techniques for quantum circuits is crucial for practical quantum computing and preventing excessive waiting times. The quantum realm is distinct from classical computing in terms of optimization, performance, utilization, and waiting periods. Consequently, the parameters and components of quantum circuit scheduling diverge from those of classical computing. This paper presents Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput, a straightforward yet effective scheduling framework and policy that enhances noise resilience, throughput, and the fidelity of quantum circuits. Drawing inspiration from classical methods, our scheduling approach incorporates additional constraints tailored for quantum logic. The outcome demonstrates a substantial improvement in fidelity and resource management, which is vital for real-world quantum applications.

Baheri, Betis↗
DOE OSTI2022

Quantum Computing in the Cloud: Analyzing job and machine characteristics

As the popularity of quantum computing continues to grow, quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis of resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing. This paper is a first-of-its-kind academic study, analyzing various trends in job execution and resources consumption / utilization on quantum cloud systems. We focus on IBM Furthermore, quantum systems and analyze characteristics over a two year period, encompassing over 6000 jobs which contain over 600,000 quantum circuit executions and correspond to almost 10 billion “shots” or trials over 20+ quantum machines. Specifically, we analyze trends focused on, but not limited to, execution times on quantum machines, queuing/waiting times in the cloud, circuit compilation times, machine utilization, as well as the impact of job and machine characteristics on all of these trends. Furthermore, our analysis identifies several similarities and differences with classical HPC cloud systems. Based on our insights, we make recommendations and contributions to improve the management of resources and jobs on future quantum cloud systems.

42 ENGINEERING↗