Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “qubit”

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Geometric representations of braid and Yang–Baxter gates

Brick-wall circuits composed of the Yang–Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang–Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang–Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang–Baxter gates via the Yang–Baxterization. We find that the braid and Yang–Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang–Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang–Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang–Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang–Baxter gates on quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enhancing quantum annealing accuracy through replication-based error mitigation *

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Djidjev, Hristo N. (ORCID:0000000192868824)↗
DOE OSTI2025

Intermediate-temperature topological Uhlmann phase on IBM quantum computers

A spin-1 system can exhibit an intermediate-temperature topological regime with a quantized Uhlmann phase sandwiched by topologically trivial low- and high-temperature regimes. We present a quantum circuit consisting of system and ancilla qubits plus a probe qubit which prepares an initial state corresponding to the purified state of a spin-1 system at finite temperature, evolves the system according to the Uhlmann process, and measures the Uhlmann phase via expectation values of the probe qubit. Although classical simulations suggest the quantized Uhlmann phase is observable on International Business Machines (IBM’s) noisy intermediate-scale quantum (NISQ) computers, an implementation of the circuit without any optimization exceeds the gate count for the error budget and results in unresolved signals. Through a series of optimization with Qiskit and BQSKit, the gate count can be substantially reduced, making the jumps of the Uhlmann phase more visible. A recent hardware upgrade of IBM quantum computers further improves the signals and leads to a clearer demonstration of interesting finite-temperature topological phenomena on NISQ hardware.

Mastandrea, Christopher [Univ. of California, Merc↗
DOE OSTI2025

Listening for new physics with quantum acoustics

We present a novel application of a qubit-coupled phonon detector to search for new physics, e.g., ultralight dark matter (DM) and high-frequency gravitational waves. The detector, motivated by recent advances in quantum acoustics, is composed of superconducting transmon qubits coupled to high-overtone bulk acoustic resonators (ℎ⁡BARs) and operates in the GHz−10 GHz frequency range. New physics can excite 𝒪⁡(10 μ⁢eV) phonons within the ℎ⁡BAR, which are then converted to qubit excitations via a transducer. We detail the design, operation, backgrounds, and expected sensitivity of a prototype detector, as well as a next-generation detector optimized for new physics signals. We find that a future detector can complement current haloscope experiments in the search for both dark photon DM and high-frequency gravitational waves. Lastly, we comment on such a detector’s ability to operate as a 𝒪⁡(10 μ⁢eV) athermal phonon sensor for sub-GeV DM detection.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Scattering phase shift in quantum mechanics on quantum computers

Here, we investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in the work by Guo and Gasparian [Phys. Rev. D 108, 074504 (2023)] that relates the integrated correlation functions for a trapped system to the infinite volume scattering phase shifts through a weighted integral. The system is first discretized in a finite box with periodic boundary conditions, and the formalism in real time is verified by employing a contact interaction potential with exact solutions. Quantum circuits are then designed and constructed to implement the formalism on current quantum computing architectures. To overcome the fast oscillatory behavior of the integrated correlation functions in real-time simulation, different methods of postdata analysis are proposed and discussed. Test results on IBM hardware show that good agreement can be achieved with two qubits, but complete failure ensues with three qubits due to two-qubit gate operation errors and thermal relaxation errors.

Guo, Peng [Dakota State Univ., Madison, SD (United↗
DOE OSTI2020

Digital-analog quantum computation

Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. Here, we construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and M-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Minimally entangled state preparation of localized wave functions on quantum computers

Initializing a single site of a lattice scalar field theory into an arbitrary state with support throughout the quantum register requires $O(2^{nQ})$ entangling gates on a quantum computer with $n_Q$ qubits per site. It is conceivable that instead initializing to functions that are good approximations to states may have utility in reducing the number of required entangling gates. In the case of a single site of a noninteracting scalar field theory, initializing to a symmetric exponential wave function requires $n_Q – 1$ entangling gates, the minimal number necessary to create an entangled state of all $n_Q$ qubits. This is compared with the $2^{nQ – 1} + n_Q – 3 + δ_{nQ, 1}$ required for a symmetric Gaussian wave function. In this work, we explore the initialization of one-site $(n_Q = 4)$, two-site $(n_Q = 3)$, and three-site ( n Q = 3 ) noninteracting scalar field theories with symmetric exponential wave functions using IBM's quantum simulators and quantum devices (Poughkeepsie and Tokyo). With the digitizations attainable with $n_Q = 3,4$, these tensor-product wave functions are found to have large overlap with a Gaussian wave function and provide a suitable low-noise initialization for improvement and Somma inflation. Further, in performing these simulations, we have employed a workflow that interleaves calibrations to mitigate systematic errors in production. The calibrations allow tolerance cuts on gate performance including the fidelity of the symmetrizing Hadamard gate, both in vacuum $(|\textbf{0}\gg^{\bigotimes nQ})$ and in medium ($n_Q –1$ qubits initialized to an exponential function). The results obtained in this work are relevant to systems beyond scalar field theories, such as the deuteron radial wave function, two- and three-dimensional Cartesian-space wave functions, and nonrelativistic multinucleon systems built on a localized eigenbasis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Quantum advantages for Pauli channel estimation

We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to simultaneously learn all the eigenvalues of an n-qubit Pauli channel to ±ε precision. We give an estimation protocol with an n-qubit ancilla that succeeds with high probability using only O(n/ε 2 ) copies of the Pauli channel, while proving that any ancilla-free protocol (possibly with adaptive control and channel concatenation) would need at least Ω(2 n/3 ) rounds of measurement. We further study the advantages provided by a small number of ancillas. For the case that a k-qubit ancilla (k≤n) is available, we obtain a sample complexity lower bound of Ω(2 (n-k)/3 ) for any nonconcatenating protocol, and a stronger lower bound of Ω(n 2n-k ) for any nonadaptive, nonconcatenating protocol, which is shown to be tight. We also show how to apply the ancilla-assisted estimation protocol to a practical quantum benchmarking task in a noise-resilient and sample-efficient manner, given reasonable noise assumptions. Our results provide a practically interesting example for quantum advantages in learning and also bring insights for quantum benchmarking.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum state preparation and nonunitary evolution with diagonal operators

Realizing nonunitary transformations on unitary-gate-based quantum devices is critically important for simulating a variety of physical problems, including open quantum systems and subnormalized quantum states. Here, we present a dilation-based algorithm to simulate nonunitary operations using probabilistic quantum computing with only one ancilla qubit. We utilize the singular-value decomposition (SVD) to decompose any general quantum operator into a product of two unitary operators and a diagonal nonunitary operator, which we show can be implemented by a diagonal unitary operator in a one-qubit dilated space. While dilation techniques increase the number of qubits in the calculation, and thus the gate complexity, our algorithm limits the operations required in the dilated space to a diagonal unitary operator, which has known circuit decompositions. We use this algorithm to prepare random subnormalized two-level states on a quantum device with high fidelity. Furthermore, we present the accurate nonunitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude-damping channel computed on a quantum device. The algorithm presented will be most useful for implementing general nonunitary operations when the SVD can be readily computed, which is the case for most operators in the noisy intermediate-scale quantum computing era.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Importance of kernel bandwidth in quantum machine learning

Quantum kernel methods are considered a promising avenue for applying quantum computers to machine learning problems. Identifying hyperparameters controlling the inductive bias of quantum machine learning models is expected to be crucial given the central role hyperparameters play in determining the performance of classical machine learning methods. In this work we introduce the hyperparameter controlling the bandwidth of a quantum kernel and show that it controls the expressivity of the resulting model. We use extensive numerical experiments with multiple quantum kernels and classical data sets to show consistent change in the model behavior from underfitting (bandwidth too large) to overfitting (bandwidth too small), with optimal generalization in between. We draw a connection between the bandwidth of classical and quantum kernels and show analogous behavior in both cases. Furthermore, we show that optimizing the bandwidth can help mitigate the exponential decay of kernel values with qubit count, which is the cause behind recent observations that the performance of quantum kernel methods decreases with qubit count. Here, we reproduce these negative results and show that if the kernel bandwidth is optimized, the performance instead improves with growing qubit count and becomes competitive with the best classical methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Multispin Clifford codes for angular momentum errors in spin systems

The physical symmetries of a system play a central role in quantum error correction. Here, in this work we encode a qubit in a collection of systems with angular momentum symmetry (spins), extending the tools developed by Gross for single large spins. By considering large spins present in atomic systems and focusing on their collective symmetric subspace, we develop codes with octahedral symmetry capable of correcting errors up to second order in angular momentum operators. These errors include the most physically relevant noise sources such as microwave control errors and optical pumping. We additionally explore qubit codes that exhibit distance scaling commensurate with the surface code while permitting transversal single-qubit Clifford operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Error mitigation, optimization, and extrapolation on a trapped-ion testbed

Current noisy intermediate-scale quantum (NISQ) trapped-ion devices are subject to errors which can significantly impact the accuracy of calculations if left unchecked. A form of error mitigation called zero noise extrapolation (ZNE) can decrease an algorithm’s sensitivity to these errors without increasing the number of required qubits. Here we explore different methods for integrating this error mitigation technique into the Variational Quantum Eigensolver (VQE) algorithm for calculating the ground state of the HeH + molecule at 0.8 Å in the presence of experimental noise. Using the Quantum Scientific Computing Open User Testbed (QSCOUT) trapped-ion device, we test three methods of scaling noise for extrapolation: time stretching the two-qubit gates, scaling the sideband detuning parameter, and inserting two-qubit gate identity operations into the ansatz circuit. We find that time stretching and sideband detuning scaling fail to scale the noise on our particular hardware in a way that can be extrapolated to zero noise. Scaling our noise with global gate identity insertions and extrapolating after variational optimization, we achieve error suppression of 96.8%, resulting in an energy estimate within –0.004 ± 0.04 hartree of the ground state energy. This is an improvement, but still outside the chemical accuracy threshold of 0.0016 hartree. Furthermore, our results show that the efficacy of this error mitigation technique depends on choosing the correct implementation for a given device architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Enhancing quantum memory lifetime with measurement-free local error correction and reinforcement learning

Reliable quantum computation requires systematic identification and correction of errors that occur and accumulate in quantum hardware. To diagnose and correct such errors, standard quantum error-correcting protocols utilize global error information across the system obtained by mid-circuit readout of ancillary qubits. We investigate circuit-level error-correcting protocols that are measurement-free and based on local error information. Such a local error correction (LEC) circuit consists of faulty multi-qubit gates to perform both syndrome extraction and ancilla-controlled error removal. We develop and implement a reinforcement learning framework that takes a fixed set of faulty gates as inputs and outputs an optimized LEC circuit. To evaluate this approach, we quantitatively characterize an extension of logical qubit lifetime by a noisy LEC circuit. For the two-dimensional (2D) classical Ising model and four-dimensional toric code, our optimized LEC circuit performs better at extending a memory lifetime compared with a conventional LEC circuit based on Toom's rule in a subthreshold gate error regime. We further show that such circuits can be used to reduce the rate of mid-circuit readouts to preserve a 2D toric code memory. Lastly, we discuss the application of the LEC protocol on dissipative preparation of quantum states with topological phases.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Efficient frequency allocation for superconducting quantum processors using improved optimization techniques

Building on previous research on frequency allocation optimization for superconducting circuit quantum processors, this work incorporates several techniques to improve overall solution quality. Here, we introduce constraints and imposed edgewise differences help to improve the optimization results. We also introduce optimization variables for the orientation of each edge, defined as the direction from the control qubit to the target qubit, to be chosen during optimization. To scale up to larger processors, multimodule designs are employed with various boundary conditions, thereby enhancing the collective yield. These enhancements allow for greater flexibility in processor design by eliminating the need for handpicked orientations. We support the efficient assembly of large processors with dense connectivity by choosing the best boundary conditions. Examples demonstrate that, at low computational cost, this optimization approach finds a frequency configuration for a square chip with over 1000 qubits and over 10% yield at much larger dispersion levels than required by previous approaches.

Zhang, Zewen [Argonne National Laboratory (ANL), A↗
DOE OSTI2025

Entanglement-enhanced ac magnetometry in the presence of Markovian noise

Entanglement is a resource to improve the sensitivity of quantum sensors. In an ideal case, using an entangled state as a probe to detect target fields, we can beat the standard quantum limit by which all classical sensors are bounded. However, since entanglement is fragile against decoherence, it is unclear whether entanglement-enhanced metrology is useful in a noisy environment. Its benefit is indeed limited when estimating the amplitude of dc magnetic fields under the effect of parallel Markovian decoherence, where the noise operator is parallel to the target field. In this paper, on the contrary, we show an advantage to using an entanglement over the classical strategy under the effect of parallel Markovian decoherence when we try to detect ac magnetic fields. We consider a scenario to induce a Rabi oscillation of the qubits with the target ac magnetic fields. Although we can, in principle, estimate the amplitude of the ac magnetic fields from the Rabi oscillation, the signal becomes weak if the qubit frequency is significantly detuned from the frequency of the ac magnetic field. We show that, by using the Greenberger-Horne-Zeilinger (GHZ) states, we can significantly enhance the signal of the detuned Rabi oscillation even under the effect of parallel Markovian decoherence. Further, our method is based on the fact that the interaction time between the GHZ states and ac magnetic fields scales as 1/L to mitigate the decoherence effect, where L is the number of qubits, which contributes to improving the bandwidth of the detectable frequencies of the ac magnetic fields. Our results pave the way for new applications of entanglement-enhanced ac magnetometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Ancilla-entangling Floquet kicks for accelerating quantum algorithms

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, in this study, we accelerate quantum simulation using digital multiqubit gates that entangle primary system qubits with ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system registry. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Cold ion beam in a storage ring as a platform for large-scale quantum computers and simulators: Challenges and directions for research and development

The purpose of this paper is to evaluate the possibility of constructing a large-scale storage-ring-type ion-trap system capable of storing, cooling, and controlling a large number of ions as a platform for scalable quantum computing (QC) and quantum simulations. In such a trap, the ions form a crystalline beam moving along a circular path with a constant velocity determined by the frequency and intensity of the cooling lasers. In this paper, we consider a large leap forward in terms of the number of ions that serve as qubits in QC, from fewer than 100 available in state of the art linear ion-trap devices today to an order of 10 5 crystallized ions in the storage-ring setup. This new trap design unifies two different concepts: the storage rings of charged particles and the linear ion traps used for QC and mass spectrometry. In this paper, we use the language of particle accelerators to discuss the ion state and dynamics. We outline the differences between the above concepts, analyze challenges of the large ring with a revolving chain of ions, and propose goals for the research and development required to enable future quantum computers with 1000 times more qubits than available today. The challenge of creating such a large-scale quantum system while maintaining the necessary coherence of the qubits and the high fidelity of quantum logic operations is significant. Performing analog quantum simulations may be an achievable initial goal for such a device. Quantum calculations and simulations of complex quantum systems will move forward both the fundamental science and the applied research. Nuclear and particle physics, many-body quantum systems, lattice gauge theories, and nuclear structure calculations are just a few examples in which a large-scale quantum simulation system will become a very powerful tool to move forward our understanding of nature.

36 MATERIALS SCIENCE↗