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:1812.05117

Help | Advanced Search

Quantum Physics

arXiv:1812.05117 (quant-ph)
[Submitted on 12 Dec 2018 ]

Title: The role of entropy in topological quantum error correction

Title: 熵在拓扑量子错误纠正中的作用

Authors:Michael E. Beverland, Benjamin J. Brown, Michael J. Kastoryano, Quentin Marolleau
Abstract: The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of encoded logical information. In this work we compare two different variants of the surface code with a comparable number of qubits: the surface code defined on a square lattice and the same model on a lattice that is rotated by $\pi / 4$. This seemingly innocuous change increases the distance of the code by a factor of $\sqrt{2}$.However, as we show, this gain can come at the expense of significantly increasing the number of different failure mechanisms that are likely to occur. We use a number of different methods to explore this tradeoff over a large range of parameter space under an independent and identically distributed noise model. We rigorously analyze the leading order performance for low error rates, where the larger distance code performs best for all system sizes. Using an analytical model and Monte Carlo sampling, we find that this improvement persists for fixed sub-threshold error rates for large system size, but that the improvement vanishes close to threshold. Remarkably, intensive numerics uncover a region of system sizes and sub-threshold error rates where the square lattice surface code marginally outperforms the rotated model.
Abstract: 量子纠错过程的性能由系统中引入的随机错误配置导致编码逻辑信息损坏的可能性决定。 在本工作中,我们比较了两种不同变体的表面码,它们具有相近的量子比特数量:定义在正方形晶格上的表面码和同一模型在旋转了$\pi / 4$的晶格上的模型。 这种看似无害的改变使代码的距离增加了$\sqrt{2}$倍。然而,正如我们所展示的,这种增益可能会以显著增加可能发生的故障机制数量为代价。 我们使用多种不同的方法,在独立且相同分布的噪声模型下,探索参数空间中的这一权衡。 我们严格分析了低错误率下的主导性能,其中距离更大的代码在所有系统尺寸下表现最好。 通过分析模型和蒙特卡洛采样,我们发现这种改进在大系统尺寸下对于固定的次阈值错误率仍然有效,但当接近阈值时,这种改进会消失。 值得注意的是,密集的数值计算揭示了一个系统尺寸和次阈值错误率的区域,在该区域中,正方形晶格表面码略微优于旋转模型。
Comments: 20 pages, 19 figures, comments welcome
Subjects: Quantum Physics (quant-ph) ; Statistical Mechanics (cond-mat.stat-mech)
Cite as: arXiv:1812.05117 [quant-ph]
  (or arXiv:1812.05117v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.1812.05117
arXiv-issued DOI via DataCite
Journal reference: J. Stat. Mech.:Theor. Exp. 2019, 073404 (2019)
Related DOI: https://doi.org/10.1088/1742-5468/ab25de
DOI(s) linking to related resources

Submission history

From: Benjamin J. Brown [view email]
[v1] Wed, 12 Dec 2018 19:00:08 UTC (676 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2018-12
Change to browse by:
cond-mat
cond-mat.stat-mech

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号