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:2610.37840

Ground-state energy estimation compiled on cat qubits: 7 164 qubits for FeMoco-54 in 23.5 hours

Larissa Kroell, Hugo Jacinto, Victor Hertz, Axel Pappalardo, Adel Ben Moussa, Manuel Rispler, Peter Shanahan, Élie Gouzien, Christophe Vuillot, Vivien Londe

quant-phSubmitted Oct 27, 2026• Announced Oct 29, 2026• 1 citation
arXivHTMLPDF

Abstract

We provide a detailed resource estimate of the state-of-the-art sum-of-squares block encoding algorithm for electronic structure Hamiltonians of Low et al. on superconducting cat qubits. To achieve this, we present compilations with closed-form costs of the dominant subroutines such as skew-tree Qrom, a Swap network and a Phaseup for both a repetition-cat and an LDPC-cat architecture. Our compilation represents algorithmic qubits in the $X$ basis, taking advantage of the asymmetric cost of $X$ and $Z$ access that the concatenation of cat qubits with phase-flip classical code brings. Additionally, we provide a protocol for $\vert i \rangle$-state distillation and a two-level Toffoli-like $\vert \text{C}_X\text{C}_X X \rangle$ magic state distillation protocol, including three factory layouts. To minimize the cost of Clifford corrections induced by magic state injections we tailor injection gadgets to each subroutine. Combining our compilation work with the adder compilation from the companion work Pappalardo et al., we provide global layouts for the block encoding in both architectures which we use to obtain resource estimates for ground-state energy estimation for the benchmarks of FeMoco-54 and FeMoco-76. Assuming a cycle time of 1$μ$s, a reaction time of 10$\mathrmμ$s, a phase estimation precision of 1 mHa and circuit-level phase-flip noise with probability $p_Z = 5 \times 10^{-4}$ with negligible bit-flip error, FeMoco-54 requires fewer than $7\,500$ cat qubits with an expected runtime of under one day for a single phase estimation run using an LDPC-cat architecture. Relaxing the bit-flip requirement to $p_X = 10^{-11}$ with an additional layer of elevator codes raises this to an estimated $13\,000$ cat qubits.

AI Summary

The paper estimates the resources for electronic-structure ground-state energy estimation on repetition-cat and hybrid LDPC-cat architectures. It compiles an existing DFTHC sum-of-squares block encoding with spectral amplification, using previously determined Hamiltonian parameters rather than introducing a new chemistry algorithm. Algorithmic qubits are represented in the $X$ basis to exploit cheaper logical $X$ access. The compilation provides closed-form costs and layouts for skew-tree QROM, controlled-SWAP networks and phase correction, together with $|i\rangle$ distillation and two-level Toffoli-like magic-state factories. These primitives, combined with an adder compilation from companion work, yield end-to-end layouts and space–time trade-offs. Circuit-level simulations support the distillation protocols and LDPC logical-error models; the latter extrapolate from Monte Carlo data using a most-likely-error decoder. With $1\,\mu\mathrm{s}$ cycles, $10\,\mu\mathrm{s}$ reaction time, $1$ mHa phase-estimation precision, $p_Z=5\times10^{-4}$ and negligible bit flips, FeMoco-54 requires 7,164 cat qubits and an expected 23.5 hours per phase-estimation run, consuming approximately $2.01\times10^9$ Toffolis. FeMoco-76 requires 7,818 qubits and 3.31 days. Larger compute zones reduce runtime; LDPC-cat uses 36–38% fewer qubits than repetition-cat in the reference configurations. The estimates assume serial Toffolis, one factory and fixed state-preparation choices. Neglecting bit flips requires extremely low physical $p_X$; an additional elevator-code layer at $p_X=10^{-11}$ raises the FeMoco-54 LDPC estimate to approximately 12,700 qubits, but this is a proportional-overhead extrapolation, not a complete compilation. FeMoco is treated as a benchmark, not a quantum-advantage demonstration.

No sign of AI-generated textStrong assumptions

Error found: The paper gives incompatible estimates, approximately 10^-18 and 10^-16, for the physical bit-flip rate required when no active bit-flip protection is used. The spin-combined one-electron OuterPrep weight should be sqrt(2 mu), whereas the block-encoding description specifies 2 sqrt(mu), inconsistent with its own SOS normalization and formula for Lambda.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
81 pages, 54 figures, 14 tables

Related papers

Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days

Axel Pappalardo, Dahmun Goudarzi, Victor Hertz +7 more

We present an end-to-end resource estimation of Shor's algorithm on superconducting cat qubits, from its mathematical description to the allocation and scheduling of physical qubits on a chip layout. We review modern versions of Shor's algorithm for RSA, ECDLP and FFDLP, and make their logical circuits and trade-offs explicit. We compile the dominant subroutines down to physical-qubit operations on two architectures: one based on repetition cat codes and one on LDPC cat codes. We design a parity-Cnot gate for cat qubits, extend a multi-target Cnot gate to the LDPC-cat architecture, and adapt an active injection procedure to cat qubits. Building on these primitives, we adapt to cat qubits the adder from Gidney's 2025 resource estimate for factoring RSA-2048. We combine our adder compilation and a coarser estimate for the phaseup with the factory designs and lookup compilation from the FeMoco resource estimation of Kroell et al. Together, these lead to chip layouts and schedules for factoring RSA-2048. Assuming a 1$μ$s error-correction cycle time, a 10$μ$s reaction time, circuit-level phase-flip noise with probability $p_Z = 5 \times 10^{-4}$ and no bit-flips, factoring RSA-2048, the configuration we compile in full, requires about 23 000 cat qubits and 3.14 days. Reusing the compiled operations, solving ECDLP on secp256k1 requires at most 30 000 cat qubits and 1 hour, and FFDLP-512, which we propose as an intermediate benchmark, about 6 700 cat qubits and 21 minutes. Trading space for time, RSA-2048 runs in 1.25 hours on about 611 000 cat qubits. The no-bit-flip requirement (a bit-flip time of about 100 years) can be relaxed to a bit-flip time of about one hour by adding a concatenation layer with a distance-3 bit-flip code, in which case RSA-2048 needs about 45 000 cat qubits.

quant-pharXiv:2610.37839•Oct 29, 2026•3 citations

A Denser Planar Surface Code

Guang Hao Low, William J. Huggins, Dominic W. Berry +4 more

We present a quantum code implementable on a regular $2$D hex grid with an estimated encoding rate up to $4.5\times$ of that of a rotated surface code patch using circuit-level noise in a one- and two-qubit $10^{-3}$ error uniform depolarizing model. Our approach is based on yoking a dense packing of surface code twist defects, enabled by new stabilizer measurement cycles with an optimal four layers of nearest-neighbor two-qubit gates, almost no distance-reducing hook errors, and efficient decoding. We demonstrate a space-efficient architecture for computing on densely packed logical qubits, including new padding-free lattice surgery protocols in an optimal bounding box of $2d^2$ data and measurement qubits per patch. Assuming a $1μ$s surface code cycle time and a $10μ$s reaction time, these developments enable chemically accurate ground state phase estimation of a broad class of `utility-scale' electronic structure simulation problems such as the $108$ spin-orbital FeMoco-based nitrogen fixation catalyst in under a month with $89$k noisy superconducting qubits. We elucidate a Pareto frontier of space-time trade-offs and find a minimum physical quantum volume of $1.3$ mega-qubit-hours. These correspond to a $36\times$ space and $6.6\times$ spacetime improvement, respectively, over our previous state-of-the-art minimum-Toffoli resource estimates (Phys. Rev. X 15, 041016).

quant-pharXiv:2605.30455•Jun 1, 2026•26 citations

Compiling the 2D Fermi-Hubbard ground-state energy estimation algorithm for active volume quantum architectures

Harriet Apel, Athena Caesura, Carys Harvey +11 more

As quantum computing enters the early fault-tolerant era, circuit compilation choices will increasingly depend on details of the underlying architecture rather than solely optimizing for generic proxies such as non-Clifford count. We present an active-volume-aware compilation of the ground-state energy estimation algorithm for the two-dimensional Fermi-Hubbard model using quantum phase estimation and Trotterized time evolution. The proposed compilation reduces the active volume across $L\times L$ square lattices with $L=4$ to $20$, achieving up to a $3.9\times$ reduction over prior work optimized for non-Clifford cost. As a by-product of these compilation improvements, the resulting circuits also achieve state-of-the-art Toffoli counts, with a ~$2\times$ reduction for the $L=20$ case. Lastly, the active volume architecture and recent execution scheduling advances provide a means of translating these reduction trends into runtime. This demonstrates the increasing importance of architecture-aware compilation for practical early fault-tolerant quantum computing.

quant-pharXiv:2609.05316•Sep 7, 2026•2 citations

LDPC-cat codes for low-overhead quantum computing in 2D

Diego Ruiz, Jérémie Guillaud, Anthony Leverrier +2 more

Abstract The main obstacle to large scale quantum computing are the errors present in every physical qubit realization. Correcting these errors requires a large number of additional qubits. Two main avenues to reduce this overhead are (i) low-density parity check (LDPC) codes requiring very few additional qubits to correct errors (ii) cat qubits where bit-flip errors are exponentially suppressed by design. In this work, we combine both approaches to obtain an extremely low overhead architecture. Assuming a physical phase-flip error probability ϵ ≈ 0.1% per qubit and operation, one hundred logical qubits can be implemented on a 758 cat qubit chip, with a total logical error probability per cycle and per logical qubit ϵ L ≤ 10 −8 . Our architecture also features two major advantages. First, the hardware implementation of the code can be realised with short-range qubit interactions in 2D and low-weight stabilizers, under constraints similar to those of the popular surface code architecture. Second, we demonstrate how to implement a fault-tolerant universal set of logical gates with an additional layer of routing cat qubits stacked on top of the LDPC layer, while maintaining the local connectivity. Furthermore, our architecture benefits from a high capacity of parallelization for these logical gates.

arXiv:2401.09541•Nature Communications•Jan 25, 2025•57 citations

Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors

Diego Ruiz, Jérémie Guillaud, Christophe Vuillot +1 more

Qubits with strongly biased noise, in which phase-flip errors are orders of magnitude more frequent than bit-flips, arise both naturally, as in electron and nuclear spins, and by engineering, as in stabilized cat qubits. This noise structure holds the promise of reducing the daunting hardware overhead of fault-tolerant quantum computing, but exploiting it requires physical operations that do not convert frequent phase-flips into rare bit-flips. In this review, we analyze the most prominent fault-tolerant protocols for biased-noise qubits, organized according to the available set of such bias-preserving operations. When this set is restricted to the CZ gate together with preparation and measurement in the X basis, we show that the complexity of the required syndrome extraction gadgets essentially cancels the benefit of the noise bias: at experimentally relevant error rates, one may as well ignore the bias and rely on standard error correction designed for depolarizing noise. The situation changes drastically when a bias-preserving CX gate is available: the hierarchy of errors can then be reflected in the structure of the code, with frequent phase-flips corrected by a dedicated high-threshold code and rare bit-flips by concatenation with a high-rate code. The same hierarchy also enables hardware-efficient preparation of magic states. Finally, as a bias-preserving CX is forbidden in naturally biased platforms and challenging in engineered ones, we present a measurement-based architecture in which a high-fidelity quantum non-demolition readout of multi-qubit Pauli Z operators takes its place, extending these overhead reductions to a much broader range of physical platforms.

quant-pharXiv:2607.20143•Jul 23, 2026•2 citations

Assessment of quantum phase estimation protocols for early fault-tolerant quantum computers

Jacob S. Nelson, Andrew Baczewski

We compare several quantum phase estimation (QPE) protocols intended for early fault-tolerant (EFT) quantum computers in the context of models of their implementations on a surface code architecture. We estimate the logical and physical resources required to use these protocols to calculate the ground-state energy of molecular hydrogen in a minimal basis with error below ${10}^{\ensuremath{-}3}$ atomic units, in the presence of depolarizing logical errors. Accounting for the overhead of rotation synthesis and magic state distillation, we find that the total $T$-gate counts do not vary significantly among the EFT QPE protocols at fixed state overlap. In addition to reducing the number of ancilla qubits and circuit depth, the noise robustness of the EFT protocols can be leveraged to reduce resource requirements below those of textbook QPE, realizing an approximately 300-fold reduction in aggregate computational volume in some cases. We also compare resource requirements for QPE on Trotterized time evolution and qubitized walk operators, for this same minimal exemplar. We estimate the costs of these two approaches to be comparable, with the Trotter approach requiring slightly fewer physical qubits and the qubitized approach requiring slightly fewer code cycles. Even so, our estimates are well beyond the scale of existing early fault-tolerance demonstrations.

arXiv:2403.00077•Physical Review A•Oct 16, 2024•15 citations
We provide a detailed resource estimate of the state-of-the-art sum-of-squares block encoding algorithm for electronic structure Hamiltonians of Low et al. on superconducting cat qubits. To achieve this, we present compilations with closed-form costs of the dominant subroutines such as skew-tree Qrom, a Swap network and a Phaseup for both a repetition-cat and an LDPC-cat architecture. Our compilation represents algorithmic qubits in the XXX basis, taking advantage of the asymmetric cost of XXX and ZZZ access that the concatenation of cat qubits with phase-flip classical code brings. Additionally, we provide a protocol for ∣i⟩\vert i \rangle∣i⟩-state distillation and a two-level Toffoli-like ∣CXCXX⟩\vert \text{C}_X\text{C}_X X \rangle∣CX​CX​X⟩ magic state distillation protocol, including three factory layouts. To minimize the cost of Clifford corrections induced by magic state injections we tailor injection gadgets to each subroutine. Combining our compilation work with the adder compilation from the companion work Pappalardo et al., we provide global layouts for the block encoding in both architectures which we use to obtain resource estimates for ground-state energy estimation for the benchmarks of FeMoco-54 and FeMoco-76. Assuming a cycle time of 1μμμs, a reaction time of 10μ\mathrmμμs, a phase estimation precision of 1 mHa and circuit-level phase-flip noise with probability pZ=5×10−4p_Z = 5 \times 10^{-4}pZ​=5×10−4 with negligible bit-flip error, FeMoco-54 requires fewer than 7 5007\,5007500 cat qubits with an expected runtime of under one day for a single phase estimation run using an LDPC-cat architecture. Relaxing the bit-flip requirement to pX=10−11p_X = 10^{-11}pX​=10−11 with an additional layer of elevator codes raises this to an estimated 13 00013\,00013000 cat qubits.
The paper estimates the resources for electronic-structure ground-state energy estimation on repetition-cat and hybrid LDPC-cat architectures. It compiles an existing DFTHC sum-of-squares block encoding with spectral amplification, using previously determined Hamiltonian parameters rather than introducing a new chemistry algorithm.
Algorithmic qubits are represented in the XXX basis to exploit cheaper logical XXX access. The compilation provides closed-form costs and layouts for skew-tree QROM, controlled-SWAP networks and phase correction, together with ∣i⟩|i\rangle∣i⟩ distillation and two-level Toffoli-like magic-state factories. These primitives, combined with an adder compilation from companion work, yield end-to-end layouts and space–time trade-offs. Circuit-level simulations support the distillation protocols and LDPC logical-error models; the latter extrapolate from Monte Carlo data using a most-likely-error decoder.
With 1 μs1\,\mu\mathrm{s}1μs cycles, 10 μs10\,\mu\mathrm{s}10μs reaction time, 111 mHa phase-estimation precision, pZ=5×10−4p_Z=5\times10^{-4}pZ​=5×10−4 and negligible bit flips, FeMoco-54 requires 7,164 cat qubits and an expected 23.5 hours per phase-estimation run, consuming approximately 2.01×1092.01\times10^92.01×109 Toffolis. FeMoco-76 requires 7,818 qubits and 3.31 days. Larger compute zones reduce runtime; LDPC-cat uses 36–38% fewer qubits than repetition-cat in the reference configurations.
The estimates assume serial Toffolis, one factory and fixed state-preparation choices. Neglecting bit flips requires extremely low physical pXp_XpX​; an additional elevator-code layer at pX=10−11p_X=10^{-11}pX​=10−11 raises the FeMoco-54 LDPC estimate to approximately 12,700 qubits, but this is a proportional-overhead extrapolation, not a complete compilation. FeMoco is treated as a benchmark, not a quantum-advantage demonstration.
We present an end-to-end resource estimation of Shor's algorithm on superconducting cat qubits, from its mathematical description to the allocation and scheduling of physical qubits on a chip layout. We review modern versions of Shor's algorithm for RSA, ECDLP and FFDLP, and make their logical circuits and trade-offs explicit. We compile the dominant subroutines down to physical-qubit operations on two architectures: one based on repetition cat codes and one on LDPC cat codes. We design a parity-Cnot gate for cat qubits, extend a multi-target Cnot gate to the LDPC-cat architecture, and adapt an active injection procedure to cat qubits. Building on these primitives, we adapt to cat qubits the adder from Gidney's 2025 resource estimate for factoring RSA-2048. We combine our adder compilation and a coarser estimate for the phaseup with the factory designs and lookup compilation from the FeMoco resource estimation of Kroell et al. Together, these lead to chip layouts and schedules for factoring RSA-2048. Assuming a 1μμμs error-correction cycle time, a 10μμμs reaction time, circuit-level phase-flip noise with probability pZ=5×10−4p_Z = 5 \times 10^{-4}pZ​=5×10−4 and no bit-flips, factoring RSA-2048, the configuration we compile in full, requires about 23 000 cat qubits and 3.14 days. Reusing the compiled operations, solving ECDLP on secp256k1 requires at most 30 000 cat qubits and 1 hour, and FFDLP-512, which we propose as an intermediate benchmark, about 6 700 cat qubits and 21 minutes. Trading space for time, RSA-2048 runs in 1.25 hours on about 611 000 cat qubits. The no-bit-flip requirement (a bit-flip time of about 100 years) can be relaxed to a bit-flip time of about one hour by adding a concatenation layer with a distance-3 bit-flip code, in which case RSA-2048 needs about 45 000 cat qubits.
We present a quantum code implementable on a regular 222D hex grid with an estimated encoding rate up to 4.5×4.5\times4.5× of that of a rotated surface code patch using circuit-level noise in a one- and two-qubit 10−310^{-3}10−3 error uniform depolarizing model. Our approach is based on yoking a dense packing of surface code twist defects, enabled by new stabilizer measurement cycles with an optimal four layers of nearest-neighbor two-qubit gates, almost no distance-reducing hook errors, and efficient decoding. We demonstrate a space-efficient architecture for computing on densely packed logical qubits, including new padding-free lattice surgery protocols in an optimal bounding box of 2d22d^22d2 data and measurement qubits per patch. Assuming a 1μ1μ1μs surface code cycle time and a 10μ10μ10μs reaction time, these developments enable chemically accurate ground state phase estimation of a broad class of `utility-scale' electronic structure simulation problems such as the 108108108 spin-orbital FeMoco-based nitrogen fixation catalyst in under a month with 898989k noisy superconducting qubits. We elucidate a Pareto frontier of space-time trade-offs and find a minimum physical quantum volume of 1.31.31.3 mega-qubit-hours. These correspond to a 36×36\times36× space and 6.6×6.6\times6.6× spacetime improvement, respectively, over our previous state-of-the-art minimum-Toffoli resource estimates (Phys. Rev. X 15, 041016).
As quantum computing enters the early fault-tolerant era, circuit compilation choices will increasingly depend on details of the underlying architecture rather than solely optimizing for generic proxies such as non-Clifford count. We present an active-volume-aware compilation of the ground-state energy estimation algorithm for the two-dimensional Fermi-Hubbard model using quantum phase estimation and Trotterized time evolution. The proposed compilation reduces the active volume across L×LL\times LL×L square lattices with L=4L=4L=4 to 202020, achieving up to a 3.9×3.9\times3.9× reduction over prior work optimized for non-Clifford cost. As a by-product of these compilation improvements, the resulting circuits also achieve state-of-the-art Toffoli counts, with a ~2×2\times2× reduction for the L=20L=20L=20 case. Lastly, the active volume architecture and recent execution scheduling advances provide a means of translating these reduction trends into runtime. This demonstrates the increasing importance of architecture-aware compilation for practical early fault-tolerant quantum computing.
Abstract The main obstacle to large scale quantum computing are the errors present in every physical qubit realization. Correcting these errors requires a large number of additional qubits. Two main avenues to reduce this overhead are (i) low-density parity check (LDPC) codes requiring very few additional qubits to correct errors (ii) cat qubits where bit-flip errors are exponentially suppressed by design. In this work, we combine both approaches to obtain an extremely low overhead architecture. Assuming a physical phase-flip error probability ϵ ≈ 0.1% per qubit and operation, one hundred logical qubits can be implemented on a 758 cat qubit chip, with a total logical error probability per cycle and per logical qubit ϵ L ≤ 10 −8 . Our architecture also features two major advantages. First, the hardware implementation of the code can be realised with short-range qubit interactions in 2D and low-weight stabilizers, under constraints similar to those of the popular surface code architecture. Second, we demonstrate how to implement a fault-tolerant universal set of logical gates with an additional layer of routing cat qubits stacked on top of the LDPC layer, while maintaining the local connectivity. Furthermore, our architecture benefits from a high capacity of parallelization for these logical gates.
Qubits with strongly biased noise, in which phase-flip errors are orders of magnitude more frequent than bit-flips, arise both naturally, as in electron and nuclear spins, and by engineering, as in stabilized cat qubits. This noise structure holds the promise of reducing the daunting hardware overhead of fault-tolerant quantum computing, but exploiting it requires physical operations that do not convert frequent phase-flips into rare bit-flips. In this review, we analyze the most prominent fault-tolerant protocols for biased-noise qubits, organized according to the available set of such bias-preserving operations. When this set is restricted to the CZ gate together with preparation and measurement in the X basis, we show that the complexity of the required syndrome extraction gadgets essentially cancels the benefit of the noise bias: at experimentally relevant error rates, one may as well ignore the bias and rely on standard error correction designed for depolarizing noise. The situation changes drastically when a bias-preserving CX gate is available: the hierarchy of errors can then be reflected in the structure of the code, with frequent phase-flips corrected by a dedicated high-threshold code and rare bit-flips by concatenation with a high-rate code. The same hierarchy also enables hardware-efficient preparation of magic states. Finally, as a bias-preserving CX is forbidden in naturally biased platforms and challenging in engineered ones, we present a measurement-based architecture in which a high-fidelity quantum non-demolition readout of multi-qubit Pauli Z operators takes its place, extending these overhead reductions to a much broader range of physical platforms.
We compare several quantum phase estimation (QPE) protocols intended for early fault-tolerant (EFT) quantum computers in the context of models of their implementations on a surface code architecture. We estimate the logical and physical resources required to use these protocols to calculate the ground-state energy of molecular hydrogen in a minimal basis with error below ${10}^{\ensuremath{-}3}$ atomic units, in the presence of depolarizing logical errors. Accounting for the overhead of rotation synthesis and magic state distillation, we find that the total TTT-gate counts do not vary significantly among the EFT QPE protocols at fixed state overlap. In addition to reducing the number of ancilla qubits and circuit depth, the noise robustness of the EFT protocols can be leveraged to reduce resource requirements below those of textbook QPE, realizing an approximately 300-fold reduction in aggregate computational volume in some cases. We also compare resource requirements for QPE on Trotterized time evolution and qubitized walk operators, for this same minimal exemplar. We estimate the costs of these two approaches to be comparable, with the Trotter approach requiring slightly fewer physical qubits and the qubitized approach requiring slightly fewer code cycles. Even so, our estimates are well beyond the scale of existing early fault-tolerance demonstrations.