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 145 records · Page 8

S-QGPU: Shared quantum gate processing unit for distributed quantum computing

We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and, thus, significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Our preliminary analysis and simulation show that S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits (also called data qubits) in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polarization-dependent atomic dipole traps behind a circular aperture for neutral-atom quantum computing

The neutral-atom quantum computing community has successfully implemented almost all necessary steps for constructing a neutral-atom quantum computer. We present computational results of a study aimed at solving the remaining problem of creating a quantum memory with individually addressable sites for quantum computing. The basis of this quantum memory is the diffraction pattern formed by laser light incident on a circular aperture. Very close to the aperture, the diffraction pattern has localized bright and dark spots that can serve as red-detuned or blue-detuned atomic dipole traps. These traps are suitable for quantum computing even for moderate laser powers. In particular, for moderate laser intensities ({approx}100 W/cm{sup 2}) and comparatively small detunings ({approx}1000-10 000 linewidths), trap depths of {approx}1 mK and trap frequencies of several to tens of kilohertz are achieved. Our results indicate that these dipole traps can be moved by tilting the incident laser beams without significantly changing the trap properties. We also explored the polarization dependence of these dipole traps. We developed a code that calculates the trapping potential energy for any magnetic substate of any hyperfine ground state of any alkali-metal atom for any laser detuning much smaller than the fine-structure splitting for any given electric field distribution. We describe details of our calculations and include a summary of different notations and conventions for the reduced matrix element and how to convert it to SI units. We applied this code to these traps and found a method for bringing two traps together and apart controllably without expelling the atoms from the trap and without significant tunneling probability between the traps. This approach can be scaled up to a two-dimensional array of many pinholes, forming a quantum memory with single-site addressability, in which pairs of atoms can be brought together and apart for two-qubit gates for quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational quantum chemistry for single Heisenberg spin couplings made simple: Just one spin flip required

We highlight a simple strategy for computing the magnetic coupling constants, J, for a complex containing two multiradical centers. On the assumption that the system follows Heisenberg Hamiltonian physics, J is obtained from a spin-flip electronic structure calculation where only a single electron is excited (and spin-flipped), from the single reference with maximum S{sup ^}{sub z}, M, to the M − 1 manifold, regardless of the number of unpaired electrons, 2M, on the radical centers. In an active space picture involving 2M orbitals, only one β electron is required, together with only one α hole. While this observation is extremely simple, the reduction in the number of essential configurations from exponential in M to only linear provides dramatic computational benefits. This (M, M − 1) strategy for evaluating J is an unambiguous, spin-pure, wave function theory counterpart of the various projected broken symmetry density functional theory schemes, and likewise gives explicit energies for each possible spin-state that enable evaluation of properties. The approach is illustrated on five complexes with varying numbers of unpaired electrons, for which one spin-flip calculations are used to compute J. Some implications for further development of spin-flip methods are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On applications of quantum computing to plasma simulations

Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is traditionally aimed at modeling linear Hamiltonian systems of a particular form that is found in quantum mechanics, so extending the existing results to plasma applications remains a challenge. Here, we report a preliminary exploration of the long-term opportunities and likely obstacles in this area. First, we show that many plasma-wave problems are naturally representable in a quantumlike form and thus are naturally fit for quantum computers. Second, we consider more general plasma problems that include non-Hermitian dynamics (instabilities, irreversible dissipation) and nonlinearities. We show that by extending the configuration space, such systems can also be represented in a quantumlike form and thus can be simulated with quantum computers too, albeit that requires more computational resources compared to the first case. Third, we outline potential applications of hybrid quantum–classical computers, which include analysis of global eigenmodes and also an alternative approach to nonlinear simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗