Majorana braiding simulations with projective measurements

• URL: http://arxiv.org/abs/2508.10106v1
• Date: Wed, 13 Aug 2025 18:03:42 GMT
• Title: Majorana braiding simulations with projective measurements
• Abstract summary: We summarize the key ingredients required for universal topological quantum computation using Majorana zero modes in networks of topological superconductor nanowires.<n> Particular emphasis is placed on the use of both sparse and dense logical qubit encodings, and on the transitions between them via projective parity measurements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We summarize the key ingredients required for universal topological quantum computation using Majorana zero modes in networks of topological superconductor nanowires. Particular emphasis is placed on the use of both sparse and dense logical qubit encodings, and on the transitions between them via projective parity measurements. Combined with hybridization, these operations extend the computational capabilities beyond braiding alone and enable universal gate sets. In addition to outlining the theoretical foundations-including the algebra of Majorana operators, along with the stabilizer formalism-we introduce an efficient numerical method for simulating the time-dependent dynamics of such systems. This method, based on the time dependent Pfaffian formalism, allows for the classical simulation of realistic device architectures that incorporate braiding, projective measurements, and disorder. The result is a semi-pedagogical overview and computational toolbox designed to support further exploration of topological quantum computing platforms.

Related papers

• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers [2.5315729179239637]
  We present a quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions.<n>We develop a hardware-efficient Trotterization whose per-step circuit depth scales with fermion flavor number rather than total system size.<n>A central contribution of this work is the Localized Diagonal Operator Approximation (LDOA), which systematically reduces the overhead associated with quartic interactions.
  arXiv  Detail & Related papers  (2026-05-06T21:57:51Z)
• Finite-Time Braiding Dynamics within Topological Nanowire Qubits [0.0]
  We extend what is known in the adiabatic regime, providing time-dependent gate elements for further qubit and algorithm modeling efforts.<n>These contributions provide insight for realistic experimental setups in the next-generation of qubit implementation.
  arXiv  Detail & Related papers  (2026-03-14T18:09:19Z)
• Exploring polymer classification with a hybrid single-photon quantum approach [45.88028371034407]
  We present a hybrid classical-quantum formalism that couples a classical deep neural network for polymer featurization with a single-photon-based quantum classifier.<n>This pipeline successfully classifies polymer species by their optical gap, with performance in line with CPU-based noisy simulations and a proof-of-principle run on Quandela's Ascella quantum processor.
  arXiv  Detail & Related papers  (2025-12-19T23:06:38Z)
• Polyhedral Classical Simulators for Quantum Computation [0.0]
  We introduce polyhedral classical simulators, a framework for classical simulation grounded in polyhedral geometry.<n>We show how this framework unifies and extends existing simu- lation methods while at the same time providing a geometric roadmap for pushing the boundary of efficient classical simulation further.
  arXiv  Detail & Related papers  (2025-10-08T20:55:55Z)
• End-to-End Complexity Analysis for Quantum Simulation of the Extended Jaynes-Cummings Models [2.5789509846010574]
  We present an end-to-end framework for the quantum simulation of the Jaynes-Cummings model (eJCM)<n>We develop explicit quantum algorithms and circuits for simulating the system's time evolution.<n>This work establishes a complete roadmap for simulating the eJCM on future quantum computers.
  arXiv  Detail & Related papers  (2025-09-16T21:23:53Z)
• Fast simulation of fermions with reconfigurable qubits [0.43553942673960666]
  We present a method for faster fermionic simulation with space-time overhead of O(log(N)) in the worst case.<n>This exponential reduction is achieved by using reconfigurable quantum systems with non-local connectivity.<n>We show that the algorithms themselves can be adapted to use only the O(1)-overhead structures.
  arXiv  Detail & Related papers  (2025-09-10T18:01:02Z)
• Explicit Pfaffian Formula for Amplitudes of Fermionic Gaussian Pure States in Arbitrary Pauli Bases [0.0]
  Explicit computation of amplitudes for fermionic Gaussian pure states in arbitrary Pauli bases is a long-standing challenge in quantum many-body physics.<n>We present an explicit Pfaffian formula for determining these amplitudes in arbitrary Pauli bases, utilizing a matrix whose structure reflects the qubit parity.
  arXiv  Detail & Related papers  (2025-02-07T11:47:44Z)
• GausSim: Foreseeing Reality by Gaussian Simulator for Elastic Objects [55.02281855589641]
  GausSim is a novel neural network-based simulator designed to capture the dynamic behaviors of real-world elastic objects represented through Gaussian kernels.<n>We leverage continuum mechanics and treat each kernel as a Center of Mass System (CMS) that represents continuous piece of matter.<n>In addition, GausSim incorporates explicit physics constraints, such as mass and momentum conservation, ensuring interpretable results and robust, physically plausible simulations.
  arXiv  Detail & Related papers  (2024-12-23T18:58:17Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators [2.3388423124918387]
  Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry. We show that previous theoretical approaches to analogue quantum simulation suffer from fundamental barriers which prohibit scalable experimental implementation.
  arXiv  Detail & Related papers  (2023-06-23T18:57:57Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)

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.