Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “qubits”

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,369 records · Page 76
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Range‐separated density functional theory using multiresolution analysis and quantum computing

Quantum computers are expected to outperform classical computers for specific problems in quantum chemistry. Such calculations remain expensive, but costs can be lowered through the partition of the molecular system. In the present study, partition was achieved with range-separated density functional theory (RS-DFT). The use of RS-DFT reduces both the basis set size and the active space size dependence of the ground state energy in comparison with the use of wave function theory (WFT) alone. The utilization of pair natural orbitals (PNOs) in place of canonical molecular orbitals (MOs) results in more compact qubit Hamiltonians. To test this strategy, a basis-set independent framework, known as multiresolution analysis (MRA), was employed to generate PNOs. Tests were conducted with the variational quantum eigensolver for a number of molecules. The results show that the proposed approach reduces the number of qubits needed to reach a target energy accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules

Abstract Materials simulations involving strongly correlated electrons pose fundamental challenges to state‐of‐the‐art electronic structure methods but are hypothesized to be the ideal use case for quantum computing algorithms. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real‐world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near‐term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using the VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies using it have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near‐term feasibility of modeling a molecule with d‐orbitals on real quantum hardware. We demonstrate that the inclusion of d‐orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE + UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Network Community Detection on Small Quantum Computers

In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. Herein, the proposed approach is applied to the network community detection problem. QLS is hardware-agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2-community detection problem on graphs of sizes of up to 410 vertices using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state-of-the-art solvers in terms of quality of the solution including reaching the optimal solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Characterization of Quantum States Based on Creation Complexity

Abstract The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which is crucial in developing efficient quantum algorithms that can outperform classical algorithms. A major question unanswered so far is what quantum states can be created with a number of elementary gates that scales polynomially with the number of qubits. In this work, it is first shown that for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is polynomial. Then, it is shown that it is possible for a large class of quantum states with polynomial creation complexity to have common coefficient features such that, given any candidate quantum state, an efficient coefficient sampling procedure can be designed to determine if the state belongs to the class or not with arbitrarily high success probability. Consequently, partial knowledge of a quantum state's creation complexity is obtained, which can be useful for designing quantum circuits and algorithms involving such a state.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Trigonometric continuous-variable gates and hybrid quantum simulations of the sine-Gordon model

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model. Using these gates, we prepare ground states via quantum imaginary-time evolution, simulate real-time dynamics, compute time-dependent vertex two-point correlation functions, and extract quantum kink profiles under topological boundary conditions. Our results demonstrate that trigonometric continuous-variable gates provide a physically natural framework for simulating interacting field theories on near-term hybrid quantum hardware, while establishing a parallel route to universality beyond polynomial gate constructions. We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

A traversable wormhole teleportation protocol in the SYK model

In this paper, we propose a concrete teleportation protocol in the SYK model based on a particle traversing a wormhole. The required operations for the communication, and insertion and extraction of the qubit, are all simple operators in terms of the basic qubits. We determine the effectiveness of this protocol, and find a version achieves almost perfect fidelity. Many features of semiclassical traversable wormholes are manifested in this setup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Noncommutative Bohnenblust–Hille inequalities

Abstract Bohnenblust–Hille inequalities for Boolean cubes have been proven with dimension-free constants that grow subexponentially in the degree (Defant et al. in Math Ann 374(1):653–680, 2019). Such inequalities have found great applications in learning low-degree Boolean functions (Eskenazis and Ivanisvili in Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, pp 203–207, 2022). Motivated by learning quantum observables, a qubit analogue of Bohnenblust–Hille inequality for Boolean cubes was recently conjectured in Rouzé et al. (Quantum Talagrand, KKL and Friedgut’s theorems and the learnability of quantum Boolean functions, 2022. arXiv preprint arXiv:2209.07279 ). The conjecture was resolved in Huang et al. (Learning to predict arbitrary quantum processes, 2022. arXiv preprint arXiv:2210.14894 ). In this paper, we give a new proof of these Bohnenblust–Hille inequalities for qubit system with constants that are dimension-free and of exponential growth in the degree. As a consequence, we obtain a junta theorem for low-degree polynomials. Using similar ideas, we also study learning problems of low degree quantum observables and Bohr’s radius phenomenon on quantum Boolean cubes.

Volberg, Alexander↗
DOE OSTI2019

Efficiently embedding QUBO problems on adiabatic quantum computers

Adiabatic quantum computers like the D-Wave 2000Q can approximately solve the QUBO problem, which is an NP-hard problem, and have been shown to outperform classical computers on several instances. Solving the QUBO problem literally means solving virtually any NP-hard problem like the traveling salesman problem, airline scheduling problem, protein folding problem, genotype imputation problem, thereby enabling significant scientific progress, and potentially saving millions/billions of dollars in logistics, airlines, healthcare and many other industries. Yet, before QUBO problems are solved on quantum computers, they must be embedded (or compiled) onto the hardware of quantum computers, which in itself is a very hard problem. Here, we propose an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value. We then compare the performance of our embedding algorithm to that of D-Wave’s embedding algorithm, which is the current state of the art, and show that our embedding algorithm convincingly outperforms D-Wave’s embedding algorithm. Our embedding approach works with perfect Chimera graphs, i.e., Chimera graphs with no missing qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Solving larger maximum clique problems using parallel quantum annealing

Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave Systems, which we consider in this work, is sparsely connected and moderately sized (on the order of thousands of qubits), thus necessitating a minor-embedding of a logical problem onto the physical qubit hardware. The combination of relatively small hardware sizes and the necessity of a minor-embedding can mean that solving large optimization problems is not possible on current quantum annealers. In this research, we show that a hybrid approach combining parallel quantum annealing with graph decomposition allows one to solve larger optimization problem accurately. We apply the approach to the Maximum Clique problem on graphs with up to 120 nodes and 6395 edges.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Improved quantum state transfer via quantum partially collapsing measurements

In this work, we present a general scheme to improve quantum state transfer (QST) by taking advantage of quantum partially collapsing measurements. The scheme consists of a weak measurement performed at the initial time on the qubit encoding the state of concern and a subsequent quantum reversal measurement at a desired time on the destined qubit. We determine the strength q{sub r} of the post quantum reversal measurement as a function of the strength p of the prior weak measurement and the evolution time t so that near-perfect QST can be achieved by choosing p close enough to 1, with a finite success probability, regardless of the evolution time and the distance over which the QST takes place. The merit of our scheme is twofold: it not only improves QST, but also suppresses the energy dissipation, if any. - Highlights: • A scheme using weak/reversal measurements is devised to improve quantum state transfer. • It can suppress dissipation allowing optimal quantum state transfer in open system. • Explicit condition for achieving near-perfect quantum state transfer is established. • Applications to spin chain and cavity array are considered in detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Resource-Efficient Chemistry on Quantum Computers with the Variational Quantum Eigensolver and The Double Unitary Coupled-Cluster approach

Applications of quantum simulation algorithms to obtain electronic energies of molecules on noisy intermediate-scale quantum (NISQ) devices require careful consideration of resources describing the complex electron correlation effects. In modeling second-quantized problems, the biggest challenge confronted is that the number of qubits scales linearly with the size of molecular basis. This poses a significant limitation on the size of the basis sets and the number of correlated electrons included in quantum simulations of chemical processes. To address this issue and to enable more realistic simulations on NISQ computers, we employ the double unitary coupled-cluster (DUCC) method to effectively downfold correlation effects into the reduced-size orbital space, commonly referred to as the active space. Using downfolding techniques, we demonstrate that properly constructed effective Hamiltonians can capture the effect of the whole orbital space in small-size active spaces. Combining the downfolding pre-processing technique with the Variational Quantum Eigensolver, we solve for the ground-state energy of H2 and Li2 in the cc-pVTZ basis using the DUCC-reduced active spaces. We compare these results to full configuration-interaction and high-level coupled-cluster reference calculations.

quantum computing, variational quantum solver, cou↗
DOE OSTI2020

Chemistry on Quantum Computers with Virtual Quantum Subspace Expansion

Several novel methods for performing calculations relevant to quantum chemistry on quantum computers have been proposed but not yet explored experimentally. Virtual quantum subspace expansion is one such algorithm developed for modeling complex molecules using their full orbital space and without the need for additional quantum resources. Here, we implement this method on the IBM Q platform and calculate the potential energy curves of the hydrogen and lithium dimers using only two qubits and simple classical post-processing. A comparable level of accuracy would require twenty qubits with previous approaches. We also develop an approach to minimize the impact of experimental noise on the stability of a generalized eigenvalue problem that is a crucial component of the algorithm. Our results demonstrate that virtual quantum subspace expansion works well in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Polynomial Scaling Localized Active Space Unitary Selective Coupled Cluster Singles and Doubles

We present a polynomial-scaling algorithm for the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. In this approach, cluster excitations are selected based on a threshold ϵ determined by the absolute gradients of the LAS-UCCSD energy with respect to cluster amplitudes. Using the generalized Wick’s theorem for multireference wave functions, we derive the gradient expression as a polynomial function of one-, two-, and three-body reduced density matrices and 1- and 2-electron integrals, valid for any multireference wave function. The resulting gradient implementation exhibits a memory scaling of 𝒪(N 6 ), with N spin orbitals in the combined active space of all fragments. The variational quantum eigensolver is used to optimize the selected cluster excitations on a quantum simulator. Furthermore, by plotting the energy error, defined as the difference between the LAS-USCCSD and corresponding CASCI energies, against the inverse cluster amplitude selection threshold (ϵ –1 ) for polyene chains containing 2 to 5 π-bond units, we establish a relationship between the energy error and the threshold. To further validate the accuracy of LAS-USCCSD, we computed the cis–trans isomerization energy of stilbene (a 20-qubit system) and the magnetic coupling constant of the tris-hydroxo-bridged chromium dimer [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ (evaluated as both 12- and 20-qubit systems) using the Qiskit-Qulacs simulator. Assessing such examples is important to determine the practical feasibility of quantum simulations for chemically realistic systems. Toward this goal, with the LAS-USCCSD algorithm we estimated the quantum resources required for simulating an active space of (30e,22o) in [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ , a size that remains beyond the reach of current quantum simulators for accurate treatment.

Algorithms↗
DOE OSTI2021

Quantum Sensing of Electron Transfer Pathways in Natural Photosynthesis Using Time-Resolved High-Field Electron Paramagnetic Resonance/Electron–Nuclear Double Resonance Spectroscopy

Photosynthetic integral membrane reaction center (RC) proteins capture and convert sunlight into chemical energy via efficient charge separation achieved through a series of rapid, photoinitiated electron transfer steps. These fast electron transfers create an entangled spin qubit (radical) pair that contains detailed information about the weak magnetic interactions, structure, and dynamics of localized protein environments involved in charge separation events. In this work, we investigate how these entangled electron spin qubits interact with nuclear spins of the protein environment using the high spectral resolution of 130 GHz electron paramagnetic resonance (EPR) and electron-nuclear double resonance (ENDOR). Spectroscopic interrogation enabled the observation and probing of protons located in the electron transfer pathway between the membrane-spanning electron pair P + Q A - (where P + is the primary donor, a special pair of bacteriochlorophylls, and Q A is the primary quinone acceptor) in the bacterial RC. Spectroscopic analysis reveals hydrogen-bonding interactions involved in regulating the route that light-induced electrons travel through the RC protein during charge separation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Spin Decoherence in VOPc@graphene Nanoribbon Complexes

Carbon nanoribbons or nanographene qubit arrays can facilitate quantum-to-quantum transduction between light, charge, and spin, making them an excellent testbed for fundamental science in quantum coherent systems and for the construction of higher-level qubit circuits. Here, in this work, we study spin decoherence due to coupling with a surrounding nuclear spin bath of an electronic molecular spin of a vanadyl phthalocyanine (VOPc) molecule integrated onto an armchair-edged graphene nanoribbon (GNR). Density functional theory (DFT) is used to obtain ground-state atomic configurations. Decay of spin coherence in Hahn echo experiments is then simulated using the cluster correlation expansion method with a spin Hamiltonian involving hyperfine and electric field gradient tensors calculated from DFT. We find that the decoherence time T 2 is anisotropic with respect to magnetic field orientation and determined only by the hydrogen nuclear spins on both VOPc and GNR. Large electron spin echo envelope modulation (ESEEM) due to nitrogen and vanadium nuclear spins is present at specific field ranges and can be completely suppressed by tuning the magnetic field. The relation between these field ranges and the hyperfine interactions is analyzed. The effects of interactions with the nuclear quadrupole moments are also studied, validating the applicability and limitations of the spin Hamiltonian when they are disregarded.

Hamiltonians↗
DOE OSTI2025

Spin Dynamics of SCRPs in ZnO Quantum Dot–Organic Molecule Conjugates Studied with Pulsed EPR

Photogenerated spin-correlated radical pairs (SCRPs) are emerging as promising new candidates for Quantum Information Science applications, where they act as electron spin qubit pairs (SQPs). Historically, these pairs have been mostly investigated in natural photosynthesis and in molecular organic donor–(linker)–acceptor systems. Recently, we have shown that these spin pairs can also be observed by time-resolved electron-paramagnetic resonance (EPR) spectroscopy in hybrid inorganic–organic conjugates. The current study builds on recent work (ACS Nano, 2025, 19, 12194–12207), in which we systematically prepared hybrid inorganic–organic molecule systems with tunable geometries that can host SCRPs/SQPs. Here, we demonstrate using pulsed EPR spectroscopy that we can generate, study, and manipulate the spins in these photogenerated SCRPs hosted on highly tailorable inorganic–organic hybrid systems. Microwave pulse-based spin manipulation is the first step toward developing quantum computing and quantum sensing applications with these promising spin-based qubit materials, which can be reversibly photogenerated in highly spin-polarized states at moderate temperatures. An attractive feature of this new class of hybrid materials is that the g-factor of the unpaired electron spin in the ZnO QD (as part of the SCRP/SQP) can be adjusted using the quantum size effect in these QDs, which allows for the selective addressability of each spin in the SCRP using microwave pulses. Additionally, we also observed a difference between the g-values of the unpaired electron in the ZnO QD in the transient SCRP state and stable photoreduced state. We hypothesize that the unpaired electron in the SCRP is delocalized as a band-like conduction electron, while in the stable photoreduced state, the electron is delocalized in a shallow electron trap state.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Selective and Scalable Control of Spin Quantum Memories in a Photonic Circuit

A central goal in many quantum information processing applications is a network of quantum memories that can be entangled with each other while being individually controlled and measured with high fidelity. This goal has motivated the development of programmable photonic integrated circuits (PICs) with integrated spin quantum memories using diamond color center spin-photon interfaces. However, this approach introduces a challenge into the microwave control of individual spins within closely packed registers. Here, we present a quantum memory-integrated photonics platform capable of (i) the integration of multiple diamond color center spins into a cryogenically compatible, high-speed programmable PIC platform, (ii) selective manipulation of individual spin qubits addressed via tunable magnetic field gradients, and (iii) simultaneous control of qubits using numerically optimized microwave pulse shaping. The combination of localized optical control, enabled by the PIC platform, together with selective spin manipulation opens the path to scalable quantum networks on intrachip and interchip platforms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗