Search NASASearch

Engineering topics

Bornman, Nicholas [Fermilab]

Publications and source records attributed to Bornman, Nicholas [Fermilab].

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]

Impact of Resonator-Assisted ZZ Cancellation on Cross-Resonance Gate Performance

Strong coupling in superconducting processors enables fast two-qubit gates but also produces static ZZ interactions that degrade performance. Flux-tunable couplers can suppress ZZ but introduce flux noise and additional hardware complexity. A driven-resonator RIP interaction offers a simple method to dynamically cancel ZZ [1]. Using this RIP-based cancellation scheme in a fixed-frequency transmon system, we compare cross-resonance gate behavior with and without ZZ suppression. Idling errors improve substantially when ZZ is cancelled, while CR calibration reveals clear tradeoffs in Hamiltonian composition and achievable gate speed. [1]: Huang, Z. et al. (2024). Physical Review Applied, 22(3), 034007.

Heidler, Paul [Fermilab]

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]

Ultracoherent superconducting cavity-based multiqudit platform with error-resilient control

Superconducting radio-frequency (SRF) cavities offer a promising platform for quantum computing due to their long coherence times, yet integrating nonlinear elements like transmons for control often introduces additional loss. We report a multimode quantum system based on a 2-cell elliptical shaped SRF cavity, comprising two cavity modes weakly coupled to an ancillary transmon circuit, designed to preserve coherence while enabling efficient control of the cavity modes. We mitigate the detrimental effects of the transmon decoherence through careful design optimization that reduces transmon-cavity couplings and participation in the dielectric substrate and lossy interfaces, to achieve single-photon lifetimes of 20.6 ms and 15.6 ms for the two modes, and a pure dephasing time exceeding 40 ms. This marks an order-of-magnitude improvement over prior 3D multimode memories. Leveraging sideband interactions and novel error-resilient protocols, including measurement-based correction and post-selection, we achieve high-fidelity control over quantum states. This enables the preparation of Fock states up to $N = 20$ with fidelities exceeding 95%, the highest reported to date to the authors' knowledge, as well as two-mode entanglement with an estimated coherence-limited fidelities of 99.9% after post-selection. These results establish our platform as a robust foundation for quantum information processing, allowing for future extensions to high-dimensional qudit encodings.

Kim, Taeyoon [Fermilab; Northwestern U.]

Robust resonator-assisted ZZ cancellation in superconducting quantum processors

Strong qubit interactions are essential for faster two-qubit gates, but they often come with undesirable ZZ interactions that limit gate fidelity. Existing methods to mitigate these interactions, such as flux-tunable couplers, can introduce additional noise and complexity. In contrast, our work presents a simpler, more robust approach using a driven resonator to cancel the static ZZ interaction between qubits [1]. The experiment was performed on a revised 9-qubit quantum processing unit from Rigetti, developed in collaboration with SQMS scientists. We validate the resonator-induced-phase (RIP) interaction, where an off-resonant drive on the resonator dynamically cancels ZZ coupling. This marks an important step toward high gate fidelities. We also explore the entangling gates enabled by this coupling scheme, focusing on minimizing gate duration and qubit decoherence while maintaining effective ZZ cancellation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum- inspired techniques with classical methods. It focuses on fixed- point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed- point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS