Search arXiv⌕ Search

arXiv · 2407.08318

Modeling and Suppressing Unwanted Parasitic Interactions in Superconducting Circuits

Abstract

Superconducting qubits are among the most promising candidates for building quantum computers. Despite significant improvements in qubit coherence, achieving a fault-tolerant quantum computer remains a major challenge, largely due to imperfect gate fidelity. A key source of this infidelity is the parasitic interaction between coupled qubits, which this thesis addresses in two- and three-qubit circuits. This parasitic interaction causes a bending between computational and non-computational levels, leading to a parasitic ZZ interaction. The thesis first investigates the possibility of zeroing the ZZ interaction in two qubit combinations: a pair of interacting transmons, and a hybrid pair of a transmon coupled to a capacitively shunted flux qubit (CSFQ). The theory developed is used to accurately simulate experimental results from our collaborators, who measured a CSFQ-transmon pair with and without a cross-resonance (CR) gate. The strong agreement between theory and experiment motivated further study of a CR gate that achieves 99.9% fidelity in the absence of static ZZ interaction. Since the CR pulse adds an additional ZZ component to the static part, a new strategy called dynamical ZZ freedom is proposed to zero the total ZZ interaction. This strategy can be applied in all-transmon circuits to enable perfect entanglement. Based on these findings, a new two-qubit gate, the parasitic-free (PF) gate, is proposed. Additionally, the thesis explores how to utilize the ZZ interaction to enhance the performance of a controlled-Z gate. Lastly, the impact of a third qubit on two-qubit gate performance is examined, with several examples illustrating the properties of two-body ZZ and three-body ZZZ interactions in circuits with more than two qubits.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuexin Xu. 2024-07-11. Modeling and Suppressing Unwanted Parasitic Interactions in Superconducting Circuits. https://arxiv.org/abs/2407.08318

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quantum Mechanics as a Reversible Diffusion Theory

This paper proposes an interpretation of quantum mechanics, relying on the time-symmetric stochastic dynamics of quantum particles and on non-classical probability theory. Our main purpose is to demonstrate that the wave function and its complex conjugate can be interpreted as complex probability distributions in two complex diffusion equations related to non-real forward and backward in time stochastic motions respectively. We say non-real because Schroedinger forward and backward diffusions describe both reversible (real trajectories) and irreversible trajectories (non-real trajectories). The reversible trajectories are the only real trajectories and are given by the intersection of those forward and backward processes. It turns out that if we translate this intersection using set-theoretic language, we are led to a reversible diffusion described by Born rule probabilities. This proposal is useful also for explaining more about the role of complex numbers in quantum mechanics that produces this so-called "wave-like" nature of quantum reality. Our perspective also challenges the notion of physical superposition and aims at a derivation of superposition principle not based on the linearity of Schroedinger's equation but relying on pure probability theory. Moreover, it is suggested that, embracing the idea of stochastic processes in quantum theory, explains the reasons for the appearance of classical behavior in large objects, in contrast to the quantum behavior of small ones. In other words, we claim that a combination of a probabilistic and no-ontic view (neither epistemic though) of the wave function with a stochastic hidden-variables approach, may provide some insight into the quantum physical reality and potentially establish the groundwork for a novel interpretation of quantum mechanics.

quant-ph↗

Flexible Qubit Allocation of Network Resource States

The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node assignments. This flexibility enables adaptable engineering of the entanglement topology of an arbitrary quantum network. In particular, we focus on cluster states with arbitrary allocation as network resource states and as a promising candidate for a \textit{network core}-level entangled resource, due to its intrinsic flexible connectivity properties and resilience to particle losses. We introduce a modeling framework for overlaying entanglement topologies on physical networks and demonstrate how optimized and even random qubit assignment creates shortcuts and improves robustness and memory savings, while reducing the worst-case hop distance between remote network nodes, when compared to conventional approaches.

quant-ph↗

Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions

We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for many computational methods such as the diagrammatic quantum Monte Carlo, a mathematically rigorous proof of polynomial runtime has been lacking. In this work we first extend the proof techniques developed in previous works for proving the convergence of the cumulant expansion in periodic systems to the non-periodic case. A key equation used to analyze the sum of connected Feynman diagrams, which we call the tree-determinant expansion, reveals an underlying tree structure in the summation. This enables us to design a new randomized algorithm to compute the log-partition function through importance sampling augmented by belief propagation. This approach differs from the traditional method based on Markov chain Monte Carlo, whose efficiency is hard to guarantee, and enables us to obtain a algorithm with provable polynomial runtime.

quant-ph↗