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 1,081 records · Page 60
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Experimental advances with the QICK (Quantum Instrumentation Control Kit) for superconducting quantum hardware

The Quantum Instrumentation Control Kit (QICK) is a standalone open-source qubit controller that was first introduced in 2022. In this follow-up work, we present recent upgrades to the QICK and the experimental use cases they uniquely enabled for superconducting qubit systems. These include multiplexed signal generation and readout, mixer-free readout, predistorted fast flux pulses, and phase-coherent pulses for parametric operations, including high-fidelity parametric entangling gates. We explain in detail how the QICK was used to enable these experiments.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Hierarchy of multipartite correlations based on concentratable entanglement

Multipartite entanglement is one of the hallmarks of quantum mechanics and is central to quantum information processing. In this work we show that concentratable entanglement (CE), an operationally motivated entanglement measure, induces a hierarchy upon pure states from which different entanglement structures can be experimentally certified. In particular, we find that nearly all genuine multipartite entangled states can be verified through the CE. Interestingly, GHZ states prove to be far from maximally entangled according to this measure. Instead we find the exact maximal value and corresponding states for up to 18 qubits and show that these correspond to extremal quantum error correcting codes. The latter allows us to unravel a deep connection between CE and coding theory. Finally, our results also offer an alternative proof, on up to 31 qubits, that absolutely maximally entangled states do not exist. Published by the American Physical Society 2024

Schatzki, Louis (ORCID:0000000217129148)↗
DOE OSTI2024

Simulation of open quantum systems via low-depth convex unitary evolutions

Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because they typically require ancilla qubits and extensive controlled sequences. In this work, we propose a hybrid quantum-classical approach for simulating a class of open system dynamics called random-unitary channels. These channels naturally decompose into a series of convex unitary evolutions, which can then be efficiently sampled and run as independent circuits. The method does not require deep ancilla frameworks and thus can be implemented with lower noise costs. We implement simulations of open quantum systems up to dozens of qubits and with large channel ranks. Published by the American Physical Society 2024

Peetz, Joseph (ORCID:0000000274458028)↗
DOE OSTI2024

Characterizing non-Markovian and coherent errors in quantum simulation

Quantum simulation of many-body systems, particularly using ultracold atoms and trapped ions, presents a unique form of quantum control—it is a direct implementation of a multi-qubit gate generated by the Hamiltonian. As a consequence, it also faces a unique challenge in terms of benchmarking, because the well-established gate benchmarking techniques are unsuitable for this form of quantum control. Here we show that the symmetries of the target many-body Hamiltonian can be used not only to benchmark but to characterize experimental errors in the quantum simulation. We use our results to develop protocols to characterize these errors, which can be implemented using state-of-the-art technology. We consider two forms of errors: (i) unitary errors arising out of systematic errors in the applied Hamiltonian and (ii) canonical non-Markovian errors arising out of random shot-to-shot fluctuations in the applied Hamiltonian. We show that the dynamics of the expectation value of the target Hamiltonian itself, which is ideally constant in time, can be used to characterize these errors. In the presence of errors, the expectation value of the target Hamiltonian shows a characteristic thermalization dynamics, when it satisfies the operator thermalization hypothesis (OTH). That is, an oscillation in the short time followed by relaxation to a steady-state value in the long time limit. We show that while the steady-state value can be used to characterize the coherent errors, the amplitude of the oscillations can be used to estimate the non-Markovian errors. We prove a sandwich theorem to establish a linear relation between the amplitude of the oscillations and the magnitude of the non-Markovian errors. Moreover, by varying the initial state, we show that the steady state values can be used to completely construct the generator of the coherent errors. Using these results, we develop two experimental protocols to characterize the unitary errors based on these results, one of which requires single-qubit addressing and the other one doesn't. We also develop a protocol to characterize non-Markovian errors. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗
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

Detecting Spin-Bath Polarization with Quantum Quench Phase Shifts of Single Spins in Diamond

Single-qubit sensing protocols can be used to measure qubit-bath coupling parameters. However, for sufficiently large coupling, the sensing protocol itself perturbs the bath, which is predicted to result in a characteristic response in the sensing measurements. Here, we observe this bath perturbation, also known as a quantum quench, by preparing the nuclear spin bath of a nitrogen-vacancy (NV) center in polarized initial states and performing phase-resolved spin-echo measurements on the NV electron spin. These measurements reveal a time-dependent phase determined by the initial state of the bath. We derive the relationship between the sensor phase and the Gaussian spin-bath polarization and apply it to reconstruct both the axial and transverse polarization components. Using this insight, we optimize the transfer efficiency of our dynamic nuclear polarization sequence. This technique for directly measuring bath polarization may assist in preparing high-fidelity quantum memory states, improving nanoscale NMR methods, and investigating non-Gaussian quantum baths.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Cross-Cap Defects and Fault-Tolerant Logical Gates in the Surface Code and the Honeycomb Floquet Code

We consider the Z 2 toric code, surface code, and Floquet code defined on a nonorientable surface, which can be considered as families of codes extending Shor’s nine-qubit code. We investigate the fault-tolerant logical gates of the Z 2 toric code in this setup, which corresponds to e ↔ m exchanging symmetry of the underlying Z 2 gauge theory. We find that nonorientable geometry provides a new way for the emergent symmetry to act on the code space, and discover the new realization of the fault-tolerant Hadamard gate of the two-dimensional surface code with a single cross cap connecting the vertices nonlocally along a slit, dubbed a nonorientable surface code. This Hadamard gate can be realized by a constant-depth local unitary circuit modulo nonlocality caused by a cross cap. Via folding, the nonorientable surface code can be turned into a bilayer local quantum code, where the folded cross cap is equivalent to a bilayer twist terminated on a gapped boundary and the logical Hadamard only contains local gates with intralayer couplings when being away from the cross cap, as opposed to the interlayer couplings on each site needed in the case of the folded surface code. We further obtain the complete logical Clifford gate set for a stack of nonorientable surface codes and similarly for codes defined on Klein-bottle geometries. We then construct the honeycomb Floquet code in the presence of a single cross cap, and find that the period of the sequential Pauli measurements acts as a H Z logical gate on the single logical qubit, where the cross cap enriches the dynamics compared with the orientable case. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the Z 2 gauge theory, and illustrate the exotic dynamics of our code in terms of a condensation operator supported at a nonorientable surface. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

Optimal Zeno Dragging for Quantum Control: A Shortcut to Zeno with Action-Based Scheduling Optimization

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024

Physics↗
DOE OSTI2025

Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer

We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Photon blockade in a Tavis-Cummings system

We observe blockade of microwave photons in a Tavis-Cummings system comprising a superconducting cavity and up to 𝑁 =3 transmon qubits. The effect is characterized with photon-number-resolving spectroscopy using an additional dispersively coupled transmon “witness” qubit to directly probe the cavity’s photon-number distribution. We first observe polariton formation with splitting proportional to $\sqrt{𝑁}$, confirming the Tavis-Cummings coupling, and subsequently obtain sub-Poissonian cavity photon statistics when the cavity is driven at polariton frequencies.

Marinelli, Brian [University of California, Berkel↗
DOE OSTI2025

Quantum simulations of nuclear resonances with variational methods

Background: The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian Hamiltonian. Quantum computing, particularly for quantum many-body systems, offers a promising alternative, especially within the constraints of current noisy intermediate-scale quantum (NISQ) devices. Purpose: This work aims to simulate nuclear resonances using quantum algorithms by developing a variational framework compatible with non-Hermitian Hamiltonians and implementing it fully on a quantum simulator. Methods: We employ the complex scaling technique to extract resonance positions classically and adapt it for quantum simulations using a two-step algorithm. First, we transform the non-Hermitian Hamiltonian into a Hermitian form by using the energy variance as a cost function within a variational framework. Second, we perform 𝜃-trajectory calculations to determine optimal resonance positions in the complex energy plane. To address resource constraints on NISQ devices, we utilize Gray code (GC) encoding to reduce qubit requirements. Results: We first validate our approach using a schematic potential model that mimics a nuclear potential, successfully reproducing known resonance energies with high fidelity. We then extend the method to a more realistic 𝛼−𝛼 nuclear potential and compute the 𝐷- and 𝐺-wave resonance energies with a basis size of 𝑁=16, using only four qubits. The quantum simulation results closely match the classical values, demonstrating the feasibility of our approach. Conclusions: This study demonstrates, for the first time, that the complete 𝜃-trajectory method can be implemented on a quantum computer without relying on any classical input beyond the Hamiltonian. The results establish a scalable and efficient quantum framework for simulating resonance phenomena in nuclear systems. This work represents a significant step toward quantum simulations of open quantum systems and lays the foundation for future investigations into resonance structures in nuclear, atomic, and molecular physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Clifford transformations for fermionic quantum systems: From Pauli and Majorana operators to Dirac fermions

Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state distillation, quantum communication and cryptography, and qubit tapering. Moreover, circuits composed entirely of Clifford gates are classically simulatable, highlighting their computational significance. In this article we extend the concept of Clifford transformations to Dirac fermions. We demonstrate that discrete Clifford transformations are generated by half-body and pair operators while continuous Clifford transformations are generated by number operators, providing a systematic framework for their characterization. Additionally, we establish connections with fermionic mean-field theories and applications in qubit tapering, offering insights into their broader implications in quantum computing.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Distributed Quantum Learning with co-Management in a Multi-tenant Quantum System

The rapid advancement of quantum computing has pushed classical designs into the quantum domain, breaking physical boundaries for computing-intensive and data-hungry applications with the hope that some systems may provide a quantum speedup. For example, variational quantum algorithms have been proposed for quantum neural networks to train deep learning models on qubits, achieving promising results. Existing quantum learning architectures and systems rely on single, monolithic quantum machines with abundant and stable resources, such as qubits. However, fabricating a large, monolithic quantum device is considerably more challenging than producing an array of smaller devices. In this paper, we investigate a distributed quantum system that combines multiple quantum machines into a unified system. We propose DQuLearn, which divides a quantum learning task into multiple subtasks. Each subtask can be executed distributively on individual quantum machines, with the results looping back to classical machines for subsequent training iterations. Additionally, our system supports multiple concurrent clients and dynamically manages their circuits according to the runtime status of quantum workers. Through extensive experiments, we demonstrate that DQuLearn achieves similar accuracies with significant runtime reduction, by up to 68.7% and an increase per-second circuit processing speed, by up to 3.99 times, in a 4-worker multi-tenant setting.

quantum computing↗
DOE OSTI2019

Mapping Arbitrarily Sparse Two-body Interactions on One-dimensional Quantum Circuits

We consider an assignment problem arising in Fermionic-swap based mapping of the one-body and two-body interaction terms in simulating time evolution of a sparse second-quantized electronic structure Hamiltonian on a quantum computer. Relative efficiency of different swap networks depends on the relative costs of performing a swap layer and computing a Hamiltonian interaction term. Under the assumption that the interaction term cost dominates the computation, we develop an iterative algorithm that uses hypergraph optimal linear arrangement (HOLA) and partial distance-2 coloring to exploit arbitrary sparsity in the Hamiltonian for efficient computation using swap networks. Using a set of 122 problems from computational chemistry, we demonstrate performance improvements up to 100% relative to the state-of-the-art approaches for one-body terms and up to 86% utilization for two-body terms relative to a theoretical peak utilization. To the best of our knowledge, this is the first study to exploit arbitrary sparsity in orbital interactions for efficient computation on one-dimensional qubit connectivity layouts. The proposed algorithms form the basis for extension to map general k-body interactions that arise in other domains onto generalized qubit connectivity layouts.

quantum computing, Combinatorial Optimization, hyp↗
DOE OSTI2022

C2QA - Bosonic Qiskit

The practical benefits of hybrid quantum information processing hardware that contains continuous-variable objects (bosonic modes such as mechanical or electromagnetic oscillators) in addition to traditional (discrete-variable) qubits have recently been demonstrated by experiments with bosonic codes that reach the break-even point for quantum error correction [1]–[5] and by efficient Gaussian boson sampling simulation of the Franck-Condon spectra of triatomic molecules [6] that is well beyond the capabilities of current qubit-only hardware. The goal of this Co-design Center for Quantum Advantage (C2QA) project is to develop an instruction set architecture (ISA) for hybrid qubit/bosonic mode systems that contains an inventory of the fundamental operations and measurements that are possible in such hardware. The corresponding abstract machine model (AMM) would also contain a description of the appropriate error models associated with the gates, measurements and time evolution of the hardware. This information has been implemented as an extension of IBM Qiskit. IBM Qiskit is an open-source software development toolkit (SDK) for simulating the quantum state of a quantum circuit and for running the same circuits on prototype hardware within the IBM Quantum Experience. We introduce the Bosonic Qiskit software to enable the simulation of hybrid qubit/bosonic systems using the existing Qiskit software development kit [7]. This implementation can be used for simulating new hybrid systems, verifying proposed physical systems, and modeling systems larger than can currently be constructed. We also cover tutorials and example use cases included within the software to study JaynesCummings models, bosonic Hubbard models, plotting Wigner functions and animations, and calculating maximum likelihood estimations using Wigner functions.

quantum, boson, Qiskit↗
DOE OSTI2026

Fidelity Comparison of Time-Bin and Fock State Encoding in Hybrid Quantum Systems Under Channel and Transduction Effects

Future quantum networks are expected to integrate a heterogeneous combination of quantum systems, owing to the diverse advantages offered by different physical platforms in terms of scalability, coherence times, and interfacing capabilities. Within the context of this emerging quantum communication paradigm, this paper presents an analytical comparison of two photonic encoding schemes—time-bin and Fock state (single rail)—in hybrid quantum systems where flying qubits are entangled with stationary matter qubits. We evaluate their resilience against fiber channel and quantum transduction effects by calculating the fidelity of the final states relative to their ideal forms. Employing the characteristic function approach, we derive analytical fidelity expressions and investigate their dependence on parameters such as transmissivity, noise levels, fiber length, and source generation success probability. Additionally, we simulate the scenario with a dedicated QuTiP software implementation to verify the validity of the theoretical models. Our findings reveal that due to its inherent single-mode structure, the Fock state encoding consistently outperforms time-bin encoding in fidelity, as this structure significantly minimizes susceptibility to losses compared to the two-mode nature of the time-bin scheme. This analysis offers valuable insights for future hybrid quantum communication and information processing applications.

Fiorini, Francesco [Pisa U.]↗
DOE OSTI2021

Understanding Quantum Control Processor Capabilities and Limitations through Circuit Characterization

Continuing the scaling of quantum computers hinges on building classical control hardware pipelines that are scalable, extensible, and provide real time response. The instruction set architecture (ISA) of the control processor provides functional abstractions that map high-level semantics of quantum programming languages to low-level pulse generation by hardware. Here, we provide a methodology to quantitatively assess the effectiveness of the ISA to encode quantum circuits for intermediate-scale quantum devices with O(10 2 ) qubits. The characterization model that we define reflects performance, the ability to meet timing constraint implications, scalability for future quantum chips, and other important considerations making them useful guides for future designs. Using our methodology, we propose scalar (QUASAR) and vector (qV) quantum ISAs as extensions and compare them with other ISAs in metrics such as circuit encoding efficiency, the ability to meet real-time gate cycle requirements of quantum chips, and the ability to scale to more qubits.

97 MATHEMATICS AND COMPUTING↗