Topological Quantum Computing: Microsoft Majorana Qubits & Error Protection
Topological quantum computing news: Microsoft Azure Quantum, Majorana fermions, topological qubits. Intrinsic error protection research.
Topological quantum computing represents the most ambitious approach to fault-tolerant quantum computation, encoding information in global topological properties of quantum systems rather than individual particles. This intrinsic error protection theoretically enables quantum computing with hardware error rates orders of magnitude higher than conventional qubits require.
Microsoft Azure Quantum leads development through its Station Q research division, pursuing topological qubits based on Majorana zero modes—quasiparticles that are their own antiparticles and exist at the boundaries of topological superconductors. When braided, Majorana modes perform quantum gates that depend only on the braiding topology, not local perturbations.
India's Topological Quantum Research
India's theoretical physics community contributes to topological quantum computing research through institutions including the Tata Institute of Fundamental Research (TIFR) Mumbai, Indian Institute of Science (IISc) Bengaluru, and the International Centre for Theoretical Sciences (ICTS) Bengaluru. Research focuses on topological phases of matter, anyonic statistics, and quantum information theory foundations. The National Quantum Mission does not currently prioritize topological qubit hardware development, focusing instead on superconducting, photonic, and neutral atom platforms with nearer-term viability.
Key Advantages
Key advantages include intrinsic topological protection eliminating need for active quantum error correction overhead, hardware error tolerance potentially 1,000x higher than other qubit types, and stable quantum information storage. Current challenges include experimental verification of Majorana modes remaining contentious, requirements for exotic materials at millikelvin temperatures, and no confirmed demonstration of topological qubit operation.
Recent Progress
Recent progress includes new generation experiments using improved hybrid semiconductor-superconductor devices (InAs/Al, InSb/Al heterostructures) reporting more robust Majorana signatures. Microsoft continues significant investment despite delays.
quantum-computingPrediction: Rigetti Computing Stock Will Be Worth This Much in 1 Year
Quantum computers are an incredible innovation. They use a concept called superposition to simulate several different solutions to a given problem at once, so they're more efficient than traditional computers at processing specific workloads, particularly in areas like science and cryptography. Rigetti Computing (RGTI 3.79%) has built some of the industry's most capable quantum computers, but they still produce relatively high error rates, making them impractical for solving many real-world problems. As a result, the company is struggling to generate meaningful revenue. Rigetti stock has plummeted 61% from last year's record high; here's where I predict it could be in 12 months. Image source: Getty Images. Rigetti's most powerful computer is now widely available Rigetti is unique because it built an entire in-house supply chain for its quantum computing business. It operates a fabrication facility, it created its own programming language called Quil, and it even launched its own cloud platform where it leases quantum computing capacity to enterprises for a fee. Therefore, Rigetti can bring new computers to market and commercialize them much faster than its competitors. During the first quarter of 2026, the company made its flagship Cepheus-1-108Q system widely available through its own cloud platform, but also through third-party platforms including Amazon Braket and Microsoft Azure Quantum, giving it unprecedented reach. ExpandNASDAQ: RGTIRigetti ComputingToday's Change(-3.79%) $-0.63Current Price$15.99Key Data PointsMarket Cap$5.5BDay's Range$15.46 - $16.7652wk Range$10.30 - $58.15Volume578KAvg Vol29MGross Margin-5945.49% Cepheus-1-108Q is the industry's largest multichip quantum computer. It features 108 qubits, so it offers 3 times the scale of Rigetti's previous Cepheus-1-36Q system. It also boasts a single-qubit gate fidelity of 99.9%, which means it only makes one error in every 1,000 quantum operations. That error rate still makes Cepheus-1-108Q impractical
The Motley FoolLoading...0
quantum-computingHow seriously should we be taking topological and neuromorphic approaches to quantum computing?
I've been reading up on alternative paradigms beyond standard gate-based quantum computing — specifically topological quantum computing and neuromorphic quantum architectures. The argument is that as quantum hardware matures, these approaches could offer real structural advantages in error correction and scalability rather than just being theoretical curiosities. Topological qubits encoding information in global properties rather than local states is compelling from an error-resilience standpoint, and the idea of merging quantum mechanics with brain-inspired adaptive architectures feels like it could open up entirely different classes of problems. Curious what this community thinks. Are these paradigms getting overhyped relative to where the actual hardware is? Or are we underestimating how quickly they could become practical? This article covers it well for anyone interested: https://medium.com/@monendra.grover/beyond-qubits-the-rise-of-topological-and-neuromorphic-quantum-machines-5736fe79da4a submitted by /u/Equal_Winter3150 [link] [comments]
Reddit r/QuantumComputing (RSS)Loading...0
quantum-computingPurdue University Launches Comprehensive Quantum Degrees Program
Purdue University Launches Comprehensive Quantum Degrees Program Purdue University has announced the launch of a multi-tiered Quantum Degrees Program, a collaborative initiative between the College of Engineering and the College of Science. The program is designed to address a critical bottleneck in the “Quantum Prairie” ecosystem: the need for a scalable, technically proficient workforce. With regional job growth in quantum technology projected to increase by 550% between 2030 and 2035, Purdue’s curriculum spans undergraduate, graduate, and professional levels to provide “quantum literacy” at scale. Multi-Level Curricular Offerings The program features several entry points tailored to different academic and professional backgrounds, combining theoretical physics with applied engineering: Undergraduate: A joint Quantum Information Science and Technology Certificate, a specialized Quantum Technology concentration for Electrical Engineering, and a Quantum Science minor. Graduate: Residential and Online Master of Science degrees in Quantum, along with specialized PhD concentrations in Quantum Interdisciplinary Studies and Electrical and Computer Engineering. Professional Development: A MicroMasters in Quantum Technology focused on computing and sensing, designed for working professionals seeking to pivot into the quantum industry. Strategic Infrastructure and Partnerships The program leverages Purdue’s existing leadership in quantum research and its status as a top-20 university for quantum computing. Central to the training environment is the Purdue Quantum Science and Engineering Institute (PQSEI), which hosts over 65 faculty members. Students will have access to the Birck Nanotechnology Center and the Microsoft Quantum Lab, West Lafayette, where Microsoft employees work alongside Purdue faculty on next-generation hardware. Furthermore, Purdue serves as the lead institution for the NSF-backed Center for Quantum Technologies and is a key member of the Chicago Quantum
Quantum Computing ReportLoading...0
quantum-computingNew quantum algorithm solves “impossible” materials problem in seconds
Science News from research organizations New quantum algorithm solves “impossible” materials problem in seconds Date: May 13, 2026 Source: Aalto University Summary: A new quantum-inspired algorithm has cracked a problem so massive that conventional supercomputers struggle to even approach it. Researchers used the method to simulate extraordinarily complex quantum materials known as quasicrystals, opening the door to powerful new quantum devices and ultra-efficient electronics. The work could help scientists design advanced topological qubits and materials for future quantum computers. Share: Facebook Twitter Pinterest LinkedIN Email FULL STORY Tensor networks can represent functions on ultra-fine grids, which makes them a promising technique for calculating massive quantum materials. Credit: Jose Lado/Aalto University Quantum computers and other advanced quantum technologies rely on specialized quantum materials that behave in unusual ways under the right conditions. In some cases, scientists can even create entirely new quantum properties by carefully changing a material's structure. One striking example involves stacking sheets of graphene and twisting them into a moiré pattern, which can suddenly turn the material into a superconductor. Researchers can arrange these layers into even more complicated structures, including quasicrystals and super-moiré materials. But predicting how these exotic materials will behave is extraordinarily difficult. Quasicrystals are so mathematically complex that simulating them can involve more than a quadrillion numbers, a scale far beyond the reach of today's most powerful supercomputers. Quantum Algorithm Solves Massive Materials Problem Scientists at Aalto University's Department of Applied Physics have now developed a quantum-inspired algorithm capable of handling these enormous non-periodic quantum materials almost instantly. Assistant Professor Jose Lado says the work also highlights a promising feedback cycle within quantum t
Science Daily QuantumLoading...0
quantum-computingPhysicists discover quantum particles that break the rules of reality
Science News from research organizations Physicists discover quantum particles that break the rules of reality Discovery could pave the way for entirely new quantum experiments and deepen our understanding of the rules that govern reality itself. Date: May 9, 2026 Source: Okinawa Institute of Science and Technology (OIST) Graduate University Summary: Physicists may have just cracked open a hidden side of the quantum world. For decades, every known particle was thought to belong to one of two categories — bosons or fermions — but researchers have now shown that bizarre “in-between” particles called anyons could also exist in a one-dimensional system. Even more exciting, these strange particles may be adjustable, allowing scientists to tune their behavior in ways never before possible. Share: Facebook Twitter Pinterest LinkedIN Email FULL STORY Scientists may have uncovered a new class of tunable quantum particles that break the universe’s long-standing boson-versus-fermion rule. Credit: AI/ScienceDaily.com Physicists have traditionally sorted all elementary particles in our three-dimensional universe into two categories: bosons and fermions. Bosons mostly include particles that carry forces, such as photons, while fermions make up ordinary matter, including electrons, protons, and neutrons. That simple division starts to break down in lower dimensional systems. Since the 1970s, scientists have predicted the existence of a third type of particle known as an anyon, which falls somewhere between a boson and a fermion. In 2020, researchers experimentally observed these unusual particles at the boundary of supercooled, strongly magnetized, one-atom thick (that is, two-dimensional) semiconductors. Now, scientists from the Okinawa Institute of Science and Technology (OIST) and the University of Oklahoma have pushed the idea further. In two papers published in Physical Review A, the team identified a one-dimensional system capable of supporting anyons and investigated the pa
ScienceDaily – Quantum ComputingLoading...0
quantum-computingTop Quantum Software Companies By Layer
Top quantum software companies in 2026 organised by stack layer: SDKs and frameworks, cloud platforms, compilers and middleware, algorithm libraries, and specialty platforms. Software is the layer where the quantum-computing industry generates revenue today, ahead of fault-tolerant hardware. Reference data sourced from the top quantum software companies and quantum-vendor directory at Entangled Future and updated quarterly. Key takeaways The four canonical SDKs are Qiskit (IBM), Cirq (Google), PennyLane (Xanadu), and tket (Quantinuum). Each is the canonical compilation layer for its parent hardware company. Three cloud platforms aggregate the bulk of commercial quantum-hardware access: IBM Quantum Platform, AWS Amazon Braket, and Microsoft Azure Quantum. Compilers, middleware, and control are the next-most-funded category. Classiq ($200M+), Quantum Machines ($280M+), Riverlane ($195M+), and Q-CTRL ($190M+) lead by capital raised. Application software is consolidating around chemistry (Algorithmiq, Phasecraft, Quantistry), finance (Multiverse, QC Ware), and materials science. Multi-vendor abstraction layers like Strangeworks let enterprises mix hardware providers without committing to a single stack. SDKs and Frameworks SDK Open-source quantum software development kits and frameworks. Each entry below is identified by its package name and the language ecosystem it targets, not by its parent company. The packages cover circuit construction, simulation, hardware execution, and domain libraries for chemistry, finance, machine learning, and optimisation. Packages and features: qiskit (core), qiskit-aer (simulator), qiskit-ibm-runtime (cloud), qiskit-optimization, qiskit-machine-learning, qiskit-nature, qiskit-finance. OpenQASM 3.0 compatible. C API for HPC since 2.3. Latest: January 2026: Qiskit 2.3 released with expanded C API and 83x faster transpilation than tket 2.6.0. The most-installed quantum SDK, the de facto teaching tool in university quantum-computing courses,
Quantum ZeitgeistLoading...0
quantum-computing3 Surprising Quantum Computing Stocks Robinhood Investors Love
By Chris Neiger – May 3, 2026 at 9:13PM ESTKey PointsNvidia's new Ising AI models will drastically reduce the error rates of quantum computers.Alphabet's Willow processor and advanced algorithms are causing big leaps in quantum computing capabilities.Microsoft's Majorana 1 processor and Azure Quantum put the company at the forefront of quantum computing services.Quantum computing is moving closer to real-world applications, and the pace of technological development -- and the excitement around its possibilities -- has pushed quantum computing stocks to the forefront of many investors' minds. And the payoff for companies getting in on the ground floor of this technology now could be huge. McKinsey estimates that the quantum computing market could be worth $100 billion by 2035. A quick peek at the top 10 most popular stocks on Robinhood reveals three tech companies already making big waves in quantum computing: Nvidia (NVDA 0.48%), Alphabet (GOOGL +0.20%) (GOOG +0.34%), and Microsoft (MSFT +1.62%). Here's why these tech stocks could be the surprise winners in the quantum computing market. Image source: Getty Images. Nvidia has the biggest quantum computing potential Nvidia recently made some big news when it announced a collection of open-source artificial intelligence (AI) models, called Ising, that help calibrate quantum computing processors. The company says that Ising results in decoding that is up to 2.5 times faster and 3 times more accurate than traditional methods. That's a big deal because one of the biggest hurdles to the real-world applications of quantum computers is that they make many errors. With Ising, Nvidia is preparing for a world where hybrid computing -- a mixture of traditional computers and quantum computers -- solves big problems. IBM recently said hybrid computers using central processing units (CPUs), graphics processing units (GPUs), and quantum processing units (QPUs) "unlock performance and accuracy beyond what any one of them can achieve
The Motley FoolLoading...0
quantum-computingNon-Local Magic Resources for Fermionic Gaussian States
--> Quantum Physics arXiv:2604.27049 (quant-ph) [Submitted on 29 Apr 2026] Title:Non-Local Magic Resources for Fermionic Gaussian States Authors:Daniele Iannotti, Beatrice Magni, Riccardo Cioli, Alioscia Hamma, Xhek Turkeshi View a PDF of the paper titled Non-Local Magic Resources for Fermionic Gaussian States, by Daniele Iannotti and 4 other authors View PDF HTML (experimental) Abstract:Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity generally requires a prohibitive minimization over the full Hilbert space, making it computationally inaccessible beyond a few qubits. Here, we overcome this bottleneck by suggesting a closed-form expression for the non-local stabilizer entropies of fermionic Gaussian states over local Gaussian unitaries, which can be evaluated in polynomial time directly from the eigenvalues of the reduced Majorana covariance matrix. We apply this framework to characterize fermionic non-local magic across diverse physical regimes: we derive an exact Page-like curve for typical random states, reveal logarithmic scaling at the quantum critical point of the XY model, and establish a quasiparticle picture for magic generation during out-of-equilibrium quantum quenches. Crucially, because our result relies solely on two-point correlation functions, it provides a scalable route for the experimental estimation of fermionic non-local magic in large-scale quantum processors via fermionic shadow tomography. Comments: Subjects: Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech) Cite as: arXiv:2604.27049 [quant-ph] (or arXiv:2604.27049v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.27049 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Daniele Iannotti [view email] [v1] Wed, 29 Apr 2026 18:00:00 UTC
arXiv Quantum PhysicsLoading...0
quantum-computingResolving spurious topological entanglement entropy in stabilizer codes
--> Quantum Physics arXiv:2604.27053 (quant-ph) [Submitted on 29 Apr 2026] Title:Resolving spurious topological entanglement entropy in stabilizer codes Authors:Peilun Han, Zijian Liang, Yifei Wang, Bowen Yang, Yingfei Gu, Yu-An Chen View a PDF of the paper titled Resolving spurious topological entanglement entropy in stabilizer codes, by Peilun Han and 4 other authors View PDF HTML (experimental) Abstract:Topological entanglement entropy (TEE) is a key diagnostic of long-range entanglement in two-dimensional gapped phases of matter, but it can suffer from spurious contributions that overestimate the total quantum dimension of the underlying topological order. In this work, we identify the microscopic origin of spurious TEE and introduce a concave partition for computing the Levin-Wen TEE of translation-invariant stabilizer codes of prime-dimensional qudits. We rigorously prove that this prescription is free of spurious contributions. As a complementary probe, we study bivariate bicycle codes on a bipartite cylinder and show that the entanglement entropy depends sensitively on the cylinder circumference, revealing topological frustration of the underlying anyons. Comments: Subjects: Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Quantum Algebra (math.QA) Cite as: arXiv:2604.27053 [quant-ph] (or arXiv:2604.27053v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.27053 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Peilun Han [view email] [v1] Wed, 29 Apr 2026 18:00:02 UTC (1,812 KB) Full-text links: Access Paper: View a PDF of the paper titled Resolving spurious topological entanglement entropy in stabilizer codes, by Peilun Han and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2026-04 Change to browse by: cond-mat cond-mat.str-el math math.QA References & Citation
arXiv Quantum PhysicsLoading...0
quantum-computingThe Qubit Report: April 30, 2026
The Qubit Report for April 30, 2026 showcases promising advances in quantum technologies. Researchers demonstrated simple electrical pulse control for quantum behavior and identified fingerprints of chiral superconductivity for robust topological qubits. Industry moves include QuiX Quantum’s photon distillation for scalable room-temperature photonic systems, energy-efficient optical computing servers, and new quantum-secure tools for Bitcoin and enterprise systems. The post The Qubit Report: April 30, 2026 appeared first on The Qubit Report.
The Qubit ReportLoading...0
quantum-computingCompiler Optimisations Reduce Communication Bottlenecks in Quantum Architectures by 20%
A new compilation pipeline addresses key challenges in building practical, fault-tolerant quantum computers, specifically the costly communication between modules and limited resources for generating necessary quantum states. Kun Liu and colleagues at Yale University, investigated modular architectures based on Bivariate Bicycle codes and identified inter-module communication during non-Clifford operations as a primary bottleneck. The pipeline incorporates several optimisations, including synthesising rotations at the factory, transvection-based Clifford deferral, and Clifford insertion, and delivers sharply improved circuit performance across a broad range of benchmarks from PennyLane and MQTBench. Notably, their ‘syn@fac’ optimisation reduced estimated circuit failure probability by a factor of 9.0, suggesting a promising pathway towards more strong and efficient early fault-tolerant quantum computation. Factory-synthesised rotations substantially reduce error rates and improve performance in modular Estimated circuit failure probability dropped by a factor of 9.0 on average across non-Clifford benchmarks, a threshold previously unattainable due to the limitations of inter-module communication in early modular quantum computers. This sharp reduction resulted from ‘syn@fac’, a technique synthesising arbitrary-angle rotations at the factory, and marks an important step towards building more reliable quantum processors. The optimisation centrally produces these complex rotations, minimising the need for error-prone communication between processing units, thereby addressing a primary bottleneck in Bivariate Bicycle code architectures. Bivariate Bicycle codes are a type of topological quantum error correcting code favoured for their relatively low overhead and suitability for modular architectures. These architectures divide the quantum computer into smaller, interconnected modules, each containing a subset of the qubits. Communication between these modules is a signif
Quantum ZeitgeistLoading...0
quantum-computingDisentangling strategies and entanglement transitions in unitary circuit games with matchgates
AbstractIn unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We analyze such games within the context of matchgate dynamics, which equivalently corresponds to evolutions of non-interacting fermions. We first investigate general entanglement properties of fermionic Gaussian states (FGS). We introduce a representation of FGS using a minimal matchgate circuit capable of preparing the state and derive an algorithm based on a generalized Yang-Baxter relation for updating this representation as unitary operations are applied. This representation enables us to define a natural disentangling procedure that reduces the number of gates in the circuit, thereby decreasing the entanglement contained in the system. We then explore different strategies to disentangle the systems and study the unitary circuit game in two different scenarios: with braiding gates, i.e., the intersection of Clifford gates and matchgates, and with generic matchgates. For each model, we observe qualitatively different entanglement transitions, which we characterize both numerically and analytically.Popular summaryQuantum systems consisting of many particles can organize into distinct phases, in the same way that water can be ice, liquid, or steam depending on temperature. In quantum matter, a key quantity that distinguishes phases is entanglement: the degree to which the individual particles are correlated with one another. In a highly entangled phase, knowing the state of one part of the system reveals information about distant parts; in a weakly entangled phase, correlations remain mostly local. A natural question is: which feature determines whether entanglement builds up or is suppressed in a system? One way to probe this is through "unitary circuit games." A quantum circuit is a sequence of elementary operations, so-calle
Quantum Science and Technology (arXiv overlay)Loading...0
quantum-computingBell Labs’ Michael Eggleston on Nokia’s research into topological quantum computing - IT Pro
Bell Labs’ Michael Eggleston on Nokia’s research into topological quantum computing IT Pro
Google News – Quantum ComputingLoading...0
quantum-computingSignature of paraparticles: a minimal Gedankenexperiment
--> Quantum Physics arXiv:2604.22178 (quant-ph) [Submitted on 24 Apr 2026] Title:Signature of paraparticles: a minimal Gedankenexperiment Authors:Francesco Toppan View a PDF of the paper titled Signature of paraparticles: a minimal Gedankenexperiment, by Francesco Toppan View PDF HTML (experimental) Abstract:Paraparticles beyond bosons and fermions can be exchanged via either the braid group (anyons, existing up to $D=2$ space dimensions) or the permutation group; in the latter case the space dimensions are not limited. Besides being predicted, anyons have been experimentally detected. The situation differs for paraparticles exchanged via the permutation group ("permutation-group parastatistics").The first test to detect their theoretical signature was published in 2021 (for $Z_2\times Z_2$-graded parafermions; it was soon followed by a second paper proving the detectability of $Z_2\times Z_2$-graded parabosons). Later on, two further papers proved theoretical signatures of permutation-group parastatistics. These works demonstrate that, in certain situations, a long-held belief on the "conventionality of parastatistics" argument can be evaded: some measurements of permutation-group paraparticles cannot be recovered from ordinary bosons/fermions. The main question now is how to experimentally detect or engineer in the laboratory such paraparticles. For this aim a minimal setup for the theoretical test is here provided: a Gedankenexperiment (a simplified version of the two tests published in 2021) which, essentially, is a flow chart of logical operations. The key point is to present, to experimentalists, the necessary steps to be simulated/realized in the laboratory (possibly, by manipulating qudits). In this minimal setup, the detection/engineering of paraparticles is mapped into a chirality test. The mathematical setting is based on $Z_2\times Z_2$-graded color Lie (super)algebras and derived mathematical structures. Comments: Subjects: Quantum Physics (quant-ph); S
arXiv Quantum PhysicsLoading...0
quantum-computingBoundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction
--> Quantum Physics arXiv:2604.22471 (quant-ph) [Submitted on 24 Apr 2026] Title:Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction Authors:Sanidhya Gupta, Sanidhay Bhambay, Narges Alavisamani, Neil Walton, Thirupathaiah Vasantam View a PDF of the paper titled Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction, by Sanidhya Gupta and 4 other authors View PDF HTML (experimental) Abstract:Future quantum architectures are expected to be modular, with quantum processors connecting multiple quantum processing units (QPUs) via photonic interconnects. In topological quantum error correction, such as color codes, this creates seam boundaries where parity checks require remote CNOT operations using heralded Bell pairs. These non-local checks are slower and noisier than bulk local checks because entanglement generation is probabilistic, causing data qubits to accumulate idle noise while waiting for remote operations. A natural way to reduce this overhead is to skip some seam measurements; however, doing so makes seam syndrome information stale and can degrade decoding. The central scheduling problem is therefore to determine how frequently seam checks should be measured so as to balance remote-operation and waiting noise against syndrome staleness. To address this trade-off, we develop a scheduling module that integrates directly into standard syndrome-extraction circuits. We consider two policies: Skip-Seam-$\tau$ (SS-$\tau$), which measures all bulk checks every round while measuring seam checks once every $\tau$ rounds and copying the most recent syndrome in skipped rounds, and Adaptive Skip-$\tau$ (AST), which selects $\tau$ as a function of code distance and entanglement generation rate (EGR). We evaluate these policies on triangular color codes under circuit-level noise in Stim, including idling errors induced by Bell-pair generation delays. Our simulations show that SS-tau and AST reduce remote-operation overhead and
arXiv Quantum PhysicsLoading...0
quantum-computingMajorana Codes Enable Forbidden Gates Using Quantum Reference Frames
Researchers have constructed a high-rate quantum low density parity check (LDPC) Majorana code with logical qubits, bringing fault-tolerant quantum computation closer to reality. While most quantum computer designs rely on traditional qubits, this work demonstrates that all necessary elements for quantum computation, state preparation, gates, and measurements, can be consistently implemented using fermionic hardware like Majorana nanowires and fermionic neutral atoms. The team extended tools from qubit fault tolerance to Majorana codes, overcoming limitations imposed by the conservation of fermion parity; specifically, they’ve shown how to implement operations that are forbidden due to parity superselection by utilizing quantum reference frames. This research provides a dictionary for translating fault-tolerant protocols into the language of fermions, potentially unlocking a new path toward scalable and stable quantum processors. Majorana Codes & Fermionic Quantum Computation Unlike traditional qubits, fermionic systems like Majorana nanowires and neutral atom arrays possess inherent constraints related to fermion parity, which historically restricted the types of quantum gates that could be directly implemented. This code, utilizing a specific error-correction scheme, allows for the encoding of logical qubits, the building blocks of robust quantum computation, on physical fermions. The development of this code is notable because it addresses a key challenge in scaling quantum computers: maintaining the integrity of quantum information in the face of noise and decoherence. Crucially, the research goes beyond simply proposing a code; it demonstrates a complete toolkit for fault-tolerant computation, including state preparation, gate implementation, and the ability to perform measurements reliably. The team achieved this by adapting established techniques like Steane error correction, tailoring them to the specific characteristics of Majorana-based systems. They d
Quantum ZeitgeistLoading...0
quantum-computingLight’s Twist Controls Exotic Particles for Future Computation
Netzer Moriya and colleagues present a new method for controlling and reading out non-Abelian anyons within a fractional quantum Hall platform using photonic chirality. A cavity-based scheme generates a rotating landscape with counter-propagating light modes to manipulate anyon loops, performing braid operations and translating the results into measurable changes in cavity coherence. The approach offers a braid-sensitive readout of these elusive particles without requiring delicate electronic interference patterns, potentially enabling more strong topological quantum computation. Photonic chirality guides non-Abelian anyon braiding within a sub-gap optical cavity Researchers, led by David Awschalom, have developed a technique employing a specially designed optical cavity to both steer and measure non-Abelian anyons, particles theorised for use in quantum computing. The cavity is not merely a container for light; it’s engineered to exploit photonic chirality, the property of light behaving differently depending on its spin direction, much like a screw that only tightens when turned a specific way. Counter-propagating light modes within the cavity create a rotating ‘pinning landscape’, an effective controlled potential that guides the anyons, allowing opposite light directions to drive opposite anyon loops and enabling precise manipulation of their braids, or exchanges. A specifically designed optical cavity manipulates non-Abelian anyons, utilising photonic chirality to steer these particles via counter-propagating light modes, operating within a ‘sub-gap dispersive regime’ where cavity frequency is much lower than the energy gap of the anyons, ensuring adiabatic transport and localisation. For a gallium arsenide platform at 20 millikelvins, successful operation requires a pinning potential exceeding both thermal fluctuations and disorder, typically several microelectronvolts, alongside maintained cavity coherence for a duration between the adiabatic transport time a
Quantum ZeitgeistLoading...0
quantum-computingQuantum Calculations Become Simpler with New One-Qubit Technique
Scientists have developed a new method for approximating one-qubit unitaries that circumvents the limitations of traditional Euler decomposition and the magnitude approximation problem. Vadym Kliuchnikov of Microsoft Quantum and colleagues present this direct approximation technique, which leverages repeat-until-success circuits and necessitates the use of only one ancillary qubit. This approach not only simplifies the approximation of single-qubit operations but also extends its applicability to approximating unitaries with multi-qubit gate sets such as Clifford and CS, or Clifford and CCZ, and to orthogonal matrices using Real Clifford and CCZ gate sets. This advancement offers a potentially more efficient pathway for quantum computation by streamlining unitary approximations and broadening applicability across diverse quantum gate architectures. Single ancillary qubit synthesis streamlines arbitrary one-qubit unitary approximations Approximating arbitrary one-qubit unitaries now requires only one ancillary qubit, a substantial improvement over previous methods reliant on Euler decomposition or magnitude approximation which typically demanded more resources. Euler decomposition, a standard technique, breaks down a unitary transformation into a sequence of rotations around the X, Y, and Z axes, but this can lead to unnecessarily long circuits and accumulation of errors. Magnitude approximation, used to reduce the number of gates, introduces inaccuracies in the resulting unitary. This new technique offers direct construction of the desired unitary, bypassing these limitations and enabling more efficient quantum computation, rather than building it from simpler rotations. The ability to directly synthesise unitaries is particularly valuable as quantum computers scale, where minimising gate count and circuit depth becomes crucial for mitigating decoherence and other noise sources. This flexibility broadens its potential application across diverse quantum architectures
Quantum ZeitgeistLoading...0
quantum-computingSoundwaves settle debate about elusive quantum particle
It was a head-spinning discovery. In 2018, researchers in Japan claimed to find concrete evidence of an elusive particle, a Majorana fermion, in a quantum spin liquid called ruthenium trichloride. Majoranas are highly sought-after by quantum materials scientists because when a pair are localized, or trapped, they can securely encode information and form a stable qubit—the building block of quantum computing.
Phys.org Quantum SectionLoading...0
quantum-computingStudy: Majorana States Get Easier to Find as Quantum Chains Grow Longer
Insider Brief Brazilian physicists have shown that the notoriously finicky quantum states needed for fault-tolerant quantum computing become dramatically more stable and easier to find as the chain of engineered particles that hosts them grows longer, a finding that could accelerate the race to build a practical quantum computer. The work, published in Physical Review […]
Quantum InsiderLoading...0