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,603 records · Page 89
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Using geochemical indicators to distinguish high biogeochemical activity in floodplain soils and sediments, Science of the Total Environment: Dataset

Data associated with analysis of sediment samples collected in the East River watershed and Rifle floodplain sites, CO. Samples were collected and analyzed as part of two student MS theses at Colorado School of Mines (Kenwell and Prugue) over a time period ranging from 2012 to 2015. Analyses include total organic carbon, leachable Fe and Mn, and total microbial DNA; all analyses performed at Colorado School of Mines. Methods: Samples were collected from core during a drilling campaign at the Rifle Site. Samples were collected every 1.5 m. At the East River site soil and sediment samples were collected using hand-augered bulk density sampler. Collected samples were stored at -20C until analysis. Samples were thawed in an anaerobic chamber and subsampled for extractions and DNA analysis. Samples for DNA analysis were freeze-dried, the remaining sample was oven dried and ground to 0.991 cm for TOC and leaching analysis. TOC analysis was performed on duplicate samples using a CM 5014 Coulometer (UIC, Joliet, IL, USA). Two chemical extractions were performed: hydroxylamine (HA) extraction of Fe and Mn adapted from Lovley et al., 1987 and synthetic precipitation (ppt) leaching adapted from EPA method 1312 (EPA, 1994) . For theHA extraction 3g of wet sediment was mixed with 150 mL of 0.5 N HCl in one bottle and another 3 g of sediment was mixed with 150 mL of 0.25 N hydroxylamine hydrochloride in 0.5 N HCl. Extraction were performed for 24 hours at room temperature after which samples of the liquid were removed and filtered to 0.45 micron and analyzed by ICP-AES. HA-reducible iron and manganese concentrations were determined by difference between the two extractions. For ppt leaches, a 60:40 sulfuric:nitric acid mixture was added to Milliq water to a pH of 4.2 and combined with sediment in a 20:1 mass ratio of acid to sediment. The extraction was performed for 18 hours at room temperature after which the samples of the liquid were removed and filtered to 0.45 micron and analyzed by ICP-AES. DNA was sampled from sediment using a PowerSoil DNA Isolation Kit and extractions were performed according to manufactured instuctions with one adjustment, a 1 minute bead beating replaced the 10 minute vortexing step. Extracted DNA was stored at -20C. Quantitative PCR was performed in triplicate on a Roche LightCycler 480 system and working curves were created by amplifying environmental samples with primers and bead purifying them with Agencourt AMPure XP. Analysis was performed with a Qubit 2.0 Fluorometer and Qubit dsDNA High Sensitivity Assay Kit with results converted to copies using the URI Genomics and Sequencing Center converter (Staroscik, 2004). Additional method details can be found in Kenwell et al., 2016. Lovley, D.R., Phillips, E.J.P. (1987). Rapid assay for microbially reducible ferric iron in aquatic sediments. Applied and Environmental Microbiology, 53(7), 1536-1540. Staroscik, A. (2004). Calculator for determining the number of copies of a template. URI Genomics & Sequencing Center. <http://cels.uri.edu/gsc/cndna.html>. EPA. (1994). Method 1312: Synthetic precipitation leaching procedure.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

First operation of superconducting quantum bits as particle detectors

Transmon qubits are among the leading technologies for the development of future quantum computers. However these superconducting devices are sensitive to ionizing radiation, which reduces their coherence time and leads to correlated errors. This study represents the first quantitative estimation of cosmic rays and ambient radiation impact on transmon qubits. In the shielded underground facility at the Laboratori Nazionali del Gran Sasso (LNGS), errors induced by the interaction of a radioactive source were reconstructed with an efficiency of about 10%. In contrast, in the unshielded above-ground facility at the Fermi National Accelerator Laboratory (FNAL), cosmic and ambient radiation impacts were detected with an efficiency ranging from 10% to 20% by modifying the acquisition protocol. Lastly, the simultaneous readout of three transmons in coincidence was demonstrated, achieving an event reconstruction efficiency of 90% when the devices were illuminated with an LED.

Bonomo, Camilla [Rome U.; INFN, Rome]↗
DOE OSTI2021

Effect of barren plateaus on gradient-free optimization

Barren plateau landscapes correspond to gradients that vanish exponentially in the number of qubits. Such landscapes have been demonstrated for variational quantum algorithms and quantum neural networks with either deep circuits or global cost functions. For obvious reasons, it is expected that gradient-based optimizers will be significantly affected by barren plateaus. However, whether or not gradient-free optimizers are impacted is a topic of debate, with some arguing that gradient-free approaches are unaffected by barren plateaus. Here we show that, indeed, gradient-free optimizers do not solve the barren plateau problem. Our main result proves that cost function differences, which are the basis for making decisions in a gradient-free optimization, are exponentially suppressed in a barren plateau. Hence, without exponential precision, gradient-free optimizers will not make progress in the optimization. We numerically confirm this by training in a barren plateau with several gradient-free optimizers (Nelder-Mead, Powell, and COBYLA algorithms), and show that the numbers of shots required in the optimization grows exponentially with the number of qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Pulse-level noisy quantum circuits with QuTiP

The study of the impact of noise on quantum circuits is especially relevant to guide the progress of Noisy Intermediate-Scale Quantum (NISQ) computing. In this paper, we address the pulse-level simulation of noisy quantum circuits with the Quantum Toolbox in Python (QuTiP). We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian that describes the unitary evolution of the physical qubits. Various types of noise can be introduced based on the physical model, e.g., by simulating the Lindblad density-matrix dynamics or Monte Carlo quantum trajectories. In particular, the user can define environment-induced decoherence at the processor level and include noise simulation at the level of control pulses. We illustrate how the Deutsch-Jozsa algorithm is compiled and executed on a superconducting-qubit-based processor, on a spin-chain-based processor and using control optimization algorithms. We also show how to easily reproduce experimental results on cross-talk noise in an ion-based processor, and how a Ramsey experiment can be modeled with Lindblad dynamics. Finally, we illustrate how to integrate these features with other software frameworks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Ancilla-free continuous-variable SWAP test

We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the computational basis measurement is replaced by photon number-resolving measurement, and we calculate an upper bound on the error of the overlap estimate obtained from a finite Fock cutoff in the detector. As an example, we show that estimation of the overlap of pure, centered, single-mode Gaussian states of energy E and squeezed in opposite quadratures can be obtained to error ϵ using photon statistics below a Fock basis cutoff O(Elnϵ –1 ). This cutoff is greatly reduced to E + O(√ Elnϵ –1 ) when the states have rapidly decaying Fock tails, such as coherent states. We show how the ancilla-free CV SWAP test can be extended to many modes and applied to quantum algorithms such as variational compiling and entanglement spectroscopy in the CV setting. For the latter we also provide a new algorithm which does not have an analog in qubit systems. The ancilla-free CV SWAP test is implemented on Xanadu's 8-mode photonic processor in order to estimate the vacuum probability of a two-mode squeezed state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum simulation of real-space dynamics

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O ~ (ηdFpoly(log(g'/ϵ))), where ϵ is the discretization error, g' controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g' from poly(g'/ϵ) to poly(log(g'/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η 3 (d + η)Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates, and another using η 3 (4d) d/2 Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗
DOE OSTI2025

Hierarchical memories: Simulating quantum LDPC codes with local gates

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of [[N,K,D]] codes, referred to as hierarchical codes, that encode a number of logical qubits K=Ω(N/log(N) 2 ). The N th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient to implement the corresponding syndrome-extraction circuit and achieve a threshold. Below threshold the logical failure rate vanishes superpolynomially as a function of the distance D(N). We present a bilayer architecture for implementing the syndrome-extraction circuit, and estimate the logical failure rate for this architecture. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.

Pattison, Christopher A. [California Institute of ↗
DOE OSTI2025

Block encoding bosons by signal processing

Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.

Kane, Christopher F↗
DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗
DOE OSTI2023

Machine-Guided Design of Oxidation-Resistant Superconductors for Quantum Information Applications

Decoherence in superconducting qubits has long been attributed to two-level systems arising from the surfaces and interfaces present in real devices. A recent significant step in reducing decoherence was the replacement of superconducting niobium by superconducting tantalum, resulting in a tripling of transmon qubit lifetimes (T1). The identity, thickness, and quality of the native surface oxide, is thought to play a major role, as tantalum only has one oxide whereas niobium has several. Here we report the development of a thermodynamic metric to rank materials based on their potential to form a well-defined, thin, surface oxide. We first computed this metric for known binary and ternary metal alloys using data available from the Materials Project and experimentally validated the strengths and limits of this metric through the preparation and controlled oxidation of eight known metal alloys. Then we trained a convolutional neural network to predict the value of this metric from atomic composition and atomic properties. This allowed us to compute the metric for materials that are not present in the Materials Project, including a large selection of known superconductors, and, when combined with Tc, allowed us to identify new candidate superconductors for quantum information science and engineering (QISE) applications. We tested the oxidation resistance of a pair of these predictions experimentally. Our results are expected to lay the foundation for the tailored and rapid selection of improved superconductors for QISE.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Probing Non-Equilibrium Pair-Breaking and Quasiparticle Dynamics in Nb Superconducting Resonators Under Magnetic Fields

We conducted a comprehensive study of the non-equilibrium dynamics of Cooper pair breaking, quasiparticle (QP) generation, and relaxation in niobium (Nb) cut from superconducting radio-frequency (SRF) cavities, as well as various Nb resonator films from transmon qubits. Using ultrafast pump–probe spectroscopy, we were able to isolate the superconducting coherence and pair-breaking responses. Our results reveal both similarities and notable differences in the temperature- and magnetic-field-dependent dynamics of the SRF cavity and thin-film resonator samples. Moreover, femtosecond-resolved QP generation and relaxation under an applied magnetic field reveals a clear correlation between non-equilibrium QPs and the quality factor of resonators fabricated by using different deposition methods, such as DC sputtering and high-power impulse magnetron sputtering. These findings highlight the pivotal influence of fabrication techniques on the coherence and performance of Nb-based quantum devices, which are vital for applications in superconducting qubits and high-energy superconducting radio-frequency applications.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

How Well Can Quantum Embedding Method Predict the Reaction Profiles for Hydrogenation of Small Li Clusters?

Quantum computing leverages the principles of quantum mechanics in novel ways to tackle complex chemistry problems that cannot be accurately addressed using traditional quantum chemistry methods. However, the high computational cost and available number of physical qubits with high fidelity limit its application to small chemical systems. This work employed a quantum-classical framework which features a quantum active space-embedding approach to perform simulations of chemical reactions that require up to 14 qubits. This framework was applied to prototypical example metal hydrogenation reactions: the coupling between hydrogen and Li 2 , Li 3 , and Li 4 clusters. Particular attention was paid to the computation of barriers and reaction energies. The predicted reaction profiles compare well with advanced classical quantum chemistry methods, demonstrating the potential of the quantum embedding algorithm to map out reaction profiles of realistic gas-phase chemical reactions to ascertain qualitative energetic trends. Additionally, the predicted potential energy curves provide a benchmark to compare against both current and future quantum embedding approaches.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Estimation and uncertainty quantification for the output from quantum simulators

The problem of estimating certain distributions over {0, 1} d is considered here. The distribution represents a quantum system of d qubits, where there are non-trivial dependencies between the qubits. A maximum entropy approach is adopted to reconstruct the distribution from exact moments or observed empirical moments. The Robbins Monro algorithm is used to solve the intractable maximum entropy problem, by constructing an unbiased estimator of the un-normalized target with a sequential Monte Carlo sampler at each iteration. In the case of empirical moments, this coincides with a maximum likelihood estimator. A Bayesian formulation is also considered in order to quantify uncertainty a posteriori. Several approaches are proposed in order to tackle this challenging problem, according to recently developed methodologies. In particular, unbiased estimators of the gradient of the log posterior are constructed and used within a provably convergent Langevin-based Markov chain Monte Carlo method. The methods are illustrated on classically simulated output from quantum simulators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Scrambling Dynamics with Imperfections in a Solvable Model

We study how probes of quantum scrambling dynamics respond to two kinds of imperfections -- unequal forward and backward evolutions and decoherence -- in a solvable Brownian circuit model. We calculate a ``renormalized'' out-of-time-order correlator (ROTOC) in the model with $N$ qubits, and we show that the circuit-averaged ROTOC is controlled by an effective probability distribution in operator weight space which obeys a system of $N$ non-linear equations of motion. These equations can be easily solved numerically for large system sizes which are beyond the reach of exact methods. Moreover, for an operator initially concentrated on weight one $w_0=1$, we provide an exact solution to the equations in the thermodynamic limit of many qubits that is valid for all times, all non-vanishing perturbation strengths $p\gtrsim 1/\sqrt{N}$, and all decoherence strengths. We also show that a generic initial condition $w_0 >1$ leads to a metastable state that eventually collapses to the $w_0=1$ case after a lifetime $\sim \log(N/w_0)$. Our results highlight situations where it is still possible to extract the unperturbed chaos exponent even in the presence of imperfections, and we comment on the applications of our results to existing experiments with nuclear spins and to future scrambling experiments.

FOS: Physical sciences↗
DOE OSTI2025

Any Clifford+T circuit can be controlled with constant T-depth overhead

Since an n-qubit circuit consisting of CNOT gates can have up to $Ω(n^2/\log{n})$ CNOT gates, it is natural to expect that $Ω(n^2/\log{n})$ Toffoli gates are needed to apply a controlled version of such a circuit. We show that the Toffoli count can be reduced to at most n. The Toffoli depth can also be reduced to O(1), at the cost of 2n Toffoli gates, even without using any ancilla or measurement. In fact, using a measurement-based uncomputation, the Toffoli depth can be further reduced to 1. From this, we give two corollaries: any controlled Clifford circuit can be implemented with O(1) T-depth, and any Clifford+T circuit with T-depth D can be controlled with T-depth O(D), even without ancillas. As an application, we show how to catalyze a rotation by any angle up to precision $ε$ in T-depth exactly 1 using a universal $\lceil\log_2(8/ε)\rceil$-qubit catalyst state.

FOS: Physical sciences↗
DOE OSTI2026

QPatLib v1.0 — Measurement-based quantum simulation Pauli string unitary pattern collections

This Zenodo record accompanies the paper “Scalable Measurement-Based Quantum Simulation Patterns for Benchmarking” arXiv.2605.12502 and provides QPatLib v1.0 measurement-pattern datasets in human-readable JSONL together with a ZIP archive of OpenQASM 3.0 circuits used for validation and reproducibility. The patterns and circuits implement Pauli string unitaries for benchmark cases. Cases include all possible string combinations for less than 6 qubits and strings used in Hamiltonians for certain diatomic molecules for 6 or more qubits. Format: Each pattern_*.jsonl file is containins measurement patterns for all subsets for a given model/instance and subset strategy: it begins with a preamble containing model metadata, subset definitions, provenance, and (when feasible) full-pattern test results, followed by one pattern entry per subset. Each subset entry includes a required pattern_ascii field storing the measurement pattern in the measurement-calculus/Graphix standard with signal shifting, written left-to-right in the canonical order nodes → edges → measurements (with signal dependencies) → byproduct corrections (X/Z). The circuits are included as circuit_files.zip. Patterns in this record were validated against the corresponding circuits and checked for causal flow. Codes for generating these patterns can be found at QPatLib repository on Github

Graphix↗
NASA NTRS2015

Mission Control Operations: Employing a New High Performance Design for Communications Links Supporting Exploration Programs

The planetary exploration programs demand a totally new examination of data multiplexing, digital communications protocols and data transmission principles for both ground and spacecraft operations. Highly adaptive communications devices on‐board and on the ground must provide the greatest possible transmitted data density between deployed crew personnel, spacecraft and ground control teams. Regarding these requirements, this proposal borrows from research into quantum mechanical computing by applying the concept of a qubit, a single bit that represents 16 states, to radio frequency (RF) communications link design for exploration programs. This concept of placing multiple character values into a single data bit can easily make the evolutionary steps needed to meet exploration mission demands. To move the qubit from the quantum mechanical research laboratory into long distance RF data transmission, this proposal utilizes polarization modulation of the RF carrier signal to represent numbers from zero to fifteen. It introduces the concept of a binary‐to‐hexadecimal converter that quickly chops any data stream into 16‐bit words and connects variously polarized feedhorns to a single‐frequency radio transmitter. Further, the concept relies on development of a receiver that uses low‐noise amplifiers and an antenna array to quickly assess carrier polarity and perform hexadecimal to binary conversion. Early testbed experiments using the International Space Station (ISS) as an operations laboratory can be implemented to provide the most cost‐effective return for research investment. The improvement in signal‐to‐noise ratio while supporting greater baseband data rates that could be achieved through this concept justifies its consideration for long‐distance exploration programs.

Jackson, Dan E., Jr.↗