arXiv subjects

Volodymyr Sivak

Publications and source records attributed to Volodymyr Sivak.

8 recordsLinked to original sources

arXiv2026

Reinforcement Learning Control of Quantum Error Correction

Quantum error correction (QEC) is the primary strategy for protecting a quantum computer from the environment. Its prerequisite is that errors must remain sufficiently rare, which requires perpetually adapting the computer's control parameters to the drifting environment conditions. The current solution to this problem is to terminate the entire quantum computation for recalibration, but it is incompatible with the long runtimes of future quantum algorithms. We address this challenge by unifying calibration with computation. We grant the QEC process a dual role: its error detection events are not only used to correct the logical quantum state, but are also repurposed as a learning signal, teaching a reinforcement learning (RL) agent to continuously steer the control parameters and stabilize the quantum system during computation. We experimentally demonstrate this framework on a Willow superconducting processor, improving the logical stability of the surface code 3.5-fold against injected drift. By synthesizing our full suite of technological advances, we achieve record performance of the surface and color codes, with average logical error per cycle of $7.72(9)\times10^{-4}$ and $8.19(14)\times10^{-3}$ respectively. Numerical simulations of large codes with tens of thousands of control parameters confirm the scalability of our RL framework, revealing an optimization speed that is independent of system size. This work thus enables a new paradigm: a quantum computer that learns from its errors and never stops computing.

quant-ph↗

arXiv2025

Magic state cultivation on a superconducting quantum processor

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most significant challenges.

quant-ph↗

arXiv2025

Demonstrating dynamic surface codes

A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of $Λ_{35,\text{hex}} = 2.15(2)$, $Λ_{35,\text{walk}} = 1.69(6)$, and $Λ_{35,\text{iSWAP}} = 1.56(2)$, achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design.

quant-ph↗

arXiv2025

Optimizing the pump coupling for a three-wave mixing Josephson parametric amplifier

Josephson element-based parametric amplifiers (JPAs) typically require rf pump power that is several orders of magnitude stronger than the maximum signal power they can handle. The low power efficiency and strong pump leakage towards signal circuitry could be critical concerns in application. In this work, we discuss how to optimize the pump coupling scheme for a three-wave mixing JPA by employing microwave filtering techniques, with the goal of maximizing the pump power efficiency and minimize pump leakage without sacrificing other properties of interest. We implement the corresponding filter design in a SNAIL-based JPA and demonstrate more than three orders of magnitude improvement in both power efficiency and pump leakage suppression compared to a similar device with regular capacitive coupling, while maintaining state-of-the-art dynamic range and near-quantum-limited noise performance. Furthermore, we show experimentally that the filter-coupled JPA is more robust against noise input from the pump port, exhibiting no significant change in added noise performance with up to 4 K of effective noise temperature at the pump port.

quant-ph↗

arXiv2024

Scaling and logic in the color code on a superconducting quantum processor

Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. In contrast, the color code enables much more efficient logic, although it requires more complex stabilizer measurements and decoding techniques. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and so far, realizations of color codes have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations. Scaling the code distance from three to five suppresses logical errors by a factor of $Λ_{3/5}$ = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and furthermore that the color code may be more efficient than the surface code with modest device improvements. Using logical randomized benchmarking, we find that transversal Clifford gates add an error of only 0.0027(3), which is substantially less than the error of an idling error correction cycle. We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection (retaining about 75% of the data). Finally, we successfully teleport logical states between distance-three color codes using lattice surgery, with teleported state fidelities between 86.5(1)% and 90.7(1)%. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

quant-ph↗

arXiv2024

Optimization of decoder priors for accurate quantum error correction

Accurate decoding of quantum error-correcting codes is a crucial ingredient in protecting quantum information from decoherence. It requires characterizing the error channels corrupting the logical quantum state and providing this information as a prior to the decoder. We introduce a reinforcement learning inspired method for calibrating these priors that aims to minimize the logical error rate. Our method significantly improves the decoding accuracy in repetition and surface code memory experiments executed on Google's Sycamore processor, outperforming the leading decoder-agnostic method by 16% and 3.3% respectively. This calibration approach will serve as an important tool for maximizing the performance of both near-term and future error-corrected quantum devices.

quant-ph↗

arXiv2024

Optimizing quantum gates towards the scale of logical qubits

A foundational assumption of quantum error correction theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Two major challenges that could become fundamental roadblocks are manufacturing high performance quantum hardware and engineering a control system that can reach its performance limits. The control challenge of scaling quantum gates from small to large processors without degrading performance often maps to non-convex, high-constraint, and time-dependent control optimization over an exponentially expanding configuration space. Here we report on a control optimization strategy that can scalably overcome the complexity of such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunable superconducting qubits to execute single- and two-qubit gates while mitigating computational errors. When combined with a comprehensive model of physical errors across our processor, the strategy suppresses physical error rates by $\sim3.7\times$ compared with the case of no optimization. Furthermore, it is projected to achieve a similar performance advantage on a distance-23 surface code logical qubit with 1057 physical qubits. Our control optimization strategy solves a generic scaling challenge in a way that can be adapted to a variety of quantum operations, algorithms, and computing architectures.

quant-ph↗

arXiv2022

Fast Universal Control of an Oscillator with Weak Dispersive Coupling to a Qubit

A controlled evolution generated by nonlinear interactions is required to perform full manipulation of a quantum system, and such control is only coherent when the rate of nonlinearity is large compared to the rate of decoherence. As a result, engineered quantum systems typically rely on a bare nonlinearity much stronger than all decoherence rates, and this hierarchy is usually assumed to be necessary. In this work, we challenge this assumption by demonstrating the universal control of a quantum system where the relevant rate of bare nonlinear interaction is comparable to the fastest rate of decoherence. We do this by introducing a novel noise-resilient protocol for the universal quantum control of a nearly-harmonic oscillator that takes advantage of an in-situ enhanced nonlinearity instead of harnessing a bare nonlinearity. Our experiment consists of a high quality-factor microwave cavity with weak-dispersive coupling to a much lower quality superconducting qubit. By using strong drives to temporarily excite the oscillator, we realize an amplified three-wave-mixing interaction, achieving typical operation speeds over an order of magnitude faster than expected from the bare dispersive coupling. Our demonstrations include preparation of a single-photon state with $98\pm 1(\%)$ fidelity and preparation of squeezed vacuum with a squeezing level of $11.1$ dB, the largest intracavity squeezing reported in the microwave regime. Finally, we also demonstrate fast measurement-free preparation of logical states for the binomial and Gottesman-Kitaev-Preskill (GKP) quantum error-correcting codes.

quant-ph↗