Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum system”

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

A unified realization of electrical quantities from the quantum International System of Units

In the revised International System of Units (SI), the ohm and the volt are realized from the von Klitzing constant and the Josephson constant, and a practical realization of the ampere is possible by applying Ohm’s law directly to the quantum Hall and Josephson effects. As a result, it is possible to create an instrument capable of realizing all three primary electrical units, but the development of such a system remains challenging. Here, in this study, we report a unified realization of the volt, ohm and ampere by integrating a quantum anomalous Hall resistor (QAHR) and a programmable Josephson voltage standard (PJVS) in a single cryostat. Our system has a quantum voltage output that ranges from 0.24 mV to 6.5 mV with combined relative uncertainties down to 3 μV V −1 . The QAHR provides a realization of the ohm at zero magnetic field with uncertainties near 1 μΩ Ω −1 . We use the QAHR to convert a longitudinal current to a quantized Hall voltage and then directly compare that against the PJVS to realize the ampere. We determine currents in the range of 9.33–252 nA, and our lowest uncertainty is 4.3 μA A −1 at 83.9 nA. For other current values, a systematic error that ranges from −10 μA A −1 to −30 μA A −1 is present due to the imperfect isolation of the PJVS microwave bias.

Quantum metrology↗
DOE OSTI2026

Rapid Quantum Ground State Preparation via Dissipative Dynamics

Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.

decoherence↗
DOE OSTI2025

Unorthodox parallelization for Bayesian quantum state estimation

Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to achieve both efficient QST and accurate uncertainty quantification, yet is generally plagued by the computational limitations associated with long Markov chains. In this work, we present a novel Bayesian QST approach that leverages modern distributed parallel computer architectures to efficiently sample a D-dimensional Hilbert space. Using a parallelized preconditioned Crank–Nicholson Metropolis–Hastings algorithm, we demonstrate our approach on simulated data and experimental results from IBM Quantum systems up to four qubits, showing significant speedups through parallelization. Although highly unorthodox in pooling independent Markov chains, our method proves remarkably practical, with validation ex post facto via diagnostics like the intrachain autocorrelation time. We conclude by discussing scalability to higher-dimensional systems, offering a path toward efficient and accurate Bayesian characterization of large quantum systems.

Bayesian inference↗
DOE OSTI2024

Visual Analytics of Performance of Quantum Computing Systems and Circuit Optimization

Driven by potential exponential speedups in business, security, and scientific scenarios, interest in quantum computing is surging. This interest feeds the development of quantum computing hardware, but several challenges arise in optimizing application performance for hardware metrics (e.g., qubit coherence and gate fidelity). In this work, we describe a visual analytics approach for analyzing the performance properties of quantum devices and quantum circuit optimization. Our approach allows users to explore spatial and temporal patterns in quantum device performance data and it computes similarities and variances in key performance metrics. Detailed analysis of the error properties characterizing individual qubits is also supported. We also describe a method for visualizing the optimization of quantum circuits. The resulting visualization tool allows researchers to design more efficient quantum algorithms and applications by increasing the interpretability of quantum computations.

Chae, Junghoon↗
DOE OSTI2024

Observing Quantum Measurement Collapse as a Learnability Phase Transition

During a quantum measurement, superpositions of states with different observable properties probabilistically collapse into one with a sharp value of the measured observable. In macroscopic quantum systems, this collapse arises via a continuous measurement-induced phase transition (MIPT) at a critical value of the strength of interaction with the measurement apparatus. MIPTs lie outside established paradigms for equilibrium or nonequilibrium critical phenomena and delineate distinct, stable dynamical and computational phases of matter. Quantum computers enable programmable simulation of the interaction of a measurement apparatus with a dynamical quantum system, to explore MIPT phenomena over a range of system sizes while retaining quantum coherence. Yet, existing experimental protocols rely on fundamentally nonscalable postselection techniques or direct classical simulation of quantum circuits. Here, we report the scalable observation of finite-size scaling evidence for an observable-sharpening MIPT in monitored quantum circuits in a chain of Yb + 171 ions in Quantinuum’s H1-1 trapped-ion quantum processor. By leveraging an equivalent description as a statistical physics problem, we implement scalable classical algorithms to infer the value of the measured observable from a single experimental shot. This technique enables a truly scalable protocol to observe observable-sharpening MIPTs in generic classes of circuits that cannot be directly classically simulated and also provides enhanced means to detect and suppress errors in the quantum simulation. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Certifying almost all quantum states with few single-qubit measurements

Certifying that an n -qubit state synthesized in the laboratory is close to a given target state is a fundamental task in quantum information science. However, existing rigorous protocols applicable to general target states have potentially prohibitive resource requirements in the form of either deep quantum circuits or exponentially many single-qubit measurements. Here we prove that almost all n -qubit target states, including those with exponential circuit complexity, can be certified from only O ( n 2 ) single-qubit measurements. Given access to the target state’s amplitudes, our protocol requires only O ( n 3 ) classical computation. This result is established by a technique that relates certification to the mixing time of a random walk. Our protocol has applications for benchmarking quantum systems, for optimizing quantum circuits to generate a desired target state and for learning and verifying neural networks, tensor networks and various other representations of quantum states using only single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties of a synthesized state that would otherwise require an exponential number of measurements on the state. We demonstrate these applications in numerical experiments with up to 120 qubits and observe an advantage over existing methods such as cross-entropy benchmarking.

information theory and computation↗
DOE OSTI2020

Autonomous Tuning and Charge-State Detection of Gate-Defined Quantum Dots

Defining quantum dots in semiconductor-based heterostructures is an essential step in initializing solid-state qubits. With growing device complexity and increasing number of functional devices required for measurements, a manual approach to finding suitable gate voltages to confine electrons electrostatically is impractical. Here, we implement a two-stage device characterization and dot-tuning process, which first determines whether devices are functional and then attempts to tune the functional devices to the single or double quantum-dot regime. We show that automating well-established manual-tuning procedures and replacing the experimenter’s decisions by supervised machine learning is sufficient to tune double quantum dots in multiple devices without premeasured input or manual intervention. The quality of measurement results and charge states are assessed by four binary classifiers trained with experimental data, reflecting real device behavior. We compare and optimize eight models and different data preprocessing techniques for each of the classifiers to achieve reliable autonomous tuning, an essential step towards scalable quantum systems in quantum-dot-based qubit architectures.

Darulova, J↗
DOE OSTI2022

Variational quantum algorithm for estimating the quantum Fisher information

The quantum Fisher information (QFI) quantifies the ultimate precision of estimating a parameter from a quantum state and can be regarded as a reliability measure of a quantum system as a quantum sensor. However, estimation of the QFI for a mixed state is in general a computationally demanding task. In this paper we present a variational quantum algorithm called variational quantum Fisher information estimation (VQFIE) to address this task. By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing. In contrast to previous approaches, VQFIE does not require knowledge of the explicit form of the sensor dynamics. We simulate the algorithm for a magnetometry setup and demonstrate the tightening of our bounds as the state purity increases. For this example, we compare our bounds with literature bounds and show that our bounds are tighter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Extracting doubly excited state lifetimes in helium directly in the time domain with attosecond noncollinear four-wave-mixing spectroscopy

The helium atom, with one nucleus and two electrons, is a prototypical system to study quantum many-body dynamics. Doubly excited states, or quantum states in which both electrons are excited by one photon, showcase electronic-correlation mediated effects. In this paper, the natural lifetimes of the doubly excited 1 P o 2 s n p Rydberg series and the 1 S e 2 p 2 dark state in helium in the 60–65 eV region are measured directly in the time domain with extreme-ultraviolet/near-infrared noncollinear attosecond four-wave-mixing (FWM) spectroscopy. The measured lifetimes agree with lifetimes deduced from spectral linewidths and theoretical predictions, and the roles of specific decay mechanisms are considered. While complex spectral line shapes in the form of Fano resonances are common in absorption spectroscopy of autoionizing states, the background-free and thus homodyned character of noncollinear FWM results exclusively in Lorentzian spectral features in the absence of strong-field effects. The onset of strong-field effects that would affect the extraction of accurate natural lifetimes in helium by FWM is determined to be approximately 0.3 Rabi cycles. This study provides a systematic understanding of the FWM parameters necessary to enable accurate lifetime extractions, which can be utilized in more complex quantum systems in the future. Published by the American Physical Society 2024

Rupprecht, Patrick (ORCID:000000026491793X)↗
DOE OSTI2020

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Automatic Qubit Characterization and Gate Optimization with QubiC

As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to tune up qubits and gates, which cannot easily expand to the large-scale quantum systems. We develop a concise and automatic calibration protocol to characterize qubits and optimize gates using QubiC, which is an open source FPGA (field-programmable gate array) based control and measurement system for superconducting quantum information processors. We propose multi-dimensional loss-based optimization of single-qubit gates and full XY-plane measurement method for the two-qubit CNOT gate calibration. We demonstrate the QubiC automatic calibration protocols are capable of delivering high-fidelity gates on the state-of-the-art transmon-type processor operating at the Advanced Quantum Testbed at Lawrence Berkeley National Laboratory. Finally, the single-qubit and two-qubit Clifford gate infidelities measured by randomized benchmarking are of 4.9(1.1) × 10 -4 and 1.4(3) × 10 -2 , respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Practical implications of SFQ-based two-qubit gates

Scalability of today’s superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active research area in both industry and academia is to push the classical controllers to the dilution refrigerator in order to increase the scalability of quantum computers. Superconducting Single Flux Quantum (SFQ) is a classical logic technology with low power consumption and ultra-high speed, and thus is a promising candidate for in-fridge classical controllers with maximized scalability. Prior work has demonstrated high-fidelity SFQ-based single-qubit gates. However, little research has been done on SFQ-based multi-qubit gates, which are necessary to realize SFQ-based universal quantum computing.In this paper, we present the first thorough analysis of SFQ-based two-qubit gates. Our observations show that SFQ-based two-qubit gates tend to have high leakage to qubit non-computational subspace, which presents severe design challenges. We show that despite these challenges, we can realize gates with high fidelity by carefully designing optimal control methods and qubit architectures. We develop optimal control methods that suppress leakage, and also investigate various qubit architectures that reduce the leakage. After carefully engineering our SFQ-friendly quantum system, we show that it can achieve similar gate fidelity and gate time to microwave-based quantum systems. Furthermore, the promising results of this paper show that (1) SFQ-based universal quantum computation is both feasible and effective; and (2) SFQ is a promising approach in designing classical controller for quantum machines because it can increase the scalability while preserving gate fidelity and performance.

42 ENGINEERING↗
DOE OSTI2022

Synthesis of Eu(HCOO) 3 and $\mathrm{Eu(HCOO)_3}$ • $\mathrm{(HCONH_2)_2}$ crystals and observation of their 5 D 0 → 7 F 0 transition for quantum information systems

Two stoichiometric metal-organic frameworks containing Eu 3+ cations are probed as candidates for photon-based quantum information storage. Synthesis procedures for growing 0.2 mm, rod-shaped Eu(HCOO) 3 and 1–3 mm, rhombohedral $\mathrm{Eu(HCOO)_3}$ • $\mathrm{(HCONH_2)_2}$ single crystals are presented with visible precipitation as soon as 1 h into heating for Eu(HCOO) 3 and 24 h for $\mathrm{Eu(HCOO)_3}$ • $\mathrm{(HCONH_2)_2}$. Room temperature and 1.4 K photoluminescence measurements of the 5 D 0 → 7 F J transitions of Eu 3+ are analyzed for both compounds. Comparisons of peak width and intensity are discussed along with the notable first report for both of the 5 D 0 → 7 F 0 transition, the hyperfine structure of which has potential use in quantum memory applications. Furthermore, the air instability of $\mathrm{Eu(HCOO)_3}$ • $\mathrm{(HCONH_2)_2}$ and the transformation of its photoluminescence properties are discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Local Poincaré algebra from quantum chaos

The local two-dimensional Poincaré algebra near the horizon of an eternal AdS black hole, or in proximity to any bifurcate Killing horizon, is generated by the Killing flow and outward null translations on the horizon. In holography, this local Poincaré algebra is reflected as a pair of unitary flows in the boundary Hilbert space whose generators under modular flow grow and decay exponentially with a maximal Lyapunov exponent. This is a universal feature of many geometric vacua of quantum gravity. To explain this universality, we show that a two-dimensional Poincaré algebra emerges in any quantum system that has von Neumann subalgebras associated with half-infinite modular time intervals (modular future and past subalgebras) in a limit analogous to the near-horizon limit. In ergodic theory, quantum dynamical systems with future or past algebras are called quantum K-systems. The surprising statement is that modular K-systems are always maximally chaotic. Interacting quantum systems in the thermodynamic limit and large N theories above the Hawking-Page phase transition are examples of physical theories with future/past subalgebras. We prove that the existence of (modular) future/past von Neumann subalgebras also implies a second law of (modular) thermodynamics and the exponential decay of (modular) correlators. We generalize our results from the modular flow to any dynamical flow with a positive generator and interpret the positivity condition as quantum detailed balance.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Simulating fermions with a digital quantum computer

Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms to determine the physical properties of such systems have been developed. Although qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and chemistry, which is now finding another application in the simulation of fermionic systems on quantum computers based on qubits. In this work, we discuss methods for encoding fermionic degrees of freedom into qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

97 MATHEMATICS AND COMPUTING↗