Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2410.02398

Help | Advanced Search

Quantum Physics

arXiv:2410.02398 (quant-ph)
[Submitted on 3 Oct 2024 (v1) , last revised 6 Jun 2025 (this version, v2)]

Title: Competing automorphisms and disordered Floquet codes

Title: 竞争自同构和无序Floquet码

Authors:Cory T. Aitchison, Benjamin Béri
Abstract: Topological order is a promising basis for quantum error correction, a key milestone towards large-scale quantum computing. Floquet codes provide a dynamical scheme for this while also exhibiting Floquet-enriched topological order (FET) where anyons periodically undergo a measurement-induced automorphism that acts uniformly in space. We study disordered Floquet codes where automorphisms have a spatiotemporally heterogeneous distribution -- the automorphisms "compete". We characterize the effect of this competition, showing how key features of the purification dynamics of mixed codestates can be inferred from anyon and automorphism properties for any Abelian topological order. This perspective can explain the protection or measurement of logical information in a dynamic automorphism (DA) code when subjected to a noise model of missing measurements. We demonstrate this using a DA color code with perturbed measurement sequences. The framework of competing automorphisms captures essential features of Floquet codes and robustness to noise, and may elucidate key mechanisms involving topological order, automorphisms, and fault-tolerance.
Abstract: 拓扑序是一种有前景的量子纠错基础,这是迈向大规模量子计算的关键里程碑。 Floquet码为此提供了一个动态方案,同时表现出Floquet富集的拓扑序(FET),其中任意子会周期性地经历一种由测量诱导的自同构,该自同构在空间上均匀作用。 我们研究了无序的Floquet码,其中自同构具有时空异质分布——这些自同构“相互竞争”。 我们表征了这种竞争的影响,展示了如何从任意子和自同构的属性推断出任意阿贝尔拓扑序混合码字纯化动力学的关键特征。 这一视角可以解释动态自同构(DA)码在遭受缺失测量的噪声模型时逻辑信息的保护或测量。 我们使用受扰动测量序列的DA颜色码来演示这一点。 竞争自同构的框架捕捉了Floquet码的本质特征以及对噪声的鲁棒性,并可能阐明涉及拓扑序、自同构和容错的关键机制。
Comments: 30 pages, 16 figures; accepted manuscript
Subjects: Quantum Physics (quant-ph) ; Disordered Systems and Neural Networks (cond-mat.dis-nn); Statistical Mechanics (cond-mat.stat-mech); Strongly Correlated Electrons (cond-mat.str-el)
Cite as: arXiv:2410.02398 [quant-ph]
  (or arXiv:2410.02398v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2410.02398
arXiv-issued DOI via DataCite
Journal reference: Phys. Rev. B 111, 235112 (2025)
Related DOI: https://doi.org/10.1103/PhysRevB.111.235112
DOI(s) linking to related resources

Submission history

From: Cory Aitchison [view email]
[v1] Thu, 3 Oct 2024 11:19:02 UTC (323 KB)
[v2] Fri, 6 Jun 2025 10:03:18 UTC (297 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cond-mat.str-el
< prev   |   next >
new | recent | 2024-10
Change to browse by:
cond-mat
cond-mat.dis-nn
cond-mat.stat-mech
quant-ph

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号