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.
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.
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.
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.
A quantum computer based on Majorana qubits would contain a large number of zero-energy Majorana states. This system can be modelled as a connected network of the Ising-Kitaev chains alternating the "trivial" and "topological" regions, with the zero-energy Majorana fermions localized at their interfaces. The low-energy sector of the theory describing such a network can be formulated in terms of leading-order couplings between the Majorana zero modes. I consider a minimal model exhibiting effective couplings between four Majorana zero modes - the nonuniform Ising-Kitaev chain, containing two "topological" regions separated by a "trivial" region. Solving the model exactly, I show that for generic values of the model parameters the four zero modes are localized at the four interface points of the chain. In the special case where additional inversion symmetry is present, the Majorana zero modes are "delocalized" between two interface points. In both cases, the low-energy sector of the theory can be formulated in terms of the localized Majorana fermions, but the couplings between some of them are independent of their respective separations: the exact solution does not support the "nearest-neighbor" form of the effective low-energy Hamiltonian.
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.
Many topological or critical aspects of the Kitaev chain are well known, with several classic results. In contrast, the study of the critical behavior of the strong Majorana zero modes (MZM) has been overlooked. Here we introduce two topological markers which, surprisingly, exhibit non-trivial signatures over the entire (1+1) Ising critical line. We first analytically compute the MZM fidelity FMZM--a measure of the MZM mapping between parity sectors. It takes a universal value along the (1+1) Ising critical line, FMZM=8/π, independent of the energy. We also obtain an exact analytical result for the critical MZM occupation number NMZM which depends on the Catalan's constant G≈0.91596559, for both the ground-state (NMZM=1/2−4G/π2≈0.12877) and the first excited state (NMZM=1/2+(8−4G)/π2≈0.93934). We further compute finite-size corrections which identically vanish for the special ratio Δ/t=2−1 between pairing and hopping in the critical Kitaev chain.
FINDING: Majorana zero modes (MZMs) in topological superconductors yield non-Abelian anyonic statistics, enabling topologically protected quantum error correction via ground-state degeneracy in the Kitaev chain. | MATH: Kitaev chain Hamiltonian H=∑j[−t(cj†cj+1+h.c.)+Δ(cjcj+1+h.c.)−μ(cj†cj−1/2)]. In the topological phase (∣μ∣<2t), unpaired Majorana operators γ1,γ2 satisfy γi†=γi, {γi,γj}=2δij, and the nonlocal fermion f=(γ1+iγ2)/2 gives a two-fold ground-state degeneracy (qubit). Braiding MZMs implements the Clifford group; the fusion rules follow the Ising anyon model: σ×σ=1+ψ, with quantum dimension dσ=2. | CONNECTION: The Ising anyon fusion rule σ×σ=1+ψ maps directly to the golden-ratio-adjacent structure of the Fibonacci anyon model (though MZMs are Ising, Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com