Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate Quantum Fourier Transform”

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 OSTI2022

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

QuanSimBench

QuanSimBench is a software program that performs a gate-by-gate simulation of a quantum computer with a full state vector formulation. It simulates a simplified version of Shor's algorithm with increasing number of qubits until resources are exhausted. The score (states/s) is how fast the Approximate Quantum Fourier Transform can be computed (the modular exponentiation is not timed). The goal is to quantify the ability of a computer to simulate ideal quantum circuits.

Pakin, Scott↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum stress and torsion distributions in the deuteron

Stress distributions in the deuteron are related to form factors of the asymmetric energy-momentum tensor through three-dimensional Fourier transforms. There are eleven such form factors, which we calculate in an impulse approximation. We compare the obtained form factors to prior results for the six form factors that have been previously calculated. We then elaborate on the formalism for relating the form factors to internal distributions of mass, mass flux, momentum, stresses, and forces, and obtain results for all of these distributions. We obtain the principal stresses for the symmetric part of the stress tensor, and show that the antisymmetric part describes the reorientation of fermion spin by torsion stress when the nucleon moves between the S and D waves. Force distributions in the nucleons depend on the so-called nonconserved form factors through the Cauchy momentum equation, and are nonradial owing to the presence of tensor forces and spin-orbit coupling.

QCD phenomenology↗
DOE OSTI2022

Effective Model for Fractional Topological Corner Modes in Quasicrystals

High-order topological insulators (HOTIs), as generalized from topological crystalline insulators, are characterized with lower-dimensional metallic boundary states protected by spatial symmetries of a crystal, whose theoretical framework based on band inversion at special k points cannot be readily extended to quasicrystals because quasicrystals contain rotational symmetries that are not compatible with crystals, and momentum is no longer a good quantum number. In this work, we develop a low-energy effective model underlying HOTI states in 2D quasicrystals for all possible rotational symmetries. By implementing a novel Fourier transform developed recently for quasicrystals and approximating the long-wavelength behavior by their large-scale average, we construct an effective k · p Hamiltonian to capture the band inversion at the center of a pseudo-Brillouin zone. We show that an in-plane Zeeman field can induce mass kinks at the intersection of adjacent edges of a 2D quasicrystal topological insulators and generate corner modes (CMs) with fractional charge, protected by rotational symmetries. Our model predictions are confirmed by numerical tight-binding calculations. Furthermore, when the quasicrystal is proximitized by an s-wave superconductor, Majorana CMs can also be created by tuning the field strength and chemical potential. Our work affords a generic approach to studying the low-energy physics of quasicrystals, in association with topological excitations and fractional statistics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Primitive quantum gates for dihedral gauge theories

We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete gauge group $D_N$-- the dihedral group -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice gauge theory. In order to carry out such a lattice simulation, we detail the construction of efficient quantum circuits to realize basic primitives including the nonabelian Fourier transform over $D_N$, the trace operation, and the group multiplication and inversion operations. For each case the required quantum resources scale linearly or as low-degree polynomials in $n=\log N$. We experimentally benchmark our gates on the Rigetti Aspen-9 quantum processor for the case of $D_4$. The fidelity of all $D_4$ gates was found to exceed $80\%$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Primitive quantum gates for an S U ( 2 ) discrete subgroup: Binary tetrahedral

We construct a primitive gate set for the digital quantum simulation of the binary tetrahedral ($\mathbb{BT}$) group on two quantum architectures. This nonabelian discrete group serves as a crude approximation to $SU(2)$ lattice gauge theory while requiring five qubits or one quicosotetrit per gauge link. The necessary basic primitives are the inversion gate, the group multiplication gate, the trace gate, and the $\mathbb{BT}$ Fourier transform over $\mathbb{BT}$. We experimentally benchmark the inversion and trace gates on ibm nairobi, with estimated fidelities between $14-55\%$, depending on the input state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Quasiparton distributions in massive QED2: Toward quantum computation

We analyze the quasiparton distributions of the lightest 𝜂′ meson in massive two-dimensional quantum electrodynamics (QED2) by exact diagonalization. The Hamiltonian and boost operators are mapped onto spin qubits in a spatial lattice with open boundary conditions. The lowest excited state in the exact diagonalization is shown to interpolate continuously between an anomalous 𝜂′ state at strong coupling, and a nonanomalous heavy meson at weak coupling, with a cusp at the critical point. The boosted 𝜂′ state follows relativistic kinematics but with large deviations in the luminal limit. The spatial quasiparton distribution function and amplitude for the 𝜂′ state are computed numerically for increasing rapidity both at strong and weak coupling, and compared to the exact light front results. The numerical results from the boosted form of the spatial parton distributions, compare fairly with the inverse Fourier transformation of the luminal parton distributions, derived in the lowest Fock space approximation. Our analysis points out some of the limitations facing the current lattice program for the parton distributions.

Lattice field theory↗
DOE OSTI2024

Primitive quantum gates for an S U ( 2 ) discrete subgroup: Binary octahedral

We construct a primitive gate set for the digital quantum simulation of the 48-element binary octahedral ( BO ) group. This non-Abelian discrete group better approximates S U ( 2 ) lattice gauge theory than previous work on the binary tetrahedral group at the cost of one additional qubit—for a total of six—per gauge link. The necessary primitives are the inversion gate, the group multiplication gate, the trace gate, and the BO Fourier transform. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Quantum Hamilton-Jacobi theory, spectral path integrals, and exact WKB analysis

We propose a new way to perform path integrals in quantum mechanics by using a quantum version of Hamilton-Jacobi (HJ) theory. In classical mechanics, Hamilton-Jacobi theory is a powerful formalism, however, its utility is not explored in quantum theory beyond approximation schemes. The canonical transformation enables one to set the new Hamiltonian to constant or zero, but keeps the information about solution in Hamilton’s characteristic function. To benefit from this in quantum theory, one must work with a formulation in which classical Hamiltonian is used. This uniquely points to phase space path integral. However, the main variable in HJ formalism is energy, not time. Thus, we are led to consider the Fourier transform of the path integral, the spectral path integral Z ˜ ( E ) . The evaluation of path integrals reduces to determining the quantum Hamilton characteristic functions (which can be achieved via an asymptotic analysis) and a discrete sum over the quantum period lattice, generalizing Gutzwiller’s sum. Published by the American Physical Society 2025

Türe, Mustafa (ORCID:0009000975968618)↗
DOE OSTI2022

Bosonic field digitization for quantum computers

Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size Φ 4 problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. Finally, we develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2007

Experimental Air-Broadened Line Parameters in the nu2 Band of CH3D

In this study we report the first experimental measurements of air-broadening and air-induced pressure-shift coefficients for approximately 378 transitions in the nu2 fundamental band of CH3D. These results were obtained from analysis of 17 room temperature laboratory absorption spectra recorded at 0.0056 cm(exp -1) resolution using the McMath-Pierce Fourier transform spectrometer located on Kitt Peak, Arizona. Three absorption cells with path lengths of 10.2, 25 and 150 cm were used to record the spectra. The total sample pressures ranged from 0.129x10(exp -2) to 52.855x10(exp -2) atm with CH3D volume mixing ratios of approximately 0.0109 in air. The spectra were analyzed using a multispectrum non-linear least-squares fitting technique. We report measurements for air pressure-broadening coefficients for transitions with quantum numbers as high as J" = 20 and K = 15, where K" = K' equivalent to K (for a parallel band). The measured air broadening coefficients range from 0.0205 to 0.0835 cm(exp -1) atm(exp -1) at 296 K. All the measured pressure-shift coefficients are negative and are found to vary from about -0.0005 to -0.0080 cm(exp -1) atm(exp -1) at the temperature of the spectra. We have examined the dependence of the measured broadening and shift parameters on the J" and K quantum numbers and also developed empirical expressions to describe the broadening coefficients in terms of m (m = -J", J" and J" + 1 in the (sup Q)P- (sup Q)Q-, and (sup Q)R-branch, respectively) and K. On average, the empirical expressions reproduce the measured broadening coefficients to within 4.4%.

Cross, Adriana Predoi↗
DOE OSTI2022

Direct measurement of storage and loss behavior in AFM force–distance experiments using the modified Fourier transformation

Force–distance curve experiments are commonly performed in atomic force microscopy (AFM) to obtain the viscoelastic characteristics of materials, such as the storage and loss moduli or compliances. The classic methods used to obtain these characteristics consist of fitting a viscoelastic material model to the experimentally obtained AFM data. Here, we demonstrate a new method that utilizes the modified discrete Fourier transform to approximate the storage and loss behavior of a material directly from the data, without the need for a fit. Additionally, one may still fit a model to the resulting storage and loss behavior if a parameterized description of the material is desired. In contrast to fitting the data to a model chosen a priori, departing from a model-free description of the material's frequency behavior guides the selection of the model, such that the user may choose the one that is most appropriate for the particular material under study. To this end, we also include modified Fourier domain descriptions of commonly used viscoelastic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Capturing Deuteration Effects in a Molecular Mechanics Force Field: Deuterated THF and the THF–Water Miscibility Gap

Deuteration is a common chemical modification used in conjunction with experiments such as neutron scattering, NMR, and Fourier-transform infrared for the study of molecular systems. Under the Born–Oppenheimer (BO) approximation, while the underlying potential energy surface remains unchanged by isotopic substitutions, isotopic substitution still alters intramolecular vibrations, which in turn may alter intermolecular interactions. Molecular mechanics (MM) force fields used in classical molecular dynamics simulations are assumed to represent local approximations of the BO potential energy surfaces, and hence, MD simulations using simple isotopic mass substitutions should capture BO-compatible isotope effects. However, standard MM force-field parameterizations do not directly fit to the local harmonic quantum mechanical (QM) Hessian that describes the BO surface, but rather to QM normal-modes and/or mass-dependent internal-coordinate derived distortion energies. In this study, using tetrahydrofuran (THF)–water mixtures as our model system, we show that not only does a simple mass-substitution approach fail to capture an experimentally characterized deuteration effect (the loss of the closed-loop miscibility gap associated with the complete deuteration of THF) but also it is necessary to generate new MM force-field parameters that correctly describe isotopic dependent vibrations to capture the experimental deuteration effect. We show that the origin of this failure is a result of using mass-dependent features to fit the THF MM force field, which unintentionally biases the bonded terms of the force field to represent only the isotopologue used during the original force-field parameterization. In addition, we make use of our isotopologue-corrected force field for D 8 THF to examine the molecular origins of the isotope-dependent loss of the THF–water miscibility gap.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗