Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum arithmetic”

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.

34 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Extending the Frontier of Quantum Computers with Qutrits

Here, we advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log 2 (3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla - an exponential improvement over the best qubit-only equivalent. Our approach features a 70× improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Completely Positive, Simple, and Possibly Highly Accurate Approximation of the Redfield Equation

Here we present a Lindblad master equation that approximates the Redfield equation, a well known master equation derived from first principles, without significantly compromising the range of applicability of the Redfield equation. Instead of full-scale coarse-graining, this approximation only truncates terms in the Redfield equation that average out over a time-scale typical of the quantum system. The first step in this approximation is to properly renormalize the system Hamiltonian, to symmetrize the gains and losses of the state due to the environmental coupling. In the second step, we swap out an arithmetic mean of the spectral density with a geometric one, in these gains and losses, thereby restoring complete positivity. This completely positive approximation, GAME (geometric-arithmetic master equation), is adaptable between its time-independent, time-dependent, and Floquet form. In the exactly solvable, three-level, Jaynes-Cummings model, we find that the error of the approximate state is almost an order of magnitude lower than that obtained by solving the coarse-grained stochastic master equation. As a test-bed, we use a ferromagnetic Heisenberg spin-chain with long-range dipole-dipole coupling between up to 25-spins, and study the differences between various master equations. We find that GAME has the highest accuracy per computational resource.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning↗
DOE OSTI2024

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗
DOE OSTI2021

Caravel: A C++ framework for the computation of multi-loop amplitudes with numerical unitarity

We present the first public version of Caravel, a C++17 framework for the computation of multi-loop scattering amplitudes in quantum field theory, based on the numerical unitarity method. Caravel is composed of modules for the D-dimensional decomposition of integrands of scattering amplitudes into master and surface terms, the computation of tree-level amplitudes in floating point or finite-field arithmetic, the numerical computation of one- and two-loop amplitudes in QCD and Einstein gravity, and functional reconstruction tools. Here, we provide programs that showcase Caravel's main functionalities and allow to compute selected one- and two-loop amplitudes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Robust analytic continuation of Green's functions via projection, pole estimation, and semidefinite relaxation

Green's functions of fermions are described by matrix-valued Herglotz-Nevanlinna functions. Since analytic continuation is fundamentally an ill-posed problem, the causal space described by the matrix-valued Herglotz-Nevanlinna structure can be instrumental in improving the accuracy and in enhancing the robustness with respect to noise. We demonstrate a three-pronged procedure for robust analytic continuation called PES: (1) projection of data to the causal space; (2) estimation of pole locations; and (3) semidefinite relaxation within the causal space. We compare the performance of PES with the recently developed Nevanlinna and Carathéodory continuation methods and find that PES is more robust in the presence of noise and does not require the usage of extended precision arithmetics. We also demonstrate that a causal projection improves the performance of the Nevanlinna and Carathéodory methods. The PES method is generalized to bosonic response functions, for which the Nevanlinna and Carathéodory continuation methods have not yet been developed. Furthermore, it is particularly useful for studying spectra with sharp features, as they occur in the study of molecules and band structures in solids.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Spinbox: tools for many-body quantum systems in a Monte Carlo context

Spinbox is a piece of software that facilitates quantum mechanical calculations relevant to Monte Carlo simulation of atomic nuclei. At the front lines of research on the nuclear many-body problem are a large number of supercomputer-scale simulation codes. These codes produce valuable results but can be hard to understand, especially for those without intimate knowledge of the relevant theoretical methods. Thus, tools that fill pedagogical roles are extremely valuable. Spinbox makes it easy for one to replicate and analyze the computational processes relevant to a Quantum Monte Carlo (QMC) simulation that may be difficult to understand/debug/analyze due to the scale of the corresponding simulation software. Spinbox is written in Python using other state-of-the-art Python modules for numerical calculations. While a number of Python libraries exist that are suited to general quantum many-body calculations, the motivation of Spinbox is quite particular. In Diffusion Monte Carlo methods (DMC, GFMC, AFDMC), the central calculation is the imaginary-time propagation of individual samples of the many-body wavefunction. Although quantum wavefunctions generally must be described by a probability distribution over a basis, DMC imbues particles (within one sample) with classical spatial coordinates. This method is unusual, so other Python packages are typically not set up to do this easily. Furthermore, the software has built-in options for nuclear systems assuming isospin symmetry, which can be set up with other libraries but is a nontrivial process to do so. Features: - numerical representation of samples of the many-body wavefunctions, including tensor-product states (used in AFDMC) - numerical representation of many-body operators, including tensor-product operators: general, spin, imaginary-time propagation, etc. - the correct associated arithmetic and algebra, implemented as class methods - classes for representing realistic nuclear two- and three-body Hamiltonians (e.g. Argonne V18, Illinois NNN) - large-scale parallel integration over random variables, crucial for the AFDMC method My goal is to make this package open source so that anyone may use it and contribute to it, particularly other researchers doing AFDMC calculations

Fox, Jordan↗
DOE OSTI2018

Tensor networks, p -adic fields, and algebraic curves: arithmetic and the AdS 3 /CFT 2 correspondence

One of the many remarkable properties of conformal field theory in two dimensions is its connection to algebraic geometry. Since every compact Riemann surface is a projective algebraic curve, many constructions of interest in physics (which a priori depend on the analytic structure of the spacetime) can be formulated in purely algebraic language. This opens the door to interesting generalizations, obtained by taking another choice of field: for instance, the p-adics. Herein, we generalize the $\mathrm{AdS} / \mathrm{CFT}$ correspondence according to this principle; the result is a formulation of holography in which the bulk geometry is discrete—the Bruhat–Tits tree for $\mathrm{PGL} (2, \mathbb{Q}_p)$—but the group of bulk isometries nonetheless agrees with that of boundary conformal transformations and is not broken by discretization. We anticipate that this forms the natural geometric setting for tensor networks that have been proposed as models of bulk reconstruction via quantum error correcting codes; in certain cases, geodesics in the Bruhat–Tits tree reproduce those constructed using quantum error correction. Other aspects of holography also hold: Standard holographic results for massive free scalar fields in a fixed background carry over to the tree, whose vertical direction can be interpreted as a renormalization-group scale for modes in the boundary $\mathrm{CFT}$. Higher-genus bulk geometries (the $\mathrm{BTZ}$ black hole and its generalizations) can be understood straightforwardly in our setting, and the Ryu–Takayanagi formula for the entanglement entropy appears naturally

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Delayed Slater determinant update algorithms for high efficiency quantum Monte Carlo

Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of a dense matrix. This is most commonly iteratively evaluated using a rank-1 Sherman-Morrison updating scheme to avoid repeated explicit calculation of the inverse. The overall computational cost is therefore formally cubic in the number of electrons or matrix size. To improve the numerical efficiency of this procedure, we propose a novel multiple rank delayed update scheme. This strategy enables probability evaluation with application of accepted moves to the matrices delayed until after a predetermined number of moves, K . The accepted events are then applied to the matrices en bloc with enhanced arithmetic intensity and computational efficiency via matrix-matrix operations instead of matrix-vector operations. Here this procedure does not change the underlying Monte Carlo sampling or its statistical efficiency. For calculations on large systems and algorithms such as diffusion Monte Carlo where the acceptance ratio is high, order of magnitude improvements in the update time can be obtained on both multi- core CPUs and GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

New approach to terahertz diagnostics of human psychoemotional state

A new approach to terahertz (THz) diagnostics of the human psychoemotional state is proposed, based on the analysis of the THz contribution to the total signal while simultaneously recording the IR and THz emissions from the human body (hereinafter referred to as the IR – THz image). The developed image-processing algorithm allows extraction of the informative contribution determined by the THz radiation from the total signal perceived by the recording system. Simultaneous registration of the IR – THz images of the human face and the psychophysiological indicators are carried out in situations of physical stress (short-term intense physical exercise – squats functional test), electrical stimulation, and information stress (cognitive load – simple arithmetic mental calculations). The obtained data are compared with those of similar measurements at rest. It is shown that using cluster analysis of IR – THz images it is possible to divide the test subjects into classes according to the type of reaction of the circulatory system under stressful conditions. (paper)

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2020

Effect of elastic anisotropy on thermally induced distortions of a laser beam in single cubic syngony crystals with radial cooling. Part I

We have studied thermally induced distortions of a beam in single cubic syngony crystals of all symmetry groups with an anisotropic elastic stiffness tensor. The arithmetic mean and the difference between the thermally induced phase incursions of eigenpolarisations, as well as the angle of incidence of these polarisations, are calculated for a long rod and a thin disk with radial cooling under uniform volume pumping of the active element. The position of the specific crystal orientations unrelated to its symmetry elements is investigated. The effective values of the thermo-optical constant Q in two specific orientations, as well as the thermo-optical constant P in an arbitrary orientation, are found. (invited paper)

36 MATERIALS SCIENCE↗
DOE OSTI2021

DR-RINS: Digital real-time relative intensity noise suppressor for pump–probe spectroscopy and microscopy

Relative intensity noise (RIN) inherent in fiber lasers poses a serious obstacle to their use in pump–probe spectroscopy and imaging. RIN can be removed through an analog balanced detector, or, as we have previously shown, software adaptive noise cancellation (ANC) on digitized signals. One major drawback to software ANC is the added time required for digitizing and post-processing. In this article, we describe a design for ANC on a field-programmable gate array (FPGA), making use of high-level synthesis tools and fixed-point arithmetic to achieve real-time laser RIN suppression at 25 MHz sample rates. Unlike the software-ANC approach, the FPGA-ANC device can serve as a dedicated drop-in denoiser, placed between the detectors and a commercial lock-in amplifier. We demonstrate its application to transient absorption spectroscopy and microscopy, lowering the noise floor to ~17 dB above the shot noise limit. Furthermore, we demonstrate a dramatic improvement in data acquisition time from ~6 h to ~5 min in a real-time imaging scenario.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A Novel Approach to Realize of All Optical Frequency Encoded Dibit Based XOR and XNOR Logic Gates Using Optical Switches with Simulated Verification

Since last few decades optics has already proved its strong potentiality for conducting parallel logic, arithmetic and algebraic operations due to its super-fast speed in communication and computation. So many different logical and sequential operations using all optical frequency encoding technique have been proposed by several authors. Here, we have keened out all optical dibit representation technique, which has the advantages of high speed operation as well as reducing the bit error problem. Exploiting this phenomenon, we have proposed all optical frequency encoded dibit based XOR and XNOR logic gates using the optical switches like add/drop multiplexer (ADM) and reflected semiconductor optical amplifier (RSOA). Also the operations of these gates have been verified through proper simulation using MATLAB (R2008a).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Generalized Bose–Hubbard Hamiltonians exhibiting a complete non-Hermitian degeneracy

Highlights: • Hot topic: physics with non-Hermitian Hamiltonians. • Computer algebra used to construct new, next-to-BH models. • Degeneracy verification via variable-precision arithmetics. • Unfolding patterns at N>5 (recent problem solved). - Abstract: The method of construction of the tridiagonal and symmetric complex-matrix Hamiltonians H{sup (N)}(z) exhibiting an exceptional-point (EP) degeneracy of the Nth (i.e., maximal) order at a preselected parameter z=z{sup (EPN)}=1 is proposed and tested. In general, the implementation of the method requires the use of computer-assisted symbolic manipulations, especially at the larger matrix dimensions N. The well known PT−symmetric N-by-N-matrix Bose–Hubbard Hamiltonians as well as their recent N≤5 non-Bose–Hubbard alternatives are obtained as special solutions. Several other N≥6 non-Bose–Hubbard models H{sup (N)}(z) exhibiting the maximal EPN degeneracy are also constructed and analyzed in detail. In particular, their z−dependent, real or complex spectra of energies are displayed and discussed near as well as far from z{sup (EPN)}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗