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 55 records · Page 3

Solving reaction dynamics with quantum computing algorithms

The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. However, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. Here, in this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Time-Frequency Warped Waveforms for Well-Contained Massive Machine Type Communications

Herein this paper proposes a novel time-frequency warped waveform for short symbols, massive machine-type communication (mMTC), and internet of things (IoT) applications. The waveform is composed of asymmetric raised cosine (RC) pulses to increase the signal containment in time and frequency domains. The waveform has low power tails in the time domain, hence better performance in the presence of delay spread and time offsets. The time-axis warping unitary transform is applied to control the waveform occupancy in time-frequency space and to compensate for the usage of high roll-off factor pulses at the symbol edges. The paper explains a step-by-step analysis for determining the roll-off factors profile and the warping functions. Gains are presented over the conventional Zero-tail Discrete Fourier Transform-spread-Orthogonal Frequency Division Multiplexing (ZT-DFT-s-OFDM), and Cyclic prefix (CP) DFT-s-OFDM schemes in the simulations section.

42 ENGINEERING↗

Fractional Statistics

The quantum-mechanical description of assemblies of particles whose motion is confined to two (or one) spatial dimensions offers many possibilities that are distinct from bosons and fermions. We call such particles anyons. The simplest anyons are parameterized by an angular phase parameter θ. θ = 0, π correspond to bosons and fermions, respectively; at intermediate values, we say that we have fractional statistics. In two dimensions, θ describes the phase acquired by the wave function as two anyons wind around one another counterclockwise. It generates a shift in the allowed values for the relative angular momentum. Composites of localized electric charge and magnetic flux associated with an abelian U(1) gauge group realize this behavior. More complex charge-flux constructions can involve nonabelian and product groups acting on a spectrum of allowed charges and fluxes, giving rise to nonabelian and mutual statistics. Interchanges of nonabelian anyons implement unitary transformations of the wave function within an emergent space of internal states. Anyons of all kinds are described by quantum field theories that include Chern–Simons terms. The crossings of one-dimensional anyons on a ring are unidirectional, such that a fractional phase θ acquired upon interchange gives rise to fractional shifts in the relative momenta between the anyons. The quasiparticle excitations of fractional quantum Hall states have long been predicted to include anyons. Recently, the anyon behavior predicted for quasiparticles in the ν = 1/3 fractional quantum Hall state has been observed in both scattering and interferometric experiments. Excitations within designed systems, notably including superconducting circuits, can exhibit anyon behavior. Such systems are being developed for possible use in quantum information processing.

Physics↗

Quantum Control Landscapes Beyond the Dipole Approximation: Controllability, Singular Controls, and Resources

We investigate the control landscapes of closed n-level quantum systems beyond the dipole approximation by including a polarizability term in the Hamiltonian. The latter term is quadratic in the control field. Theoretical analysis of singular controls is presented, which are candidates for producing landscape traps. The results for considering the presence of singular controls are compared to their counterparts in the dipole approximation (i.e., without polarizability). A numerical analysis of the existence of traps in control landscapes for generating unitary transformations beyond the dipole approximation is made upon including the polarizability term. An extensive exploration of these control landscapes is achieved by creating many random Hamiltonians which include terms linear and quadratic in a single control field. The discovered singular controls are all found not to be local optima. This result extends a great body of recent work on typical landscapes of quantum systems where the dipole approximation is made. We further investigate the relationship between the magnitude of the polarizability and the fluence of the control resulting from optimization. It is also shown that including a polarizability term in an otherwise uncontrollable dipole coupled system removes traps from the corresponding control landscape by restoring controllability. We numerically assess the effect of a polarizability term on a known example of a particular three-level Λ-system with a second order trap in its control landscape. It is found that the addition of the polarizability removes the trap from the landscape. The general practical control implications of these simulations are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the use of corresponding orbitals in the calculation of nonorthogonal transition moments

Full valence and first-order CI wave functions are invariant with respect to unitary transformations among the valence orbitals. We exploit this degree of freedom and show that by transforming the valence orbitals into a corresponding orbital basis, nonorthogonal transition moment calculations become an easily managed task. Sample full valence calculations on several states of O2(+) and OF are also presented.

Lengsfield, B. H., III↗

Kinematics of the CS method for the treatment of molecular collisions

The problem of the quantum treatment of nonreactive collisions of two simple molecules or of an atom and a molecule is considered mathematically. Kinematical structure theorems analogous to the Wigner-Eckart theorem for scalar operators are derived for the transition operator (T-operator) of a two-molecule system, where, in addition to the usual conservation laws, certain additional conservation laws are presumed satisfied in a collision. The additional conservation laws were examined in order to develop a testable approximation scheme (CS method) for the specification of the kinematics of a system of two rigid diatomic molecules. The rand p-helicity basis states for a two-rigid rotor system are defined and unitary transformations established between these and conventional bases. It is found that only questionable criteria exist for testing the on-the-energy-shell matrix of a T(energy) operator for the presence of properties of two of the additional conservation laws.

Hahne, G. E.↗

Parallel solution of closely coupled systems

The odd-even permutation and associated unitary transformations for reordering the matrix coefficient A are employed as means of breaking the strong seriality which is characteristic of closely coupled systems. The nested dissection technique is also reviewed, and the equivalence between reordering A and dissecting its network is established. The effect of transforming A with odd-even permutation on its topology and the topology of its Cholesky factors is discussed. This leads to the construction of directed graphs showing the computational steps required for factoring A, their precedence relationships and their sequential and concurrent assignment to the available processors. Expressions for the speed-up and efficiency of using N processors in parallel relative to the sequential use of a single processor are derived from the directed graph. Similar expressions are also derived when the number of available processors is fewer than required.

Utku, S.↗

The wave function and minimum uncertainty function of the bound quadratic Hamiltonian system

The bound quadratic Hamiltonian system is analyzed explicitly on the basis of quantum mechanics. We have derived the invariant quantity with an auxiliary equation as the classical equation of motion. With the use of this invariant it can be determined whether or not the system is bound. In bound system we have evaluated the exact eigenfunction and minimum uncertainty function through unitary transformation.

Yeon, Kyu Hwang↗

Block encoding bosons by signal processing

Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.

Kane, Christopher F↗

Quadratic Unitary Coupled-Cluster Singles and Doubles Scheme: Efficient Implementation, Benchmark Study, and Formulation of an Extended Version

An efficient implementation of the quadratic unitary coupled-cluster singles and doubles (qUCCSD) scheme for calculations of electronic ground and excited states using an unrestricted molecular spin–orbital formulation and an efficient tensor contraction library is reported. The accuracy of the qUCCSD scheme and the efficiency of the present implementation are demonstrated using extensive benchmark calculations of excitation energies and an application to S o → S 1 vertical excitation energies for cis- and trans-4a,4b-dihydrotriphenylene. The qUCCSD scheme has been shown to provide improved excitation energies compared with the UCC3 scheme formulated based on perturbation theory. Here, a UCC truncation scheme that can provide excitation energies correct through the fourth order is also presented to further improve the accuracy of the qUCCSD scheme.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nearly optimal state preparation for quantum simulations of lattice gauge theories

Here, we present several improvements to the recently developed ground-state preparation algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in (2+1) dimensions, as well as propose an alternative application of QETU, a highly efficient preparation of Gaussian distributions. The QETU technique was originally proposed as an algorithm for nearly optimal ground-state preparation and ground-state energy estimation on early fault-tolerant devices. It uses the time-evolution input model, which can potentially overcome the large overall prefactor in the asymptotic gate cost arising in similar algorithms based on the Hamiltonian input model. We present modifications to the original QETU algorithm that significantly reduce the cost for the cases of both exact and Trotterized implementation of the time evolution circuit. We use QETU to prepare the ground state of a U(1) lattice gauge theory in two spatial dimensions, explore the dependence of computational resources on the desired precision and system parameters, and discuss the applicability of our results to general lattice gauge theories. We also demonstrate how the QETU technique can be utilized for preparing Gaussian distributions and wave packets in a way which outperforms existing algorithms for as little as n q ≳ 2–5 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quandary

Quandary numerically simulates and optimizes the time-evolution of open quantum systems. The underlying dynamics are modelled by Lindblad's master equation, a linear ordinary differential equation (ODE) describing quantum systems interacting with the environment. Quandary solves this ODE numerically by applying a time-stepping integration scheme, and utilizes a gradient-based optimization approach to determine optimal control pulses that drive the quantum system to a desired target state. Two optimization objectives are considered: (a) Unitary gate optimization that finds controls to realize a unitary gate transformation, and (b) optimal reset that aims to drive the quantum system to the ground states. Gradient-based optimization schemes utilizing Petsc's Tao optimization package are applied to generate control pulses that minimize the respective measure. To evaluate the gradient of the objective function, the discrete adjoint method is used while leveraging techniques from Algorithmic Differentiation to produce exact and consistent gradients. To mitigate excessive execution run times, the software can be build together with the XBraid software library which provides a parallelization strategy to distribute the time-evolution of the underlying dynamics onto multiple processor.

Petersson, NilsA.↗

Using deflation in the pole assignment problem with output feedback

A direct algorithm is suggested for the computation of a linear output feedback for a multi input, multi output system such that the resultant closed-loop matrix has eigenvalues that include a specified set of eigenvalues. The algorithm uses deflation based on unitary similarity transformations. Thus researchers hope the algorithm is numerically stable; however, this has not been proven as yet.

Miminis, George↗

Generalized Wigner theorem for noninvertible symmetries

In this article, we establish the conditions under which a conservation law associated with a non-invertible operator may be realized as a symmetry in quantum physics. As established by Wigner, all quantum symmetries must be represented by either unitary or antiunitary transformations. Relinquishing an implicit assumption of invertibility, we demonstrate that the fundamental invariance of quantum transition probabilities under the application of symmetries mandates that all non-invertible symmetries may only correspond to projective unitary or antiunitary transformations, i.e., partial isometries. This extends the notion of physical states beyond conventional rays in Hilbert space to equivalence classes in an extended, gauged Hilbert space, thereby broadening the traditional understanding of symmetry transformations in quantum theory. Our generalized theorem applies irrespective of the origin of the (non)invertible symmetry, holds in arbitrary spatial dimensions, and is independent of the Hamiltonian or action. We explore its physical consequences and, using simple model systems, illustrate how the distinction between invertible and non-invertible symmetries can sometimes be tied to the choice of boundary conditions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in paraxial optical systems. The MT is also an essential ingredient of the geometrical-optics modeling of caustics that we recently proposed. In particular, this application relies on the near-identity MT (NIMT); however, the NIMT approximation used so far is not exactly unitary and leads to numerical instability. Here, we develop a discrete MT that is exactly unitary, and approximate it to obtain a discrete NIMT that is also unitary and can be computed in linear time. We prove that the discrete NIMT converges to the discrete MT when iterated, thereby allowing the NIMT to compute MTs that are not necessarily near-identity. Finally, we then demonstrate the new algorithms with a series of examples.

47 OTHER INSTRUMENTATION↗

A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications

In recent years, a number of results on the relationships between the inertias of Hermitian matrices and the inertias of their principal submatrices appeared in the literature. We study restricted congruence transformation of Hermitian matrices M which, at the same time, induce a congruence transformation of a given principal submatrix A of M. Such transformations lead to concept of the restricted signature normal form of M. In particular, by means of this normal form, we obtain short proofs of most of the known inertia theorems and also derive some new results of this type. For some applications, a special class of almost unitary restricted congruence transformations turns out to be useful. We show that, with such transformations, M can be reduced to a quasi-diagonal form which, in particular, displays the eigenvalues of A. Finally, applications of this quasi-spectral decomposition to generalize inverses and Hermitian matrix pencils are discussed.

Freund, Roland W.↗