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 325 records · Page 18

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Power spectrum and form factor in random diagonal matrices and integrable billiards

Triggered by a controversy surrounding a universal behavior of the power spectrum in quantum systems exhibiting regular classical dynamics, we focus on a model of random diagonal matrices (RDM), often associated with the Poisson spectral universality class, and examine how the power spectrum and the form factor get affected by two-sided truncations of RDM spectra. Having developed a nonperturbative description of both statistics, we perform their detailed asymptotic analysis to demonstrate explicitly how a traditional assumption (lying at the heart of the controversy) – that the power spectrum is merely determined by the spectral form factor – breaks down for truncated spectra. This observation has important consequences as we further argue that bounded quantum systems with integrable classical dynamics are described by heavily truncated rather than complete RDM spectra. High-precision numerical simulations of semicircular and irrational rectangular billiards lend independent support to these conclusions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fermionic systems for quantum information people

The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity superselection in the fermionic case on the other. We discuss these two fundamental differences extensively, and illustrate these through the Jordan–Wigner representation in a coherent, self-contained, pedagogical way, from the point of view of quantum information theory. Our perspective leads us to develop useful new tools for the treatment of fermionic systems, such as the fermionic (quasi-)tensor product, fermionic canonical embedding, fermionic partial trace, fermionic products of maps and fermionic embeddings of maps. We formulate these by direct, easily applicable formulas, without mode permutations, for arbitrary partitionings of the modes. It is also shown that fermionic reduced states can be calculated by the fermionic partial trace, containing the proper phase factors. We also consider variants of the notions of fermionic mode correlation and entanglement, which can be endowed with the usual, local operation based motivation, if the parity superselection rule is imposed. We also elucidate some other fundamental points, related to joint map extensions, which make the parity superselection inevitable in the description of fermionic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal framework for simultaneous tomography of quantum states and SPAM noise

We present a general denoising algorithm for performing simultaneous tomography of quantum states and measurement noise. This algorithm allows us to fully characterize state preparation and measurement (SPAM) errors present in any quantum system. Our method is based on the analysis of the properties of the linear operator space induced by unitary operations. Given any quantum system with a noisy measurement apparatus, our method can output the quantum state and the noise matrix of the detector up to a single gauge degree of freedom. We show that this gauge freedom is unavoidable in the general case, but this degeneracy can be generally broken using prior knowledge on the state or noise properties, thus fixing the gauge for several types of state-noise combinations with no assumptions about noise strength. Such combinations include pure quantum states with arbitrarily correlated errors, and arbitrary states with block independent errors. This framework can further use available prior information about the setting to systematically reduce the number of observations and measurements required for state and noise detection. Our method effectively generalizes existing approaches to the problem, and includes as special cases common settings considered in the literature requiring an uncorrelated or invertible noise matrix, or specific probe states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cryogenic Control Circuitry for Superconducting Qubits

Superconducting qubits have reached the point where system designers are worried about the heat that control wiring brings into the cryostat. To continue scaling cryogenic quantum systems, control solutions that work inside the cold space must be explored. One possibility is to use control electronics that is native to superconductivity, so called single-flux-quantum (SFQ) circuitry, to form an interface between qubits and whatever other electronics is needed to control eventual quantum systems. To begin exploring the utility of SFQ as control circuitry, we performed modeling and experiments on qubit readout using ballistic fluxons which are SFQ in the limit of ballistic fluxon transport. Our modeling results show that a flavor of qubit, the fluxonium, can be read out using ballistic fluxons. We designed test samples to prove some of the key concepts needed for such a readout but were ultimately unable to getting a working demonstration. The lack of testing success was due to challenges in fabrication and running short of time to perform testing rather than a fundamental problem with our analysis.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Alpha-decay width of a near proton-threshold resonance in the 7 Li( α, α ) channel

We investigate the alpha-decay width of a near proton-threshold resonance in 11 B by the excitation functions of 7 Li(α, α) and 7 Li(α, α’) reactions. This resonance is an example of loosely bound atomic nuclei, understood as small open quantum systems, that exhibit properties significantly influenced by their coupling to the continuum. The present experiment focuses on the formation of a specific state in 11 B at excitation energy in the region near 11.4 MeV by bombarding a 7 Li target with a 4 He beam at energies ranging from 3.92 to 4.56 MeV in the laboratory frame. The study provides data complementary to previous observations of the proton emission in the β-decay of the neutron-rich halo nucleus 11 Be. An R-matrix fit to the data provides resonance energy and partial widths consistent with J π =1/2 + for a narrow near-threshold state in 11 B at 11.400(20) MeV, that is 171(20) keV above the proton emission threshold, with partial α-decay width Γ α =2.5$^{+3.5}_{–1.5}$ keV in elastic scattering and Γ α' =15.8$^{+1.9}_{–0.4}$ keV in inelastic scattering. These findings contribute to the understanding of the structure of this open quantum system resonance.

11B↗

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the Hamiltonian. By working out expressions for the partition function and transition amplitudes of discretized versions of continuous-variable quantum systems, and then taking the continuum limit, we explicitly recover Feynman's continuous-variable path integrals. We also discuss the implications of our result.

Feynman diagrams↗

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)↗

Quantum for Energy Systems and Technologies

Quantum information science (QIS) is creating a transformative opportunity to improve processes for energy production, distribution, and consumption. In this presentation, we will show the works that are currently pursued into two major directions, (i) quantum sensing and (ii) quantum computing is undergoing in order to find applications in the areas of carbon captures, critical minerals and gas sensing applications.

Paudel, Hari P.↗