Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum processors”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Understanding and Mitigating Coherence and Frequency Fluctuations in Superconducting Transmon Qubits

Transmon qubits are a cornerstone of superconducting quantum computing platforms. However‚ their frequency and coherence properties exhibit temporal fluctuations‚ leading to performance degradation in quantum processors over time. A common mitigation approach involves frequent recalibration‚ which‚ while effective‚ results in increased system downtime. Enhancing the long-term stability of transmon qubits is therefore critical for scalable and reliable quantum computing. In this study‚ we develop novel techniques for understanding the underlying mechanisms driving frequency and coherence fluctuations in fixed-frequency transmon qubits. We further explore strategies to mitigate these instabilities‚ aiming to improve overall system robustness. Our findings provide insights into optimizing superconducting quantum hardware for practical applications.

Roy, Tanay [Fermilab]↗
DOE OSTI2024

Acceptor-Induced Bulk Dielectric Loss in Superconducting Circuits on Silicon

The performance of superconducting quantum circuits is primarily limited by dielectric loss due to interactions with two-level systems (TLSs). State-of-the-art circuits with engineered material interfaces are approaching a limit where dielectric loss from bulk substrates plays an important role. However, a microscopic understanding of dielectric loss in crystalline substrates is still lacking. In this work, we show that boron acceptors in silicon constitute a TLS bath that leads to an energy dissipation channel for superconducting circuits. We discuss how the electronic structure of boron acceptors leads to an effective TLS response in silicon. We sweep the boron concentration in silicon and demonstrate the bulk dielectric loss limit from boron acceptors. We show that boron-induced dielectric loss can be reduced in a magnetic field due to the spin-orbit structure of boron. This work provides the first detailed microscopic description of a TLS bath for superconducting circuits and demonstrates the need for ultrahigh-purity substrates for next-generation superconducting quantum processors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Suppressing Quantum Circuit Errors Due to System Variability

We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present-day noisy quantum computing platforms. This method can be run after qubit routing or postcompilation and consists of computing isomorphic subgraphs to input circuits and scoring each using heuristic cost functions derived from system calibration data. Using an independent standard algorithmic test suite, we show that it is possible to recover on average nearly 40% of missing fidelity using better qubit selection via efficient to compute cost functions. We demonstrate additional performance gains by considering qubit placement over multiple quantum processors. The overhead from these tools is minimal with respect to other compilation steps, such as qubit routing, as the number of qubits increases. As such, our method can be used to find qubit mappings for problems at the scale of quantum advantage and beyond.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Deformed Fredkin model for the ν = 5 / 2 Moore-Read state on thin cylinders

We propose a frustration-free model for the Moore-Read quantum Hall state on sufficiently thin cylinders with circumferences ≲ 7 magnetic lengths. While the Moore-Read Hamiltonian involves complicated long-range interactions between triplets of electrons in a Landau level, our effective model is a simpler one-dimensional chain of qubits with deformed Fredkin gates. We show that the ground state of the Fredkin model has high overlap with the Moore-Read wave function and accurately reproduces the latter's entanglement properties. Moreover, we demonstrate that the model captures the dynamical response of the Moore-Read state to a geometric quench, induced by suddenly changing the anisotropy of the system. We elucidate the underlying mechanism of the quench dynamics and show that it coincides with the linearized bimetric field theory. The minimal model introduced here can be directly implemented as a first step towards quantum simulation of the Moore-Read state, as we demonstrate by deriving an efficient circuit approximation to the ground state and implementing it on an IBM quantum processor. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

First-order crosstalk mitigation in parallel quantum gates driven with multi-photon transitions

Here, we demonstrate an order of magnitude reduction in the sensitivity to optical crosstalk for neighboring trapped-ion qubits during simultaneous single-qubit gates driven with individual addressing beams. Gates are implemented via two-photon Raman transitions, where crosstalk is mitigated by offsetting the drive frequencies for each qubit to avoid first-order crosstalk effects from inter-beam two-photon resonance. The technique is simple to implement, and we find that phase-dependent crosstalk due to optical interference is reduced on the most impacted neighbor from a maximal fractional rotation error of 0.185(4) without crosstalk mitigation to ≤0.006 with the mitigation strategy. Furthermore, we characterize first-order crosstalk in the two-qubit gate and avoid the resulting rotation errors for the arbitrary-axis Mølmer–Sørensen gate via a phase-agnostic composite gate. Finally, we demonstrate holistic system performance by constructing a composite CNOT gate using the improved single-qubit gates and phase-agnostic two-qubit gate. This work is done on the Quantum Scientific Computing Open User Testbed; however, our methods are widely applicable for individual addressing Raman gates and impose no significant overhead, enabling immediate improvement for quantum processors that incorporate this technique.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Provable bounds for noise-free expectation values computed from noisy samples

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

SQMS Quantum R&D in Machine Learning, Optimization and Sensing beyond Fundamental Physics Applications

This newly formed team at SQMS under the Ecosystem Thrust is looking to develop capabilities impacting societal advances outside the core domain of HEP and condensed matter physics. We explicitly leverage the experimental and algorithmic innovations developed across all groups as well as connect to broad-scope external projects of the diverse team of PIs. As the inaugural set of projects, we are studying numerically quantum machine learning models inspired by efficiently trainable echo-state and orthogonal neural networks and developing designs for related experiments to be performed on quantum processors based on SQMS SRF cQED technology and Rigetti s transmon arrays. Investigated models exploit ideas and lessons learned from multiple prior work by SQMS team members in a variety of internal and external activities [R1]. Target initial applications include noisy signal processing, potentially captured by quantum sensors or noisy QPUs, as well as simulation and classification of healthcare data. For instance, image reconstruction of the brain s electrical properties by solving the inverse Maxwell equation problem with uncertainty [R2] through a hybrid quantum-classical physics-informed architecture for time-dependent processes [R3]. The group is also investigating the application and development of novel quantum sensors based on magnetic levitation of a superconducting sphere coupled to a superconducting qubit. This coupling enables high-precision measurements of the position of the sphere, which can be used for sensitive detection of forces, enabling practical applications such as gravimetry for geophysics analysis, or accelerometry for GPS-denied navigation [R4] [R1] Rieffel, Eleanor G., Ata Akbari Asanjan, M. Sohaib Alam, Namit Anand, David E. Bernal Neira, Sophie Block, Lucas T. Brady et al. "Assessing and advancing the potential of quantum computing: A NASA case study." Future Generation Computer Systems (2024). [R2] Yu, X., Serrall s, J.E., Giannakopoulos, I.I., Liu, Z., Daniel, L., Lattanzi, R. and Zhang, Z., 2023. Pifon-ept: Mr-based electrical property tomography using physics-informed fourier networks. IEEE Journal on Multiscale and Multiphysics Computational Techniques. [R3] Wudarski, Filip, Daniel OConnor, Shaun Geaney, Ata Akbari Asanjan, Max Wilson, Elena Strbac, P. Aaron Lott, and Davide Venturelli. "Hybrid quantum-classical reservoir computing for simulating chaotic systems." arXiv preprint arXiv:2311.14105 (2023). [R4] Higgins, Gerard, Saarik Kalia, and Zhen Liu. "Maglev for dark matter: Dark-photon and axion dark matter sensing with levitated superconductors." Physical Review D 109.5 (2024): 055024.

Venturelli, Davide↗
DOE OSTI2026

Quantum utility-scale error mitigation for quantum quench dynamics in Heisenberg spin chains

Here, we implement a quantum error mitigation method termed self-mitigation, which is comparable to zero-noise extrapolation, at large scales to achieve quantum utility on near-term, noisy quantum computers. We investigate the effectiveness of several quantum error mitigation strategies, including self-mitigation, by simulating quantum quench dynamics for Heisenberg spin chains with system sizes up to 104 qubits using IBM quantum processors. In particular, we discuss the limitations of zero-noise extrapolation and the advantages offered by self-mitigation at large scales. The self-mitigation method demonstrates stable accuracy with large systems of 104 qubits comprising more than 3,000 CNOT gates. Also, we combine the discussed quantum error mitigation methods with practical entanglement entropy measuring methods, and it shows a good agreement with the theoretical estimation. Our study illustrates the usefulness of near-term noisy quantum hardware in examining the quantum quench dynamics of many-body systems at large scales and lays the groundwork for surpassing classical simulations with quantum methods prior to the development of fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Hardware-Efficient Quantum Optimization Layered Algorithms and Experiments

Quantum optimization algorithms, such as QAOA, that implement parametrized stochastic optimization solvers attempt to identify low-energy solutions of Ising systems by exploiting available quantum effects in noisy-intermediate scale machines. Engineering a well-performing parametrized quantum optimization circuit is indeed an exercise in balancing the trade-off between expressivity and implementation complexity. We show that, for MaxCut QAOA circuits defined on native hardware topology (Rigetti’s Aspen Quantum Processors), error-mitigation techniques recover simulated features of the noiseless theory. Moreover, we explore a design space for QAOA-like ansatze that perform well in theory as well as in hardware for fully-connected problems. We also discuss how efficient coherence and entanglement detection methods that could be coupled with quantum optimization experiments require only linear overhead in benchmarking time.

quantum computing↗
DOE OSTI2024

Dynamic Cooling on Contemporary Quantum Computers

We study the problem of dynamic cooling whereby a target qubit is cooled at the expense of heating up N − 1 further identical qubits by means of a global unitary operation. A standard back-of-the-envelope high-temperature estimate establishes that the target qubit temperature can be dynamically cooled by at most a factor of 1 / N . Here we provide the exact expression for the minimum temperature to which the target qubit can be cooled and reveal that there is a crossover from the high initial temperature regime, where the scaling is 1 / N , to a low initial temperature regime, where a much faster scaling of 1 / N occurs. This slow, 1 / N scaling, which was relevant for early high-temperature NMR quantum computers, is the reason dynamic cooling was dismissed as ineffectual around 20 years ago; the fact that current low-temperature quantum computers fall in the fast, 1 / N scaling regime, reinstates the appeal of dynamic cooling today. We further show that the associated work cost of cooling is exponentially more advantageous in the low-temperature regime. We discuss the implementation of dynamic cooling in terms of quantum circuits and examine the effects of hardware noise. We successfully demonstrate dynamic cooling in a three-qubit system on a real quantum processor. Since the circuit size grows quickly with N , scaling dynamic cooling to larger systems on noisy devices poses a challenge. We therefore propose a suboptimal cooling algorithm, whereby relinquishing a small amount of cooling capability results in a drastically reduced circuit complexity, greatly facilitating the implementation of dynamic cooling on near-future quantum computers. Published by the American Physical Society2024

Physics↗
DOE OSTI2022

Model predictive control for robust quantum state preparation

A critical engineering challenge in quantum technology is the accurate control of quantum dynamics. Model-based methods for optimal control have been shown to be highly effective when theory and experiment closely match. Consequently, realizing high-fidelity quantum processes with model-based control requires careful device characterization. In quantum processors based on cold atoms, the Hamiltonian can be well-characterized. For superconducting qubits operating at milli-Kelvin temperatures, the Hamiltonian is not as well-characterized. Unaccounted for physics (i.e., mode discrepancy), coherent disturbances, and increased noise compromise traditional model-based control. This work introduces model predictive control (MPC) for quantum control applications. MPC is a closed-loop optimization framework that (i) inherits a natural degree of disturbance rejection by incorporating measurement feedback, (ii) utilizes finite-horizon model-based optimizations to control complex multi-input, multi-output dynamical systems under state and input constraints, and (iii) is flexible enough to develop synergistically alongside other modern control strategies. We show how MPC can be used to generate practical optimized control sequences in representative examples of quantum state preparation. Specifically, we demonstrate for a qubit, a weakly-anharmonic qubit, and a system undergoing crosstalk, that MPC can realize successful model-based control even when the model is inadequate. These examples showcase why MPC is an important addition to the quantum engineering control suite.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Broadband bandpass Purcell filter for circuit quantum electrodynamics

In circuit quantum electrodynamics, qubits are typically measured using dispersively coupled readout resonators. Coupling between each readout resonator and its electrical environment, however, reduces the qubit lifetime via the Purcell effect. Inserting a Purcell filter counters this effect while maintaining high readout fidelity but reduces measurement bandwidth and, thus, limits multiplexing readout capacity. In this Letter, we develop and implement a multi-stage bandpass Purcell filter that yields better qubit protection while simultaneously increasing measurement bandwidth and multiplexed capacity. Here, we report on the experimental performance of our transmission-line-based implementation of this approach, a flexible design that can easily be integrated with current scaled-up, long coherence time superconducting quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Qubit Assignment Using Time Reversal

As quantum computers with large numbers of qubits become increasingly available, experiments executed on a given device may not utilize all available qubits. In this case, the outcome of executing a quantum program will depend on the ability to efficiently select a subset of high-performing physical qubits. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while relying on standard device benchmarks provides incomplete information about the performance of any specific program. Furthermore, the number of possible assignments grows combinatorially in the number of qubits on the device and in the program, motivating the use of heuristic optimization techniques. We demonstrate a practical solution to the problem of qubit assignment by using simulated annealing with a cost function based on the Loschmidt echo, a diagnostic that measures the reversibility of a quantum process. We provide theoretical justification for this choice of cost function by demonstrating that the optimal qubit assignment coincides with the optimal qubit assignment based on state fidelity in the weak error limit, and we provide experimental justification using diagnostics performed on Google’s superconducting qubit devices. We then establish the performance of simulated annealing for qubit assignment using classical simulations of noisy devices as well as optimization experiments performed on a quantum processor. Our results demonstrate that the use of Loschmidt echoes and simulated annealing provides a scalable and flexible approach to optimizing qubit assignment on near-term hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Completely Positive Map for Noisy Driven Quantum Systems Derived by Keldysh Expansion

Accurate modeling of decoherence errors in quantum processors is crucial for analyzing and improving gate fidelities. To increase the accuracy beyond that of the Lindblad dynamical map, several generalizations have been proposed, and the exploration of simpler and more systematic frameworks is still ongoing. In this paper, we introduce a decoherence model based on the Keldysh formalism. This formalism allows us to include non-periodic drives and correlated quantum noise in our model. In addition to its wide range of applications, our method is also numerically simple, and yields a CPTP map. These features allow us to integrate the Keldysh map with quantum-optimal-control techniques. We demonstrate that this strategy generates pulses that mitigate correlated quantum noise in qubit state-transfer and gate operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Demonstration of Cross-Resonance Gates with Resonator-Assisted ZZ Cancellation

We present the characterization of a CNOT gate realized by combining cross-resonance interaction with resonator-assisted ZZ cancellation in fixed-frequency transmons on a Rigetti–SQMS co-developed quantum processor. Extending earlier work on dynamical ZZ cancellation via off-resonant resonator drives [1], we demonstrate a direct CNOT gate implementation achieved through two microwave drives on the transmons that generate a CX rotation in the |10⟩−|11⟩ subspace while selectively darkening the |00⟩−|01⟩ transition. This tunable-coupler-free approach enables high-fidelity gates and enhances the scalability of superconducting quantum architectures. [1] Z. Huang et al., Phys. Rev. Applied 22, 034007 (2024)

Heidler, Paul [Fermilab]↗
DOE OSTI2024

Observing Quantum Measurement Collapse as a Learnability Phase Transition

During a quantum measurement, superpositions of states with different observable properties probabilistically collapse into one with a sharp value of the measured observable. In macroscopic quantum systems, this collapse arises via a continuous measurement-induced phase transition (MIPT) at a critical value of the strength of interaction with the measurement apparatus. MIPTs lie outside established paradigms for equilibrium or nonequilibrium critical phenomena and delineate distinct, stable dynamical and computational phases of matter. Quantum computers enable programmable simulation of the interaction of a measurement apparatus with a dynamical quantum system, to explore MIPT phenomena over a range of system sizes while retaining quantum coherence. Yet, existing experimental protocols rely on fundamentally nonscalable postselection techniques or direct classical simulation of quantum circuits. Here, we report the scalable observation of finite-size scaling evidence for an observable-sharpening MIPT in monitored quantum circuits in a chain of Yb + 171 ions in Quantinuum’s H1-1 trapped-ion quantum processor. By leveraging an equivalent description as a statistical physics problem, we implement scalable classical algorithms to infer the value of the measured observable from a single experimental shot. This technique enables a truly scalable protocol to observe observable-sharpening MIPTs in generic classes of circuits that cannot be directly classically simulated and also provides enhanced means to detect and suppress errors in the quantum simulation. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Error rate reduction of single-qubit gates via noise-aware decomposition into native gates

In the current era of Noisy Intermediate-Scale Quantum (NISQ) technology, the practical use of quantum computers remains inhibited by our inability to aptly decouple qubits from their environment to mitigate computational errors. In this paper, we introduce an approach by which knowledge of a qubit’s initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We benchmark our protocol using cloud-based access to IBM quantum processors. On ibmq_rome, we demonstrate a reduction of the single-qubit error rate by 38%, from $1.6 \times 10 ^{-3}$ to $1.0 \times 10 ^{-3}$ , provided the initial state of the input qubit is known. On ibmq_bogota, we prove that our protocol will never decrease gate fidelity, provided the system’s T 1 and T 2 times have not drifted above 100 times their assumed values. The protocol can be used to reduce quantum state preparation errors, as well as to improve the fidelity of quantum circuits for which some knowledge of the qubits’ intermediate states can be inferred. This paper presents a pathway to using information about noise levels and quantum state distributions to significantly reduce error rates associated with quantum gates via optimized decomposition into native hardware gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗