Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum Numbers”

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

Photoproduction of K 0 S Pairs at GlueX

We present an study of the ¿¿ ¿ ¿0 ¿¿0 ¿¿ channel measured by the GlueX experiment. This channel selects for resonances with ¿¿¿ = even++ quantum numbers (the ¿0, ¿2, ¿0, and ¿2 light, flavorless mesons) and potentially contains contributions from the lightest scalar glueball (¿0). Data from the 2017, 2018, and 2020 run periods are used to perform a mass independent (binned) partial-wave analysis to distinguish spin states. Due to the polarized photon beam at GlueX, we are also able to extract reflectivity amplitudes for the first time in this channel. Additionally, we perform mass-dependent partial-wave analyses using a fixed ¿-matrixparameterization to attempt a determination of the relative contribution of each res onance, and we present a guided initialization method which facilitates navigation through a parameter space with many local minima. These mass-dependent fits are a proof-of-concept in using fixed ¿-matrix models constrained by other experiments to measure photoproduc tion amplitudes for overlapping states which may only differ by isospin, a property which cannot be distinguished in this channel.

Hoffman, Nathaniel [Carnegie Mellon University]↗
DOE OSTI2025

DOUBLY-STRANGE BARYON SPECTROSCOPY WITH THE GLUEX EXPERIMENT: GROUND STATE ¿(1320) PHOTOPRODUCTION CROSS SECTION AND PROPERTIES

In the light-quark sector, traditional quark models and, more recently, lattice QCD calculations have predicted many more baryon states than have been experimentally observed. The hyperons, baryons with strange-quark content, in particular abundantly lack these observed states, and past observations are statistically limited. For multi-strange hyperons the matter is much worse and the production mechanisms of these states in photoproduction are very poorly understood. By capitalizing on the narrow peaks, as compared to the broad and overlapping N* and ¿* states, characteristic of the lowest lying ¿ resonances, the systematic aspects of the spectrum can be analyzed. In addition, we can measure experimental observables such as the production cross section to study the production mechanisms of the ¿ resonances. By accumulating various experimental observables, this goal could be accomplished through Partial Wave Analysis (PWA). The main body of work presented in this dissertation is the physics analysis and systematic study of the production cross section for the doubly strange octet ground state baryon (¿(1320)) in the exclusive t-channel photoproduction reaction ¿p ¿ K+Y* ¿ K+(K+¿-)Y* where ¿- ¿ ¿p- and ¿ ¿ pp-. The spin quantum number of ¿(1320) is also extracted and discussed. A preliminary result to extract the mass of ¿(1320) is also explored as a result of the statistical limitations of current measurements. Furthermore, the spectrum of the excited ¿* baryons are explored and discussed in the ¿*- ¿ K-¿ decay channel. The studies on the ground state and excited ¿ baryon are performed using the GlueX Phase-I (GlueX-I) data set. We have extracted differential cross sections from seven beam photon energy bins for E¿ ¿ [6.4,11.4] GeV1 and for -t < 2.4 GeV2 in the production of K+Y*. 1Natural units (c = 1) are used for the entire body of work.

Hernandez, Jesse [Florida State Univ., Tallahassee↗
DOE OSTI2023

Reaction-diffusive dynamics of number-conserving dissipative quantum state preparation

The use of dissipation for the controlled creation of nontrivial quantum many-body correlated states is of much fundamental and practical interest. What is the result of imposing number conservation, which, in closed system, gives rise to diffusive spreading? For this work, we investigate this question for a paradigmatic model of a two-band system, with dissipative dynamics aiming to empty one band and to populate the other, which had been introduced before for the dissipative stabilization of topological states. Going beyond the mean-field treatment of the dissipative dynamics, we demonstrate the emergence of a diffusive regime for the particle and hole density modes at intermediate length- and timescales, which, interestingly, can only be excited in nonlinear response to external fields. We also identify processes that limit the diffusive behavior of this mode at the longest length- and timescales. Strikingly, we find that these processes lead to a reaction-diffusion dynamics governed by the Fisher-Kolmogorov-Petrovsky-Piskunov equation, making the designed dark state unstable towards a state with a finite particle and hole density.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Quantifying the Variation in the Number of Donors in Quantum Dots Created Using Atomic Precision Advanced Manufacturing

Atomic-precision advanced manufacturing enables unique silicon quantum electronics built on quantum dots fabricated from small numbers of phosphorus dopants. The number of dopant atoms comprising a dot plays a central role in determining the behavior of charge and spin confined to the dots and thus overall device performance. Here in this work, we use both theoretical and experimental techniques to explore the combined impact of lithographic variation and stochastic kinetics on the number of P incorporations in quantum dots made using these techniques and how this variation changes as a function of the size of the dot. Using a kinetic model of PH3 dissociation augmented with novel reaction barriers, we demonstrate that for a 2 × 3 silicon dimer window the probability that no donor incorporates goes to zero, allowing for certainty in the placement of at least one donor. However, this still comes with some uncertainty in the precise number of incorporated donors (either one or two), and this variability may still impact certain applications. We also examine the impact of the size of the initial lithographic window, finding that the incorporation fraction saturates to δ-layer-like coverage as the circumference-to-area ratio decreases. We predict that this incorporation fraction depends strongly on the dosage of the precursor and that the standard deviation of the number of incorporations scales as ~√n, as would be expected for a sequence of largely independent incorporation events. Finally, we characterize an array of 36 experimentally prepared multidonor 3 × 3 nm lithographic windows with scanning tunneling microscopy, measuring the fidelity of the lithography to the desired array and the final location of PH x fragments within these lithographic windows. We use our kinetic model to examine the expected variability due to the observed lithographic error, predicting a negligible impact on incorporation statistics. We find good agreement between our model and the inferred incorporation locations in these windows from scanning tunneling microscope measurements.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

State Preparation of Antisymmetrized Geminal Power on a Quantum Computer without Number Projection

The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen–Cooper–Schrieffer (PBCS) wave function. It is also an elementary symmetric polynomial (ESP) state. We generalize previous research on deterministically implementing the Dicke state to a state preparation algorithm for an ESP state, or equivalently AGP, on a quantum computer. Our method is deterministic and has polynomial cost, and it does not rely on number symmetry breaking and restoration. We also show that our circuit is equivalent to a disentangled unitary paired coupled cluster operator and a layer of unitary Jastrow operator acting on a single Slater determinant. Here, the method presented herein highlights the ability of disentangled unitary coupled cluster to capture nontrivial entanglement properties that are hardly accessible with traditional Hartree–Fock based electronic structure methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Number Partitioning via Quantum Adiabatic Computation

We study both analytically and numerically the complexity of the adiabatic quantum evolution algorithm applied to random instances of combinatorial optimization problems. We use as an example the NP-complete set partition problem and obtain an asymptotic expression for the minimal gap separating the ground and exited states of a system during the execution of the algorithm. We show that for computationally hard problem instances the size of the minimal gap scales exponentially with the problem size. This result is in qualitative agreement with the direct numerical simulation of the algorithm for small instances of the set partition problem. We describe the statistical properties of the optimization problem that are responsible for the exponential behavior of the algorithm.

Smelyanskiy, Vadim N.↗
DOE OSTI2025

Traceable random numbers from a non-local quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations—the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts—a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2−64. Further, the generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Shadow process tomography of quantum channels

Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scales exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. Furthermore, we make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography, enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Current Noisy Intermediate-Scale Quantum (NISQ) computers and forward-looking Fault-Tolerant (FT) quantum computers have fundamentally different constraints such as data locality, instruction parallelism, and communication overhead. Our heuristic-based ancilla-reuse algorithm balances these considerations and fits computations into resource-constrained NISQ or FT quantum machines, throttling parallelism when necessary. To precisely capture the workload of a program, we propose an improved metric, the "active quantum volume," and use this metric to evaluate the effectiveness of our algorithm. Furthermore, our results show that SQUARE improves the average success rate of NISQ applications by 1.47X. Surprisingly, the additional gates for uncomputation create ancilla with better locality, and result in substantially fewer swap gates and less gate noise overall. SQUARE also achieves an average reduction of 1.5X (and up to 9.6X) in active quantum volume for FT machines.

compiler optimization↗
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

Grand Unification of Quantum Algorithms

Quantum algorithms offer significant speed-ups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, which appear as subroutines for large families of composite quantum algorithms. A number of these quantum algorithms have recently been tied together by a novel technique known as the quantum singular value transformation (QSVT), which enables one to perform a polynomial transformation of the singular values of a linear operator embedded in a unitary matrix. In the seminal GSLW’19 paper on the QSVT [Gilyén et al., ACM STOC 2019], many algorithms are encompassed, including amplitude amplification, methods for the quantum linear systems problem, and quantum simulation. Here, we provide a pedagogical tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform, from which the QSVT naturally emerges. Paralleling GSLW’19, we then employ the QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation, and also showcase algorithms for the eigenvalue threshold problem and matrix inversion. This overview illustrates how the QSVT is a single framework comprising the three major quantum algorithms, suggesting a grand unification of quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2002

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗
NASA NTRS2002

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗
DOE OSTI2024

Quantum simulation of excited states from parallel contracted quantum eigensolvers

Abstract Computing excited-state properties of molecules and solids is considered one of the most important near-term applications of quantum computers. While many of the current excited-state quantum algorithms differ in circuit architecture, specific exploitation of quantum advantage, or result quality, one common feature is their rooting in the Schrödinger equation. However, through contracting (or projecting) the eigenvalue equation, more efficient strategies can be designed for near-term quantum devices. Here we demonstrate that when combined with the Rayleigh–Ritz variational principle for mixed quantum states, the ground-state contracted quantum eigensolver (CQE) can be generalized to compute any number of quantum eigenstates simultaneously. We introduce two excited-state (anti-Hermitian) CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm, such as its scalability. To showcase our approach, we study several model and chemical Hamiltonians and investigate the performance of different implementations.

Physics↗
NASA NTRS2005

Scheme for Entering Binary Data Into a Quantum Computer

A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.

Williams, Colin↗
DOE OSTI2020

Development and study of high-power quantum-cascade lasers emitting at 4.5 – 4.6 μm

Quantum-cascade room-temperature 4.5 – 4.6 μm lasers with different numbers of quantum cascades are developed and studied. It is shown that losses at the metallised sidewalls of the ridge waveguide considerably increase the threshold current density. It is demonstrated that the current density needed to overcome the internal and outcoupling losses in lasers with 30 quantum cascades is an order of magnitude lower than in lasers with 15 quantum cascades. (lasers)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Toward simulating quantum field theories with controlled phonon-ion dynamics: A hybrid analog-digital approach

Quantum field theories are the cornerstones of modern physics, providing relativistic and quantum mechanical descriptions of physical systems at the most fundamental level. Simulating real-time dynamics within these theories remains elusive in classical computing. This provides a unique opportunity for quantum simulators, which hold the promise of revolutionizing our simulation capabilities. Trapped-ion systems are successful quantum-simulator platforms for quantum many-body physics and can operate in digital, or gate-based, and analog modes. Inspired by the progress in proposing and realizing quantum simulations of a number of relativistic quantum field theories using trapped-ion systems, and by the hybrid analog-digital proposals for simulating interacting boson-fermion models, we propose hybrid analog-digital quantum simulations of selected quantum field theories, taking recent developments to the next level. On one hand, the semi-digital nature of this proposal offers more flexibility in engineering generic model interactions compared with a fully-analog approach. On the other hand, encoding the bosonic fields onto the phonon degrees of freedom of the trapped-ion system allows a more efficient usage of simulator resources, and a more natural implementation of intrinsic quantum operations in such platforms. This opens up new ways for simulating complex dynamics of e.g., Abelian and non-Abelian gauge theories, by combining the benefits of digital and analog schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗