<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>#FaultTolerantQC on Home</title>
    <link>https://yakinin.com/en/tags/%23faulttolerantqc/</link>
    <description>Recent content in #FaultTolerantQC on Home</description>
    <generator>Hugo -- 0.148.2</generator>
    <language>en</language>
    <lastBuildDate>Mon, 18 Aug 2025 00:03:45 +0000</lastBuildDate>
    <atom:link href="https://yakinin.com/en/tags/%23faulttolerantqc/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Fixing a Quantum Bottleneck: How &#39;Neglected&#39; Particles Could Make Qubits Robust</title>
      <link>https://yakinin.com/en/posts/20250818-quantum-bottleneck-neglectons/</link>
      <pubDate>Mon, 18 Aug 2025 00:03:45 +0000</pubDate>
      <guid>https://yakinin.com/en/posts/20250818-quantum-bottleneck-neglectons/</guid>
      <description>&lt;p&gt;Quantum computing&amp;rsquo;s biggest roadblock isn&amp;rsquo;t speed; it&amp;rsquo;s stability. Qubits are notoriously fragile, easily collapsing from environmental noise. This makes scaling a reliable quantum computer an immense engineering challenge. One of the most promising solutions is topological quantum computing, which encodes information not in the state of a particle, but in the geometric &amp;ldquo;braiding&amp;rdquo; of quasiparticles called anyons. This approach is inherently more robust against decoherence.&lt;/p&gt;
&lt;p&gt;However, the leading candidates for this approach, known as Ising anyons, have a critical flaw: they aren&amp;rsquo;t &amp;ldquo;universal.&amp;rdquo; Performing computations by braiding them is like trying to type with half the keys missing from your keyboard—you can perform some operations, but not the full set required for general-purpose computing.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
