Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “unitary transformation”

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 91 records · Page 5

Strategies for simulating the time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian H requires developing algorithms for implementing the unitary operator e -iHt . A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian lattice field theories. Using the scalar $\hat{φ}$ 4 theory as a test, we also perform numerical studies and compare the gate costs required by product formulas and signal-processing-based techniques to simulate time evolution. For the latter, we use the linear combination of unitaries (LCU) construction augmented with the quantum Fourier transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. Further, this paper also includes a pedagogical review of the techniques used, in particular product formulas, LCU, qubitization, quantum signal processing, as well as the technique for simulating geometrically-local Hamiltonians developed by Haah, Hastings, Kothari, and Low.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Covariant harmonic oscillators: 1973 revisited

Using the relativistic harmonic oscillator, a physical basis is given to the phenomenological wave function of Yukawa which is covariant and normalizable. It is shown that this wave function can be interpreted in terms of the unitary irreducible representations of the Poincare group. The transformation properties of these covariant wave functions are also demonstrated.

Noz, M. E.↗

Scalable Implementation of Mean-Field and Correlation Methods Based on Lie-Algebraic Similarity Transformation of Spin Hamiltonians in the Jordan–Wigner Representation

Recent work has highlighted that the strong correlation inherent in spin Hamiltonians can be effectively reduced by mapping spins to Fermions via the Jordan−Wigner transformation (JW). The Hartree−Fock method is straightforward in the Fermionic domain and may provide a reasonable approximation to the ground state. Correlation with respect to the Fermionic mean field can be recovered based on Lie-algebraic similarity transformation (LAST) with two-body correlators. Specifically, a unitary LAST variant eliminates the dependence on site ordering, while a nonunitary LAST yields size-extensive correlation energies. Whereas the first recent demonstration of such methods was restricted to small spin systems, we present efficient implementations using analytical gradients for the optimization with respect to the mean-field reference and the LAST parameters, thereby enabling the treatment of larger clusters, including systems with local spins s > $\frac{1}{2}$.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulation of Molecular Electronic States with a Transcorrelated Hamiltonian: Higher Accuracy with Fewer Qubits

Simulation of electronic structure is one of the most promising applications on noisy intermediate-scale quantum (NISQ) era devices. However, NISQ devices suffer from a number of challenges like limited qubit connectivity, short coherence times, and sizable gate error rates. Thus, desired quantum algorithms should require shallow circuit depths and low qubit counts to take advantage of these devices. Here, we attempt to reduce quantum resource requirements for molecular simulations on a quantum computer while maintaining the desired accuracy with the help of classical quantum chemical theories of canonical transformation and explicit correlation. In this work, compact ab initio Hamiltonians are generated classically, in the second quantized form, through an approximate similarity transformation of the Hamiltonian with (a) an explicitly correlated two-body unitary operator with generalized pair excitations that remove the Coulombic electron–electron singularities from the Hamiltonian and (b) a unitary one-body operator to efficiently capture the orbital relaxation effects required for accurate description of the excited states. The resulting transcorrelated Hamiltonians are able to describe both the ground and the excited states of molecular systems in a balanced manner. Using the variational quantum eigensolver (VQE) method based on the unitary coupled cluster with singles and doubles (UCCSD) ansatz and only a minimal basis set (ANO-RCC-MB), we demonstrate that the transcorrelated Hamiltonians can produce ground state energies comparable to the reference CCSD energies with the much larger cc-pVTZ basis set. This leads to a reduction in the number of required CNOT gates by more than 3 orders of magnitude for the chemical species studied in this work. Furthermore, using the quantum equation of motion (qEOM) formalism in conjunction with the transcorrelated Hamiltonian, we are able to reduce the deviations in the excitation energies from the reference EOM-CCSD/cc-pVTZ values by an order of magnitude. In conclusion, the transcorrelated Hamiltonians developed here are Hermitian and contain only one- and two-body interaction terms and thus can be easily combined with any quantum algorithm for accurate electronic structure simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Standard versus non-standard CP phases in neutrino oscillation in matter with non-unitarity

We formulate a perturbative framework for the flavor transformation of the standard active three neutrinos but with a non-unitary flavor mixing matrix, a system which may be relevant for the leptonic unitarity test. We use the $\alpha$ parametrization of the non-unitary matrix and take its elements $\alpha_{\beta \gamma}$ ($\beta,\gamma = e,\mu,\tau$) and the ratio $\epsilon \simeq \Delta m^2_{21} / \Delta m^2_{31}$ as the small expansion parameters. Two qualitatively new features that hold in all the oscillation channels are uncovered in the probability formula obtained to first order in the expansion: (1) The phases of the complex $\alpha$ elements always come into the observable in the particular combination with the $\nu$SM CP phase $\delta$ in the form $[e^{- i \delta } \bar{\alpha}_{\mu e}, ~e^{ - i \delta} \bar{\alpha}_{\tau e}, ~\bar{\alpha}_{\tau \mu}]$ under the Particle Data Group convention of a unitary $\nu$SM mixing matrix. (2) The diagonal $\alpha$ parameters appear in particular combinations $\left( a/b - 1 \right) \alpha_{ee} + \alpha_{\mu \mu}$ and $\alpha_{\mu \mu} - \alpha_{\tau \tau}$, where $a$ and $b$ denote, respectively, the matter potential due to charged current and neutral current reactions. This property holds only in the unitary evolution part of the probability, and there is no such feature in the genuine non-unitary part, while the $\delta$–$\alpha$ parameter phase correlation exists for both. The reason for such remarkable stability of the phase correlation is discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Determining The Degree Of Graphitization In Carbon Composites

Method for determining degree of graphitization of carbon/carbon composite material combines infrared spectral experimental technique with thermodynamical theoretical model of solubility. By interrupting manufacturing process at almost any time and applying method, one can judge quality of composite and monitor chemical transformations taking place during process. Also computes effective solubility parameter for composite considered as unitary material. Parameter significant for subsequent fabrication steps involving chemical treatments; e.g., coating or joining with adhesives.

Lawson, Daniel D.↗

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗

Paradigm for universal quantum information processing with integrated acousto-optic frequency beamsplitters

Frequency-bin encoding offers tremendous potential in quantum photonic information processing, in which a single waveguide can support hundreds of lightpaths in a naturally phase-stable fashion. This stability, however, comes at a cost: arbitrary unitary operations can be realized by cascaded electro-optic phase modulators and pulse shapers, but require nontrivial numerical optimization for design and have thus far been limited to discrete tabletop components. In this article, we propose, formalize, and computationally evaluate a new paradigm for universal frequency-bin quantum information processing using acousto-optic scattering processes between distinct transverse modes. We show that controllable phase matching in intermodal processes enables 2 × 2 frequency beamsplitters and transverse-mode-dependent phase shifters, which together comprise cascadable FRequency-transverse-mODe Operations (FRODOs) that can synthesize any unitary via analytical decomposition procedures. Modeling the performance of both random gates and discrete Fourier transforms, we demonstrate the feasibility of high-fidelity quantum operations with existing integrated photonics technology, highlighting prospects of parallelizable operations achieving 100% bandwidth utilization. Our approach is realizable with CMOS technology, opening the door to scalable on-chip quantum information processing in the frequency domain.

Lukens, Joseph M. [Purdue Univ., West Lafayette, I↗

Exact relationships between the GW approximation and equation-of-motion coupled-cluster theories through the quasi-boson formalism

We describe the relationship between the GW approximation and various equation-of-motion (EOM) coupled-cluster (CC) theories. We demonstrate the exact equivalence of the G0W0 approximation and the propagator theory for an electron–boson problem in a particular excitation basis. From there, we establish equivalence within the quasi-boson picture to the IP+EA-EOM unitary CC propagator. We analyze the incomplete description of screening provided by the standard similarity-transformed IP+EA-EOM-CC and the recently introduced G0W0 Tamm–Dancoff approximation. We further consider the approximate decoupling of IP and EA sectors in EOM-CC treatments and devise the analogous particle–hole decoupling approach for the G0W0 approximation. Finally, we numerically demonstrate the exact relationships and magnitude of the approximations in the calculations of a set of molecular ionization potentials and electron affinities.

Chemistry↗

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↗

MoS 2 Catalysts Selectively Achieve High Yield of Liquid Oxygenate from Direct Conversion of Methane via Hydroxyl Radicals

Directly converting methane (CH 4 ) into liquid oxygenates (e.g., methanol) can circumvent the cost and engineering limits of natural gas transportation and storage. However, oxygenate yields from CH 4 remain low, and sulfur present in natural gas hinders activity in most catalysts. Here, to overcome these barriers, we employ bulk molybdenum disulfide (MoS 2 ), a low-cost, robust catalyst which selectively produces large quantities of liquid oxygenates (>900 µmol/g cat ∙hr) from methane in the presence of hydroxyl (OH • ) radicals produced from dilute hydrogen peroxide (H 2 O 2 ) at 75°C. Under realistic reaction conditions, MoS 2 partially and reversibly adopts a metastable, more electrically conductive phase (1T’) that can only be observed through in situ structural probes. Herein, we elucidate that redox synergy between H 2 O 2 and MoS 2 produces active OH • radical species that selectively transform CH 4 to surface methoxy species at the gas-solid liquid interface, leading to the unitary production of liquid oxygenate at a rate competitive with more costly precious metal catalysts, without additional catalyst preparation steps.

36 MATERIALS SCIENCE↗

Comparing light-front quantization with instant-time quantization

Here in this paper we compare light-front quantization and instant-time quantization both at the level of operators and at the level of their Feynman diagram matrix elements. At the level of operators light-front quantization and instant-time quantization lead to equal light-front time commutation (or anticommutation) relations that appear to be quite different from equal instant-time commutation (or anticommutation) relations. Despite this we show that at unequal times instant-time and light-front commutation (or anticommutation) relations actually can be transformed into each other, with it only being the restriction to equal times that makes the commutation (or anticommutation) relations appear to be so different. While our results are valid for both bosons and fermions, for fermions there are subtleties associated with tip of the light cone contributions that need to be taken care of. At the level of Feynman diagrams we show for non-vacuum Feynman diagrams that the pole terms in four-dimensional light-front Feynman diagrams reproduce the widely used three-dimensional light-front on-shell Hamiltonian Fock space formulation in which the light-front energy and light-front momentum are on shell. Moreover, we show that the contributions of pole terms in non-vacuum instant-time and non-vacuum light-front Feynman diagrams are equal. However, because of circle at infinity contributions we show that this equivalence of pole terms fails for four-dimensional light-front vacuum tadpole diagrams. Then, and precisely because of these circle at infinity contributions, we show that light-front vacuum tadpole diagrams are not only nonzero, they quite remarkably are actually equal to the pure pole term instant-time vacuum tadpole diagrams. Light-front vacuum diagrams are not correctly describable by the on-shell Hamiltonian formalism, and thus not by the closely related infinite momentum frame prescription either. Thus for the light-front vacuum sector we must use the off-shell Feynman formalism as it contains information that is not accessible in the on-shell Hamiltonian Fock space approach. We show that light-front quantization is intrinsically nonlocal, and that for fermions this nonlocality is present in Ward identities. One can project fermion spinors into so-called good and bad components, and both of these components contribute in Ward identities. Central to our analysis is that the transformation from instant-time coordinates and fields to light-front coordinates and fields is a unitary, spacetime-dependent translation. Consequently, not only are instant-time quantization and light-front quantization equivalent, because of general coordinate invariance they are unitarily equivalent.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advanced vehicle separation apparatus

A method of obtaining test data from two independent models or bodies in a conventional wind tunnel is described. The system makes efficient use of wind tunnel test time with computer control performing complex coordinate transformations necessary for model positioning. The apparatus is designed to be used in any of the three Unitary Wind Tunnels at NASA-Ames Research Center. Mechanical design details and a brief description of the control system for the separation apparatus are presented.

Ospring, M. J.↗

Variational Adiabatic Gauge Transformation on Real Quantum Hardware for Effective Low-Energy Hamiltonians and Accurate Diagonalization

Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a nonperturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized via a shallow quantum circuit, then VAGT can learn the optimal parameters using a polynomial number of runs. The accuracy of VAGT is tested through numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the 𝑋⁢𝑍 and transverse Ising model, respectively. For 𝐴 qubits BRGC yields 2 𝐴 positions and is reduced to its 2-local form with O⁡(𝐴) ancillary qubits. H2GC yields 2 𝐴/2+1 positions with O⁡(𝐴 2 ) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of 𝑘 -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.

97 MATHEMATICS AND COMPUTING↗

Simulating nonlinear optical processes on a superconducting quantum device

Simulating plasma physics on quantum computers is difficult because most problems of interest are nonlinear, but quantum computers are not naturally suitable for nonlinear operations. In weakly nonlinear regimes, plasma problems can be modelled as wave–wave interactions. In this paper, we develop a quantization approach to convert nonlinear wave–wave interaction problems to Hamiltonian simulation problems. We demonstrate our approach using two qubits on a superconducting device. Unlike a photonic device, a superconducting device does not naturally have the desired interactions in its native Hamiltonian. Nevertheless, Hamiltonian simulations can still be performed by decomposing required unitary operations into native gates. To improve experimental results, we employ a range of error-mitigation techniques. Apart from readout error mitigation, we use randomized compilation to transform undiagnosed coherent errors into well-behaved stochastic Pauli channels. Moreover, to compensate for stochastic noise, we rescale exponentially decaying probability amplitudes using rates measured from cycle benchmarking. We carefully consider how different choices of product-formula algorithms affect the overall error and show how a trade-off can be made to best utilize limited quantum resources. This study provides an example of how plasma problems may be solved on near-term quantum computing platforms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗