Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum circuits”

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 919 records · Page 51

Correlating AGP on a quantum computer

For variational algorithms on the near term quantum computing hardware, it is highly desirable to use very accurate ansatze with low implementation cost. Recent studies have shown that the antisymmetrized geminal power (AGP) wavefunction can be an excellent starting point for ansatze describing systems with strong pairing correlations, as those occurring in superconductors. In this work, we show how AGP can be efficiently implemented on a quantum computer with circuit depth, number of CNOTs, and number of measurements being linear in system size. Using AGP as the initial reference, we propose and implement a unitary correlator on AGP and benchmark it on the ground state of the pairing Hamiltonian. Furthermore, the results show highly accurate ground state energies in all correlation regimes of this model Hamiltonian.

97 MATHEMATICS AND COMPUTING↗

Designing robust unitary gates: Application to concatenated composite pulses

We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase in some composite gates is essential to suppress pulse-length errors. By employing our formalism, we derive a composite unitary gate which can be seen as a concatenation of two known composite unitary operations. The obtained unitary gate has high fidelity over a wider range of error strengths compared to existing composite gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dispersive nonreciprocity between a qubit and a cavity

The dispersive interaction between a qubit and a cavity is ubiquitous in circuit and cavity quantum electrodynamics. It describes the frequency shift of one quantum mode in response to excitations in the other and, in closed systems, is necessarily bidirectional, i.e., reciprocal. Here, we present an experimental study of a nonreciprocal dispersive-type interaction between a transmon qubit and a superconducting cavity, arising from a common coupling to dissipative intermediary modes with broken time reversal symmetry. We characterize the qubit-cavity dynamics, including asymmetric frequency pulls and photon shot noise dephasing, under varying degrees of nonreciprocity by tuning the magnetic field bias of a ferrite component in situ. We introduce a general master equation model for nonreciprocal interactions in the dispersive regime, providing a compact description of the observed qubit-cavity dynamics agnostic to the intermediary system. Our result provides an example of quantum nonreciprocal phenomena beyond the typical paradigms of non-Hermitian Hamiltonians and cascaded systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Photoemission Induced Plasma Breakdown (Update)

Laser-induced photoemission of electrons offers opportunities to trigger and control plasmas and discharges. However, the underlying mechanisms are not sufficiently characterized to be fully utilized. Photoemission is highly nonlinear, achieved through multiphoton absorption, above threshold ionization, photo-assisted tunneling, etc., where the dominant process depends on the work function of the material, photon energy and associated fields, surface heating, background fields, etc. To characterize the effects of photoemission on breakdown, breakdown experiments were performed and interpreted using a 0D plasma discharge circuit model and quantum model of photoemission.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Chemical Analysis of Tantalum Thin Films compared to Niobium Thin Films using SIMS and XPS

Superconducting qubits are a leading platform for quantum computation. These circuits are typically made from superconducting materials like aluminum or niobium. However, the amorphous niobium oxide and aluminum oxide on the surface of these circuits introduce considerable RF loss due to the presence of two-level systems (TLS), which limits the maximum coherence times T1 to ~100 μs. Capping the niobium qubits with a tantalum layer leads to a 3- 5x improvement [Bal et al., 2024]. But even in this case, tantalum forms an amorphous surface oxide that introduces loss. In an effort to devise strategies to eliminate the presence of this oxide, we present a comprehensive study on the nature of Ta oxide using x-ray photoemission spectroscopy (XPS) and secondary ion mass spectrometry (ToF-SIMS) as a function of heat treatment. The thin films were annealed in ultra-high vacuum conditions and analyzed in situ to characterize the composition and evolution of the native tantalum oxide layer and oxide-metal interface. Our analysis reveals two critical differences between tantalum and niobium oxides: Nb2O5 completely dissolves at 400°C, while Ta2O5 persists even at 800°C. Additionally, tantalum oxide contains only a single suboxide (TaO), in contrast to niobium's two suboxides (NbO and NbO2). The suboxide of tantalum contributes minimally to the total oxide content and shows a relative increase with temperature. Understanding the oxide’s behavior will open new pathways for optimizing coherence times in tantalum qubits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CAFQA: A Classical Simulation Bootstrap for Variational Quantum Algorithms

Classical computing plays a critical role in the advancement of quantum frontiers in the NISQ era. In this spirit, this work uses classical simulation to bootstrap Variational Quantum Algorithms (VQAs). VQAs rely upon the iterative optimization of a parameterized unitary circuit (ansatz) with respect to an objective function. Since quantum machines are noisy and expensive resources, it is imperative to classically choose the VQA ansatz initial parameters to be as close to optimal as possible to improve VQA accuracy and accelerate their convergence on today’s devices. This work tackles the problem of finding a good ansatz initialization, by proposing CAFQA, a Clifford Ansatz For Quantum Accuracy. The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. In this ansatz, the parameters for the tunable gates are chosen by searching efficiently through the Clifford parameter space via classical simulation. The resulting initial states always equal or outperform traditional classical initialization (e.g., Hartree-Fock), and enable high-accuracy VQA estimations. CAFQA is well-suited to classical computation because: a) Clifford-only quantum circuits can be exactly simulated classically in polynomial time, and b) the discrete Clifford space is searched efficiently via Bayesian Optimization. For the Variational Quantum Eigensolver (VQE) task of molecular ground state energy estimation (up to 18 qubits), CAFQA’s Clifford Ansatz achieves a mean accuracy of nearly 99% and recovers as much as 99.99% of the molecular correlation energy that is lost in Hartree-Fock initialization. CAFQA achieves mean accuracy improvements of 6.4x and 56.8x, over the state-of-the-art, on different metrics. Here, the scalability of the approach allows for preliminary ground state energy estimation of the challenging chromium dimer (Cr2) molecule. With CAFQA’s high-accuracy initialization, the convergence of VQAs is shown to accelerate by 2.5x, even for small molecules. Furthermore, preliminary exploration of allowing a limited number of non-Clifford (T) gates in the CAFQA framework, shows that as much as 99.9% of the correlation energy can be recovered at bond lengths for which Clifford-only CAFQA accuracy is relatively limited, while remaining classically simulable.

bayesian optimization↗

Adaptive Quantum Generative Training using an Unbounded Loss Function

We propose a generative quantum learning algorithm using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum Rényi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art adaptive algorithms by learning random two-local thermal states. We perform numerical experiments of up to 12 qubits comparing our method learning algorithms that use linear objective functions and show that Rényi-ADAPT is capable of constructing shallow quantum circuits competitive with existing methods, while the gradients remain favorable resulting from the maximal Rényi divergence loss function.

quantum algorithms, quantum machine learning, quan↗

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Quantum Convolution for Multidimensional Data

The convolution operation plays a vital role in a wide range of critical algorithms across various domains, such as digital image processing, convolutional neural networks, and quantum machine learning. In existing implementations, particularly in quantum neural networks, convolution operations are usually approximated by the application of filters with data strides that are equal to the filter window sizes. One challenge with these implementations is preserving the spatial and temporal localities of the input features, specifically for data with higher dimensions. In addition, the deep circuits required to perform quantum convolution with a unity stride, especially for multidimensional data, increase the risk of violating decoherence constraints. In this work, we propose depth-optimized circuits for performing generalized multidimensional quantum convolution operations with unity stride targeting applications that process data with high dimensions, such as hyperspectral imagery and remote sensing. We experimentally evaluate and demonstrate the applicability of the proposed techniques by using real-world, high-resolution, multidimensional image data on a state-of-the-art quantum simulator from IBM Quantum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superconducting Hyperdimensional Associative Memory Circuit for Scalable Machine Learning

Here we propose a generalized architecture for the first rapid-single-flux-quantum (RSFQ) associative memory circuit. The circuit employs hyperdimensional computing (HDC), a machine learning (ML) paradigm utilizing vectors with dimensionality in the thousands to represent information. HDC designs have small memory footprints, simple computations, and simple training algorithms compared to superconducting neural network accelerators (SNNAs), making them a better option for scalable SFQ machine learning (ML) solutions. The proposed superconducting HDC (SHDC) circuit uses entirely on-chip RSFQ memory which is tightly integrated with logic, operates at 33.3 GHz, is applicable to general ML tasks, and is manufacturable at practically useful scales given current SFQ fabrication limits. Tailored to a language recognition task, SHDC consists of ~ 2-20 M Josephson junctions (JJs) and consumes up to three times less power than an analogous CMOS HDC circuit while achieving 78-84% higher throughput. SHDC is capable of outperforming the state of the art RSFQ SNNA, SuperNPU, by 48-99% for all benchmark NN architectures tested while occupying up to 90% less area and consuming up to nine times less power. To the best of the authors' knowledge, SHDC is currently the only superconducting ML approach feasible at practically useful scales for real-world ML tasks and capable of online learning.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum states of cylindrical surface charge density for modeling plasmonic circuit elements: Nanowires, nanorods, cavities, and waveguides

Nanostructures in the form of ellipsoids, prolate spheroids, rings, and cylinders are known to exhibit resonant surface and cavity modes with applications in nanophotonics and plasmonics and, more recently, in novel quantum experiments, in which control of plasmons and their interactions with plasmons, photons, phonons, excitons, and quantum emitters are desired. Nanorods and nanowires are examples of plasmonic structures with spectral properties of potential use as interconnects and circuit components. Additionally, estimates of the surface properties of these components are needed in circuit design and integrated systems. Here, we present a quantum Hamiltonian for the cylindrical surface charge density. We then study the photon excitation of plasmons on the cylindrical surface and calculate their scattering and radiative decay rate. Nonradiative decay of plasmons induces an efficient heating of the nanoparticle and can photoacoustically excite mechanical oscillations. Computational calculations are also presented for the plasmonic modes and the ensuing excitations of nanomechanical eigenmodes of nanoparticles with near-cylindrical symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

PQML: Enabling the Predictive Reproducibility on NISQ Machines for Quantum ML Applications

Quantum computing represents a groundbreaking approach to high-performance computing. In recent years, quantum computers have progressed from single-qubit processors to systems boasting over 400 qubits. The presence of such a large number of qubits offers significant advantages, including enhanced computational speed—a capability beyond classical computing methods. However, the current stage of quantum computing is referred to as the noisy intermediate-scale quantum (NISQ) era. The existence of noise in this era presents challenges in testing quantum computing applications, leading to considerable variance in application results. Furthermore, the diverse noise characteristics observed across different machines exacerbate this issue, complicating the selection of the appropriate machine for application execution. In response to these challenges, we introduce our Predictive Quantum Machine Learning (PQML) tool. This tool is designed to predict outcomes when executing identical quantum machine learning applications—specifically, a critical suite of variational quantum algorithms—across various quantum computers during the NISQ era. This effort relies on data collected over a 12-month period. To the best of our knowledge, this study represents the first attempt to ensure reproducibility across quantum computers for complex circuits. Additionally, we have developed a model capable of forecasting the accuracy of quantum computers for variational quantum algorithms, with a particular emphasis on quantum machine learning as a case study.

Senapati, Priyabrata [Kent State University]↗

Subexponential Decay of Local Correlations from Diffusion-Limited Dephasing

Chaotic quantum systems at finite entropy density are expected to act as their own heat baths, rapidly dephasing local quantum superpositions. Here, we argue that in fact this dephasing is generically subexponential in one-dimensional systems with conservation laws: all local correlation functions decay as exp⁡[−𝒪⁡(𝑡 𝛼 )] with 0 ≤ 𝛼 ≤ 2/3, even when the operators are orthogonal to all hydrodynamic modes. The mechanism is diffusion-limited dephasing, in which rare low-entropy regions (“voids”) protect quantum coherences. This intrinsically quantum effect lies beyond standard hydrodynamics and disappears under extrinsic dephasing. In random charge-conserving circuits we find 𝛼 = 1/2, while in generic translation-invariant Floquet systems we bound 𝛼 ≤ 2/3. Our arguments are general, subject principally to the assumption that thermal fluctuations can create regions of zero entropy density. In systems with energy conservation, this assumption is automatically satisfied because of the third law of thermodynamics.

information scrambling↗

Integrated optical and electrical modeling of plasmon-enhanced thin film photovoltaics: A case-study on organic devices

The nanoscale light control for absorption enhancement of organic photovoltaic (OPV) devices inevitably produces strongly non-uniform optical fields. These non-uniformities due to the localized optical modes are a primary route toward absorption enhancement in OPV devices. Therefore, a rigorous modeling tool taking into account the spatial distribution of optical field and carrier generation is necessary. Presented here is a comprehensive numerical model to describe the coupled optical and electrical behavior of plasmon-enhanced polymer:fullerene bulk heterojunction (BHJ) solar cells. In this model, a position-dependent electron-hole pair generation rate that could become highly non-uniform due to photonic nanostructures is directly calculated from the optical simulations. By considering the absorption and plasmonic properties of nanophotonic gratings included in two different popular device architectures, and applying the Poisson, current continuity, and drift/diffusion equations, the model predicts quantum efficiency, short-circuit current density, and desired carrier mobility ratios for bulk heterojunction devices incorporating nanostructures for light management. In particular, the model predicts a significant degradation of device performance when the carrier species with lower mobility are generated far from the collecting electrode. Consequently, an inverted device architecture is preferred for materials with low hole mobility. This is especially true for devices that include plasmonic nanostructures. Additionally, due to the incorporation of a plasmonic nanostructure, we use simulations to theoretically predict absorption band broadening of a BHJ into energies below the band gap, resulting in a 4.8% increase in generated photocurrent.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^8 determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

J Wayne Mullinax↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗

Continuous-time quantum walks on dynamic graphs

Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Lastly, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗