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:2206.00563 · Quantum Science and Technology

Simulating Majorana zero modes on a noisy quantum processor

Kevin J. Sung, Marko J. Rančić, Olivia Lanes, Nicholas T. Bronn

Published Jan 31, 2023• 13 citations
arXivHTMLPDF

Abstract

Abstract The simulation of systems of interacting fermions is one of the most anticipated applications of quantum computers. The most interesting simulations will require a fault-tolerant quantum computer, and building such a device remains a long-term goal. However, the capabilities of existing noisy quantum processors have steadily improved, sparking an interest in running simulations that, while not necessarily classically intractable, may serve as device benchmarks and help elucidate the challenges to achieving practical applications on near-term devices. Systems of non -interacting fermions are ideally suited to serve these purposes. While they display rich physics and generate highly entangled states when simulated on a quantum processor, their classical tractability enables experimental results to be verified even at large system sizes that would typically defy classical simulation. In this work, we use a noisy superconducting quantum processor to prepare Majorana zero modes (MZMs) as eigenstates of the Kitaev chain Hamiltonian, a model of non-interacting fermions. Our work builds on previous experiments with non-interacting fermionic systems. Previous work demonstrated error mitigation techniques applicable to the special case of Slater determinants. Here, we show how to extend these techniques to the case of general fermionic Gaussian states, and demonstrate them by preparing MZMs on systems of up to seven qubits.

DOI
10.1088/2058-9565/acb796

Related papers

Exactly solving the Kitaev chain and generating Majorana-zero-modes out of noisy qubits

Marko J. Rančić

Majorana-zero-modes (MZMs) were predicted to exist as edge states of a physical system called the Kitaev chain. MZMs should host particles that are their own antiparticles and could be used as a basis for a qubit which is robust-to-noise. However, all attempts to prove their existence gave inconclusive results. Here, the Kitaev chain is exactly solved with a quantum computing methodology and properties of MZMs are probed by generating eigenstates of the Kitev Hamiltonian on 3 noisy qubits of a publicly available quantum computer. After an ontological elaboration I show that two eigenstates of the Kitaev Hamiltonian exhibit eight signatures attributed to MZMs. The results presented here are a most comprehensive set of validations of MZMs ever conducted in an actual physical system. Furthermore, the findings of this manuscript are easily reproducible for any user of publicly available quantum computers, solving another important problem of research with MZMs-the result reproducibility crisis.

arXiv:2108.07235•Scientific Reports•Nov 18, 2022•13 citations

Resource-Efficient Emulation of Majorana Zero Mode Braiding on a Superconducting Trijunction

Rahul Singh, Weixin Lu, Kaelyn J Ferris +1 more

Topological superconductivity could host quasiparticles that are key candidates for fault-tolerant quantum computation due to their immunity to noise as they obey non-Abelian exchange statistics. For example, in the case of Majorana Zero Modes (MZM), braiding enables two topologically protected quantum gates. While their direct manipulation in solid-state systems remains experimentally challenging, digital emulation of MZM behavior has provided insight as well as a deeper understanding of controlling these topological quantum systems. This emulation is typically accomplished by mapping the topological and trivial phases of a Majorana system to ferromagnetic and paramagnetic Hamiltonians of a spin-glass model. This approach usually relies on adiabatic evolution of superconducting Hamiltonians, which require circuits with very large depths. In this work, we present a resource-efficient method to emulate MZM braiding in a trijunction geometry using a quantum processor. We introduce direct braiding operators which simulate the evolution more efficiently, reducing the quantum gate overhead. We then further generalize this method to emulate braiding operations in extended trijunction architectures based on Kitaev chains.

quant-pharXiv:2603.03645•IEEE Transactions on Quantum Engineering•Mar 5, 2026•0 citations

Practical Tests and Witnesses of Fermionic non-Gaussianity

Tobias Haug, Xhek Turkeshi, Piotr Sierant

Fermionic Gaussian states describe free fermions and underlie the mean-field picture of matter, from metals to superconductors; they are also efficiently simulable on classical computers. Departures from Gaussianity -- the correlations produced by interactions -- are therefore what make a fermionic system hard to simulate classically and useful for quantum computation, analogous to the role of magic in stabilizer-based quantum computation. Yet detecting and quantifying such non-Gaussianity at scale has remained challenging. Here we introduce practical tests and witnesses of fermionic non-Gaussianity built on fermionic antiflatness, a measure derived from the two-point covariance matrix. We estimate it with two protocols -- a two-copy Bell measurement and a single-copy scheme using commuting Majorana bilinears -- that determine whether a state is Gaussian or far from it at lower measurement cost than existing approaches, using only operations native to fault-tolerant hardware. For mixed states, a purity-corrected witness certifies non-Gaussianity and remains robust under strong noise; running it on the IQM quantum processor, we find that noise can both reduce and enhance non-Gaussianity. Finally, we show that preparing pseudorandom fermionic states requires extensive non-Gaussianity. Together, these tools enable the study and certification of non-Gaussian fermionic resources on present-day quantum devices.

quant-pharXiv:2605.26218•May 27, 2026•24 citations

Frustration-free Hamiltonians supporting Majorana zero edge modes

Sania Jevtic, Ryan Barnett

A one-dimensional fermionic system, such as a superconducting wire, may host Majorana zero-energy edge modes (MZMs) at its edges when it is in the topological phase. MZMs provide a path to realising fault-tolerant quantum computation, and so are the focus of intense experimental and theoretical studies. However, given a Hamiltonian, determining whether MZMs exist is a daunting task as it relies on knowing the spectral properties of the Hamiltonian in the thermodynamic limit. The Kitaev chain is a paradigmatic non-interacting model that supports MZMs and the Hamiltonian can be fully diagonalised. However, for interacting models, the situation is far more complex. Here we consider a different classification of models, namely, ones with frustration-free Hamiltonians. Within this class of models, interacting and non-interacting systems are treated on an equal footing, and we identify exactly which Hamiltonians can realise MZMs.

arXiv:1704.09017•New Journal of Physics•Oct 27, 2017•11 citations

Emulating Quantum Teleportation of a Majorana Zero Mode Qubit

He-Liang Huang, Marek Narożniak, Futian Liang +14 more

Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase-flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from 70.76±0.35% to 84.60±0.11%, well beyond the classical bound in either case.

arXiv:2009.07590•Physical Review Letters•Mar 3, 2021•51 citations

Simulated non-Abelian statistics of Majorana zero modes from a Kitaev lattice

Foster Sabatino, Matthew Brooks, Charles Tahan +1 more

We simulate the non-Abelian exchange of Majorana zero modes (MZMs) on a quantum computer. Rather than utilizing MZMs at the boundaries of quantum Ising chains, which are typically represented as nonlocal operators on a quantum computer, using a Kitaev lattice allows us to exploit a local representation of MZMs. We detail the protocol for braiding two and four MZMs in terms of a spin Hamiltonian, i.e. physical qubit Hamiltonian. Projecting this onto a subspace of states, we extract an effective Hamiltonian which drives a non-Abelian Berry phase. Using several approximations, we construct a set of gates which mimics this accumulation of non-Abelian phase and process this construction on a quantum computer. For two and four MZMs, we realize braiding fidelities of approximately 85 and 47%, respectively.

arXiv:2503.15405•Physical review. B./Physical review. B•Jul 28, 2025•2 citations
Abstract The simulation of systems of interacting fermions is one of the most anticipated applications of quantum computers. The most interesting simulations will require a fault-tolerant quantum computer, and building such a device remains a long-term goal. However, the capabilities of existing noisy quantum processors have steadily improved, sparking an interest in running simulations that, while not necessarily classically intractable, may serve as device benchmarks and help elucidate the challenges to achieving practical applications on near-term devices. Systems of non -interacting fermions are ideally suited to serve these purposes. While they display rich physics and generate highly entangled states when simulated on a quantum processor, their classical tractability enables experimental results to be verified even at large system sizes that would typically defy classical simulation. In this work, we use a noisy superconducting quantum processor to prepare Majorana zero modes (MZMs) as eigenstates of the Kitaev chain Hamiltonian, a model of non-interacting fermions. Our work builds on previous experiments with non-interacting fermionic systems. Previous work demonstrated error mitigation techniques applicable to the special case of Slater determinants. Here, we show how to extend these techniques to the case of general fermionic Gaussian states, and demonstrate them by preparing MZMs on systems of up to seven qubits.
Majorana-zero-modes (MZMs) were predicted to exist as edge states of a physical system called the Kitaev chain. MZMs should host particles that are their own antiparticles and could be used as a basis for a qubit which is robust-to-noise. However, all attempts to prove their existence gave inconclusive results. Here, the Kitaev chain is exactly solved with a quantum computing methodology and properties of MZMs are probed by generating eigenstates of the Kitev Hamiltonian on 3 noisy qubits of a publicly available quantum computer. After an ontological elaboration I show that two eigenstates of the Kitaev Hamiltonian exhibit eight signatures attributed to MZMs. The results presented here are a most comprehensive set of validations of MZMs ever conducted in an actual physical system. Furthermore, the findings of this manuscript are easily reproducible for any user of publicly available quantum computers, solving another important problem of research with MZMs-the result reproducibility crisis.
Topological superconductivity could host quasiparticles that are key candidates for fault-tolerant quantum computation due to their immunity to noise as they obey non-Abelian exchange statistics. For example, in the case of Majorana Zero Modes (MZM), braiding enables two topologically protected quantum gates. While their direct manipulation in solid-state systems remains experimentally challenging, digital emulation of MZM behavior has provided insight as well as a deeper understanding of controlling these topological quantum systems. This emulation is typically accomplished by mapping the topological and trivial phases of a Majorana system to ferromagnetic and paramagnetic Hamiltonians of a spin-glass model. This approach usually relies on adiabatic evolution of superconducting Hamiltonians, which require circuits with very large depths. In this work, we present a resource-efficient method to emulate MZM braiding in a trijunction geometry using a quantum processor. We introduce direct braiding operators which simulate the evolution more efficiently, reducing the quantum gate overhead. We then further generalize this method to emulate braiding operations in extended trijunction architectures based on Kitaev chains.
Fermionic Gaussian states describe free fermions and underlie the mean-field picture of matter, from metals to superconductors; they are also efficiently simulable on classical computers. Departures from Gaussianity -- the correlations produced by interactions -- are therefore what make a fermionic system hard to simulate classically and useful for quantum computation, analogous to the role of magic in stabilizer-based quantum computation. Yet detecting and quantifying such non-Gaussianity at scale has remained challenging. Here we introduce practical tests and witnesses of fermionic non-Gaussianity built on fermionic antiflatness, a measure derived from the two-point covariance matrix. We estimate it with two protocols -- a two-copy Bell measurement and a single-copy scheme using commuting Majorana bilinears -- that determine whether a state is Gaussian or far from it at lower measurement cost than existing approaches, using only operations native to fault-tolerant hardware. For mixed states, a purity-corrected witness certifies non-Gaussianity and remains robust under strong noise; running it on the IQM quantum processor, we find that noise can both reduce and enhance non-Gaussianity. Finally, we show that preparing pseudorandom fermionic states requires extensive non-Gaussianity. Together, these tools enable the study and certification of non-Gaussian fermionic resources on present-day quantum devices.
A one-dimensional fermionic system, such as a superconducting wire, may host Majorana zero-energy edge modes (MZMs) at its edges when it is in the topological phase. MZMs provide a path to realising fault-tolerant quantum computation, and so are the focus of intense experimental and theoretical studies. However, given a Hamiltonian, determining whether MZMs exist is a daunting task as it relies on knowing the spectral properties of the Hamiltonian in the thermodynamic limit. The Kitaev chain is a paradigmatic non-interacting model that supports MZMs and the Hamiltonian can be fully diagonalised. However, for interacting models, the situation is far more complex. Here we consider a different classification of models, namely, ones with frustration-free Hamiltonians. Within this class of models, interacting and non-interacting systems are treated on an equal footing, and we identify exactly which Hamiltonians can realise MZMs.
Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase-flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from 70.76±0.35% to 84.60±0.11%, well beyond the classical bound in either case.
We simulate the non-Abelian exchange of Majorana zero modes (MZMs) on a quantum computer. Rather than utilizing MZMs at the boundaries of quantum Ising chains, which are typically represented as nonlocal operators on a quantum computer, using a Kitaev lattice allows us to exploit a local representation of MZMs. We detail the protocol for braiding two and four MZMs in terms of a spin Hamiltonian, i.e. physical qubit Hamiltonian. Projecting this onto a subspace of states, we extract an effective Hamiltonian which drives a non-Abelian Berry phase. Using several approximations, we construct a set of gates which mimics this accumulation of non-Abelian phase and process this construction on a quantum computer. For two and four MZMs, we realize braiding fidelities of approximately 85 and 47%, respectively.