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,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A scanning resonator for probing quantum coherent devices

Superconducting resonators with high quality factors are extremely sensitive detectors of the complex impedance of materials and devices coupled to them. This capability has been used to measure losses in multiple different materials and, in the case of circuit quantum electrodynamics (circuit QED), has been used to measure the coherent evolution of multiple different types of qubits. Here, we report on the implementation of a scanning resonator for probing quantum coherent devices. Our scanning setup enables tunable coherent coupling to systems of interest without the need for fabricating on-chip superconducting resonators. We measure the internal quality factor of our resonator sensor in the single-photon regime to be >104 and demonstrate capacitive imaging using our sensor with zeptoFarad sensitivity and micron spatial resolution at milliKelvin temperatures. We then use our setup to characterize the energy spectrum and coherence times of multiple transmon qubits with no on-chip readout circuitry. Our experiments introduce a new tool for using circuit QED to measure existing and proposed qubit platforms.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here, we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground-state energy of the Transverse Field Ising Model with long-range interactions with tunable range, and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot, individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground-state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward toward the application of the QAOA to more general problem instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Josephson junction with h -BN tunnel barrier: observation of low critical current noise

Decoherence in quantum bits (qubits) is a major challenge for realizing scalable quantum computing. One of the primary causes of decoherence in qubits and quantum circuits based on superconducting Josephson junctions is the critical current fluctuation. Many efforts have been devoted to suppressing the critical current fluctuation in Josephson junctions. Nonetheless, the efforts have been hindered by the defect-induced trapping states in oxide-based tunnel barriers and the interfaces with superconductors in the traditional Josephson junctions. Motivated by this, along with the recent demonstration of 2D insulator h-BN with exceptional crystallinity and low defect density, we fabricated a vertical NbSe 2 /h-BN/Nb Josephson junction consisting of a bottom NbSe 2 superconductor thin layer and a top Nb superconductor spaced by an atomically thin h-BN layer. Furthermore, we characterized the superconducting current and voltage (I–V) relationships and Fraunhofer pattern of the NbSe 2 /h-BN/Nb junction. Notably, we demonstrated the critical current noise (1/f noise power) in the h-BN-based Josephson device is at least a factor of four lower than that of the previously studied aluminum oxide-based Josephson junctions. Our work offers a strong promise of h-BN as a novel tunnel barrier for high-quality Josephson junctions and qubit applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2019

Versatile laser-free trapped-ion entangling gates

We present a general theory for laser-free entangling gates with trapped-ion hyperfine qubits, using either static or oscillating magnetic-field gradients combined with a pair of uniform microwave fields symmetrically detuned about the qubit frequency. By transforming into a 'bichromatic' interaction picture, we show that either ${\hat{\sigma }}_{\phi }\otimes {\hat{\sigma }}_{\phi }$ or ${\hat{\sigma }}_{z}\otimes {\hat{\sigma }}_{z}$ geometric phase gates can be performed. The gate basis is determined by selecting the microwave detuning. The driving parameters can be tuned to provide intrinsic dynamical decoupling from qubit frequency fluctuations. The ${\hat{\sigma }}_{z}\otimes {\hat{\sigma }}_{z}$ gates can be implemented in a novel manner which eases experimental constraints. Here, we present numerical simulations of gate fidelities assuming realistic parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Single-ion addressing via trap potential modulation in global optical fields

To date, individual addressing of ion qubits has relied primarily on local Rabi or transition frequency differences between ions created via electromagnetic field spatial gradients or via ion transport operations. Alternatively, it is possible to synthesize arbitrary local one-qubit gates by leveraging local phase differences in a global driving field. Here we report individual addressing of 40 Ca + ions in a two-ion crystal using axial potential modulation in a global gate laser field. We characterize the resulting gate performance via one-qubit randomized benchmarking, applying different random sequences to each co-trapped ion. We identify the primary error sources and compare the results with single-ion experiments to better understand our experimental limitations. These experiments form a foundation for the universal control of two ions, confined in the same potential well, with a single gate laser beam.

quantum computing↗
DOE OSTI2021

Full configuration interaction simulations of exchange-coupled donors in silicon using multi-valley effective mass theory

Abstract Donor spins in silicon have achieved record values of coherence times and single-qubit gate fidelities. The next stage of development involves demonstrating high-fidelity two-qubit logic gates, where the most natural coupling is the exchange interaction. To aid the efficient design of scalable donor-based quantum processors, we model the two-electron wave function using a full configuration interaction method within a multi-valley effective mass theory. We exploit the high computational efficiency of our code to investigate the exchange interaction, valley population, and electron densities for two phosphorus donors in a wide range of lattice positions, orientations, and as a function of applied electric fields. The outcomes are visualized with interactive images where donor positions can be swept while watching the valley and orbital components evolve accordingly. Our results provide a physically intuitive and quantitatively accurate understanding of the placement and tuning criteria necessary to achieve high-fidelity two-qubit gates with donors in silicon.

Joecker, Benjamin (ORCID:0000000302635440)↗
DOE OSTI2021

Quantum simulation of molecules without fermionic encoding of the wave function

Abstract Molecular simulations generally require fermionic encoding in which fermion statistics are encoded into the qubit representation of the wave function. Recent calculations suggest that fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. Here we show that the two-electron reduced density matrix (2-RDM) can be expressed as a unique functional of the unencoded N -qubit-particle wave function without approximation, and hence, the energy can be expressed as a functional of the 2-RDM without fermionic encoding of the wave function. In contrast to current hardware-efficient methods, the derived functional has a unique, one-to-one (and onto) mapping between the qubit-particle wave functions and 2-RDMs, which avoids the over-parametrization that can lead to optimization difficulties such as barren plateaus. An application to computing the ground-state energy and 2-RDM of H 4 is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Hamiltonian simulation in Zeno subspaces

Here, we investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum dynamics on a target qubit register with a circuit complexity similar to randomized approaches. The classical sampling overhead in the latter approaches is traded for ancilla qubit overhead in Zeno-based approaches. A second-order Zeno sequence is developed to improve scaling and implementations through unitary kicks are discussed. We derive rigorous error bounds that allow for identifying the associated circuit complexities for the first- and second-order Zeno sequences. We show that the circuits over the combined register can be identified as a subroutine commonly used in post-Trotter Hamiltonian simulation methods. We build on this observation to reveal connections between different Hamiltonian simulation algorithms.

Hamiltonian simulation↗
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 OSTI2017

What is the optimal way to prepare a Bell state using measurement and feedback?

Recent work has shown that the use of quantum feedback can significantly enhance both the speed and success rate of measurement-based remote entanglement generation, but it is generally unknown what feedback protocols are optimal for these tasks. In this work, we consider two common measurements that are capable of projecting into pairwise entangled states, namely half- and full-parity measurements of two qubits, and determine in each case a globally optimal protocol for generation of entanglement. For the half-parity measurement, we rederive a previously described protocol using more general methods and prove that it is globally optimal for several figures of merit, including maximal concurrence or fidelity and minimal time to reach a specified concurrence or fidelity. For the full-parity measurement, we derive a protocol for rapid entanglement generation related to that of (Hill, Ralph, Phys. Rev. A 77, 014305), and then map the dynamics of the concurrence of the state to the Bloch vector length of an effective qubit. This mapping allows us to prove several optimality results for feedback protocols with full-parity measurements. We further show that our full-parity protocol transfers entanglement optimally from one qubit to the other amongst all measurement-based schemes. The methods developed here will be useful for deriving feedback protocols and determining their optimality properties in many other quantum systems subject to measurement and unitary operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2019

Analysis of superfast encoding performance for electronic structure simulations

In our recent work, we examined various fermion-to-qubit mappings in the context of quantum simulation including the original Bravyi-Kitaev superfast encoding (OSE) as well as a generalized version (GSE). We return to OSE and compare it against the Jordan-Wigner (JW) transform for quantum chemistry considering the number of qubits required, the Pauli weight of terms in the transformed Hamiltonians, and the L 1 norm of the Hamiltonian. We considered a test set of molecular systems known as the Atomization Energy 6 (AE6) as well as hydrogen lattices. Our results showed that the resource efficiency of OSE is strongly affected by the spatial locality of the underlying single-particle basis. We find that OSE is outperformed by JW when the orbitals in the underlying single-particle basis are highly overlapping, which limits its applicability to near-term quantum chemistry simulations utilizing standard basis sets. In contrast, when orbitals are overlapping with only few others, as is the case of hydrogen lattices with very tight orbitals, OSE fares comparatively better. Furthermore, our results illustrate the importance of choosing the right combination of basis sets and fermion-to-qubit mapping to get the most out of a quantum device when simulating physical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗