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:2407.01658v1

Help | Advanced Search

Quantum Physics

arXiv:2407.01658v1 (quant-ph)
[Submitted on 1 Jul 2024 ]

Title: Fault-tolerant noise guessing decoding of quantum random codes

Title: 量子随机码的容错噪声猜测解码

Authors:Diogo Cruz, Francisco A. Monteiro, André Roque, Bruno C. Coutinho
Abstract: This work addresses the open question of implementing fault-tolerant QRLCs with feasible computational overhead. We present a new decoder for quantum random linear codes (QRLCs) capable of dealing with imperfect decoding operations. A first approach, introduced by Cruz et al., only considered channel errors, and perfect gates at the decoder. Here, we analyze the fault-tolerant characteristics of QRLCs with a new noise-guessing decoding technique, when considering preparation, measurement, and gate errors in the syndrome extraction procedure, while also accounting for error degeneracy. Our findings indicate a threshold error rate ($\pth$) of approximately $\pnum$ in the asymptotic limit, while considering realistic noise levels in the mentioned physical procedures.
Abstract: 这项工作解决了实现具有可行计算开销的容错量子随机线性码的开放问题。 我们提出了一种用于量子随机线性码(QRLCs)的新解码器,能够处理不完善的解码操作。 Cruz 等人提出的第一种方法仅考虑了信道错误,并假设解码器中的门操作是完美的。 在此,我们分析了在考虑 syndrome 提取过程中准备、测量和门错误的同时,也考虑到错误退化情况下的 QRLCs 的容错特性,采用了一种新的噪声猜测解码技术。 我们的研究结果表明,在考虑所述物理过程中的现实噪声水平时,在渐近极限下有一个阈值错误率($\pth$)约为$\pnum$。
Subjects: Quantum Physics (quant-ph) ; Information Theory (cs.IT)
Cite as: arXiv:2407.01658 [quant-ph]
  (or arXiv:2407.01658v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2407.01658
arXiv-issued DOI via DataCite

Submission history

From: Francisco Monteiro [view email]
[v1] Mon, 1 Jul 2024 17:54:23 UTC (3,970 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.IT
math
math.IT

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号