Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computer”

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 163 records · Page 9

Symposium: Quantum Theory, Quantum Materials, Quantum Computing (Final Report, DE-SC0022551)

Quantum mechanics is fundamental to understanding, predicting, and controlling many physical processes in a vast range of scientific and technological areas. In molecules and materials, the quantum mechanics of Coulombic many-body systems determines far more than the ground state and bulk properties. Quantum mechanics governs magnetism, electron and spin transport, chemical reactions and catalysis, superconductivity, photosynthesis, etc. Each plays a vital role in modern society. As digital technologies push both temporal and length-scale limits, fundamental quantum principles become the current focus for a new class of technologies: quantum computing, quantum sensing, quantum encryption, etc. This oncoming quantum information sciences wave is manifest recently in frontier foci of all six Department of Energy Office of Science programs. The Sanibel Symposium offers a proven, influential platform for facilitating and advancing cross-fertilization among theoretical and computational chemists and physicists, computer scientists, and materials engineers. The Symposia have a long, successful record of driving progress on theory and computation of materials, nanostructures, and their molecular constituents. The Symposia thus are well-suited for advancing the quantum information science thrust in the Office of Basic Energy Sciences (BES). With that QIS thrust as the focus, we propose five sessions of the 61st Sanibel Symposium on the theme Quantum Theory, Quantum Materials, Quantum Computing. From a longer perspective, this thematic program for 2022 is the second year of a five year plan of program segments addressed at challenges in quantum information sciences and quantum materials. The rest of the Symposium program will be of considerable relevance, with, for example, sessions on quantum molecular and material dynamics, and new directions in coupled cluster theory. New ideas for methods and applications can be expected to emerge from the stimulus of the formal presentations and informal discussions. The proposed award is targeted at students, post-docs, and junior scientists. Conscious effort, characteristic of the Sanibel Symposia, to stimulate the participation of women and under-represented minorities will continue.

36 MATERIALS SCIENCE↗

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗

Universal resources for approximate and stochastic measurement-based quantum computation

We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation in the sense that any quantum state can be generated from a given resource by means of single-qubit (local) operations assisted by classical communication. More precisely, we consider the approximate and stochastic generation of states, resulting, for example, from a restriction to finite measurement settings or from possible imperfections in the resources or local operations. We show that entanglement-based criteria for universality obtained in M. Van den Nest et al. [New J. Phys. 9, 204 (2007)] for the exact, deterministic case can be lifted to the much more general approximate, stochastic case. This allows us to move from the idealized situation (exact, deterministic universality) considered in previous works to the practically relevant context of nonperfect state preparation. We find that any entanglement measure fulfilling some basic requirements needs to reach its maximum value on some element of an approximate, stochastic universal family of resource states, as the resource size grows. This allows us to rule out various families of states as being approximate, stochastic universal. We prove that approximate, stochastic universality is in general a weaker requirement than deterministic, exact universality and provide resources that are efficient approximate universal, but not exact deterministic universal. We also study the robustness of universal resources for measurement-based quantum computation under realistic assumptions about the (imperfect) generation and manipulation of entangled states, giving an explicit expression for the impact that errors made in the preparation of the resource have on the possibility to use it for universal approximate and stochastic state preparation. Finally, we discuss the relation between our entanglement-based criteria and recent results regarding the uselessness of states with a high degree of geometric entanglement as universal resources [D. Gross et al., Phys. Rev. Lett. 102, 190501 (2009); M. J. Bremner et al., Phys. Rev. Lett 102, 190502 (2009)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adiabatic cluster-state quantum computing

Models of quantum computation (QC) are important because they change the physical requirements for achieving universal QC. For example, one-way QC requires the preparation of an entangled ''cluster'' state, followed by adaptive measurement on this state, a set of requirements which is different from the standard quantum-circuit model. Here we introduce a model based on one-way QC but without measurements (except for the final readout), instead using adiabatic deformation of a Hamiltonian whose initial ground state is the cluster state. Our results could help increase the feasibility of adiabatic schemes by using tools from one-way QC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computing and Second Quantization

Quantum computers are by their nature many particle quantum systems. Both the many-particle arrangement and being quantum are necessary for the existence of the entangled states, which are responsible for the parallelism of the quantum computers. Second quantization is a very important approximate method of describing such systems. This lecture will present the general idea of the second quantization, and discuss shortly some of the most important formulations of second quantization.

97 MATHEMATICS AND COMPUTING↗

Towards simulation of the dynamics of materials on quantum computers

A highly anticipated application for quantum computers is as a universal simulator of quantum many-body systems, as was conjectured by Richard Feynman in the 1980s. The last decade has witnessed the growing success of quantum computing for simulating static properties of quantum systems, i.e., the ground state energy of small molecules. However, it remains a challenge to simulate quantum many-body dynamics on current-to-near-future noisy intermediate-scale quantum computers. In this work, we demonstrate successful simulation of nontrivial quantum dynamics on IBM's Q16 Melbourne quantum processor and Rigetti's Aspen quantum processor; namely, ultrafast control of emergent magnetism by THz radiation in an atomically-thin two-dimensional material. The full code and step-by-step tutorials for performing such simulations are included to lower the barrier to access for future research on these two quantum computers. As such, this work lays a foundation for the promising study of a wide variety of quantum dynamics on near-future quantum computers, including dynamic localization of Floquet states and topological protection of qubits in noisy environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

97 MATHEMATICS AND COMPUTING↗

Thermodynamic effects of single-qubit operations in silicon-based quantum computing

Silicon-based quantum logic is a promising technology to implement universal quantum computing. It is widely believed that a millikelvin cryogenic environment will be necessary to accommodate silicon-based qubits. This prompts a question of the ultimate scalability of the technology due to finite cooling capacity of refrigeration systems. In this work, we answer this question by studying energy dissipation due to interactions between nuclear spin impurities and qubit control pulses. Furthermore, we demonstrate that this interaction constrains the sustainable number of single-qubit operations per second for a given cooling capacity.

97 MATHEMATICS AND COMPUTING↗

Quantum chemistry as a benchmark for near-term quantum computers

We present a quantum chemistry benchmark for noisy intermediate-scale quantum computers that leverages the variational quantum eigensolver, active-space reduction, a reduced unitary coupled cluster ansatz, and reduced density purification as error mitigation. We demonstrate this benchmark using 4 of the available qubits on the 20-qubit IBM Tokyo and 16-qubit Rigetti Aspen processors via the simulation of alkali metal hydrides (NaH, KH, RbH), with accuracy of the computed ground state energy serving as the primary benchmark metric. We further parameterize this benchmark suite on the trial circuit type, the level of symmetry reduction, and error mitigation strategies. Our results demonstrate the characteristically high noise level present in near-term superconducting hardware, but provide a relevant baseline for future improvement of the underlying hardware, and a means for comparison across near-term hardware types. We also demonstrate how to reduce the noise in post processing with specific error mitigation techniques. Particularly, the adaptation of McWeeny purification of noisy density matrices dramatically improves accuracy of quantum computations, which, along with adjustable active space, significantly extends the range of accessible molecular systems. We demonstrate that for specific benchmark settings and a selected range of problems, the accuracy metric can reach chemical accuracy when computing over the cloud on certain quantum computers.

97 MATHEMATICS AND COMPUTING↗

Universal quantum computation using the discrete-time quantum walk

A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computing in power systems

Electric power systems provide the backbone of modern industrial societies. Enabling scalable grid analytics is the keystone to successfully operating large transmission and distribution systems. However, today's power systems are suffering from ever-increasing computational burdens in sustaining the expanding communities and deep integration of renewable energy resources, as well as managing huge volumes of data accordingly. These unprecedented challenges call for transformative analytics to support the resilient operations of power systems. Recently, the explosive growth of quantum computing techniques has ignited new hopes of revolutionizing power system computations. Quantum computing harnesses quantum mechanisms to solve traditionally intractable computational problems, which may lead to ultra-scalable and efficient power grid analytics. This paper reviews the newly emerging application of quantum computing techniques in power systems. We present a comprehensive overview of existing quantum-engineered power analytics from different operation perspectives, including static analysis, transient analysis, stochastic analysis, optimization, stability, and control. We thoroughly discuss the related quantum algorithms, their benefits and limitations, hardware implementations, and recommended practices. We also review the quantum networking techniques to ensure secure communication of power systems in the quantum era. Finally, we discuss challenges and future research directions. This paper will hopefully stimulate increasing attention to the development of quantum-engineered smart grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Computing for Energy-Related Applications

Growing interest in quantum computing and simulations have created opportunities for its deployment to improve processes pertaining to energy production, distribution, and consumption. While quantum computing is considered as a paradigm shift in our basic understanding of physical computation, effective implementation of quantum computing in energy applications also depends on progress and development in the dimensions of both quantum computing hardware and quantum computing algorithms. To fully address the status and future challenges of quantum information science (QIS) applied within the energy sector, in this presentation, we firstly summarize recent advancements on the applications of quantum computing to energy infrastructure and materials, complex energy system processes, advanced manufacturing, and energy system security. Then, we will demonstrate the results of quantum computing both on a simulator and a quantum device accessing from OLCF. Our first example is to use the variational quantum eigensolver (VQE) with a unitary coupled cluster with singles and doubles (UCCSD) ansatz to simulate a series of LixHyq molecules (q=-1, 0, +1). The obtained results showed that the quantum computing VQE-UCCSD is comparable to classical CCSD for small systems like LiH with respect to full configuration interaction (FCI). Targeting on CO2 capture application, our second example is to use VQE to quantify molecular vibrational energies and reaction pathways between CO2 and a simplified amine-based solvent model—NH3 to form H2NCOOH. This research showcases quantum computing applications in the study of CO2 capture reactions.

Duan, Yuhua↗

An introduction to financial option pricing on a qudit-based quantum computer

The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers, in areas such as portfolio optimisation and risk management to financial derivative pricing. Financial mathematics, and derivative pricing in particular, are not areas quantum physicists are traditionally trained in despite the fact that they often have the raw technical skills needed to understand such topics. On the other hand, most quantum algorithms have largely focused on qubits, which are comprised of two discrete states, as the information carriers. However, discrete higher-dimensional qudits, in addition to possibly possessing increased noise robustness and allowing for novel error correction protocols in certain hardware implementations, also have logarithmically greater information storage and processing capacity. In the current NISQ era of quantum computing, a wide array of hardware paradigms are still being studied and any potential advantage a platform offers is worth exploring. Here we introduce the basic concepts behind financial derivatives for the unfamiliar enthusiast as well as outline in great detail the quantum algorithm routines needed to price a European option, the simplest derivative. This is done within the context of a quantum computer comprised of qudits and employing the natural higher-dimensional analogue of a qubit-based pricing algorithm with its various subroutines. From these pieces, one should relatively easily be able to tailor the scheme to more complex, realistic financial derivatives. Finally, the entire stack is numerically simulated with the results demonstrating how the qudit-based scheme's payoff quickly approaches that of both a similarly-resourced classical computer as well as the true payoff, within error, for a modest increase in qudit dimension.

Bornman, Nicholas↗

Computing Free Energies with Fluctuation Relations on Quantum Computers

One of the most promising applications for quantum computers is the dynamic simulation of quantum materials. Current hardware, however, sets stringent limitations on how long such simulations can run before decoherence begins to corrupt results. The Jarzynski equality, a fluctuation theorem that allows for the computation of equilibrium free energy differences from an ensemble of short, non-equilibrium dynamics simulations, can make use of such short-time simulations on quantum computers. Here, we present a quantum algorithm based on the Jarzynski equality for computing free energies of quantum materials. We demonstrate our algorithm using the transverse field Ising model on both a quantum simulator and real quantum hardware. As the free energy is a central thermodynamic property that allows one to compute virtually any equilibrium property of a physical system, the ability to perform this algorithm for larger quantum systems in the future has implications for a wide range of applications including the construction of phase diagrams, prediction of transport properties and reaction constants, and computer-aided drug design.

Bassman, Lindsay↗

SU(2) non-Abelian gauge field theory in one dimension on digital quantum computers

A dynamical quantum simulation of SU(2) non-Abelian gauge field theory on a digital quantum computer is presented here. This was enabled on current quantum hardware by introducing a mapping of the field onto a register of qubits that utilizes local gauge symmetry while preserving local constraints on the fields, reducing the dimensionality of the calculation. Controlled plaquette operators and gauge-variant completions in the unphysical part of the Hilbert space were designed and used to implement time evolution. The new techniques developed in this work generalize to quantum simulations of higher dimensional gauge field theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable quantum computer architecture with coupled donor-quantum dot qubits

A quantum bit computing architecture includes a plurality of single spin memory donor atoms embedded in a semiconductor layer, a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, wherein a first voltage applied across at least one pair of the aligned quantum dot and donor atom controls a donor-quantum dot coupling. A method of performing quantum computing in a scalable architecture quantum computing apparatus includes arranging a pattern of single spin memory donor atoms in a semiconductor layer, forming a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, applying a first voltage across at least one aligned pair of a quantum dot and donor atom to control a donor-quantum dot coupling, and applying a second voltage between one or more quantum dots to control a Heisenberg exchange J coupling between quantum dots and to cause transport of a single spin polarized electron between quantum dots.

97 MATHEMATICS AND COMPUTING↗

(3 + 1)-dimensional Schwinger pair production with quantum computers

Real-time quantum simulation of quantum field theory in (3+1)D requires large quantum computing resources. With a few-qubit quantum computer, we develop a novel algorithm and experimentally study the Schwinger effect, the electron-positron pair production in a strong electric field, in (3+1)D. The resource reduction is achieved by treating the electric field as a background field, working in Fourier space transverse to the electric field direction, and considering parity symmetry, such that we successfully map the three spatial dimension problems into one spatial dimension problems. In this work, we observe that the rate of pair production of electrons and positrons is consistent with the theoretical predication of the Schwinger effect. Our work paves the way towards exploring quantum simulation of quantum field theory beyond one spatial dimension.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A multilayer multi-configurational approach to efficiently simulate large-scale circuit-based quantum computers on classical machines

Here, a multilayer multi-configurational theory framework is adapted to simulate circuit-based quantum computers. Quantum addition of superpositions of an exponential number of summands is performed in polynomial time with high accuracy. We demonstrate numerically accurate calculations including up to one million qubits for entangling benchmarks. Simulation cost can be assessed by entropy-based entanglement measures. For the considered systems, we show that the entanglement only grows weakly with the system size. The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.

97 MATHEMATICS AND COMPUTING↗