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

Nature Nanotechnology

Universal logical operations in a silicon quantum processor

Chunhui Zhang, Feng Xu, Shihang Zhang, Meiling Duan, Dupeng Zhong, Xuesong Bai, Hao Wang, Chao Huang, Yi Deng, Miao Gao, Yu-Ning Zhang, Jiaze Liu, Chunhui Li, Yan Jiang, Baolong Zhao, Huan Shu, Kunrong Wu, Keji Shi, Qiming Ding, Zhen Tian, Guanyong Wang, Xiao Yuan, Tao Xin, Guangchong Hu, Song Liu, Tianluo Pan, Peihao Huang, Yu He, Dapeng Yu

Published Mar 23, 2026• 6 citations
Publisher

Abstract

Quantum errors induced by environmental noise are unavoidable and preclude the direct implementation of practical quantum computation. Fault-tolerant quantum computation offers one of the viable paths, necessitating the encoding and processing of information within logical qubits to curb such errors. Although substantial progress has been achieved recently in building silicon quantum computers, logical operations still haven’t been realized in silicon. Here we demonstrate a logical quantum processor using a phosphorus donor cluster in silicon. By implementing the [[4, 2, 2]] code, we realize the essential components for logical operations, which include fault-tolerant preparation of logical states and the characterization of a universal gate set comprising logical single-qubit and two-qubit gates. In particular, the logical T gate is achieved using the gate-by-measurement method, and magic states based on this gate are prepared. Furthermore, we execute the variational quantum eigensolver algorithm using two logical qubits and simulate the ground state of the electronic structure of the water molecule H2O. This work represents a key step towards scalable, fault-tolerant quantum computation in silicon spin qubits. Five nuclear spins in silicon and the [[4, 2, 2]] code are used to demonstrate a universal logical gate set and to execute a variational quantum eigensolver computation of the ground-state energy of a water molecule.

DOI
10.1038/s41565-026-02140-1

Related papers

Quantum logic with spin qubits crossing the surface code threshold

Xiao Xue, Maximilian Rimbach-Russ, Nodar Samkharadze +4 more

Abstract High-fidelity control of quantum bits is paramount for the reliable execution of quantum algorithms and for achieving fault tolerance—the ability to correct errors faster than they occur 1 . The central requirement for fault tolerance is expressed in terms of an error threshold. Whereas the actual threshold depends on many details, a common target is the approximately 1% error threshold of the well-known surface code 2,3 . Reaching two-qubit gate fidelities above 99% has been a long-standing major goal for semiconductor spin qubits. These qubits are promising for scaling, as they can leverage advanced semiconductor technology 4 . Here we report a spin-based quantum processor in silicon with single-qubit and two-qubit gate fidelities, all of which are above 99.5%, extracted from gate-set tomography. The average single-qubit gate fidelities remain above 99% when including crosstalk and idling errors on the neighbouring qubit. Using this high-fidelity gate set, we execute the demanding task of calculating molecular ground-state energies using a variational quantum eigensolver algorithm 5 . Having surpassed the 99% barrier for the two-qubit gate fidelity, semiconductor qubits are well positioned on the path to fault tolerance and to possible applications in the era of noisy intermediate-scale quantum devices.

arXiv:2107.00628•Nature•Jan 19, 2022•576 citations

Demonstration of measurement-free universal logical quantum computation

Friederike Butt, Ivan Pogorelov, Robert S. Freund +4 more

The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.

Nature Communications•Jan 26, 2026•8 citations

Demonstrating a universal logical gate set in error-detecting surface codes on a superconducting quantum processor

Jiaxuan Zhang, Zhao‐Yun Chen, Yunjie Wang +6 more

Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging. Particularly, in the superconducting system, two-qubit gates on surface code logical qubits have not been realized. Here, we experimentally implement a logical CNOT gate along with arbitrary single-qubit rotation gates on distance-2 surface codes using the superconducting quantum processor Wukong , thereby demonstrating a universal logical gate set. In the experiment, we demonstrate the transversal CNOT gate on a two-dimensional topological processor based on a tailored encoding circuit, at the cost of removing the ancilla qubits required for stabilizer measurements. Furthermore, we fault-tolerantly prepare logical Bell states and observe a violation of CHSH inequality, confirming the entanglement between logical qubits. Using the logical CNOT gate and an ancilla logical state, arbitrary single-qubit rotation gates are realized through gate teleportation. All logical gates are characterized on a complete state set and their fidelities are evaluated by logical Pauli transfer matrices. The demonstration of a universal logical gate set and the entangled logical states highlights significant aspects of FTQC on superconducting quantum processors.

arXiv:2405.09035•npj Quantum Information•Nov 14, 2025•11 citations

Fault-tolerant operation of a logical qubit in a diamond quantum processor

M. H. Abobeih, Yang Wang, J. Randall +6 more

Abstract Solid-state spin qubits is a promising platform for quantum computation and quantum networks1,2. Recent experiments have demonstrated high-quality control over multi-qubit systems3–8, elementary quantum algorithms8–11 and non-fault-tolerant error correction12–14. Large-scale systems will require using error-corrected logical qubits that are operated fault tolerantly, so that reliable computation becomes possible despite noisy operations15–18. Overcoming imperfections in this way remains an important outstanding challenge for quantum science15,19–27. Here, we demonstrate fault-tolerant operations on a logical qubit using spin qubits in diamond. Our approach is based on the five-qubit code with a recently discovered flag protocol that enables fault tolerance using a total of seven qubits28–30. We encode the logical qubit using a new protocol based on repeated multi-qubit measurements and show that it outperforms non-fault-tolerant encoding schemes. We then fault-tolerantly manipulate the logical qubit through a complete set of single-qubit Clifford gates. Finally, we demonstrate flagged stabilizer measurements with real-time processing of the outcomes. Such measurements are a primitive for fault-tolerant quantum error correction. Although future improvements in fidelity and the number of qubits will be required to suppress logical error rates below the physical error rates, our realization of fault-tolerant protocols on the logical-qubit level is a key step towards quantum information processing based on solid-state spins.

arXiv:2108.01646•Nature•May 5, 2022•256 citations

Grover’s algorithm in a four-qubit silicon processor above the fault-tolerant threshold

Ian Thorvaldson, D. Poulos, Christian M. Moehle +15 more

Spin qubits in silicon are strong contenders for the realization of a practical quantum computer, having demonstrated single- and two-qubit gates with fidelities above the fault-tolerant threshold, and entanglement of three qubits. However, maintaining high-fidelity operations while increasing the qubit count remains challenging and therefore only two-qubit algorithms have been executed. Here we utilize a four-qubit silicon processor with all control fidelities above the fault-tolerant threshold and demonstrate a three-qubit Grover's search algorithm with a ~95% probability of finding the marked state. Our processor is made of three phosphorus atoms precision-patterned into isotopically pure silicon, which localise one electron. The long coherence times of the qubits enable single-qubit fidelities above 99.9% for all qubits. Moreover, the efficient single-pulse multi-qubit operations enabled by the electron-nuclear hyperfine interaction facilitate controlled-Z gates between all pairs of nuclear spins with fidelities above 99% when using the electron as an ancilla. These control fidelities, combined with high-fidelity non-demolition readout of all nuclear spins, allow the creation of a three-qubit Greenberger-Horne-Zeilinger state with 96.2% fidelity. Looking ahead, coupling neighbouring nuclear spin registers, as the one shown here, via electron-electron exchange may enable larger, fault-tolerant quantum processors.

arXiv:2404.08741•Nature Nanotechnology•Feb 20, 2025•51 citations

New pathways to universal quantum logic in the early era of fault tolerance

Friederike Butt

Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.

•Jan 1, 2026•0 citations
Quantum errors induced by environmental noise are unavoidable and preclude the direct implementation of practical quantum computation. Fault-tolerant quantum computation offers one of the viable paths, necessitating the encoding and processing of information within logical qubits to curb such errors. Although substantial progress has been achieved recently in building silicon quantum computers, logical operations still haven’t been realized in silicon. Here we demonstrate a logical quantum processor using a phosphorus donor cluster in silicon. By implementing the [[4, 2, 2]] code, we realize the essential components for logical operations, which include fault-tolerant preparation of logical states and the characterization of a universal gate set comprising logical single-qubit and two-qubit gates. In particular, the logical T gate is achieved using the gate-by-measurement method, and magic states based on this gate are prepared. Furthermore, we execute the variational quantum eigensolver algorithm using two logical qubits and simulate the ground state of the electronic structure of the water molecule H2O. This work represents a key step towards scalable, fault-tolerant quantum computation in silicon spin qubits. Five nuclear spins in silicon and the [[4, 2, 2]] code are used to demonstrate a universal logical gate set and to execute a variational quantum eigensolver computation of the ground-state energy of a water molecule.
Abstract High-fidelity control of quantum bits is paramount for the reliable execution of quantum algorithms and for achieving fault tolerance—the ability to correct errors faster than they occur 1 . The central requirement for fault tolerance is expressed in terms of an error threshold. Whereas the actual threshold depends on many details, a common target is the approximately 1% error threshold of the well-known surface code 2,3 . Reaching two-qubit gate fidelities above 99% has been a long-standing major goal for semiconductor spin qubits. These qubits are promising for scaling, as they can leverage advanced semiconductor technology 4 . Here we report a spin-based quantum processor in silicon with single-qubit and two-qubit gate fidelities, all of which are above 99.5%, extracted from gate-set tomography. The average single-qubit gate fidelities remain above 99% when including crosstalk and idling errors on the neighbouring qubit. Using this high-fidelity gate set, we execute the demanding task of calculating molecular ground-state energies using a variational quantum eigensolver algorithm 5 . Having surpassed the 99% barrier for the two-qubit gate fidelity, semiconductor qubits are well positioned on the path to fault tolerance and to possible applications in the era of noisy intermediate-scale quantum devices.
The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.
Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging. Particularly, in the superconducting system, two-qubit gates on surface code logical qubits have not been realized. Here, we experimentally implement a logical CNOT gate along with arbitrary single-qubit rotation gates on distance-2 surface codes using the superconducting quantum processor Wukong , thereby demonstrating a universal logical gate set. In the experiment, we demonstrate the transversal CNOT gate on a two-dimensional topological processor based on a tailored encoding circuit, at the cost of removing the ancilla qubits required for stabilizer measurements. Furthermore, we fault-tolerantly prepare logical Bell states and observe a violation of CHSH inequality, confirming the entanglement between logical qubits. Using the logical CNOT gate and an ancilla logical state, arbitrary single-qubit rotation gates are realized through gate teleportation. All logical gates are characterized on a complete state set and their fidelities are evaluated by logical Pauli transfer matrices. The demonstration of a universal logical gate set and the entangled logical states highlights significant aspects of FTQC on superconducting quantum processors.
Abstract Solid-state spin qubits is a promising platform for quantum computation and quantum networks1,2. Recent experiments have demonstrated high-quality control over multi-qubit systems3–8, elementary quantum algorithms8–11 and non-fault-tolerant error correction12–14. Large-scale systems will require using error-corrected logical qubits that are operated fault tolerantly, so that reliable computation becomes possible despite noisy operations15–18. Overcoming imperfections in this way remains an important outstanding challenge for quantum science15,19–27. Here, we demonstrate fault-tolerant operations on a logical qubit using spin qubits in diamond. Our approach is based on the five-qubit code with a recently discovered flag protocol that enables fault tolerance using a total of seven qubits28–30. We encode the logical qubit using a new protocol based on repeated multi-qubit measurements and show that it outperforms non-fault-tolerant encoding schemes. We then fault-tolerantly manipulate the logical qubit through a complete set of single-qubit Clifford gates. Finally, we demonstrate flagged stabilizer measurements with real-time processing of the outcomes. Such measurements are a primitive for fault-tolerant quantum error correction. Although future improvements in fidelity and the number of qubits will be required to suppress logical error rates below the physical error rates, our realization of fault-tolerant protocols on the logical-qubit level is a key step towards quantum information processing based on solid-state spins.
Spin qubits in silicon are strong contenders for the realization of a practical quantum computer, having demonstrated single- and two-qubit gates with fidelities above the fault-tolerant threshold, and entanglement of three qubits. However, maintaining high-fidelity operations while increasing the qubit count remains challenging and therefore only two-qubit algorithms have been executed. Here we utilize a four-qubit silicon processor with all control fidelities above the fault-tolerant threshold and demonstrate a three-qubit Grover's search algorithm with a ~95% probability of finding the marked state. Our processor is made of three phosphorus atoms precision-patterned into isotopically pure silicon, which localise one electron. The long coherence times of the qubits enable single-qubit fidelities above 99.9% for all qubits. Moreover, the efficient single-pulse multi-qubit operations enabled by the electron-nuclear hyperfine interaction facilitate controlled-Z gates between all pairs of nuclear spins with fidelities above 99% when using the electron as an ancilla. These control fidelities, combined with high-fidelity non-demolition readout of all nuclear spins, allow the creation of a three-qubit Greenberger-Horne-Zeilinger state with 96.2% fidelity. Looking ahead, coupling neighbouring nuclear spin registers, as the one shown here, via electron-electron exchange may enable larger, fault-tolerant quantum processors.
Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.