Braided Majorana qubits as a minimal setting for Topological Quantum Computation?

• URL: http://arxiv.org/abs/2504.02125v1
• Date: Wed, 02 Apr 2025 21:00:46 GMT
• Title: Braided Majorana qubits as a minimal setting for Topological Quantum Computation?
• Authors: Francesco Toppan,
• Abstract summary: Majorana qubits implement a Gentile-type parastatistics with at most $s-1$ excited states accommodated in a multiparticle sector.<n>It is argued that braided Majorana qubits could play, for topological quantum computers, the same role as standard bits for ordinary computers and as qubits for "ordinary" quantum computers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: I point out that a possible minimal setting to realize Kitaev's proposal of a Topological Quantum Computation which offers topological protection from decoherence could in principle be realized by braided Majorana qubits. Majorana qubits and their braiding were introduced in Nucl. Phys. B 980, 115834 (2022) and further analyzed in J. Phys. A: Math. Theor. 57, 435203 (2024). Braided Majorana qubits implement a Gentile-type parastatistics with at most $s-1$ excited states accommodated in a multiparticle sector (the integer $s=2,3,4,\ldots$ labels quantum group reps at roots of unity). It is argued that braided Majorana qubits could play, for topological quantum computers, the same role as standard bits for ordinary computers and as qubits for "ordinary" quantum computers.

Related papers

• Universal quantum computation using Ising anyons from a non-semisimple Topological Quantum Field Theory [0.058331173224054456]
  We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2+1 dimensions. We show that the non-semisimple theory introduces new anyon types that extend the Ising framework.
  arXiv  Detail & Related papers  (2024-10-18T21:03:07Z)
• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography.<n> cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP)<n>Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• More quantum chemistry with fewer qubits [0.9903198600681908]
  We propose a quantum algorithm that improves on the representation of the physical problem by virtue of second-order perturbation theory. In particular, our quantum algorithm evaluates the second-order energy correction through a series of time-evolution steps under the unperturbed Hamiltonian. Our perturbation theory quantum algorithm can also be applied to symmetry-adapted perturbation theory.
  arXiv  Detail & Related papers  (2023-08-31T17:21:17Z)
• Fundamental causal bounds of quantum random access memories [13.19534468575575]
  We study the intrinsic bounds of rapid quantum memories based on causality. We show that QRAM can accommodate up to $mathcalO(107)$ logical qubits in 1 dimension, $mathcalO(1015)$ to $mathcalO(1020)$ in various 2D architectures, and $mathcalO(1024)$ in 3 dimensions.
  arXiv  Detail & Related papers  (2023-07-25T12:40:48Z)
• Systematic construction of topological-nontopological hybrid universal quantum gates based on many-body Majorana fermion interactions [0.0]
  Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. We make a systematic construction of the C$n$Z gate, C$n$NOT gate and the C$n$SWAP gate.
  arXiv  Detail & Related papers  (2023-04-13T04:41:29Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum algorithms for estimating quantum entropies [6.211541620389987]
  We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state. We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
  arXiv  Detail & Related papers  (2022-03-04T15:44:24Z)
• Probing Topological Spin Liquids on a Programmable Quantum Simulator [40.96261204117952]
  We use a 219-atom programmable quantum simulator to probe quantum spin liquid states. In our approach, arrays of atoms are placed on the links of a kagome lattice and evolution under Rydberg blockade creates frustrated quantum states. The onset of a quantum spin liquid phase of the paradigmatic toric code type is detected by evaluating topological string operators.
  arXiv  Detail & Related papers  (2021-04-09T00:18:12Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Quantum supremacy in driven quantum many-body systems [0.0]
  We show that quantum supremacy can be obtained in generic periodically-driven quantum many-body systems. Our proposal opens the way for a large class of quantum platforms to demonstrate and benchmark quantum supremacy.
  arXiv  Detail & Related papers  (2020-02-27T07:20:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.