Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits

Quantum Fourier Transform Using Dynamic Circuits

In dynamic quantum circuits, classical information from midcircuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful protocols by drastically reducing the resource requirements for certain core algorithmic primitives. In particular, in the case of the n-qubit quantum Fourier transform followed immediately by measurement, the scaling of resource requirements is reduced from O(n^{2}) two-qubit gates in an all-to-all connectivity in the standard unitary formulation to O(n) midcircuit measurements in its dynamic counterpart without any connectivity constraints. Here, we demonstrate the advantage of dynamic quantum circuits for the quantum Fourier transform on IBM's superconducting quantum hardware with certified process fidelities of >50% on up to 16 qubits and >1% on up to 37 qubits, exceeding previous reports across all quantum computing platforms. These results are enabled by our contribution of an efficient method for certifying the process fidelity, as well as of a dynamical decoupling protocol for error suppression during midcircuit measurements and feed forward within a dynamic quantum circuit that we call "feed-forward-compensated dynamical decoupling." Our results demonstrate the advantages of leveraging dynamic circuits in optimizing the compilation of quantum algorithms.

Simulation of a Diels-Alder reaction on a quantum computer

The simulation of chemical reactions is an anticipated application of quantum computers. Using a Diels-Alder reaction as a test case, in this study we explore the potential applications of quantum algorithms and hardware in investigating chemical reactions. Our specific goal is to calculate the activation barrier of a reaction between ethylene and cyclopentadiene forming a transition state. To achieve this goal, we use quantum algorithms for near-term quantum hardware (entanglement forging and quantum subspace expansion) and classical post-processing (many-body perturbation theory) in concert. We conduct simulations on IBM quantum hardware using up to 8 qubits, and compute accurate activation barrier in the reaction between cyclopentadiene and ethylene by accounting for both static and dynamic electronic correlation. This work illustrates a hybrid quantum-classical computational workflow to study chemical reactions on near-term quantum devices, showcasing the potential for performing quantum chemistry simulations on quantum hardware to predict activation barriers in agreement with those predicted by CASCI.

Dynamically generated decoherence-free subspaces and subsystems on superconducting qubits

Decoherence-free subspaces and subsystems (DFS) preserve quantum information by encoding it into symmetry-protected states unaffected by decoherence. An inherent DFS of a given experimental system may not exist; however, through the use of dynamical decoupling (DD), one can induce symmetries that support DFSs. Here, we provide the first experimental demonstration of DD-generated decoherence-free subsystem logical qubits. Utilizing IBM Quantum superconducting processors, we investigate two and three-qubit DFS codes comprising up to six and seven noninteracting logical qubits, respectively. Through a combination of DD and error detection, we show that DFS logical qubits can achieve up to a 23% improvement in state preservation fidelity over physical qubits subject to DD alone. This constitutes a beyond-breakeven fidelity improvement for DFS-encoded qubits. Our results showcase the potential utility of DFS codes as a pathway toward enhanced computational accuracy via logical encoding on quantum processors.

Simulating Chemistry on Bosonic Quantum Devices

Bosonic quantum devices offer a novel approach to realize quantum computations, where the quantum two-level system (qubit) is replaced with the quantum (an)harmonic oscillator (qumode) as the fundamental building block of the quantum simulator. The simulation of chemical structure and dynamics can then be achieved by representing or mapping the system Hamiltonians in terms of bosonic operators. In this Perspective, we review recent progress and future potential of using bosonic quantum devices for addressing a wide range of challenging chemical problems, including the calculation of molecular vibronic spectra, the simulation of gas-phase and solution-phase adiabatic and nonadiabatic chemical dynamics, the efficient solution of molecular graph theory problems, and the calculations of electronic structure.

Open-loop quantum control of small-size networks for high-order cumulants and cross-correlations sensing

Quantum control techniques are one of the most efficient tools for attaining high-fidelity quantum operations and a convenient approach for quantum sensing and quantum noise spectroscopy. In this work, we investigate dynamical decoupling while processing an entangling two-qubit gate based on an Ising-xx interaction, each qubit affected by pure dephasing classical correlated 1/f-noises. To evaluate the gate error, we used the Magnus expansion introducing generalized filter functions that describe decoupling while processing and allow us to derive an approximate analytic expression as a hierarchy of nested integrals of noise cumulants. The error is separated in contributions of Gaussian and non-Gaussian noise, with the corresponding generalized filter functions calculated up to the fourth order. By exploiting the properties of selected pulse sequences, we show that it is possible to extract the second-order statistics (spectrum and cross-spectrum) and to highlight non-Gaussian features contained in the fourth-order cumulant. We discuss the applicability of these results to state-of-the-art small networks based on solid-state platforms.

Multi-ion Frequency Reference Using Dynamical Decoupling

We present the experimental realization of a continuous dynamical decoupling scheme which suppresses leading frequency shifts in a multi-ion frequency reference based on ^{40}Ca^{+}. By near-resonant magnetic coupling of the ^{2}S_{1/2} and ^{2}D_{5/2} Zeeman sublevels using radio-frequency dressing fields, engineered transitions with reduced sensitivity to magnetic-field fluctuations are obtained. A second stage detuned dressing field reduces the influence of amplitude noise in the first stage driving fields and decreases 2nd-rank tensor shifts, such as the electric quadrupole shift. Suppression of the quadratic dependence of the quadrupole shift to 3(2)  mHz/μm^{2} and coherence times of 290(20) ms on the optical transition are demonstrated even within a laboratory environment with significant magnetic field noise. Besides removing inhomogeneous line shifts in multi-ion clocks, the demonstrated dynamical decoupling technique may find applications in quantum computing and simulation with trapped ions by a tailored design of decoherence-free subspaces.

Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices

Dynamical decoupling (DD) is a promising technique for mitigating errors in near-term quantum devices. However, its effectiveness depends on both hardware characteristics and algorithm implementation details. This paper explores the synergistic effects of dynamical decoupling and optimized circuit design in maximizing the performance and robustness of algorithms on near-term quantum devices. By utilizing eight IBM quantum devices, we analyze how hardware features and algorithm design impact the effectiveness of DD for error mitigation. Our analysis takes into account factors such as circuit fidelity, scheduling duration, and hardware-native gate set. We also examine the influence of algorithmic implementation details, including specific gate decompositions, DD sequences, and optimization levels. The results reveal an inverse relationship between the effectiveness of DD and the inherent performance of the algorithm. Furthermore, we emphasize the importance of gate directionality and circuit symmetry in improving performance. This study offers valuable insights for optimizing DD protocols and circuit designs, highlighting the significance of a holistic approach that leverages both hardware features and algorithm design for the high-quality and reliable execution of near-term quantum algorithms.

Demonstration of Algorithmic Quantum Speedup

Despite the development of increasingly capable quantum computers, an experimental demonstration of a provable algorithmic quantum speedup employing today's non-fault-tolerant devices has remained elusive. Here, we unequivocally demonstrate such a speedup within the oracular model, quantified in terms of the scaling with the problem size of the time-to-solution metric. We implement the single-shot Bernstein-Vazirani algorithm, which solves the problem of identifying a hidden bitstring that changes after every oracle query, using two different 27-qubit IBM Quantum superconducting processors. The speedup is observed on only one of the two processors when the quantum computation is protected by dynamical decoupling but not without it. The quantum speedup reported here does not rely on any additional assumptions or complexity-theoretic conjectures and solves a bona fide computational problem in the setting of a game with an oracle and a verifier.

Suppressing Decoherence in Quantum State Transfer with Unitary Operations

Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In this work, by following the recent theoretical proposal, we study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state against the effect of decoherence acting on all qubits. We observe the increase in the fidelity of the output quantum state both in a quantum emulation experiment, where all protecting unitaries are perfect, and in a real experiment with a cloud-accessible quantum processor, where protecting unitaries themselves are affected by the noise. We expect the considered approach to be useful for analyzing capabilities of quantum information processing devices in transmitting known quantum states. We also demonstrate the applicability of the developed approach for suppressing decoherence in the process of distributing a two-qubit state over remote physical qubits of a quantum processor.

Protectability of IBMQ Qubits by Dynamical Decoupling Technique

We study the current effectiveness of the dynamical decoupling technique on a publicly accessible IBM quantum computer (IBMQ). This technique, also known as bang-bang decoupling or dynamical symmetrization, consists of applying sequences of pulses for protecting a qubit from decoherence by symmetrizing the qubit–environment interactions. Works in the field have studied sequences with different symmetries and carried out tests on IBMQ devices typically considering single-qubit states. We show that the simplest universal sequences can be interesting for preserving two-qubit states on the IBMQ device. For this, we considered a collection of single-qubit and two-qubit states. The results indicate that a simple dynamical decoupling approach using available IBMQ pulses is not enough for protecting a general single-qubit state without further care. Nevertheless, the technique is beneficial for the Bell states. This encouraged us to study logical qubit encodings such as |0⟩L≡|01⟩,|1⟩L≡|10⟩, where a quantum state has the form |ψab⟩=a|0⟩L+b|1⟩L. Thus, we explored the effectiveness of dynamical decoupling with a large set of two-qubit |ψab⟩ states, where a and b are real amplitudes. With this, we also determined that the |ψab⟩ states most benefiting from this dynamical decoupling approach and slowed down the decay of their survival probability.

Error rate reduction of single-qubit gates via noise-aware decomposition into native gates

In the current era of Noisy Intermediate-Scale Quantum (NISQ) technology, the practical use of quantum computers remains inhibited by our inability to aptly decouple qubits from their environment to mitigate computational errors. In this paper, we introduce an approach by which knowledge of a qubit’s initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We benchmark our protocol using cloud-based access to IBM quantum processors. On ibmq_rome, we demonstrate a reduction of the single-qubit error rate by 38%, from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1.6 \times 10 ^{-3}$$\end{document}1.6×10-3 to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1.0 \times 10 ^{-3}$$\end{document}1.0×10-3, provided the initial state of the input qubit is known. On ibmq_bogota, we prove that our protocol will never decrease gate fidelity, provided the system’s \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_1$$\end{document}T1 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_2$$\end{document}T2 times have not drifted above 100 times their assumed values. The protocol can be used to reduce quantum state preparation errors, as well as to improve the fidelity of quantum circuits for which some knowledge of the qubits’ intermediate states can be inferred. This paper presents a pathway to using information about noise levels and quantum state distributions to significantly reduce error rates associated with quantum gates via optimized decomposition into native hardware gates.

Entanglement Purification and Protection in a Superconducting Quantum Network

High-fidelity quantum entanglement is a key resource for quantum communication and distributed quantum computing, enabling quantum state teleportation, dense coding, and quantum encryption. Any sources of decoherence in the communication channel, however, degrade entanglement fidelity, thereby increasing the error rates of entangled state protocols. Entanglement purification provides a method to alleviate these nonidealities by distilling impure states into higher-fidelity entangled states. Here we demonstrate the entanglement purification of Bell pairs shared between two remote superconducting quantum nodes connected by a moderately lossy, 1-meter long superconducting communication cable. We use a purification process to correct the dominant amplitude damping errors caused by transmission through the cable, with fractional increases in fidelity as large as 25%, achieved for higher damping errors. The best final fidelity the purification achieves is 94.09±0.98%. In addition, we use both dynamical decoupling and Rabi driving to protect the entangled states from local noise, increasing the effective qubit dephasing time by a factor of 4, from 3 to 12  μs. These methods demonstrate the potential for the generation and preservation of very high-fidelity entanglement in a superconducting quantum communication network.

Demonstration of non-Markovian process characterisation and control on a quantum processor

In the scale-up of quantum computers, the framework underpinning fault-tolerance generally relies on the strong assumption that environmental noise affecting qubit logic is uncorrelated (Markovian). However, as physical devices progress well into the complex multi-qubit regime, attention is turning to understanding the appearance and mitigation of correlated — or non-Markovian — noise, which poses a serious challenge to the progression of quantum technology. This error type has previously remained elusive to characterisation techniques. Here, we develop a framework for characterising non-Markovian dynamics in quantum systems and experimentally test it on multi-qubit superconducting quantum devices. Where noisy processes cannot be accounted for using standard Markovian techniques, our reconstruction predicts the behaviour of the devices with an infidelity of 10⁻³. Our results show this characterisation technique leads to superior quantum control and extension of coherence time by effective decoupling from the non-Markovian environment. This framework, validated by our results, is applicable to any controlled quantum device and offers a significant step towards optimal device operation and noise reduction.

As quantum computing devices become more complex, they enter the realm of correlated noise, which is difficult to characterise and mitigate. Here, the authors demonstrate, over a range of superconducting devices, a method for non-Markovian dynamics characterisation based on the process tensor framework.

Implementation of leakage elimination operators and subspace protection

Decoherence-induced leakage errors can potentially damage physical or logical qubits embedded in a subspace of the entire Hilbert space by coupling them to other system levels. Here we report the first experimental implementation of Leakage Elimination Operators (LEOs) that aims to reduce this undermining. LEOs are a type of dynamical decoupling control that have been previously introduced to counteract leakage from a chosen subspace into the rest of a Hilbert space, and have been widely explored theoretically. Different from other error correction strategies, LEOs are compatible with any gate sequence in a code space, and thus, compatible with universal quantum computation. Using IBM's cloud quantum computer (QC), we design three potentially applicable examples of subspaces in two- and three-qubit Hilbert spaces and derive the explicit forms of the corresponding LEOs for these subspaces. For the first time, we experimentally demonstrate that these LEOs significantly suppress leakage. The results also show that the LEO time-scale condition can be satisfied with noise in the IBM's cloud QC and pave a way for quantum setups to get rid of leakage trouble.

A noise-resisted scheme of dynamical decoupling pulses for quantum memories

Stable quantum memories that capable of storing quantum information for long time scales are an essential building block for an array of potential applications. The long memory time are usually achieved via dynamical decoupling technique involving decoupling of the memory states from its local environment. However, because this process is strongly limited by the errors in the pulses, an noise-protected scheme remains challenging in the field of quantum memories. Here we propose a scheme to design a noise-resisted [Formula: see text] pulse, which features high fidelity exceeding [Formula: see text] under realistic situations. Using this [Formula: see text] pulse we can generate different dynamical decoupling sequences that preserve high fidelity for long time scales. The versatility, robustness, and potential scalability of this method may allow for various applications in quantum memories technology.

Benchmarking an 11-qubit quantum computer

The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 ¹⁷¹Yb⁺ ions. We demonstrate average single-qubit gate fidelities of 99.5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}%, average two-qubit-gate fidelities of 97.5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}%, and SPAM errors of 0.7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}%. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}% and 35\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}%, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

The growing complexity of quantum computing devices makes presents challenges for benchmarking their performance as previous, exhaustive approaches become infeasible. Here the authors characterise the quality of their 11-qubit device by successfully computing two quantum algorithms.

Generation of Coherent and Spatially Squeezed States of an Electromagnetic Beam in a Planar Inhomogeneous Dielectric Waveguide

We use slow-varying amplitude approximation (SVA) for the wave equation to study both analytically and numerically propagation of an electromagnetic beam in the waveguide structure with parabolic susceptibility spatial dependence. Such a structure is similar to the harmonic oscillator in quantum mechanics. We analyze this structure as a single mode guide and introduce the notion of number of “photons” in the mode. In particular, we pay special attention to the possibility of effective build-up of the coherent and spatially squeezed vacuum states of the mode that can be of interest for a number of practical applications. The way to provide these types of mode excitation is suggested. Several applications for controlling the mode composition of an electromagnetic wave in the parabolic index-gradient waveguide for various frequency ranges are considered.