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 379 records · Page 21

Qubit Regularization and Qubit Embedding Algebras

Qubit regularization is a procedure to regularize the infinite dimensional local Hilbert space of bosonic fields to a finite dimensional one, which is a crucial step when trying to simulate lattice quantum field theories on a quantum computer. When the qubit-regularized lattice quantum fields preserve important symmetries of the original theory, qubit regularization naturally enforces certain algebraic structures on these quantum fields. We introduce the concept of qubit embedding algebras (QEAs) to characterize this algebraic structure associated with a qubit regularization scheme. We show a systematic procedure to derive QEAs for the O(N) lattice spin models and the SU(N) lattice gauge theories. While some of the QEAs we find were discovered earlier in the context of the D-theory approach, our method shows that QEAs are far richer. A more complete understanding of the QEAs could be helpful in recovering the fixed points of the desired quantum field theories.

97 MATHEMATICS AND COMPUTING↗

Studying light-harvesting models with superconducting circuits

The process of photosynthesis, the main source of energy in the living world, converts sunlight into chemical energy. The high efficiency of this process is believed to be enabled by an interplay between the quantum nature of molecular structures in photosynthetic complexes and their interaction with the environment. Investigating these effects in biological samples is challenging due to their complex and disordered structure. Here we experimentally demonstrate a technique for studying photosynthetic models based on superconducting quantum circuits, which complements existing experimental, theoretical, and computational approaches. We demonstrate a high degree of freedom in design and experimental control of our approach based on a simplified three-site model of a pigment protein complex with realistic parameters scaled down in energy by a factor of 10 5 . We show that the excitation transport between quantum-coherent sites disordered in energy can be enabled through the interaction with environmental noise. We also show that the efficiency of the process is maximized for structured noise resembling intramolecular phononic environments found in photosynthetic complexes.

42 ENGINEERING↗

Hamiltonian Simulation [Slides]

Given a (qubit) quantum system modeled by a Hamiltonian H, use a quantum computer to obtain time-evolved properties of the system. One way of solving this problem is by actually preparing the evolved quantum state (in some encoded fashion). The goal is to provide a sequence of elementary 1 and 2-qubit gates that would prepare such a state.

97 MATHEMATICS AND COMPUTING↗

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗

Topos models for physics and topos theory

What is the role of topos theory in the topos models for quantum theory as used by Isham, Butterfield, Döring, Heunen, Landsman, Spitters, and others? In other words, what is the interplay between physical motivation for the models and the mathematical framework used in these models? Concretely, we show that the presheaf topos model of Butterfield, Isham, and Döring resembles classical physics when viewed from the internal language of the presheaf topos, similar to the copresheaf topos model of Heunen, Landsman, and Spitters. Both the presheaf and copresheaf models provide a “quantum logic” in the form of a complete Heyting algebra. Although these algebras are natural from a topos theoretic stance, we seek a physical interpretation for the logical operations. Finally, we investigate dynamics. In particular, we describe how an automorphism on the operator algebra induces a homeomorphism (or isomorphism of locales) on the associated state spaces of the topos models, and how elementary propositions and truth values transform under the action of this homeomorphism. Also with dynamics the focus is on the internal perspective of the topos.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]↗

Classical probabilities for Majorana and Weyl spinors

Highlights: > Map of classical statistical Ising model to fermionic quantum field theory. > Lattice-regularized real Grassmann functional integral for single Weyl spinor. > Emerging complex structure characteristic for quantum physics. > A classical statistical ensemble describes a quantum theory. - Abstract: We construct a map between the quantum field theory of free Weyl or Majorana fermions and the probability distribution of a classical statistical ensemble for Ising spins or discrete bits. More precisely, a Grassmann functional integral based on a real Grassmann algebra specifies the time evolution of the real wave function q{sub {tau}}(t) for the Ising states {tau}. The time dependent probability distribution of a generalized Ising model obtains as p{sub {tau}}(t)=q{sub {tau}}{sup 2}(t). The functional integral employs a lattice regularization for single Weyl or Majorana spinors. We further introduce the complex structure characteristic for quantum mechanics. Probability distributions of the Ising model which correspond to one or many propagating fermions are discussed explicitly. Expectation values of observables can be computed equivalently in the classical statistical Ising model or in the quantum field theory for fermions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable stable comb-to-tone integrated RF photonic drive for superconducting qubits

The recent advent of quantum computing has the potential to overhaul security, communications, and scientific modeling. Superconducting qubits are a leading platform that is advancing noise-tolerant intermediate-scale quantum processors. The implementation requires scaling to large numbers of superconducting qubits, circuit depths, and gate speeds, wherein high-purity RF signal generation and effective cabling transport are desirable. Fiber photonic-enhanced RF signal generation has demonstrated the principle of addressing both signal generation and transport requirements, supporting intermediate qubit numbers and robust packaging efforts; however, fiber-based approaches to RF signal distribution are often bounded by their phase instability. Here, we present a silicon photonic integrated circuit-based version of a photonic-enhanced RF signal generator that demonstrates the requisite stability, as well as a path towards the necessary signal fidelity.

47 OTHER INSTRUMENTATION↗

Optical spin-1 chain and its use as a quantum-computational wire

Measurement-based quantum computing, a powerful alternative to the standard circuit model, proceeds using only local adaptive measurements on a highly entangled resource state of many spins on a graph or lattice. Along with the canonical cluster state, the valence-bond solid ground state on a chain of spin-1 particles, studied by Affleck, Kennedy, Lieb, and Tasaki (AKLT), is such a resource state. We propose a simulation of this AKLT state using linear optics, wherein we can make use of the high-fidelity projective measurements that are commonplace in quantum-optical experiments, and describe how quantum logic gates can be performed on this chain. In our proposed implementation, the spin-1 particles comprising the AKLT state are encoded on polarization biphotons: three-level systems consisting of pairs of polarized photons in the same spatio-temporal mode. A logical qubit encoded on the photonic AKLT state can be initialized, read out, and have an arbitrary single-qubit unitary applied to it by performing projective measurements on the constituent biphotons. For MBQC, biphoton measurements are required which cannot be deterministically performed using only linear optics and photodetection.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental Measurement of Out-of-Time-Ordered Correlators at Finite Temperature

Out-of-time-ordered correlators (OTOCs) are a key observable in a wide range of interconnected fields including many-body physics, quantum information science, and quantum gravity. Measuring OTOCs using near-term quantum simulators will extend our ability to explore fundamental aspects of these fields and the subtle connections between them. Here, we demonstrate an experimental method to measure OTOCs at finite temperatures and use the method to study their temperature dependence. These measurements are performed on a digital quantum computer running a simulation of the transverse field Ising model. Our flexible method, based on the creation of a thermofield double state, can be extended to other models and enables us to probe the OTOC’s temperature-dependent decay rate. Measuring this decay rate opens up the possibility of testing the fundamental temperature-dependent bounds on quantum information scrambling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering phase shift in quantum mechanics on quantum computers

Here, we investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in the work by Guo and Gasparian [Phys. Rev. D 108, 074504 (2023)] that relates the integrated correlation functions for a trapped system to the infinite volume scattering phase shifts through a weighted integral. The system is first discretized in a finite box with periodic boundary conditions, and the formalism in real time is verified by employing a contact interaction potential with exact solutions. Quantum circuits are then designed and constructed to implement the formalism on current quantum computing architectures. To overcome the fast oscillatory behavior of the integrated correlation functions in real-time simulation, different methods of postdata analysis are proposed and discussed. Test results on IBM hardware show that good agreement can be achieved with two qubits, but complete failure ensues with three qubits due to two-qubit gate operation errors and thermal relaxation errors.

Guo, Peng [Dakota State Univ., Madison, SD (United↗

Topological order, entanglement, and quantum memory at finite temperature

We compute the topological entropy of the toric code models in arbitrary dimension at finite temperature. We find that the critical temperatures for the existence of full quantum (classical) topological entropy correspond to the confinement-deconfinement transitions in the corresponding Z{sub 2} gauge theories. This implies that the thermal stability of topological entropy corresponds to the stability of quantum (classical) memory. The implications for the understanding of ergodicity breaking in topological phases are discussed. - Highlights: Black-Right-Pointing-Pointer We calculate the topological entropy of a general toric code in any dimension. Black-Right-Pointing-Pointer We find phase transitions in the topological entropy. Black-Right-Pointing-Pointer The phase transitions coincide with the appearance of quantum/classical memory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum surrogate models for uncertainty quantification

Surrogate models are a critical ingredient to computation-based design and validation of many DOE mission-relevant physical systems. When first-principles computation of properties of a physical systems becomes pro hibitive, surrogate models are the only path towards achieving tasks such as uncertainty quantification (UQ), exploration of design space, and validation of design choices. In this project we have developed and demonstrated a new surro gate modeling paradigm for complex models that is data-driven, non-intrusive, and has the potential to be versatile and equipped with performance guaran tees. This combination of features is absent in existing surrogate modeling tools. The framework we have developed in this project exploits a quantum-classical correspondence to establish a quantum system that mimics the dynamics of the classical Hamiltonian system from which data in the form of temporal snapshots is provided. Since quantum dynamics propagates distributions over observables, the framework is naturally suited to propagation of epistemic uncertainties in the form of distributions over initial state and parametric uncertainties. In this project, we take the first step in establishing this novel framework by deriving a quantization and de-quantization procedure, demonstrating the accuracy of the quantum surrogate models these define using two model systems, and defining the next steps in maturing the framework towards a tool applicable to Sandia mission-relevant problems.

97 MATHEMATICS AND COMPUTING↗

Unitary Qubit Lattice Algorithms for Plasma Physics

This final technical report summarizes research conducted under DOE Award DE-SC0021653 to develop unitary Quantum Lattice Algorithms for modeling electromagnetic wave propagation and scattering in complex media, including plasmas. The project developed and validated quantum-inspired formulations of Maxwell's equations that preserve unitary evolution and can be evaluated on classical high-performance computing systems while providing a foundation for future quantum-computing implementations. Major accomplishments include the development of two- and three-dimensional algorithms for electromagnetic scattering; scalable, distributed-memory implementations demonstrated on the Perlmutter supercomputer; formulations for nonlinear lossless fluid dynamics and cold, lossless, inhomogeneous magnetized plasmas; and an explicit quantum algorithm for a time-discretized Lorenz model. Simulations reproduced a range of characteristic wave phenomena, including transient effects that are not readily apparent in conventional frequency-domain studies, demonstrating the effectiveness of the proposed approach for modeling complex electromagnetic and plasma systems. The work establishes a unified theoretical and computational framework for quantum and quantum-inspired simulation and provides a foundation for future implementation on fault-tolerant quantum systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A violation of global symmetries from replica wormholes and the fate of black hole remnants

We show that the presence of replica wormholes in the Euclidean path integral of gravity leads to a non-perturbative violation of charge conservation for any global symmetry present in the low-energy description of quantum gravity. Explicitly, we compute the scattering probability between different charged states in several two-dimensional models of quantum gravity and find a non-vanishing answer. Here, this suggests that the set of all charged states is typically over-complete, which has drastic consequences for the fate of black hole remnants that could carry a global symmetry charge. In the holographic context, we argue that the presence of such a symmetry in the effective description of the bulk should appear on the boundary as an emergent global symmetry after ensemble averaging.

79 ASTRONOMY AND ASTROPHYSICS↗

A Study of Complex Deep Learning Networks on High-Performance, Neuromorphic, and Quantum Computers

Current deep learning approaches have been very successful using convolutional neural networks trained on large graphical-processing-unit-based computers. Three limitations of this approach are that (1) they are based on a simple layered network topology, i.e., highly connected layers, without intra-layer connections; (2) the networks are manually configured to achieve optimal results, and (3) the implementation of the network model is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. We use the MNIST dataset for our experiment, due to input size limitations of current quantum computers. Our results show the feasibility of using the three architectures in tandem to address the above deep learning limitations. Finally, we show that a quantum computer can find high quality values of intra-layer connection weights in a tractable time as the complexity of the network increases, a high performance computer can find optimal layer-based topologies, and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.

97 MATHEMATICS AND COMPUTING↗

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Breaking the Million-Electron and 1 EFLOP/s Barriers: Biomolecular-Scale Ab Initio Molecular Dynamics Using MP2 Potentials

The accurate simulation of complex biochemical phenomena has historically been hampered by the computational requirements of high-fidelity molecular-modeling techniques. Quantum mechanical methods, such as ab initio wave-function (WF) theory, deliver the desired accuracy, but have impractical scaling for modeling biosystems with thousands of atoms. Combining molecular fragmentation with MP2 perturbation theory, this study presents an innovative approach that enables biomolecular-scale ab initio molecular dynamics (AIMD) simulations at WF theory level. Leveraging the resolution-of-the-identity approximation for Hartree-Fock and MP2 gradients, our approach eliminates computationally intensive four-center integrals and their gradients, while achieving near-peak performance on modern GPU architectures. The introduction of asynchronous time steps minimizes time step latency, overlapping computational phases and effectively mitigating load imbalances. Utilizing up to 9,400 nodes of Frontier and achieving 59% (1006.7 PFLOP/s) of its double-precision floating-point peak, our method enables us to break the million-electron and 1EFLOP/s barriers for AIMD simulations with quantum accuracy.

Kurzak, Jakub↗