Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computing models”

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 325 records · Page 18

Low-dimensional representations of the three component loop braid group

Motivated by physical and topological applications, we study representations of the group LB 3 of motions of 3 unlinked oriented circles in R 3 . Our point of view is to regard the three strand braid group B 3 as a subgroup of LB 3 and study the problem of extending B 3 representations. We introduce the notion of a standard extension and characterize B 3 representations admitting such an extension. In particular we show, using a classification result of Tuba and Wenzl [Pacific J. Math. 197, 491–510 (2001)], that every irreducible B 3 representation of dimension at most 5 has a (standard) extension. We show that this result is sharp by exhibiting an irreducible 6-dimensional B 3 representation that has no extensions (standard or otherwise). Here, we obtain complete classifications of (1) irreducible 2-dimensional LB 3 representations, (2) extensions of irreducible 3-dimensional B 3 representations, and (3) irreducible LB 3 representations whose restriction to B 3 has abelian image.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hamiltonian systems, Toda lattices, solitons, Lax pairs on weighted Z -graded graphs

In this study, we consider discrete one-dimensional nonlinear equations and present the procedure of lifting them to Z -graded graphs. We identify conditions that allow one to lift one-dimensional solutions to solutions on graphs. In particular, we prove the existence of solitons for static potentials on graded fractal graphs. We also show that even for a simple example of a topologically interesting graph, the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z -graded graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cheaper and more noise-resilient quantum state preparation using eigenvector continuation

Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary-time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver. By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground-state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Furthermore, our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finding flows in the one-way measurement model

The one-way measurement model is a framework for universal quantum computation in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform a unitary embedding between two Hilbert spaces is for the graph G, together with input and output I, O vertices I,O is contained in V(G), to have a flow in the sense introduced by Danos and Kashefi [Phys. Rev. A 74, 052310 (2006)]. For the special case of |I|=|O|, using a graph-theoretic characterization, I show that such flows are unique when they exist. This leads to an efficient algorithm for finding flows by a reduction to solved problems in graph theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neutrinoless double-β decay: Combining quantum Monte Carlo and the nuclear shell model with the generalized contact formalism

Neutrinoless double beta decay searches can determine the Majorana nature of neutrinos, the absolute neutrino mass, and provide invaluable insights on the matter dominance of the universe. However, the uncertainty in the nuclear matrix elements that govern the decay limits the physics reach of these experiments. Here, we devise a novel framework based on the generalized contact formalism that combines the nuclear shell model and quantum Monte Carlo methods and compute the neutrinoless double-beta decay of nuclei used in the most advanced experiments, including 76 Ge, 130 Te, and 136 Xe. Our results cover all relevant terms, including the leading-order short-range operator recognized recently. We validate our method in light nuclei by comparing against accurate variational Monte Carlo results. On heavy systems we obtain reduced nuclear matrix elements compared with previous calculations due to additional correlations captured by quantum Monte Carlo and introduced within the generalized contact formalism, suggesting longer decay half-lives than previously considered. On the other hand, we find an enhancement of the nuclear matrix elements due to the new short-range operator.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Multi-Neutrino Entanglement and Correlations in Dense Neutrino Systems

The time-evolution of multi-neutrino entanglement and correlations are studied in two-flavor collective neutrino oscillations, relevant for dense neutrino environments, building upon previous works. Specifically, simulations performed of systems with up to 12 neutrinos using Quantinuum’s H1-1 20 qubit trapped-ion quantum computer are used to compute n-tangles, and two- and three- body correlations, probing beyond mean-field descriptions. n-tangle re-scalings are found to converge for large system sizes, signaling the presence of genuine multi-neutrino entanglement.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mixed polyanion glass cathodes: Glass-state conversion reactions

Mixed polyanion (MP) glasses can undergo glass-state conversion (GSC) reactions to provide an alternate class of high-capacity cathode materials. GSC reactions have been demonstrated in phosphate/vanadate glasses with Ag, Co, Cu, Fe, and Ni cations. These MP glasses provided high capacity and good high power performance, but suffer from moderate voltages, large voltage hysteresis, and significant capacity fade with cycling. Details of the GSC reaction have been revealed by x-ray absorption spectroscopy, electron microscopy, and energy dispersive x-ray spectroscopy of ex situ cathodes at key states of charge. Using the Open Quantum Materials Database (OQMD), a computational thermodynamic model has been developed to predict the near-equilibrium voltages of glass-state conversion reactions in MP glasses.

36 MATERIALS SCIENCE↗

MPS++

The MPS++ computer code simulates models of strongly correlated quantum lattice systems. The algorithm used is the density-matrix renormalization method formulated in the matrix product states language. These models and methods are used to obtain ground state, dynamic, finite temperature and time evolution properties of the underlying materials that are simulated. These materials are usually one- and quasi-one dimensional strongly correlated electronic systems, such as high temperature superconductors, manganites, and other transition metal oxides. This code is (mostly) an implementation of the paper “The density-matrix renormalization group in the age of matrix product states” by U. Schollwoeck, and references therein, found at http://arxiv.org/abs/1008.3477v2 , and that was also published in Annals of Physics 326,96 (2011).

Source record↗

Cross-scale Efficient Tensor Contractions for Coupled Cluster Computations Through Multiple Programming Model Backends

Coupled-cluster methods provide highly accurate models of molecular structure by explicit numerical calculation of tensors representing the correlation between electrons. These calculations are dominated by a sequence of tensor contractions, motivating the development of numerical libraries for such operations. While based on matrix-matrix multiplication, these libraries are specialized to exploit symmetries in the molecular structure and in electronic interactions, and thus reduce the size of the tensor representation and the complexity of contractions. The resulting algorithms are irregular and their parallelization has been previously achieved via the use of dynamic scheduling or specialized data decompositions. We introduce our efforts to extend the Libtensor framework to work in the distributed memory environment in a scalable and energy efficient manner. We achieve up to 240 speedup compared with the best optimized shared memory implementation. We attain scalability to hundreds of thousands of compute cores on three distributed-memory architectures, (Cray XC30&XC40, BlueGene/Q), and on a heterogeneous GPU-CPU system (Cray XK7). As the bottlenecks shift from being compute-bound DGEMM's to communication-bound collectives as the size of the molecular system scales, we adopt two radically different parallelization approaches for handling load-imbalance. Nevertheless, we preserve a uni ed interface to both programming models to maintain the productivity of computational quantum chemists.

74 ATOMIC AND MOLECULAR PHYSICS↗

Unifying and benchmarking state-of-the-art quantum error mitigation techniques

Error mitigation is an essential component of achieving a practical quantum advantage in the near term, and a number of different approaches have been proposed. In this work, we recognize that many state-of-the-art error mitigation methods share a common feature: they are data-driven, employing classical data obtained from runs of different quantum circuits. For example, Zero-noise extrapolation (ZNE) uses variable noise data and Clifford-data regression (CDR) uses data from near-Clifford circuits. We show that Virtual Distillation (VD) can be viewed in a similar manner by considering classical data produced from different numbers of state preparations. Observing this fact allows us to unify these three methods under a general data-driven error mitigation framework that we call UNIfied Technique for Error mitigation with Data (UNITED). In certain situations, we find that our UNITED method can outperform the individual methods (i.e., the whole is better than the individual parts). Specifically, we employ a realistic noise model obtained from a trapped ion quantum computer to benchmark UNITED, as well as other state-of-the-art methods, in mitigating observables produced from random quantum circuits and the Quantum Alternating Operator Ansatz (QAOA) applied to Max-Cut problems with various numbers of qubits, circuit depths and total numbers of shots. We find that the performance of different techniques depends strongly on shot budgets, with more powerful methods requiring more shots for optimal performance. For our largest considered shot budget (10 10 ), we find that UNITED gives the most accurate mitigation. Hence, our work represents a benchmarking of current error mitigation methods and provides a guide for the regimes when certain methods are most useful.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MPS++

The MPS++ computer code simulates models of strongly correlated quantum lattice systems. The algorithm used is the density-matrix renormalization method formulated in the matrix product states language. These models and methods are used to obtain ground state, dynamic, finite temperature and time evolution properties of the underlying materials that are simulated. These materials are usually one- and quasi-one dimensional strongly correlated electronic systems, such as high temperature superconductors, manganites, and other transition metal oxides. This code is (mostly) an implementation of the paper "The density-matrix renormalization group in the age of matrix product states" by U. Schollwoeck, and references therein, found at http://arxiv.org/abs/1008.3477v2 , and that was also published in Annals of Physics 326,96 (2011).

Source record↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

Visualizing effective potentials and using the IBM-Q to study quantum field theory models in 0+1 dimensions

This work explores the utility of two novel techniques applied to studying quantum field theory, namely quantum computing and visualizing effective potentials. We studied the ground state properties of the anharmonic oscillator and the Wess-Zumino model using the variational quantum eigensolver algorithm. We performed calculations for three and four qubit systems using IBM’s open source quantum computing simulation software. Using effective potentials, we study a simple dark mat-ter system with a Higgs and dark Higgs like particle interacting through a porthole fermion.

97 MATHEMATICS AND COMPUTING↗

Direct observation of dislocation structure evolution in SRF cavity niobium using electron channeling contrast imaging

Two major goals of superconducting radio frequency cavity research and development are achieving higher accelerating gradient and gaining the highest quality factor, a measure of efficiency. However, the consistent improvement of these performance metrics is restricted by many factors, one of which is microstructural defects, such as dislocation substructures within the material. In this work, dislocation evolution is compared in four samples extracted from a 2.8 mm thick large-grain niobium slice, with tensile axes chosen to generate specific dislocation structures during subsequent deformation. The four samples are (1) as-extracted, (2) extracted and annealed, (3) extracted and then deformed to 40% tensile strain, and (4) extracted, annealed at 800 °C 2 h, and then deformed to 40% strain. Electron channeling contrast imaging was performed on all samples to characterize initial dislocation density and dislocation structure evolution due to annealing and deformation, and related to the mechanical behavior observed in stress-strain curves. A fundamental understanding of dislocation evolution in niobium is necessary to develop computational models to simulate cavity forming, which could enable new processing methods for cavity fabrication to be identified that could lead to improved performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ArQTiC: A Full-stack Software Package for Simulating Materials on Quantum Computers

ArQTiC is an open-source, full-stack software package built for the simulations of materials on quantum computers. It currently can simulate materials that can be modeled by any Hamiltonian derived from a generic, one-dimensional, time-dependent Heisenberg Hamiltonian. ArQTiC includes modules for generating quantum programs for real- and imaginary-time evolution, quantum circuit optimization, connection to various quantum backends via the cloud, and post-processing of quantum results. By enabling users to seamlessly design, execute, and analyze materials simulations on quantum computers, ArQTiC opens this field to a broader community of scientists from a wider range of scientific domains.

97 MATHEMATICS AND COMPUTING↗

A reductionist perspective on quantum statistical mechanics: Coarse-graining of path integrals

Computational modeling of the condensed phase based on classical statistical mechanics has been rapidly developing over the last few decades and has yielded important information on various systems containing up to millions of atoms. However, if a system of interest contains important quantum effects, well-developed classical techniques cannot be used. One way of treating finite temperature quantum systems at equilibrium has been based on Feynman’s imaginary time path integral approach and the ensuing quantum-classical isomorphism. This isomorphism is exact only in the limit of infinitely many classical quasiparticles representing each physical quantum particle. In this work, we present a reductionist perspective on this problem based on the emerging methodology of coarse-graining. This perspective allows for the representations of one quantum particle with only two classical-like quasiparticles and their conjugate momenta. One of these coupled quasiparticles is the centroid particle of the quantum path integral quasiparticle distribution. Only this quasiparticle feels the potential energy function. The other quasiparticle directly provides the observable averages of quantum mechanical operators. The theory offers a simplified perspective on quantum statistical mechanics, revealing its most reductionist connection to classical statistical physics. By doing so, it can facilitate a simpler representation of certain quantum effects in complex molecular environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗