Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum computation theory”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Quantum computation of SU(2) lattice gauge theory with continuous variables

We present a quantum computational framework for pure SU(2) lattice gauge theory, using continuous variables instead of discrete qubits to represent the infinite-dimensional Hilbert space of the gauge fields. We consider a ladder as well as a two-dimensional grid of plaquettes, detailing the use of gauge fixing to reduce the degrees of freedom and simplify the Hamiltonian. We demonstrate how system dynamics, ground states, and energy gaps can be computed using the continuous-variable approach to quantum computing. Our results indicate that it is feasible to study non-Abelian gauge theories with continuous variables, providing new avenues for understanding the real-time dynamics of quantum field theories.

Gauge Symmetry↗
DOE OSTI2025

S-QGPU: Shared quantum gate processing unit for distributed quantum computing

We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and, thus, significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Our preliminary analysis and simulation show that S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits (also called data qubits) in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer

Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum graph learning and algorithms applied in quantum computer sciences and image classification

Graph and network theory play a fundamental role in quantum computer sciences, including quantum information and computation. Random graphs and complex network theory are pivotal in predicting novel quantum phenomena, where entangled links are represented by edges. Quantum algorithms have been developed to enhance solutions for various network problems, giving rise to quantum graph computing and quantum graph learning (QGL). Here, in this review, we explore graph theory and graph learning methods as powerful tools for quantum computers to generate efficient solutions to problems beyond the reach of classical systems. We delve into the development of quantum complex network theory and its applications in quantum computation, materials discovery, and research. We also discuss quantum machine learning (QML) methodologies for effective image classification using qubits, quantum gates, and quantum circuits. Additionally, the paper addresses the challenges of QGL and algorithms, emphasizing the steps needed to develop flexible QGL solvers. This review presents a comprehensive overview of the fields of QGL and QML, highlights recent advancements, and identifies opportunities for future research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Quantum computing universal thermalization dynamics in a (2 + 1)D Lattice Gauge Theory

Simulating non-equilibrium phenomena in strongly-interacting quantum many-body systems, including thermalization, is a promising application of near-term and future quantum computation. By performing experiments on a digital quantum computer consisting of fully-connected optically-controlled trapped ions, we study the role of entanglement in the thermalization dynamics of a Z 2 lattice gauge theory in 2+1 spacetime dimensions. Using randomized-measurement protocols, we efficiently learn a classical approximation of non-equilibrium states that yields the gap-ratio distribution and the spectral form factor of the entanglement Hamiltonian. These observables exhibit universal early-time signals for quantum chaos, a prerequisite for thermalization. Our work, therefore, establishes quantum computers as robust tools for studying universal features of thermalization in complex many-body systems, including in gauge theories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum state preparation with resolution refinement

We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then lifted to higher resolution and adiabatically evolved to produce the corresponding eigenstate of a higher-fidelity Hamiltonian. We give examples of resolution refinement applied to both single-particle basis states as well as a spatial lattice grid. For basis refinement, we compute few-body ground states of the Busch model for interacting particles in a harmonic trap in one dimension. For lattice refinement, we compute Hartree-Fock nuclear states for a central Woods-Saxon potential in three dimensions, and we compute bound states and continuum states in a multi-species Hubbard model of fermions in one dimension. In all cases, the method is efficient and requires an adiabatic evolution time that scales with the inverse of the energy gap times the square root of the system size. We show that this very favorable scaling arises from the fact that resolution refinement does not make large changes to the structure or energies of the low-energy eigenstates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Systematic input scheme for many-boson Hamiltonians with applications to the two-dimensional 𝜙 4 theory

We develop a novel, systematic input scheme for many-boson Hamiltonians in order to solve field theory problems within the light-front Hamiltonian formalism via quantum computing. We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional ϕ 4 theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We squeeze the boson operators of each mode and present the Hamiltonian in terms of unique combinations of the squeezed-boson operators. We design the circuit modules for these unique combinations. Based on these circuit modules, we block encode the many-boson Hamiltonian utilizing the idea of quantum walk. For demonstration purposes, we present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm based on our input scheme, where the quantum computations are performed with the IBM Qiskit quantum simulator. The results of the hybrid calculations agree with exact results. Here, we can incorporate the input scheme in this work with the input scheme for many-fermion Hamiltonians; they jointly offer new pathways to solving the structure and dynamics of more general field theory problems on future fault-tolerant quantum computers.

Ab initio calculations↗
DOE OSTI2025

State preparation of lattice field theories using quantum optimal control

Here, we explore the application of quantum optimal control (QOC) techniques to state preparation of lattice field theories on quantum computers. As a first example, we focus on the Schwinger model, quantum electrodynamics in 1+1 dimensions. We demonstrate that QOC can significantly speed up the ground state preparation compared to gate-based methods, even for models with long-range interactions. Using classical simulations, we explore the dependence on the interqubit coupling strength and the device connectivity, and we study the optimization in the presence of noise. While our simulations indicate potential speedups, the results strongly depend on the device specifications. In addition, we perform exploratory studies on the preparation of thermal states. Our results motivate further studies of QOC techniques in the context of quantum simulations for fundamental physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Surrogate-constructed scalable-circuits adaptive variational quantum eigensolver in the Schwinger model

Inspired by recent advancements in simulating periodic systems on quantum computers, we develop an approach to further advance the simulation of these systems, named (SC) 2 -ADAPT-VQE. Our approach extends the scalable-circuits ADAPT-VQE framework, which builds an ansatz from a pool of coordinate-invariant operators defined for arbitrarily large, though not arbitrarily small, volumes. Our method uses a classically tractable “surrogate constructed” method to remove irrelevant operators from the pool, reducing the minimum size for which the scalable circuits are defined. Bringing together the scalable circuits and the surrogate constructed approaches forms the core of the (SC) 2 methodology. Our approach allows for a wider set of classical computations on small volumes, which can be used for a more robust extrapolation protocol. While developed in the context of lattice models, the surrogate construction portion is applicable to a wide variety of problems where information about the relative importance of operators in the pool is available. As an example, we use it to compute the properties of the Schwinger model—quantum electrodynamics for a single, massive fermion in 1 +1 dimensions—and show that our method can be used to accurately extrapolate to the continuum limit.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Testing Classical Properties from Quantum Data

Many properties of Boolean functions can be tested far more efficiently than the function itself can be learned. However, this dramatic advantage often disappears when testers are limited to random samples of ƒ instead of adaptively chosen queries to f. In this work we investigate the quantum version of this restriction: quantum algorithms that test properties of a Boolean function f solely from copies of either the function state |ƒ⟩ ∝ ∑ x |x, ƒ(x)⟩ or the phase state |(-1) ƒ ⟩ ∝ ∑ x (-1) ƒ(x) |x⟩. For monotonicity, symmetry, and triangle-freeness, we show passive quantum testers are unboundedly or super-polynomially better than their classical passive testing counterparts. They are competitive with classic query -based testers in each case. Our new testers use techniques beyond quantum Fourier sampling, and it turns out this is necessary: we show a certain class of bent functions can be tested from 𝒪(1) function states but has a sample complexity lower bound of 2 Ω(n) for any tester relying exclusively on Fourier and classical samples. Our passive quantum testers are competitive with classical query -based testers, but this isn't universal: we exhibit a testing problem that can be solved from 𝒪(1) classical queries but requires Ω(2 n/2 ) function state copies. The Forrelation problem provides a separation of the same magnitude in the opposite direction, so we conclude that quantum data and classical queries are "maximally incomparable" resources for testing. We also begin the study of lower bounds for testing from quantum data. For quantum monotonicity testing, we prove that the ensembles of [Goldreich et al., 2000; Black, 2024], which give exponential lower bounds for classical sample-based testing, do not yield any nontrivial lower bounds for testing from quantum data. New insights specific to quantum data will be required for proving copy complexity lower bounds for testing in this model.

Boolean Functions↗
DOE OSTI2026

Toward the “platinum standard” of quantum chemistry on quantum computers: Perturbative quadruple corrections in unitary coupled cluster theory

We propose a non-iterative, post-hoc correction to the unitary coupled cluster theory with the single, double, and triple excitations (UCCSDT) Ansatz, which considers the leading-order effects of neglected quadruple excitations. We present two ways to derive this correction, henceforth referred to as [Q-6], which leads to an improvement in the correlation energy shown to be truncated to sixth-order in many-body perturbation theory. Furthermore, a comparison between the UCC-based [Q-6] correction proposed in this work and analogous, “platinum standard” quadruple corrections proposed in conventional coupled cluster theory recognizes that [Q-6] is distinct from prior corrections since it is constructed entirely from internally connected components. Although trotterized (t) and full operator variants of UCCSDT exhibit errors in scans of small molecule potential energy surfaces that routinely exceed 1.6 mH, we find that t/UCCSDT[Q-6] is, nevertheless, able to achieve chemical accuracy as measured by the mean unsigned error.

Correlation energy↗
DOE OSTI2025

Hybrid quantum simulations with qubits and qumodes on trapped-ion platforms

We explore the feasibility of gate-based hybrid quantum computing using both discrete (qubit) and continuous (qumode) variables on trapped-ion platforms. Trapped-ion systems have demonstrated record one- and two-qubit gate fidelities and long qubit coherence times, while qumodes, which can be represented by the collective vibrational modes of the ion chain, have remained relatively unex- plored for their use in computing. Using numerical simulations, we show that high-fidelity hybrid gates and measurement operations can be achieved for existing trapped-ion quantum platforms. As an exemplary application, we consider quantum simulations of the Jaynes-Cummings-Hubbard model, which is given by a one-dimensional chain of interacting spin and boson degrees of free- dom. Using classical simulations, we study its real-time evolution and develop a suitable variational quantum algorithm for ground state preparation. Furthermore, our results motivate further studies of hybrid quantum computing in this context, which may lead to direct applications in condensed matter and fundamental particle and nuclear physics.

Lower-dimensional field theories↗
DOE OSTI2025

Quantum computing for energy correlators

In recent years, energy correlators have emerged as powerful observables for probing the fragmentation dynamics of high-energy collisions. We introduce the first numerical strategy for calculating energy correlators using the Hamiltonian lattice approach, providing access to the intriguing nonperturbative dynamics of these observables. Furthermore, motivated by rapid advances in quantum computing hardware and algorithms, we propose a quantum algorithm for calculating energy correlators in quantum field theories. This algorithm includes ground state preparation, the application of source, sink, energy flux and real-time evolution operators, and the Hadamard test. We validate our approach by applying it to the SU(2) pure gauge theory in 2 + 1 dimensions on 3 × 3 and 5 × 5 honeycomb lattices with 𝑗 max = $\frac{1}{2}$ at various couplings, utilizing both classical methods and the quantum algorithm, the latter tested using the IBM emulator for specific configurations. The results are consistent with the expected behavior of the strong coupling regime and motivate a more comprehensive study to probe the confinement dynamics across the weak and strong coupling regimes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Electronic structure theory with molecular point group symmetries on quantum annealers

Quantum computation has the potential to revolutionize quantum chemistry through major speedups in computation times and an exponential reduction in computational resources. Here, we combine the symmetry-adapted Jordan–Wigner encoding based on the full Boolean symmetry group $\mathbb{Z}$$^{k}_{2}$ with our new implementation of the Xia–Bian–Kais (XBK) method for improving the efficiency of electronic structure theory calculations on quantum annealers, particularly by reducing the number of qubits needed to achieve the same accuracy. By providing a more extensive symmetry-adapted encoding (SAE) than previous work, we are able to simulate molecules larger than those previously reported that have been studied using methods developed for quantum annealers and without using an active space. We calculated the potential energy surfaces of H 2 , LiH, He 2 , H 2 O, O 2 , N 2 , Li 2 , F 2 , CO, BH 3 , NH 3 , and CH 4 , with the largest molecule in the STO-6G basis set requiring 16 qubits with our SAE, and compared them with full configuration interaction results. The application of SAE to the XBK method provides an exponential reduction in the size of the Hilbert space and scales well with the size of the problem. It does not introduce significant additional errors for even or large values of a key variational parameter that determines the number of ancilla qubits used in the XBK method’s Hamiltonian embedding, or for certain molecules such as He 2 and H 2 O. Here, we provide an explanation for this behavior and a recommendation on the usage of our method. In addition, we briefly discuss the potential of extracting electronic excited states from our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories

We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve these improvements through two optimizations. First, we consider a finite volume approach for estimating the elements of the S-matrix. This approach is appropriate in general for 1+1D and for certain low-energy elastic collisions in higher dimensions. Second, we implement our approach using a series of different fault-tolerant simulation algorithms for Hamiltonians formulated both in the field occupation basis and field amplitude basis. Our algorithms are based on either second-order Trotterization or qubitization. The cost of Trotterization in occupation basis scales as O ( λ N 7 | Ω | 3 / ( M 5 / 2 ϵ 3 / 2 ) ) where λ is the coupling strength, N is the occupation cutoff, | Ω | is the volume of the spatial lattice, M is the mass of the particles and ϵ is the uncertainty in the energy calculation used for the S -matrix determination. Qubitization in the field basis scales as O ( | Ω | 2 ( k 2 Λ + k M 2 ) / ϵ ) , where k is the cutoff in the field and Λ is a scaled coupling constant. We find in both cases that the bounds suggest physically meaningful simulations can be performed using on the order of 4 × 10 6 physical qubits and 10 12 T -gates which corresponds to roughly one day on a superconducting quantum computer with surface code and a cycle time of 100 ns. This places the simulation of scalar field theory within striking distance of the gate counts for the best available chemistry simulation results.

Hardy, Andrew [Toronto U.] (ORCID:0000000235817382↗
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

Qubit Regularization of Quantum Field Theories

To study quantum field theories on a quantum computer, we must begin with Hamiltonians defined on a finite-dimensional Hilbert space and then take appropriate limits. This approach can be seen as a new type of regularization for quantum field theories, which we refer to as qubit regularization. A related finite-dimensional regularization, known as the D-theory approach, was proposed long ago as a general framework for all quantum field theories. In this framework, the dimensionality of the local Hilbert space at each spatial point can increase as needed through an additional flavor index. To reproduce asymptotically free QFTs, most studies assume that qubit-regularized theories require extending the local Hilbert space to infinity. However, contrary to this common belief, recent discoveries in (1+1) dimensions have revealed two examples where asymptotic freedom appears to emerge within a strictly finite-dimensional local Hilbert space through a novel renormalization group (RG) flow. These findings motivate further investigation into whether asymptotically free gauge theories could also emerge within a strictly finite-dimensional local Hilbert space. To support these explorations, we propose an orthonormal basis called the monomer-dimer-tensor-network (MDTN) basis and use it to construct new types of qubit-regularized lattice gauge theories.

Chandrasekharan, Shailesh [Duke Univ., Durham, NC ↗
DOE OSTI2025

Quantum computation of mass gap in an asymptotically free theory

In relativistic field theories, the mass spectrum is given by the difference between the energy of the vacuum and the excited states. Near the continuum limit, the cancellation between these two values leads to loss of precision. We propose a method to extract the mass gap directly using quantum computers and apply it to a particular version of the nonlinear $σ$-model with the correct continuum limit and perform calculations in quantum hardware (at strong coupling) and simulation in classical computers (at weak coupling).

Bedaque, Paulo F. [Maryland U.] (ORCID:00000001521↗