Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1804.08783 · Physical Review A

Local gradient optimization of modular entangling sequences

A. A. Setser, Michael H. Goerz, J. P. Kestner

Published Jun 26, 2018• 2 citations
arXivHTMLPDF

Abstract

Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy nonlocal gate to dramatically suppress arbitrary logical errors, while steering the evolution operator towards the perfectly entangling subset of $\text{SU}(4)$ gates. The modularity of the approach allows for application to any two-qubit system, regardless of the Hamiltonian or details of the experimental implementation. This approach is effective for both quasistatic and time-dependent $1/{f}^{\ensuremath{\alpha}}$ noise. We also show how the fidelity of the final operation depends on both the fidelity of the local rotations and the noise strength.

DOI
10.1103/physreva.97.062339

Related papers

Local gradient optimization of leakage-suppressing entangling sequences

A. A. Setser, J. P. Kestner

We use a gradient-based optimization scheme to find single-qubit rotations to be interwoven between time steps of a noisy logical two-qubit entangling gate in order to suppress the effects of arbitrary logical and leakage noise in the two-qubit gate. We show how the sequence fidelity is affected by imperfections in the single-qubit operations, as well as by various relative strengths of the logical and leakage noise. Our approach is completely general and system-independent, allowing for application to any two-qubit system regardless of the experimental implementation details.

arXiv:2007.09019•Physical Review A•Jan 26, 2021•1 citation

Lattice surgery with Bell measurements: Modular fault-tolerant quantum computation at low entanglement cost

Trond Hjerpekjøn Haug, Timo Hillmann, Anton Frisk Kockum +1 more

Modular architectures are a promising approach to scaling quantum computers to fault tolerance. Small, low-noise quantum processors connected through relatively noisy quantum links are capable of fault-tolerant operation as long as the noise can be confined to the interface. Finding protocols that implement the quantum links between modules as efficiently as possible is essential because inter-module entanglement is challenging to produce at a similar rate and fidelity as local entanglement. We introduce a protocol for lattice surgery on surface codes in which all non-local operations are Bell measurements. The protocol simultaneously confines the link noise and requires only half as many module-crossing gates as previously proposed protocols. To mitigate distance-reducing hook errors, we introduce a strategy of alternating the gate sequence between rounds of syndrome measurement, which prevents multiple hooks from simultaneously aligning with a logical operator in the code. We evaluate our protocol's performance when two logical qubits on separate modules are prepared in a logical Bell state. Circuit-level simulations under depolarizing noise show that the logical error suppression for a given entanglement rate between modules is consistently stronger compared to the best-performing alternative protocols for a wide range of link noise, with a typical 40% entanglement resource saving for a constant logical error rate. Our approach to protocol design is applicable to any quantum circuit that must be divided across processor modules and can therefore guide development of resource-efficient modular quantum computation beyond the surface code.

arXiv:2510.13541•Oct 15, 2025•15 citations

Fault-Tolerant Logical Operations and Efficient State Preparation in Modular Quantum Architectures with Noisy Interfaces

S. Siddardha Chelluri, Riccardo Mengoni, Tom Darras +3 more

Modular quantum computing is a leading paradigm for scaling quantum computation beyond the resource limitations of monolithic devices. In this architecture, multiple quantum processing units (QPUs), employing identical or distinct qubit modalities, are interconnected via shared entanglement. Here, we investigate how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code. Going beyond the logical-memory benchmark, we perform circuit-level simulations of fault-tolerant nonlocal CNOT gates implemented via lattice surgery between QPUs connected by noisy Bell pairs, and analyze the resulting logical error rates. Our results show that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold. We further develop an efficient protocol for preparing distributed fault-tolerant logical GHZ states, reducing ancilla overhead, time, and nonlocal Bell-pair consumption. We show that ancilla minimization in this setting is equivalent to a vertex-cover problem on an associated graph, and introduce a polynomial-time heuristic algorithm for finding low-overhead solutions. Our results provide quantitative evidence that distributed quantum error correction can enable scalable, fault-tolerant quantum computation in modular architectures.

quant-pharXiv:2607.27204•Jul 30, 2026•2 citations

Practical Entanglement Distillation Protocols with Quadratic Error Suppression

Elisa Bäumer Marty

Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different chips or dilution refrigerators. Such inter-module operations can therefore become a dominant bottleneck, even when quantum error correction is applied. Entanglement distillation provides a natural way to trade additional operations and qubits for higher-fidelity entanglement. Standard distillation protocols, however, are usually formulated in an LOCC resource model, in which several noisy Bell pairs are generated initially and all subsequent processing consists only of local operations and classical communication. Here, we consider a generalized model tailored to modular quantum computing hardware, in which the two modules have access to high-fidelity local operations and to repeated uses of the same noisy inter-module entangling operation during the protocol. We develop practical small-scale entanglement distillation protocols designed to minimize both space and time overhead. Remarkably, our main protocol requires only two qubits per module, yet achieves quadratic error suppression of inter-module errors, assuming local operations are much cleaner. Compared with existing small-scale protocols, our space-optimal protocol provides more space- and time-efficient quadratic error suppression and achieves the best performance in our simulations and experiments on noisy links of current superconducting quantum processors. These results suggest that inter-module-gate-assisted entanglement distillation can be a practical primitive for overcoming noisy links in modular quantum computing architectures.

quant-pharXiv:2605.26757•May 27, 2026•1 citation

Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent

Dhruv Srinivasan, Kushal Chakrabarti, Nikhil Chopra +1 more

Gate-based quantum algorithms are typically implemented by circuits consisting of many single-qubit and multi-qubit gates operating on a quantum input state, followed by measurements of the output state. For certain quantum subroutines, such as initial state preparation and quantum Fourier transforms, explicit decompositions of the circuit in terms of single-qubit and two-qubit maximally entangling gates may exist. However, they often lead to large-depth circuits that are challenging for noisy intermediate-scale quantum (NISQ) hardware. Additionally, exact decompositions might only exist for some modular quantum circuits. Therefore, it is essential to find gate combinations that approximate these circuits to high fidelity with potentially low depth. Gradient-based optimization has been used to find such approximate decompositions. Still, these traditional optimizers often run into problems of slow convergence requiring many iterations, and performing poorly in the presence of noise, a factor that is especially relevant for NISQ hardware. Here we present iteratively preconditioned gradient descent (IPG) for optimizing quantum circuits and demonstrate performance speedups for state preparation and implementation of quantum algorithmic subroutines. IPG is a noise-resilient, higher-order algorithm that has shown promising gains in convergence speed for classical optimizations, converging locally at a linear rate for convex problems and superlinearly when the solution is unique. Specifically, we show an improvement in fidelity by a factor of 104for preparing a 4-qubit W state and a maximally entangled 5-qubit GHZ state with compared to other commonly used classical optimizers tuning the same ansatz. Such faster convergence with promise for noise-resilience could provide advantages for quantum algorithms on NISQ hardware, especially since the cost of running each iteration on a quantum computer is substantially higher than the classical optimizer step.

arXiv:2309.09957•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•2 citations

High-fidelity two-qubit gates via dynamical decoupling of local 1/f noise at the optimal point

Antonio D’Arrigo, G. Falci, Elisabetta Paladino

We investigate the possibility of achieving high-fidelity universal two-qubit gates by supplementing optimal tuning of individual qubits with dynamical decoupling (DD) of local $1/f$ noise. We consider simultaneous local pulse sequences applied during the gate operation and compare the efficiencies of periodic, Carr-Purcell, and Uhrig DD with hard $\ensuremath{\pi}$ pulses along two directions (${\ensuremath{\pi}}_{z/y}$ pulses). We present analytical perturbative results (Magnus expansion) in the quasistatic noise approximation combined with numerical simulations for realistic $1/f$ noise spectra. The gate efficiency is studied as a function of the gate duration, of the number $n$ of pulses, and of the high-frequency roll-off. We find that the gate error is nonmonotonic in $n$, decreasing as ${n}^{\ensuremath{-}\ensuremath{\alpha}}$ in the asymptotic limit, $\ensuremath{\alpha}\ensuremath{\ge}2$, depending on the DD sequence. In this limit ${\ensuremath{\pi}}_{z}$-Urhig is the most efficient scheme for quasistatic $1/f$ noise, but it is highly sensitive to the soft UV cutoff. For small number of pulses, ${\ensuremath{\pi}}_{z}$ control yields anti-Zeno behavior, whereas ${\ensuremath{\pi}}_{y}$ pulses minimize the error for a finite $n$. For the current noise figures in superconducting qubits, two-qubit gate errors $\ensuremath{\sim}{10}^{\ensuremath{-}6}$, meeting the requirements for fault-tolerant quantum computation, can be achieved. The Carr-Purcell-Meiboom-Gill sequence is the most efficient procedure, stable for $1/f$ noise with UV cutoff up to gigahertz.

arXiv:1605.06231•Physical Review A•Aug 3, 2016•6 citations
Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy nonlocal gate to dramatically suppress arbitrary logical errors, while steering the evolution operator towards the perfectly entangling subset of SU(4)\text{SU}(4)SU(4) gates. The modularity of the approach allows for application to any two-qubit system, regardless of the Hamiltonian or details of the experimental implementation. This approach is effective for both quasistatic and time-dependent 1/f\ensuremathα1/{f}^{\ensuremath{\alpha}}1/f\ensuremathα noise. We also show how the fidelity of the final operation depends on both the fidelity of the local rotations and the noise strength.
We use a gradient-based optimization scheme to find single-qubit rotations to be interwoven between time steps of a noisy logical two-qubit entangling gate in order to suppress the effects of arbitrary logical and leakage noise in the two-qubit gate. We show how the sequence fidelity is affected by imperfections in the single-qubit operations, as well as by various relative strengths of the logical and leakage noise. Our approach is completely general and system-independent, allowing for application to any two-qubit system regardless of the experimental implementation details.
Modular architectures are a promising approach to scaling quantum computers to fault tolerance. Small, low-noise quantum processors connected through relatively noisy quantum links are capable of fault-tolerant operation as long as the noise can be confined to the interface. Finding protocols that implement the quantum links between modules as efficiently as possible is essential because inter-module entanglement is challenging to produce at a similar rate and fidelity as local entanglement. We introduce a protocol for lattice surgery on surface codes in which all non-local operations are Bell measurements. The protocol simultaneously confines the link noise and requires only half as many module-crossing gates as previously proposed protocols. To mitigate distance-reducing hook errors, we introduce a strategy of alternating the gate sequence between rounds of syndrome measurement, which prevents multiple hooks from simultaneously aligning with a logical operator in the code. We evaluate our protocol's performance when two logical qubits on separate modules are prepared in a logical Bell state. Circuit-level simulations under depolarizing noise show that the logical error suppression for a given entanglement rate between modules is consistently stronger compared to the best-performing alternative protocols for a wide range of link noise, with a typical 40% entanglement resource saving for a constant logical error rate. Our approach to protocol design is applicable to any quantum circuit that must be divided across processor modules and can therefore guide development of resource-efficient modular quantum computation beyond the surface code.
Modular quantum computing is a leading paradigm for scaling quantum computation beyond the resource limitations of monolithic devices. In this architecture, multiple quantum processing units (QPUs), employing identical or distinct qubit modalities, are interconnected via shared entanglement. Here, we investigate how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code. Going beyond the logical-memory benchmark, we perform circuit-level simulations of fault-tolerant nonlocal CNOT gates implemented via lattice surgery between QPUs connected by noisy Bell pairs, and analyze the resulting logical error rates. Our results show that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold. We further develop an efficient protocol for preparing distributed fault-tolerant logical GHZ states, reducing ancilla overhead, time, and nonlocal Bell-pair consumption. We show that ancilla minimization in this setting is equivalent to a vertex-cover problem on an associated graph, and introduce a polynomial-time heuristic algorithm for finding low-overhead solutions. Our results provide quantitative evidence that distributed quantum error correction can enable scalable, fault-tolerant quantum computation in modular architectures.
Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different chips or dilution refrigerators. Such inter-module operations can therefore become a dominant bottleneck, even when quantum error correction is applied. Entanglement distillation provides a natural way to trade additional operations and qubits for higher-fidelity entanglement. Standard distillation protocols, however, are usually formulated in an LOCC resource model, in which several noisy Bell pairs are generated initially and all subsequent processing consists only of local operations and classical communication. Here, we consider a generalized model tailored to modular quantum computing hardware, in which the two modules have access to high-fidelity local operations and to repeated uses of the same noisy inter-module entangling operation during the protocol. We develop practical small-scale entanglement distillation protocols designed to minimize both space and time overhead. Remarkably, our main protocol requires only two qubits per module, yet achieves quadratic error suppression of inter-module errors, assuming local operations are much cleaner. Compared with existing small-scale protocols, our space-optimal protocol provides more space- and time-efficient quadratic error suppression and achieves the best performance in our simulations and experiments on noisy links of current superconducting quantum processors. These results suggest that inter-module-gate-assisted entanglement distillation can be a practical primitive for overcoming noisy links in modular quantum computing architectures.
Gate-based quantum algorithms are typically implemented by circuits consisting of many single-qubit and multi-qubit gates operating on a quantum input state, followed by measurements of the output state. For certain quantum subroutines, such as initial state preparation and quantum Fourier transforms, explicit decompositions of the circuit in terms of single-qubit and two-qubit maximally entangling gates may exist. However, they often lead to large-depth circuits that are challenging for noisy intermediate-scale quantum (NISQ) hardware. Additionally, exact decompositions might only exist for some modular quantum circuits. Therefore, it is essential to find gate combinations that approximate these circuits to high fidelity with potentially low depth. Gradient-based optimization has been used to find such approximate decompositions. Still, these traditional optimizers often run into problems of slow convergence requiring many iterations, and performing poorly in the presence of noise, a factor that is especially relevant for NISQ hardware. Here we present iteratively preconditioned gradient descent (IPG) for optimizing quantum circuits and demonstrate performance speedups for state preparation and implementation of quantum algorithmic subroutines. IPG is a noise-resilient, higher-order algorithm that has shown promising gains in convergence speed for classical optimizations, converging locally at a linear rate for convex problems and superlinearly when the solution is unique. Specifically, we show an improvement in fidelity by a factor of 104for preparing a 4-qubit W state and a maximally entangled 5-qubit GHZ state with compared to other commonly used classical optimizers tuning the same ansatz. Such faster convergence with promise for noise-resilience could provide advantages for quantum algorithms on NISQ hardware, especially since the cost of running each iteration on a quantum computer is substantially higher than the classical optimizer step.
We investigate the possibility of achieving high-fidelity universal two-qubit gates by supplementing optimal tuning of individual qubits with dynamical decoupling (DD) of local 1/f1/f1/f noise. We consider simultaneous local pulse sequences applied during the gate operation and compare the efficiencies of periodic, Carr-Purcell, and Uhrig DD with hard $\ensuremath{\pi}$ pulses along two directions (${\ensuremath{\pi}}_{z/y}$ pulses). We present analytical perturbative results (Magnus expansion) in the quasistatic noise approximation combined with numerical simulations for realistic 1/f1/f1/f noise spectra. The gate efficiency is studied as a function of the gate duration, of the number nnn of pulses, and of the high-frequency roll-off. We find that the gate error is nonmonotonic in nnn, decreasing as ${n}^{\ensuremath{-}\ensuremath{\alpha}}$ in the asymptotic limit, $\ensuremath{\alpha}\ensuremath{\ge}2$, depending on the DD sequence. In this limit ${\ensuremath{\pi}}_{z}$-Urhig is the most efficient scheme for quasistatic 1/f1/f1/f noise, but it is highly sensitive to the soft UV cutoff. For small number of pulses, ${\ensuremath{\pi}}_{z}$ control yields anti-Zeno behavior, whereas ${\ensuremath{\pi}}_{y}$ pulses minimize the error for a finite nnn. For the current noise figures in superconducting qubits, two-qubit gate errors $\ensuremath{\sim}{10}^{\ensuremath{-}6}$, meeting the requirements for fault-tolerant quantum computation, can be achieved. The Carr-Purcell-Meiboom-Gill sequence is the most efficient procedure, stable for 1/f1/f1/f noise with UV cutoff up to gigahertz.