Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum algorithms”

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

Investigating parameter trainability in the SNAP-displacement protocol of a qudit system

Here, in this study, we explore the universality of Selective Number-dependent Arbitrary Phase (SNAP) and Displacement gates for quantum control in qudit-based systems. However, optimizing the parameters of these gates poses a challenging task. Our main focus is to investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system and draw comparisons with multi-qubit systems. The parameterized ansatz we consider consists of blocks, where each block is composed of hardware operations, namely SNAP and Displacement gates [Fösel et al 2020 Efficient cavity control with snap gates arXiv:2004.14256]. Applying Variational Quantum algorithm (VQA) with observable and gate cost functions, we utilize techniques similar to those in [McClean et al 2018 Barren plateaus in quantum neural network training landscapes Nat. Commun.9 1–6] and [Cerezo et al 2021 Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun.12 1–12] along with the concept of t − design. Through this analysis, we make the following key observations: (a) The trainability of a SNAP-parameter does not exhibit a preference for any particular direction within our cost function landscape, (b) By leveraging the first and second moments properties of Haar measures, we establish new lemmas concerning the expectation of certain polynomial functions, and (c) utilizing these new lemmas, we identify a general condition that indicates an expected trainability advantage in a qudit system when compared to multi-qubit systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Scalable quantum simulations of scattering in scalar field theory on 120 qubits

Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be bounded-error quantum polynomial time (BQP) complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wave packets in one-dimensional scalar field theory is simulated using 120 qubits of IBM’s Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wave packet initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical matrix product state simulations. Finally, the developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.

quantum circuits↗
DOE OSTI2019

Is the Trotterized UCCSD Ansatz Chemically Well-Defined?

The variational quantum eigensolver (VQE) has emerged as one of the most enticing near-term quantum algorithms that can be used to simulate many-body systems such as molecular electronic structures. Serving as an attractive ansatz in the VQE algorithm, unitary coupled cluster (UCC) theory has seen a renewed interest in recent literature. Yet, unlike the original classical UCC theory, implementation on a quantum computer requires a finite-order Suzuki-Trotter decomposition to separate the exponentials of the large sum of Pauli operators. While previous literature has recognized the non-uniqueness of different orderings of the operators in the Trotterized form of UCC methods, the question of whether or not different orderings matter at the chemical scale has not been addressed. In this letter, we explore the effect of operator ordering on the Trotterized UCCSD ansatz, as well as the much more compact k-UpCCGSD ansatz recently proposed by Lee et al. We observe a significant, system-dependent variation in the energies of Trotterizations with different operator orderings. The energy variations occur on a chemical scale, sometimes on the order of hundreds of kcal/mol. This letter establishes the need to define not only the operators present in the ansatz, but also the order in which they appear. This is necessary for adhering to the quantum chemical notion of a ``model chemistry'', in addition to the general importance of scientific reproducibility. As a final note, we suggest a useful strategy to select out of the combinatorial number of possibilities, a single well-defined and effective ordering of the operators.

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

A Quantum Leap for Dynamic Radiography

Dynamic radiography techniques have been instrumental in advancing the National Nuclear Security Administration's (NNSA) mission since WWII. This paper explores the transformative potential of quantum information science (QIS) to revolutionize dynamic radiography through enhanced image processing, tomographic reconstruction, statistics and uncertainty quantification (UQ), and artificial intelligence integration. By leveraging quantum algorithms to extract previously inaccessible information from existing datasets, this interdisciplinary approach promises unprecedented insights at the intersection of dynamic imaging, artificial intelligence, and quantum information technologies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Materials challenges and opportunities for quantum computing hardware

Combatting noise on the platform The potential of quantum computers to solve problems that are intractable for classical computers has driven advances in hardware fabrication. In practice, the main challenge in realizing quantum computers is that general, many-particle quantum states are highly sensitive to noise, which inevitably causes errors in quantum algorithms. Some noise sources are inherent to the current materials platforms. de Leon et al. review some of the materials challenges for five platforms for quantum computers and propose directions for their solution. Science , this issue p. eabb2823

Science & Technology - Other Topics↗
DOE OSTI2025

Efficient sparse state preparation via quantum walks

Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

dynamic continuous time quantum walks↗
DOE OSTI2025

Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025

Bombieri, Lisa (ORCID:0009000950422897)↗
DOE OSTI2023

Digital quantum simulation of NMR experiments

Simulations of nuclear magnetic resonance (NMR) experiments can be an important tool for extracting information about molecular structure and optimizing experimental protocols but are often intractable on classical computers for large molecules such as proteins and for protocols such as zero-field NMR. We demonstrate the first quantum simulation of an NMR spectrum, computing the zero-field spectrum of the methyl group of acetonitrile using four qubits of a trapped-ion quantum computer. We reduce the sampling cost of the quantum simulation by an order of magnitude using compressed sensing techniques. We show how the intrinsic decoherence of NMR systems may enable the zero-field simulation of classically hard molecules on relatively near-term quantum hardware and discuss how the experimentally demonstrated quantum algorithm can be used to efficiently simulate scientifically and technologically relevant solid-state NMR experiments on more mature devices. Our work opens a practical application for quantum computation.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Quantum Information Science in High Energy Physics at the Large Hadron Collider (Final Report-QuantISED)

We pursue scientific research at the interface of High Energy Physics and Quantum Information Science. This includes studies of thermal radiation and quantum entanglement in high-energy collisions at the Large Hadron Collider (LHC), with special emphasis on entanglement entropy and the Higgs boson. This project has also been extended to include quantum entanglement and charged current weak interactions using Fermilab results. And most recently, we have begun tests of the temporal entanglement using LHC data. Collider experiments such as proton-proton collisions at the LHC yield hadrons that exhibit an exponential behavior at low transverse momenta. This surprising behavior is seen in data from both the ATLAS and CMS collaborations. We attribute this phenomenon to quantum entanglement between the regions in the nucleon wave function. The exponential component to the transverse momentum distribution is a result of thermal radiation that is akin to Hawking or Unruh radiation that should exist at the event horizon of astrophysical black holes and neutron stars. The Principal Investigator, in collaboration with a theoretical physicist at Stony Brook University and Brookhaven National Laboratory, and with Yale University students, has shown evidence for this thermal radiation in several production and decay processes in the ATLAS and CMS data, and its connection to entanglement entropy (O.K. Baker and D.E Kharzeev, Phys. Rev. D 98, 054007 (2018)), including even the Higgs boson sector. Interestingly, this thermal behavior is also seen in momentum distributions of charged current weak interactions according to our studies. These findings suggest a deep connection between quantum entanglement (entanglement entropy) and thermalization in both hadron collisions at the energy frontier and neutrino scattering at the intensity frontier. We have confirmed the proposed relation between the effective temperature and the hard-scattering scale at lower energies using the most recent LHC data for the following systems: Higgs bosons, top quarks, and charged hadrons. Additionally, we have results for hadron production in neutrino scattering from nuclei using Fermilab weak interaction data. This study is carried out using data from the MINERvA collaboration. In those cases where entanglement is expected, there is an exponential component to the momentum distribution, while this component is absent in those processes where no entanglement is expected. This research thus tests the hypothesis about a link between quantum entanglement and thermalization in strong and weak interactions. See Phys Lett B 811, 135948 (2020). We also initiated research applying a quantum search algorithm (Grover's Algorithm) to LHC data. This quantum algorithm was used to show how rare events in LHC data can be searched for in large, unsorted databases, with quadratic speedup compared to classical search algorithms on classical computers. See "Application of a Quantum Search Algorithm to High- Energy Physics Data at the Large Hadron Collider", arXiv:2010.00649 [quant-ph].

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Quantum Machine Learning in High Energy Physics

Machine learning has been used in high energy physics for a long time, primarily at the analysis level with supervised classification. Quantum computing was postulated in the early 1980s as way to perform computations that would not be tractable with a classical computer. With the advent of noisy intermediate-scale quantum computing devices, more quantum algorithms are being developed with the aim at exploiting the capacity of the hardware for machine learning applications. An interesting question is whether there are ways to apply quantum machine learning to High Energy Physics. This paper reviews the first generation of ideas that use quantum machine learning on problems in high energy physics and provide an outlook on future applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]↗
DOE OSTI2023

Autonomous quantum error correction and fault-tolerant quantum computation with squeezed cat qubits

We propose an autonomous quantum error correction scheme using squeezed cat (SC) code against excitation loss in continuous-variable systems. Through reservoir engineering, we show that a structured dissipation can stabilize a two-component SC while autonomously correcting the errors. The implementation of such dissipation only requires low-order nonlinear couplings among three bosonic modes or between a bosonic mode and a qutrit. While our proposed scheme is device independent, it is readily implementable with current experimental platforms such as superconducting circuits and trapped-ion systems. Compared to the stabilized cat, the stabilized SC has a much lower dominant error rate and a significantly enhanced noise bias. Furthermore, the bias-preserving operations for the SC have much lower error rates. In combination, the stabilized SC leads to substantially better logical performance when concatenating with an outer discrete-variable code. The surface-SC scheme achieves more than one order of magnitude increase in the threshold ratio between the loss rate κ 1 and the engineered dissipation rate κ 2 . Under a practical noise ratio κ 1 /κ 2 = 10 -3 , the repetition-SC scheme can reach a 10 -15 logical error rate even with a small mean excitation number of 4, which already suffices for practically useful quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1995

Microgravity and Charge Transfer in the Neuronal Membrane: Implications for Computational Neurobiology

Evidence from natural and artificial membranes indicates that the neural membrane is a liquid crystal. A liquid-to-gel phase transition caused by the application of superposed electromagnetic fields to the outer membrane surface releases spin-correlated electron pairs which propagate through a charge transfer complex. The propagation generates Rydberg atoms in the lipid bilayer lattice. In the present model, charge density configurations in promoted orbitals interact as cellular automata and perform computations in Hilbert space. Due to the small binding energies of promoted orbitals, their automata are highly sensitive to microgravitational perturbations. It is proposed that spacetime is classical on the Rydberg scale, but formed of contiguous moving segments, each of which displays topological equivalence. This stochasticity is reflected in randomized Riemannian tensor values. Spacetime segments interact with charge automata as components of a computational process. At the termination of the algorithm, an orbital of high probability density is embedded in a more stabilized microscopic spacetime. This state permits the opening of an ion channel and the conversion of a quantum algorithm into a macroscopic frequency code.

Wallace, Ron↗
DOE OSTI2024

Group-theoretic error mitigation enabled by classical shadows and symmetries

Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows , by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

Zhao, Andrew (ORCID:0000000202990277)↗
DOE OSTI2024

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗
DOE OSTI2021

Determining quantum phase diagrams of topological Kitaev-inspired models on NISQ quantum hardware

Topological protection is employed in fault-tolerant error correction and in developing quantum algorithms with topological qubits. But, topological protection intrinsic to models being simulated , also robustly protects calculations, even on NISQ hardware. We leverage it by simulating Kitaev-inspired models on IBM quantum computers and accurately determining their phase diagrams. This requires constructing conventional quantum circuits for Majorana braiding to prepare the ground states of Kitaev-inspired models. The entanglement entropy is then measured to calculate the quantum phase boundaries. We show how maintaining particle-hole symmetry when sampling through the Brillouin zone is critical to obtaining high accuracy. This work illustrates how topological protection intrinsic to a quantum model can be employed to perform robust calculations on NISQ hardware, when one measures the appropriate protected quantum properties. It opens the door for further simulation of topological quantum models on quantum hardware available today.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Automated quantum error mitigation based on probabilistic error reduction

Current quantum computers suffer from a level of noise that prohibits extracting useful results directly from longer computations. The figure of merit in many near-term quantum algorithms is an expectation value measured at the end of the computation, which experiences a bias in the presence of hardware noise. A systematic way to remove such bias is probabilistic error cancellation (PEC). PEC requires a full characterization of the noise and introduces a sampling overhead that increases exponentially with circuit depth, prohibiting high-depth circuits at realistic noise levels. Probabilistic error reduction (PER) is a related quantum error mitigation method that systematically reduces the sampling overhead at the cost of reintroducing bias. In combination with zero-noise extrapolation, PER can yield expectation values with an accuracy comparable to PEC.Noise reduction through PER is broadly applicable to near-term algorithms, and the automated implementation of PER is thus desirable for facilitating its widespread use. To this end, we present an automated quantum error mitigation software framework that includes noise tomography and application of PER to user-specified circuits. We provide a multi-platform Python package that implements a recently developed Pauli noise tomography (PNT) technique for learning a sparse Pauli noise model and exploits a Pauli noise scaling method to carry out PER.We also provide software tools that leverage a previously developed toolchain, employing PyGSTi for gate set tomography and providing a functionality to use the software Mitiq for PER and zero-noise extrapolation to obtain error-mitigated expectation values on a user-defined circuit.

McDonough, Benjamin↗