SEARCH · Engineering Papers

Results for “Quantum Computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,603 records · Page 89

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Localization in Energy Materials (Final Project Report)

The last year of this award we have continued our research on using quantum machine learning to identify phase transitions. By combining quantum machine learning with quantum computing, we extended a hybrid classical-quantum algorithm to capture the metal-insulator quantum phase transition of the Hubbard model. We have also continued our studies of non-equilibrium dynamics of interacting disordered systems. In particular, we studied the non-equilibrium transient dynamics of a system described by the Anderson-Hubbard model following an interaction and disorder quench, and the effect of disorder on the out-of-time-order correlator on the Hubbard model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS2000

Automated Design of Quantum Circuits

In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in terms of a sequence of quantum gate operations. To date, such designs have either been found by hand or by exhaustive enumeration of all possible circuit topologies. In this paper we propose an automated approach to quantum circuit design using search heuristics based on principles abstracted from evolutionary genetics, i.e. using a genetic programming algorithm adapted specially for this problem. We demonstrate the method on the task of discovering quantum circuit designs for quantum teleportation. We show that to find a given known circuit design (one which was hand-crafted by a human), the method considers roughly an order of magnitude fewer designs than naive enumeration. In addition, the method finds novel circuit designs superior to those previously known.

Williams, Colin P.↗

NASA NTRS1998

Automated Design of Quantum Circuits

evolutionary programming↗

DOE OSTI2021

QuanSimBench

QuanSimBench is a software program that performs a gate-by-gate simulation of a quantum computer with a full state vector formulation. It simulates a simplified version of Shor's algorithm with increasing number of qubits until resources are exhausted. The score (states/s) is how fast the Approximate Quantum Fourier Transform can be computed (the modular exponentiation is not timed). The goal is to quantify the ability of a computer to simulate ideal quantum circuits.

Pakin, Scott↗

DOE OSTI2024

Flag Gadgets Based on Classical Codes

Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computation. While conventional methods use a number of extra qubits that are linear in the weight of the syndrome, several improvements have been introduced using flag gadgets. In this work, we develop a framework to design flag gadgets using classical codes. Using this framework, we show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance using exponentially fewer qubits than conventional methods when qubit measurement and reset are relatively slow compared to a round of error correction. In particular, our method requires only ( 2 t + 1 ) t ⌈ log 2 ( w ) ⌉ flag qubits to fault-tolerantly measure a weight- w stabilizer. We further take advantage of the saving provided by our construction to fault-tolerantly measure multiple stabilizers using a single gadget and show that it maintains the same exponential advantage when it is used to fault-tolerantly extract the syndromes of quantum low-density parity-check codes. Using the developed framework, we perform computer-assisted search to find several small examples where our constructions reduce the number of qubits required. These small examples may be relevant to near-term experiments on small-scale quantum computers. Published by the American Physical Society 2024

Anker, Benjamin↗

DOE OSTI2014

Optical spin-to-orbital angular momentum conversion in ultra-thin metasurfaces with arbitrary topological charges

Orbital angular momentum associated with the helical phase-front of optical beams provides an unbounded “space” for both classical and quantum communications. Among the different approaches to generate and manipulate orbital angular momentum states of light, coupling between spin and orbital angular momentum allows a faster manipulation of orbital angular momentum states because it depends on manipulating the polarisation state of light, which is simpler and generally faster than manipulating conventional orbital angular momentum generators. In this work, we design and fabricate an ultra-thin spin-to-orbital angular momentum converter, based on plasmonic nano-antennas and operating in the visible wavelength range that is capable of converting spin to an arbitrary value of orbital angular momentum ℓ. The nano-antennas are arranged in an array with a well-defined geometry in the transverse plane of the beam, possessing a specific integer or half-integer topological charge q. When a circularly polarised light beam traverses this metasurface, the output beam polarisation switches handedness and the orbital angular momentum changes in value by ℓ=±2qℏ per photon. We experimentally demonstrate ℓ values ranging from ±1 to ±25 with conversion efficiencies of 8.6% ± 0.4%. Our ultra-thin devices are integratable and thus suitable for applications in quantum communications, quantum computations, and nano-scale sensing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2020

An updated LLVM-based quantum research compiler with further OpenQASM support

Abstract Quantum computing is a rapidly growing field with the potential to change how we solve previously intractable problems. Emerging hardware is approaching a complexity that requires increasingly sophisticated programming and control. Scaffold is an older quantum programming language that was originally designed for resource estimation for far-future, large quantum machines, and ScaffCC is the corresponding LLVM-based compiler. For the first time, we provide a full and complete overview of the language itself, the compiler as well as its pass structure. While previous works Abhari et al (2015 Parallel Comput. 45 2–17), Abhari et al (2012 Scaffold: quantum programming language https://cs.princeton.edu/research/techreps/TR-934-12 ), have piecemeal descriptions of different portions of this toolchain, we provide a more full and complete description in this paper. We also introduce updates to ScaffCC including conditional measurement and multidimensional qubit arrays designed to keep in step with modern quantum assembly languages, as well as an alternate toolchain targeted at maintaining correctness and low resource count for noisy-intermediate scale quantum (NISQ) machines, and compatibility with current versions of LLVM and Clang. Our goal is to provide the research community with a functional LLVM framework for quantum program analysis, optimization, and generation of executable code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2012

A search model for topological insulators with high-throughput robustness descriptors

Topological insulators (TI) are becoming one of the most studied classes of novel materials because of their great potential for applications ranging from spintronics to quantum computers. To fully integrate TI materials in electronic devices, high-quality epitaxial single-crystalline phases with sufficiently large bulk bandgaps are necessary. Current efforts have relied mostly on costly and time-consuming trial-and-error procedures. Here we show that by defining a reliable and accessible descriptor {cflx X}TI, which represents the topological robustness or feasibility of the candidate, and by searching the quantum materials repository aflowlib.org, we have automatically discovered 28 TIs (some of them already known) in five different symmetry families. These include peculiar ternary halides, Cs{l_brace}Sn,Pb,Ge{r_brace}{l_brace}Cl,Br,I{r_brace}{sub 3}, which could have been hardly anticipated without high-throughput means. Our search model, by relying on the significance of repositories in materials development, opens new avenues for the discovery of more TIs in different and unexplored classes of systems.

36 MATERIALS SCIENCE↗

DOE OSTI2019

Mapping Arbitrarily Sparse Two-body Interactions on One-dimensional Quantum Circuits

We consider an assignment problem arising in Fermionic-swap based mapping of the one-body and two-body interaction terms in simulating time evolution of a sparse second-quantized electronic structure Hamiltonian on a quantum computer. Relative efficiency of different swap networks depends on the relative costs of performing a swap layer and computing a Hamiltonian interaction term. Under the assumption that the interaction term cost dominates the computation, we develop an iterative algorithm that uses hypergraph optimal linear arrangement (HOLA) and partial distance-2 coloring to exploit arbitrary sparsity in the Hamiltonian for efficient computation using swap networks. Using a set of 122 problems from computational chemistry, we demonstrate performance improvements up to 100% relative to the state-of-the-art approaches for one-body terms and up to 86% utilization for two-body terms relative to a theoretical peak utilization. To the best of our knowledge, this is the first study to exploit arbitrary sparsity in orbital interactions for efficient computation on one-dimensional qubit connectivity layouts. The proposed algorithms form the basis for extension to map general k-body interactions that arise in other domains onto generalized qubit connectivity layouts.

quantum computing, Combinatorial Optimization, hyp↗

DOE OSTI2020

Impact of ionizing radiation on superconducting qubit coherence

The practical viability of any qubit technology stands on long coherence times and high-fidelity operations, with the superconducting qubit modality being a leading example. However, superconducting qubit coherence is impacted by broken Cooper pairs, referred to as quasiparticles, with a density that is empirically observed to be orders of magnitude greater than the value predicted for thermal equilibrium by the Bardeen-Cooper-Schrieffer (BCS) theory of superconductivity. Previous work has shown that infrared photons significantly increase the quasiparticle density, yet even in the best isolated systems, it still remains higher than expected, suggesting that another generation mechanism exists. In this Letter, we provide evidence that ionizing radiation from environmental radioactive materials and cosmic rays contributes to this observed difference, leading to an elevated quasiparticle density that would ultimately limit superconducting qubits of the type measured here to coherence times in the millisecond regime. We further demonstrate that introducing radiation shielding reduces the flux of ionizing radiation and positively correlates with increased coherence time. Albeit a small effect for today’s qubits, reducing or otherwise mitigating the impact of ionizing radiation will be critical for realizing fault-tolerant superconducting quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2016

Prime factorization using magnonic holographic devices

Determining the prime factors of a given number $N$ is a problem that requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by Shor for quantum computers. In this paper, we present experimental data that demonstrate prime factorization using spin-wave interference but without quantum entanglement. Prime factorization includes three major steps. First, a general-type computer calculates the sequence of numbers m k mod($N$), where $N$ is the number to be factorized, m is a randomly chosen positive integer, and k = 1, 2, 3, 4, 5, 6…. Next, the period of the calculated sequence $r$ is determined by exploiting spin-wave interference. Finally, the general-type computer determines the primes based on the obtained $r$. The experiment for period finding was conducted on a six-terminal Y 3 Fe 2 (FeO 4 ) 3 device. We chose number 15 for testing and determined its primes using a sequence of measurements. The obtained experimental data for a micrometer-sized prototype aimed to demonstrate the benefits of using spin-wave devices to solve complex computational problems. Scalability is one of the major strengths inherent in this type of wave-based device, which may provide a route to nanometer-sized logic circuits. We discuss the physical and technological limitations of this approach, which define the maximum size of N and the computational speed. Although this classical approach cannot compete with the quantum algorithm in terms of efficiency, magnonic holographic devices can potentially be used as complementary logic units aimed at speeding up prime factorization for classical computers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

An FPGA-based instrumentation platform for use at deep cryogenic temperatures

We describe the operation of a cryogenic instrumentation platform incorporating commercially available field-programmable gate arrays (FPGAs). The functionality of the FPGAs at temperatures approaching 4 K enables signal routing, multiplexing, and complex digital signal processing in close proximity to cooled devices or detectors within the cryostat. The performance of the FPGAs in a cryogenic environment is evaluated, including clock speed, error rates, and power consumption. Although constructed for the purpose of controlling and reading out quantum computing devices with low latency, the instrument is generic enough to be of broad use in a range of cryogenic applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2015

A Ku band pulsed electron paramagnetic resonance spectrometer using an arbitrary waveform generator for quantum control experiments at millikelvin temperatures

We present a 17 GHz (Ku band) arbitrary waveform pulsed electron paramagnetic resonance spectrometer for experiments down to millikelvin temperatures. The spectrometer is located at room temperature, while the resonator is placed either in a room temperature magnet or inside a cryogen-free dilution refrigerator; the operating temperature range of the dilution unit is from ca. 10 mK to 8 K. This combination provides the opportunity to perform quantum control experiments on electron spins in the pure-state regime. At 0.6 T, spin echo experiments were carried out using γ-irradiated quartz glass from 1 K to 12.3 mK. With decreasing temperatures, we observed an increase in spin echo signal intensities due to increasing spin polarizations, in accordance with theoretical predictions. Through experimental data fitting, thermal spin polarization at 100 mK was estimated to be at least 99%, which was almost pure state. Next, to demonstrate the ability to create arbitrary waveform pulses, we generate a shaped pulse by superposing three Gaussian pulses of different frequencies. The resulting pulse was able to selectively and coherently excite three different spin packets simultaneously—a useful ability for analyzing multi-spin system and for controlling a multi-qubit quantum computer. By applying this pulse to the inhomogeneously broadened sample, we obtain three well-resolved excitations at 8 K, 1 K, and 14 mK.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2023

A Verified Optimizer for Quantum Circuits

We present VOQC, the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called SQIR, a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of SQIR programs. SQIR programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. SQIR’s careful design and our provided automation make it possible to write and verify a broad range of optimizations in VOQC, including full-circuit transformations from cutting-edge optimizers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Control of coherence among the spins of a single electron and the three nearest neighbor {sup 13}C nuclei of a nitrogen-vacancy center in diamond

Individual nuclear spins in diamond can be optically detected through hyperfine couplings with the electron spin of a single nitrogen-vacancy (NV) center; such nuclear spins have outstandingly long coherence times. Among the hyperfine couplings in the NV center, the nearest neighbor {sup 13}C nuclear spins have the largest coupling strength. Nearest neighbor {sup 13}C nuclear spins have the potential to perform fastest gate operations, providing highest fidelity in quantum computing. Herein, we report on the control of coherences in the NV center where all three nearest neighbor carbons are of the {sup 13}C isotope. Coherence among the three and four qubits are generated and analyzed at room temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

Fusion dynamics of Majorana zero modes

Braiding and fusion of Majorana zero modes are key elements of any future topological Majorana-based quantum computer. In this article, we investigate the fusion dynamics of Majorana zero modes in the spinless Kitaev model, as well as in a spinful model describing magnet-superconductor hybrid structures. We consider various scenarios allowing us to reproduce the fusion rules of the Ising anyon model. Particular emphasis is given to the charge of the fermion obtained after fusing two Majorana zero modes: as long as it remains on the superconductor, charge quantization is absent. When moving the fermion to a nonsuperconducting region, such as a quantum dot, nearly quantized charge can be measured. Our findings confirm for both platforms that fusion dynamics of Majorana zero modes can indeed be used for the readout of Majorana qubits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Page curves and typical entanglement in linear optics

Bosonic Gaussian states are a special class of quantum states in an infinite dimensional Hilbert space that are relevant to universal continuous-variable quantum computation as well as to near-term quantum sampling tasks such as Gaussian Boson Sampling. In this work, we study entanglement within a set of squeezed modes that have been evolved by a random linear optical unitary. We first derive formulas that are asymptotically exact in the number of modes for the Rényi-2 Page curve (the average Rényi-2 entropy of a subsystem of a pure bosonic Gaussian state) and the corresponding Page correction (the average information of the subsystem) in certain squeezing regimes. We then prove various results on the typicality of entanglement as measured by the Rényi-2 entropy by studying its variance. Using the aforementioned results for the Rényi-2 entropy, we upper and lower bound the von Neumann entropy Page curve and prove certain regimes of entanglement typicality as measured by the von Neumann entropy. Our main proofs make use of a symmetry property obeyed by the average and the variance of the entropy that dramatically simplifies the averaging over unitaries. In this light, we propose future research directions where this symmetry might also be exploited. We conclude by discussing potential applications of our results and their generalizations to Gaussian Boson Sampling and to illuminating the relationship between entanglement and computational complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗