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 1,027 records · Page 57

Quantum neural networks: Current status and prospects for development

The idea of quantum artificial neural networks, first formulated in [34], unites the artificial neural network concept with the quantum computation paradigm. Quantum artificial neural networks were first systematically considered in the PhD thesis by T. Menneer (1998). Based on the works of Menneer and Narayanan [42, 43], Kouda, Matsui, and Nishimura [35, 36], Altaisky [2, 68], Zhou [67], and others, quantum-inspired learning algorithms for neural networks were developed, and are now used in various training programs and computer games [29, 30]. The first practically realizable scaled hardware-implemented model of the quantum artificial neural network is obtained by D-Wave Systems, Inc. [33]. It is a quantum Hopfield network implemented on the basis of superconducting quantum interference devices (SQUIDs). In this work we analyze possibilities and underlying principles of an alternative way to implement quantum neural networks on the basis of quantum dots. A possibility of using quantum neural network algorithms in automated control systems, associative memory devices, and in modeling biological and social networks is examined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving Signal-to-Noise Ratio (SNR) for Readout Signals Using Adaptive Filters on Reconfigurable Controls Hardware

This study investigates the optimization of Signal-to-Noise Ratio (SNR) in superconducting quantum computing readout signals through adaptive filtering. Quantum computing technology has the potential to revolutionize various fields by delivering exponential speedup in solving certain computational problems. However, the technology's practical implementation is hindered by the difficulty of extracting clean, reliable signals during the readout phase, with various sources of noise presenting a significant barrier to clean signals. This noise, often present in readout profiles due to imperfect isolation, degrades the system's overall SNR, thus impeding the ability to extract the quantum state accurately. The research leverages the power of adaptive filtering to improve the SNR of quantum computing readout signals. Specifically, an adaptive filter is implemented in a PYNQ overlay on an FPGA, and eventually will be connected to a quantum computing system. The system models the noise with a Least Mean Squares (LMS) adaptive filter, and then subtracts the estimated noise from the received signal to improve the SNR. A Direct Memory Access (DMA) channel is used to handle the signal processing, delivering efficient, high-speed data transfer between the PYNQ system and the hardware. The study explores the benefits of this adaptive filtering technique, potentially providing a significant contribution to practical and fast quantum computing.

Johnson, Hans↗

Improving Signal-to-Noise Ratio (SNR) for Readout Signals Using Adaptive Filters on Reconfigurable Controls Hardware

This study investigates the optimization of Signal-to-Noise Ratio (SNR) in superconducting quantum computing readout signals through adaptive filtering. Quantum computing technology has the potential to revolutionize various fields by delivering exponential speedup in solving certain computational problems. However, the technology's practical implementation is hindered by the difficulty of extracting clean, reliable signals during the readout phase, with various sources of noise presenting a significant barrier to clean signals. This noise, often present in readout profiles due to imperfect isolation, degrades the system's overall SNR, thus impeding the ability to extract the quantum state accurately. The research leverages the power of adaptive filtering to improve the SNR of quantum computing readout signals. Specifically, an adaptive filter is implemented in a PYNQ overlay on an FPGA, and eventually will be connected to a quantum computing system. The system models the n oise with a Least Mean Squares (LMS) adaptive filter, and then subtracts the estimated noise from the received signal to improve the SNR. A Direct Memory Access (DMA) channel is used to handle the signal processing, delivering efficient, high-speed data transfer between the PYNQ system and the hardware. The study explores the benefits of this adaptive filtering technique, potentially providing a significant contribution to practical and fast quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum bus of metal nanoring with surface plasmon polaritons

We develop an architecture for distributed quantum computation using quantum bus of plasmonic circuits and spin qubits in self-assembled quantum dots. Deterministic quantum gates between two distant spin qubits can be reached by using an adiabatic approach in which quantum dots couple with highly detuned plasmon modes in a metallic nanoring. Plasmonic quantum bus offers a robust and scalable platform for quantum optics experiments and the development of on-chip quantum networks composed of various quantum nodes, such as quantum dots, molecules, and nanoparticles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ac Stark gradient echo memory in cold atoms

The burgeoning fields of quantum computing and quantum key distribution have created a demand for a quantum memory. The gradient echo memory scheme is a quantum memory candidate for light storage that can boast efficiencies approaching unity, as well as the flexibility to work with either two- or three-level atoms. The key to this scheme is the frequency gradient that is placed across the memory. Currently, the three-level implementation uses a Zeeman gradient and warm atoms. In this article we model an alternate gradient-creation mechanism--the ac Stark effect--to provide an improvement in the flexibility of gradient-creation and field-switching times. We propose this scheme in concert with a move to cold atoms ({approx_equal}1 mK). These temperatures would increase the storage times possible, and the small ensemble volumes would enable large ac Stark shifts with reasonable laser power. We find that memory bandwidths on the order of MHz can be produced with experimentally achievable laser powers and trapping volumes, with high precision in gradient creation and switching times on the order of nanoseconds possible. By looking at the different decoherence mechanisms present in this system, we determine that coherence times on the order of tens of milliseconds are possible, as are delay-bandwidth products of approximately 50 and efficiencies over 90%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph states of atomic ensembles engineered by photon-mediated entanglement

Abstract Graph states are a broad family of entangled quantum states, each defined by a graph composed of edges representing the correlations between subsystems. Such states constitute versatile resources for quantum computation and quantum-enhanced measurement. Their generation and engineering require a high level of control over entanglement. Here we report on the generation of continuous-variable graph states of atomic spin ensembles, which form the nodes of the graph. We program the entanglement structure encoded in the graph edges by combining global photon-mediated interactions in an optical cavity with local spin rotations. By tuning the entanglement between two subsystems, we either localize correlations within each subsystem or enable Einstein–Podolsky–Rosen steering—a strong form of entanglement that enables the extraction of precise information from one subsystem through measurements on the other. We further engineer a four-mode square graph state, highlighting the flexibility of our approach. Our method is scalable to larger and more complex graphs, laying groundwork for measurement-based quantum computation and advanced protocols in quantum metrology.

74 ATOMIC AND MOLECULAR PHYSICS↗

Variational quantum state diagonalization

Abstract Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost evaluation), and a classical computer uses this information to adjust the parameters of the gate sequence. Here we present such an algorithm for quantum state diagonalization. State diagonalization has applications in condensed matter physics (e.g., entanglement spectroscopy) as well as in machine learning (e.g., principal component analysis). For a quantum state ρ and gate sequence U , our cost function quantifies how far $$U\rho U^\dagger$$ U ρ U † is from being diagonal. We introduce short-depth quantum circuits to quantify our cost. Minimizing this cost returns a gate sequence that approximately diagonalizes ρ . One can then read out approximations of the largest eigenvalues, and the associated eigenvectors, of ρ . As a proof-of-principle, we implement our algorithm on Rigetti’s quantum computer to diagonalize one-qubit states and on a simulator to find the entanglement spectrum of the Heisenberg model ground state.

97 MATHEMATICS AND COMPUTING↗

Analysis of RF Surface Loss in a Planar 2D Qubit

The Josephson junction and shunt capacitor form a transmon qubit, which is the cornerstone of modern quantum computing platforms. For reliable quantum computing, it is important how long a qubit can remain in a superposition of quantum states, which is determined by the coherence time (T1). The coherence time of a qubit effectively sets the "lifetime" of usable quantum information, determining how long quantum computations can be performed before errors occur and information is lost. There are several sources of decoherence in transmon qubits, but the predominant one is generally considered to be dielectric losses in the natural oxide layer formed on the surface of the superconductor. In this paper, we present a numerical study of microwave surface losses in planar superconducting antennas of different transmon qubit designs. An asymptotic method for estimating the energy participation ratio in ultrathin films of nanometer scales is proposed, and estimates are given for the limits of achievable minimum RF losses depending on the electrical properties of the surface oxide and the interface of the qubit with the substrate material.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Coherent control of atomic transport in spinor optical lattices

Coherent transport of atoms trapped in an optical lattice can be controlled by microwave-induced spin flips that correlate with site-to-site hopping. We study the controllability of homogeneous one-dimensional systems of noninteracting atoms in the absence of site addressability. Given these restrictions, we construct a deterministic protocol to map an initially localized Wannier state to a wave packet that is coherently distributed over n sites. As an example, we consider a one dimensional quantum walk in the presence of both realistic photon scattering and inhomogeneous broadening of the microwave transition due to the optical lattice. Using composite pulses to suppress errors, fidelities of over 95% can be achieved for a 25-step walk. We extend the protocol for state preparation to analytic solutions for arbitrary unitary maps given homogeneous systems and in the presence of time-dependent uniform forces. Such control is important for applications in quantum information processing, such as quantum computing and quantum simulations of condensed matter phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust quantum gates via a photon triggering electromagnetically induced transparency

We propose a scheme to achieve a parallelized controlled-NOT (c-not) gate based on electromagnetically induced transparency (EIT) and cavity-assisted photon scattering. By using the flying photon as the control bit, we can implement a conditional transfer between two logical states of an atom trapped in the cavity with high fidelity and on a microsecond time scale. Thanks to the fact that the photon is well suited for scalable quantum computation, a quantum c-not gate between the single-photon pulses and the nonlocal gate on remote atoms are obtained by reflecting the photon pulse from an optical cavity with a single-trapped atom. Our protocol is robust for spontaneous emission and works quite well in the bad-cavity limit, which makes it more applicable in the laboratory with current experimental techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using IBM-Q to Study and Visualize the Ground State Properties of the Su-Schrieffer-Heeger Model

Quantum computing takes advantage of quantum mechanical properties such as superposition and entanglement in order to perform calculations that are too intensive for a classical computer. Richard Feynmann came up with the idea of quantum computers in 1982, where it was only theoretically motivated until the creation of Shor’s algorithm. This algorithm involves the factorization of large numbers, which in turn makes it possible to break encryption keys. Quantum computers would be capable of using Shor’s algorithm to crack encryptions at a significantly faster speed than a classical computer, which provided the motivation to start developing quantum computers to run Shor’s algorithm and discover other uses. In the present day, companies such as Google, Microsoft, D-Wave Systems, Rigetti Computing, and IBM are building quantum computers using different techniques and racing to achieve quantum supremacy. The purpose of quantum computing is to perform calculations that are too difficult to be executed on classical computers. But before we are able to use these computers, we must first prove that they are able to use quantum mechanics that will in turn be used to perform the calculations. As a proof of principle we use algorithms that can be done classically and compare those results to that of the quantum computer. In theory, if the quantum computer works for small qubit systems, larger qubit systems can be implemented and run on quantum computers.

97 MATHEMATICS AND COMPUTING↗

A Novel Spatial-Temporal Variational Quantum Circuit to Enable Deep Learning on NISQ Devices

Quantum computing presents a promising approach for machine learning with its capability for extremely parallel computation in high-dimension through superposition and entanglement. Despite its potential, existing quantum learning algorithms, such as Variational Quantum Circuits (VQCs), face challenges in handling more complex datasets, particularly those that are not linearly separable. What’s more, it encounters the deployability issue, making the learning models suffer a drastic accuracy drop after deploying them to the actual quantum devices. To overcome these limitations, this paper proposes a novel spatial-temporal design, namely “ST-VQC”, to integrate nonlinearity in quantum learning and improve the robustness of the learning model to noise. Specifically, ST-VQC can extract spatial features via a novel block-based encoding quantum sub-circuit coupled with a layer-wise computation quantum sub-circuit to enable temporal-wise deep learning. Additionally, a SWAP-Free physical circuit design is devised to improve robustness. These designs bring a number of hyperparameters. After a systematic analysis of the design space for each design component, an automated optimization framework is proposed to generate the ST-VQC quantum circuit. The proposed ST-VQC has been evaluated on two IBM quantum processors, ibm-cairo with 27 qubits and ibmq-lima with 7 qubits to assess its effectiveness. The results of the evaluation on the standard dataset for binary classification show that ST-VQC can achieve over 30% accuracy improvement compared with existing VQCs on actual quantum computers. Moreover, on a non-linear synthetic dataset, the STVQC outperforms a linear classifier by 27.9%, while the linear classifier using classical computing outperforms the existing VQC by 15.58%.

Li, Jinyang↗

Frequency-encoded photonic qubits for scalable quantum information processing

Among the objectives for large-scale quantum computation is the quantum interconnect: a device that uses photons to interface qubits that otherwise could not interact. However, the current approaches require photons indistinguishable in frequency—a major challenge for systems experiencing different local environments or of different physical compositions altogether. Here, we develop an entirely new platform that actually exploits such frequency mismatch for processing quantum information. Labeled “spectral linear optical quantum computation” (spectral LOQC), our protocol offers favorable linear scaling of optical resources and enjoys an unprecedented degree of parallelism, as an arbitrary Ν-qubit quantum gate may be performed in parallel on multiple Ν-qubit sets in the same linear optical device. Here, not only does spectral LOQC offer new potential for optical interconnects, but it also brings the ubiquitous technology of high-speed fiber optics to bear on photonic quantum information, making wavelength-configurable and robust optical quantum systems within reach.

97 MATHEMATICS AND COMPUTING↗

Fault localization in a microfabricated surface ion trap using diamond nitrogen-vacancy center magnetometry

Here, as quantum computing hardware becomes more complex with ongoing design innovations and growing capabilities, the quantum computing community needs increasingly powerful techniques for fabrication failure root-cause analysis. This is especially true for trapped-ion quantum computing. As trapped-ion quantum computing aims to scale to thousands of ions, the electrode numbers are growing to several hundred, with likely integrated photonic components also adding to the electrical and fabrication complexity, making faults even harder to locate. In this work, we used a high-resolution quantum magnetic imaging technique, based on nitrogen-vacancy centers in diamond, to investigate short-circuit faults in an ion trap chip. We imaged currents from these short-circuit faults to ground and compared them to intentionally created faults, finding that the root cause of the faults was failures in the on-chip trench capacitors. This work, where we exploited the performance advantages of a quantum magnetic sensing technique to troubleshoot a piece of quantum computing hardware, is a unique example of the evolving synergy between emerging quantum technologies to achieve capabilities that were previously inaccessible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recent progress of quantum annealing

We review the recent progress of quantum annealing. Quantum annealing was proposed as a method to solve generic optimization problems. Recently a Canadian company has drawn a great deal of attention, as it has commercialized a quantum computer based on quantum annealing. Although the performance of quantum annealing is not sufficiently understood, it is likely that quantum annealing will be a practical method both on a conventional computer and on a quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Communication Networks for Energy Applications: Review and Perspective

Abstract The energy sector is expected to undergo significant changes in the coming decades with the advent of new technologies, including smart grid development, microgrid expansion, increasing electric vehicle and renewable energy usage, and enhanced measures to minimize greenhouse gas emission, among others. In tandem, these changes are expected to create new opportunities for the deployment of quantum technologies within the energy sector. Building on the authors' previous reviews on the current state of and future opportunities for quantum sensing, quantum computing and quantum simulations for energy sector applications, this work provides an overview of recent progress in quantum networking and communications for the energy industry, with a focus on platforms, devices, and protocols, including quantum teleportation and quantum key distribution. Specific areas of relevance to the energy sector are then analyzed, including the role of quantum networks for greenhouse gas monitoring, secure data collection and transmission in smart grids, nuclear power plants’ safety, facilitating oil and gas exploration, and other energy‐relevant applications. This review concludes with a brief overview of areas for future innovation, including the need for platforms for simulating quantum networks, quantum material and platform design, and computational approaches to accelerate quantum protocol discovery and development.

Paudel, Hari P.↗

A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation

We present a product formula to approximate the exponential of a skew-Hermitian operator that is a sum of generators of a Lie algebra. The number of terms in the product depends on the structure factors. When the generators have large norm with respect to the dimension of the Lie algebra, or when the norm of the effective operator resulting from nested commutators is less than the product of the norms, the number of terms in the product is significantly less than that obtained from well-known results. We apply our results to construct product formulas useful for the quantum simulation of some continuous-variable and bosonic physical systems, including systems whose potential is not quadratic. For many of these systems, we show that the number of terms in the product can be sublinear or even subpolynomial in the dimension of the relevant local Hilbert spaces, where such a dimension is usually determined by the energy scale of the problem. Our results emphasize the power of quantum computers for the simulation of various quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗