量子纠错码背后的理论:概述

IF 1.8 4区 综合性期刊 Q2 MULTIDISCIPLINARY SCIENCES
Shayan Srinivasa Garani, Priya J. Nadkarni, Ankur Raina
{"title":"量子纠错码背后的理论:概述","authors":"Shayan Srinivasa Garani,&nbsp;Priya J. Nadkarni,&nbsp;Ankur Raina","doi":"10.1007/s41745-023-00392-7","DOIUrl":null,"url":null,"abstract":"<div><p>Quantum information processing is now a well-evolved field of study with roots to quantum physics that has significantly evolved from pioneering works over almost more than a century. Today, we are at a stage where elementary forms of quantum computers and communication systems are being built and deployed. In this paper, we begin with a historical background into quantum information theory and coding theory for both entanglement-unassisted and assisted quantum communication systems, motivating the need for quantum error correction in such systems. We then begin with the necessary mathematical preliminaries towards understanding the theory behind quantum error correction, central to the discussions within this article, starting from the binary case towards the non-binary generalization, using the rich framework of finite fields. We will introduce the stabilizer framework, build upon the Calderbank-Shor-Steane framework for binary quantum codes and generalize this to the non-binary case, yielding generalized CSS codes that are linear and additive. We will survey important families of quantum codes derived from well-known classical counterparts. Next, we provide an overview of the theory behind entanglement-assisted quantum ECCs along with encoding and syndrome computing architectures. We present a case study on how to construct efficient quantum Reed-Solomon codes that saturate the Singleton bound for the non-degenerate case. We will also show how positive coding rates can be realized using tensor product codes from two zero-rate entanglement-assisted CSS codes, an effect termed as the coding analog of superadditivity, useful for entanglement-assisted quantum communications. We discuss how quantum coded networks can be realized using cluster states and modified graph state codes. Last, we will motivate fault-tolerant quantum computation from the perspective of coding theory. We end the article with our perspectives on interesting open directions in this exciting field.</p></div>","PeriodicalId":675,"journal":{"name":"Journal of the Indian Institute of Science","volume":"103 2","pages":"449 - 495"},"PeriodicalIF":1.8000,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Theory Behind Quantum Error Correcting Codes: An Overview\",\"authors\":\"Shayan Srinivasa Garani,&nbsp;Priya J. Nadkarni,&nbsp;Ankur Raina\",\"doi\":\"10.1007/s41745-023-00392-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Quantum information processing is now a well-evolved field of study with roots to quantum physics that has significantly evolved from pioneering works over almost more than a century. Today, we are at a stage where elementary forms of quantum computers and communication systems are being built and deployed. In this paper, we begin with a historical background into quantum information theory and coding theory for both entanglement-unassisted and assisted quantum communication systems, motivating the need for quantum error correction in such systems. We then begin with the necessary mathematical preliminaries towards understanding the theory behind quantum error correction, central to the discussions within this article, starting from the binary case towards the non-binary generalization, using the rich framework of finite fields. We will introduce the stabilizer framework, build upon the Calderbank-Shor-Steane framework for binary quantum codes and generalize this to the non-binary case, yielding generalized CSS codes that are linear and additive. We will survey important families of quantum codes derived from well-known classical counterparts. Next, we provide an overview of the theory behind entanglement-assisted quantum ECCs along with encoding and syndrome computing architectures. We present a case study on how to construct efficient quantum Reed-Solomon codes that saturate the Singleton bound for the non-degenerate case. We will also show how positive coding rates can be realized using tensor product codes from two zero-rate entanglement-assisted CSS codes, an effect termed as the coding analog of superadditivity, useful for entanglement-assisted quantum communications. We discuss how quantum coded networks can be realized using cluster states and modified graph state codes. Last, we will motivate fault-tolerant quantum computation from the perspective of coding theory. We end the article with our perspectives on interesting open directions in this exciting field.</p></div>\",\"PeriodicalId\":675,\"journal\":{\"name\":\"Journal of the Indian Institute of Science\",\"volume\":\"103 2\",\"pages\":\"449 - 495\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Indian Institute of Science\",\"FirstCategoryId\":\"103\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s41745-023-00392-7\",\"RegionNum\":4,\"RegionCategory\":\"综合性期刊\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Indian Institute of Science","FirstCategoryId":"103","ListUrlMain":"https://link.springer.com/article/10.1007/s41745-023-00392-7","RegionNum":4,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

摘要

量子信息处理现在是一个发展良好的研究领域,其根源在于量子物理学,在近一个多世纪的时间里,量子物理学从开创性的工作中得到了显著的发展。今天,我们正处于构建和部署基本形式的量子计算机和通信系统的阶段。在本文中,我们从量子信息理论和编码理论的历史背景开始,这两种纠缠-无辅助和辅助量子通信系统,激发了量子纠错在这些系统中的需要。然后,我们从必要的数学基础开始,以理解量子纠错背后的理论,这是本文讨论的核心,从二进制情况到非二进制推广,使用有限域的丰富框架。我们将引入稳定器框架,在二进制量子码的calderbank - shorr - steane框架的基础上,将其推广到非二进制情况,得到线性和可加性的广义CSS码。我们将调查从著名的经典对应物中衍生出来的重要量子码族。接下来,我们概述了纠缠辅助量子ecc以及编码和综合征计算架构背后的理论。我们给出了一个关于如何构造有效的量子Reed-Solomon码的实例研究,该码使非简并情况下的单例界饱和。我们还将展示如何使用两个零速率纠缠辅助CSS代码的张量积代码来实现正编码率,这种效应被称为超可加性的编码模拟,对纠缠辅助量子通信很有用。讨论了如何利用簇态和改进的图态码来实现量子编码网络。最后,我们将从编码理论的角度激发容错量子计算。在文章的最后,我们对这个令人兴奋的领域中有趣的开放方向进行了展望。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Theory Behind Quantum Error Correcting Codes: An Overview

Theory Behind Quantum Error Correcting Codes: An Overview

Quantum information processing is now a well-evolved field of study with roots to quantum physics that has significantly evolved from pioneering works over almost more than a century. Today, we are at a stage where elementary forms of quantum computers and communication systems are being built and deployed. In this paper, we begin with a historical background into quantum information theory and coding theory for both entanglement-unassisted and assisted quantum communication systems, motivating the need for quantum error correction in such systems. We then begin with the necessary mathematical preliminaries towards understanding the theory behind quantum error correction, central to the discussions within this article, starting from the binary case towards the non-binary generalization, using the rich framework of finite fields. We will introduce the stabilizer framework, build upon the Calderbank-Shor-Steane framework for binary quantum codes and generalize this to the non-binary case, yielding generalized CSS codes that are linear and additive. We will survey important families of quantum codes derived from well-known classical counterparts. Next, we provide an overview of the theory behind entanglement-assisted quantum ECCs along with encoding and syndrome computing architectures. We present a case study on how to construct efficient quantum Reed-Solomon codes that saturate the Singleton bound for the non-degenerate case. We will also show how positive coding rates can be realized using tensor product codes from two zero-rate entanglement-assisted CSS codes, an effect termed as the coding analog of superadditivity, useful for entanglement-assisted quantum communications. We discuss how quantum coded networks can be realized using cluster states and modified graph state codes. Last, we will motivate fault-tolerant quantum computation from the perspective of coding theory. We end the article with our perspectives on interesting open directions in this exciting field.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of the Indian Institute of Science
Journal of the Indian Institute of Science MULTIDISCIPLINARY SCIENCES-
CiteScore
4.30
自引率
0.00%
发文量
75
期刊介绍: Started in 1914 as the second scientific journal to be published from India, the Journal of the Indian Institute of Science became a multidisciplinary reviews journal covering all disciplines of science, engineering and technology in 2007. Since then each issue is devoted to a specific topic of contemporary research interest and guest-edited by eminent researchers. Authors selected by the Guest Editor(s) and/or the Editorial Board are invited to submit their review articles; each issue is expected to serve as a state-of-the-art review of a topic from multiple viewpoints.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信