Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum computation”

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 1,135 records · Page 63

Quasiprobabilistic Readout Correction of Midcircuit Measurements for Adaptive Feedback via Measurement Randomized Compiling

Quantum measurements are a fundamental component of quantum computing. However, on present-day quantum computers, measurements can be more error prone than quantum gates and are susceptible to nonunital errors as well as nonlocal correlations due to measurement crosstalk. While readout errors can be mitigated in postprocessing, this is inefficient in the number of qubits due to a combinatorially large number of possible states that need to be characterized. In this work, we show that measurement errors can be tailored into a simple stochastic error model using randomized compiling, enabling the efficient mitigation of readout errors via quasiprobability distributions reconstructed from the measurement of a single preparation state in an exponentially large confusion matrix. We demonstrate the scalability and power of this approach by correcting readout errors without matrix inversion on a large number of different preparation states applied to a register of eight superconducting transmon qubits. Moreover, we show that this method can be extended to midcircuit measurements used for active feedback via quasiprobabilistic error cancellation, and we demonstrate the correction of measurement errors on an ancilla qubit used to detect and actively correct bit-flip errors on an entangled memory qubit. Our approach enables the correction of readout errors on large numbers of qubits and offers a strategy for correcting readout errors in adaptive circuits in which the results of midcircuit measurements are used to perform conditional operations on nonlocal qubits in real time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coherently coupled quantum oscillators for quantum reservoir computing

Here, we analyze the properties of a quantum system composed of two coherently coupled quantum oscillators and show through simulations that it fulfills the two properties required for reservoir computing: non-linearity and fading memory. We first show that the basis states of this system apply a set of nonlinear transformations on the input signals and thus can implement neurons. We then show that the system exhibits a fading memory that can be controlled by its dissipation rates. Finally we show that a strong coupling between the oscillators is important in order to ensure complex dynamics and to populate a number of basis state neurons that is exponential in the number of physical devices.

Dudas, Julien↗

Quantum Machine Learning in High Energy Physics

Machine learning has been used in high energy physics for a long time, primarily at the analysis level with supervised classification. Quantum computing was postulated in the early 1980s as way to perform computations that would not be tractable with a classical computer. With the advent of noisy intermediate-scale quantum computing devices, more quantum algorithms are being developed with the aim at exploiting the capacity of the hardware for machine learning applications. An interesting question is whether there are ways to apply quantum machine learning to High Energy Physics. This paper reviews the first generation of ideas that use quantum machine learning on problems in high energy physics and provide an outlook on future applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Gate fidelity and coherence of an electron spin in an Si/SiGe quantum dot with micromagnet

Significance A quantum computer is able to solve certain problems that cannot be solved by a classical computer within a reasonable time. The building block of a quantum computer is called a quantum bit (qubit), the counterpart of the conventional binary digit (bit). A qubit unavoidably interacts with its environment, leading to errors in the qubit state. This article reports on the qubit performance of an electron spin in a silicon/silicon-germanium (Si/SiGe) quantum dot, and examines the dominant error mechanisms. We demonstrate that this qubit can be electrically controlled with sufficient accuracy so that remaining errors could, in principle, be corrected using known protocols, even without isotopically purified silicon. This qubit also offers a quantum memory that lasts for almost 0.5 ms.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

YBCO-on-Kapton: Material for High-Density Quan-tum Computer Interconnects with Ultra-Low Thermal Conductance

Development of practical quantum computers would require 1000's of qubits and equally large number of read-outs, bias and drive lines. New materials that combine low passive loss and good RF properties are needed. In this study we report performance of signal interconnects comprised of high-temperature YBCO films that are exfoliated from a metal substrate and transferred to a E-Kapton tape. The technology offers low-loss transition be-tween 60 K to sub-mK environments and interfacing with off-shelf flexible silicon electronics. We demonstrate < 1 dB/m at-tenuation at 6 GHz at 77 K. The microstrip assemblies demon-strated no degradation upon multiple cycles to liquid Nitrogen and conduction cooling down to 18 K. We discuss designs of a practical high-density signal cable with passive heat load well below 1 μW per line. The YBCO-on-Kapton technology offers a practical pathway to large error-corrected quantum computing systems.

47 OTHER INSTRUMENTATION↗

Certified randomness using a trapped-ion quantum processor

Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.

computer science↗

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↗

A linear response framework for quantum simulation of bosonic and fermionic correlation functions

Response functions are a fundamental aspect of physics; they represent the link between experimental observations and the underlying quantum many-body state. However, this link is often under-appreciated, as the Lehmann formalism for obtaining response functions in linear response has no direct link to experiment. Within the context of quantum computing, and via a linear response framework, we restore this link by making the experiment an inextricable part of the quantum simulation. This method can be frequency- and momentum-selective, avoids limitations on operators that can be directly measured, and can be more efficient than competing methods. As prototypical examples of response functions, we demonstrate that both bosonic and fermionic Green’s functions can be obtained, and apply these ideas to the study of a charge-density-wave material on the ibm_auckland superconducting quantum computer. The linear response method provides a robust framework for using quantum computers to study systems in physics and chemistry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emulation of complex open quantum systems using superconducting qubits

With quantum computers being out of reach for now, quantum simulators are alternative devices for efficient and accurate simulation of problems that are challenging to tackle using conventional computers. Quantum simulators are classified into analog and digital, with the possibility of constructing “hybrid” simulators by combining both techniques. Here we focus on analog quantum simulators of open quantum systems and address the limit that they can beat classical computers. In particular, as an example, we discuss simulation of the chlorosome light-harvesting antenna from green sulfur bacteria with over 250 phonon modes coupled to each electronic state. Furthermore, we propose physical setups that can be used to reproduce the quantum dynamics of a standard and multiple-mode Holstein model. The proposed scheme is based on currently available technology of superconducting circuits consist of flux qubits and quantum oscillators.

97 MATHEMATICS AND COMPUTING↗

Computational nuclear quantum many-body problem: The UNEDF project

The UNEDF project was a large-scale collaborative effort that applied high-performance computing to the nuclear quantum many-body problem. The primary focus of the project was on constructing, validating, and applying an optimized nuclear energy density functional, which entailed a wide range of pioneering developments in microscopic nuclear structure and reactions, algorithms, high-performance computing, and uncertainty quantification. UNEDF demonstrated that close associations among nuclear physicists, mathematicians, and computer scientists can lead to novel physics outcomes built on algorithmic innovations and computational developments. This review showcases a wide range of UNEDF science results to illustrate this interplay.

Configuration interaction↗

Computational nuclear quantum many-body problem: The UNEDF project

The UNEDF project was a large-scale collaborative effort that applied high-performance computing to the nuclear quantum many-body problem. The primary focus of the project was on constructing, validating, and applying an optimized nuclear energy density functional, which entailed a wide range of pioneering developments in microscopic nuclear structure and reactions, algorithms, high-performance computing, and uncertainty quantification. UNEDF demonstrated that close associations among nuclear physicists, mathematicians, and computer scientists can lead to novel physics outcomes built on algorithmic innovations and computational developments. This review showcases a wide range of UNEDF science results to illustrate this interplay.

Configuration interaction↗

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗

The Superconducting Quantum Materials and Systems Center at Fermilab

The Superconducting Quantum Materials and Systems Center, or SQMS, led by Fermilab, brings together national laboratories, academia and industry to make revolutionary advances in quantum computing and sensing, including the building and deployment of a beyond-the-state-of-the-art quantum computer. The quantum devices developed at SQMS will have game-changing impacts in basic science and in our everyday lives.

Fermilab, Fermilab↗

Adiabatically implementing quantum gates

We show that, through the approach of quantum adiabatic evolution, all of the usual quantum gates can be implemented efficiently, yielding running time of order O(1). This may be considered as a useful alternative to the standard quantum computing approach, which involves quantum gates transforming quantum states during the computing process.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Enhancing the Q-Factor of a Practical Qubit Niobium Three-Dimensional λ/4-Resonator Through Surface Treatment

Quantum computing stands as a revolutionary frontier in information technology, with the potential to solve complex problems far beyond the capacity of classical computers. At the heart of this disruptive innovation are qubits, forming the fundamental backbone of quantum computing. A leading-edge solution for constructing robust, enduring qubits involves embedding a Josephson junction within a high Q-factor, superconducting three-dimensional cavity. Further, our recent innovation lies in developing a uniquely optimized, quarter-wave resonator-based superconducting cavity, functioning at 6 GHz, specifically tailored for quantum computers. In this work, we elucidate our advancement towards elevating the Q-factor tenfold, an achievement made possible through the enhancement of machining precision, the application of rigorous postprocessing techniques—including mechanical, chemical, and surface treatments—as well as the refinement of our testing methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Practical implications of SFQ-based two-qubit gates

Scalability of today’s superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active research area in both industry and academia is to push the classical controllers to the dilution refrigerator in order to increase the scalability of quantum computers. Superconducting Single Flux Quantum (SFQ) is a classical logic technology with low power consumption and ultra-high speed, and thus is a promising candidate for in-fridge classical controllers with maximized scalability. Prior work has demonstrated high-fidelity SFQ-based single-qubit gates. However, little research has been done on SFQ-based multi-qubit gates, which are necessary to realize SFQ-based universal quantum computing.In this paper, we present the first thorough analysis of SFQ-based two-qubit gates. Our observations show that SFQ-based two-qubit gates tend to have high leakage to qubit non-computational subspace, which presents severe design challenges. We show that despite these challenges, we can realize gates with high fidelity by carefully designing optimal control methods and qubit architectures. We develop optimal control methods that suppress leakage, and also investigate various qubit architectures that reduce the leakage. After carefully engineering our SFQ-friendly quantum system, we show that it can achieve similar gate fidelity and gate time to microwave-based quantum systems. Furthermore, the promising results of this paper show that (1) SFQ-based universal quantum computation is both feasible and effective; and (2) SFQ is a promising approach in designing classical controller for quantum machines because it can increase the scalability while preserving gate fidelity and performance.

42 ENGINEERING↗

Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses

Quantum computing testbeds exhibit high-fidelity quantum control over small collections of qubits, enabling performance of precise, repeatable operations followed by measurements. Currently, these noisy intermediate-scale devices can support a sufficient number of sequential operations prior to decoherence such that near term algorithms can be performed with proximate accuracy (like chemical accuracy for quantum chemistry problems). While the results of these algorithms are imperfect, these imperfections can help bootstrap quantum computer testbed development. Demonstrations of these algorithms over the past few years, coupled with the idea that imperfect algorithm performance can be caused by several dominant noise sources in the quantum processor, which can be measured and calibrated during algorithm execution or in post-processing, has led to the use of noise mitigation to improve typical computational results. Conversely, benchmark algorithms coupled with noise mitigation can help diagnose the nature of the noise, whether systematic or purely random. Here, we outline the use of coherent noise mitigation techniques as a characterization tool in trapped-ion testbeds. We perform model-fitting of the noisy data to determine the noise source based on realistic physics focused noise models and demonstrate that systematic noise amplification coupled with error mitigation schemes provides useful data for noise model deduction. Further, in order to connect lower level noise model details with application specific performance of near term algorithms, we experimentally construct the loss landscape of a variational algorithm under various injected noise sources coupled with error mitigation techniques. This type of connection enables application-aware hardware codesign, in which the most important noise sources in specific applications, like quantum chemistry, become foci of improvement in subsequent hardware generations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗