Encoding entanglement-assisted quantum stabilizer codes

We address the problem of encoding entanglement-assisted (EA) quantum error-correcting codes (QECCs) and of the corresponding complexity. We present an iterative algorithm from which a quantum circuit composed of CNOT, H, and S gates can be derived directly with complexity O(n²) to encode the qubits being sent. Moreover, we derive the number of each gate consumed in our algorithm according to which we can design EA QECCs with low encoding complexity. Another advantage brought by our algorithm is the easiness and efficiency of programming on classical computers.     

量子稳定子码的差错纠正与译码网络构建

寻找差错症状与差错算子之间映射关系是量子译码网络的核心内容,也是量子译码网络实现纠错功能的关键.给出了比特翻转差错症状矩阵和相位翻转差错症状矩阵的定义,将任意Pauli差错算子的差错症状表示为比特翻转差错症状矩阵和相位翻转差错症状矩阵的线性组合.研究发现,量子稳定子码的差错症状矩阵由其校验矩阵所决定,从而可将差错症状矩阵与差错算子之间的映射关系转化为校验矩阵与差错算子之间的映射关系,使得所有关于差错症状的分析都可以通过分析其校验矩阵来实现.这与经典线性码的差错症状与奇偶校验矩阵之间的关系类似,因此可以将经 关键词： 稳定子码 校验矩阵 差错症状 Pauli算子     

Homological stabilizer codes

In this paper we define homological stabilizer codes on qubits which encompass codes such as Kitaev’s toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev’s toric code or to the topological color codes.     

Secure deterministic communication in a quantum loss channel using quantum error correction code

The loss of a quantum channel leads to an irretrievable particle loss as well as information. In this paper, the loss of quantum channel is analysed and a method is put forward to recover the particle and information loss effectively using universal quantum error correction. Then a secure direct communication scheme is proposed, such that in a loss channel the information that an eavesdropper can obtain would be limited to arbitrarily small when the code is properly chosen and the correction operation is properly arranged.     

超导量子计算系统中的容错技术

随着超导系统中的量子控制技术日益成熟,量子纠错技术也在不断发展。最近,已有一些平台实现了超越量子纠错盈亏平衡点的里程碑式突破。然而,要实现最终目标——容错量子计算,仍需要拓展系统的维度并进一步压制噪声。文章以超导量子系统为例,首先介绍了四种实现容错错误症状测量的思路;以此为基础,讨论了实现容错量子计算的三个关键阶段以及各阶段所面临的挑战,包括超越盈亏平衡点、达到容错阈值和实现完备逻辑门操作。为了实现这些目标,将按照连通性从低到高归纳三种可能的拓展系统规模的方案。此外,还总结了实验上纠错技术的进展以及对连通性的探索,最后讨论当前关键的研究问题。     

Determination of quantum toric error correction code threshold using convolutional neural network decoders

Quantum error correction technology is an important solution to solve the noise interference generated during the operation of quantum computers.In order to find the best syndrome of the stabilizer code in quantum error correction,we need to find a fast and close to the optimal threshold decoder.In this work,we build a convolutional neural network(CNN)decoder to correct errors in the toric code based on the system research of machine learning.We analyze and optimize various conditions that affect CNN,and use the RestNet network architecture to reduce the running time.It is shortened by 30%-40%,and we finally design an optimized algorithm for CNN decoder.In this way,the threshold accuracy of the neural network decoder is made to reach 10.8%,which is closer to the optimal threshold of about 11%.The previous threshold of 8.9%-10.3%has been slightly improved,and there is no need to verify the basic noise.     

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states.This paper presents how to use a [2k-1,1,k] quantum error-correcting code(QECC) to implement a quantum(k,2k 1) threshold scheme.It also takes advantage of classical enhancement of the [2k-1,1,k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously.Because information is encoded into QECC,these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.     

Jointly-check iterative decoding algorithm for quantum sparse graph codes

<正>For quantum sparse graph codes with stabilizer formalism,the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with a standard belief-propagation(BP) algorithm.In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently.Numerical simulations show that this modified method outperforms the standard BP algorithm with an obvious performance improvement.     

Quantum computation and error correction based on continuous variable cluster states

Measurement-based quantum computation with continuous variables, which realizes computation by performing measurement and feedforward of measurement results on a large scale Gaussian cluster state, provides a feasible way to implement quantum computation. Quantum error correction is an essential procedure to protect quantum information in quantum computation and quantum communication. In this review, we briefly introduce the progress of measurement-based quantum computation and quantum error correction with continuous variables based on Gaussian cluster states. We also discuss the challenges in the fault-tolerant measurement-based quantum computation with continuous variables.     

An overview of quantum error mitigation formulas

Minimizing the effect of noise is essential for quantum computers. The conventional method to protect qubits against noise is through quantum error correction. However, for current quantum hardware in the so-called noisy intermediate-scale quantum (NISQ) era, noise presents in these systems and is too high for error correction to be beneficial. Quantum error mitigation is a set of alternative methods for minimizing errors, including error extrapolation, probabilistic error cancellation, measurement error mitigation, subspace expansion, symmetry verification, virtual distillation, etc. The requirement for these methods is usually less demanding than error correction. Quantum error mitigation is a promising way of reducing errors on NISQ quantum computers. This paper gives a comprehensive introduction to quantum error mitigation. The state-of-art error mitigation methods are covered and formulated in a general form, which provides a basis for comparing, combining and optimizing different methods in future work.     

Reinforcement learning for optimal error correction of toric codes

We apply deep reinforcement learning techniques to design high threshold decoders for the toric code under uncorrelated noise. By rewarding the agent only if the decoding procedure preserves the logical states of the toric code, and using deep convolutional networks for the training phase of the agent, we observe near-optimal performance for uncorrelated noise around the theoretically optimal threshold of 11%. We observe that, by and large, the agent implements a policy similar to that of minimum weight perfect matchings even though no bias towards any policy is given a priori.     

基于无消相干子空间的量子避错码设计

针对量子系统的联合消相干模型,可以找到一些不受消相干错误影响的系统状态,这种状态被称为相干保持态,所有相干保持态构成的空间就称为无消相干子空间(decoherencefreesubspace,缩写为DFS).利用DFS的特性可以实现自动容错的量子避错码.首先提出一种DFS的定义,并且以定理的形式证明其他DFS的定义都是等价的.然后给出了DFS的存在性定理.最后利用群论的方法设计一种构造DFS的简单方法 关键词： 相干保持态 无消相干子空间 量子避错码 容错量子计算     

Secure deterministic communication scheme based on quantum remote state preparation

Based on the techniques of the quantum remote state preparation via a deterministic way, this paper proposes a quantum communication scheme to distribute the secret messages in two phases, i.e., the carrier state checking phase and the message state transmitting phase. In the first phase, the secret messages are encoded by the sender using a stabilizer quantum code and then transmitted to the receiver by implementing three CNOT gates. In the second phase, the communicators check the perfectness of the entanglement of the transmitted states. The messages can be distributed to the receiver even if some of the transmitted qubits are destroyed.     

基于光量子态避错及容错传输的量子通信

量子通信以量子态为信息载体在远距离的通信各方之间传递信息,因此量子态的传输和远距离共享是量子通信的首要步骤.信道噪声不仅会影响通信效率还可能被窃听者利用从而威胁通信安全,对抗信道噪声是实现安全高效量子通信亟需解决的问题.本文介绍基于光量子态的两类对抗信道噪声的实用方法——量子态的避错传输和容错的量子通信,包括对抗噪声的基本原理和两种方法的代表性方案,并从资源消耗和可操作性的角度分析了方案的实用价值.     

Implementation of Fault-Tolerant Encoding Circuit Based on Stabilizer Implementation and “Flag” Bits in Steane Code

Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.     

交换节点基于电磁波全向辐射特性的M维空时纠错码理论

电磁波在自由空间中的全向辐射特性在无线通信领域一直被认为是一个巨大缺点,但在网络环境下该特性可被用来提高无线通信系统的性能.考虑在一个无线网络中, M 个节点通过一个交换节点来相互交换各自信息.不同于传统传输方式,交换节点将对自己接收到的这 M 份独立信息进行联合编码,再利用电磁波全向辐射特性向所有节点同时发送相同码字.对于这种新型网络编码方式,本文给出了它对应的 M 维空时纠错码的数学定义,并证明了一些关于码本性能的基本定理,为构造性能较好的码本奠定了基础.这种同时引入空域和时域冗余的纠错码本有效地提高 关键词： 全向辐射 无线通信网络 交换节点 M 维空时纠错码     

基于泊松分布单光子源的量子误码率的分析

在自由空间量子密钥分配中,单光子源采用具有泊松分布的高度衰减激光脉冲,量子密码术协议采用BB84和B92协议。通过引入量子信道传输率、单光子捕获概率、测量因子和数据筛选因子,建立了量子误码率理论模型,给出了量子误码率的表达式。对于自由空间量子信道,引起量子误码率的主要因素是光学元件、探测器暗噪声和空间光学环境,并对这些因素进行了分析。针对低轨卫星_地面站间链路,进行了量子误码率的数值仿真研究。结果表明,在低轨卫星_地面站间进行量子密钥分配是可行的,限制自由空间量子密钥分配链路距离的主要因素是探测器暗噪声和空间光学环境。     

基于量子隐形传态的量子保密通信方案

量子保密通信包括量子密钥分发、量子安全直接通信和量子秘密共享等主要形式.在量子密钥分发和秘密共享中,传输的是随机数而不是信息,要再经过一次经典通信才能完成信息的传输.在量子信道直接传输信息的量子通信形式是量子安全直接通信.基于量子隐形传态的量子通信(简称量子隐形传态通信)是否属于量子安全直接通信尚需解释.构造了一个量子隐形传态通信方案,给出了具体的操作步骤.与一般的量子隐形传态不同,量子隐形传态通信所传输的量子态是计算基矢态,大大简化了贝尔基测量和单粒子操作.分析结果表明,量子隐形传态通信等价于包含了全用型量子密钥分发和经典通信的复合过程,不是量子安全直接通信,其传输受到中间介质和距离的影响,所以不比量子密钥分发更有优势.将该方案与量子密钥分发、量子安全直接通信和经典一次性便笺密码方案进行对比,通过几个通信参数的比较给出各个方案的特点,还特别讨论了各方案在空间量子通信方面的特点.