Description of a quantum convolutional code

We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances in classical communication. The particular example shown here uses the stabilizer formalism. We provide an explicit encoding circuit and its associated error estimation algorithm. The latter gives the most likely error over any memoryless quantum channel, with a complexity growing only linearly with the number of encoded qubits.     

Nested Quantum Error Correction Codes via Subgraphs

Because of its directness and simplicity, using graph is a worthy researching approach to construct quantum error correction codes. Nested graphical quantum code is a special class of stabilizer codes. In this letter, by making uses of the entanglement of several subgraphs, we proposed a novel construction method of generator matrices of graphical quantum nested codes, and families of corresponding nested graphical quantum codes.     

Zeno effect for quantum computation and control

It is well known that the quantum Zeno effect can protect specific quantum states from decoherence by using projective measurements. Here we combine the theory of weak measurements with stabilizer quantum error correction and detection codes. We derive rigorous performance bounds which demonstrate that the Zeno effect can be used to protect appropriately encoded arbitrary states to arbitrary accuracy while at the same time allowing for universal quantum computation or quantum control.     

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

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

量子Turbo乘积码

量子通信是经典通信和量子力学相结合的一门新兴交叉学科.量子纠错编码是实现量子通信的关键技术之一.构造量子纠错编码的主要方法是借鉴经典纠错编码技术,许多经典的编码技术在量子领域中都可以找到其对应的编码方法.针对经典纠错码中最好码之一的Turbo乘积码,提出一种以新构造的CSS型量子卷积码为稳定子码的量子Turbo乘积码.首先,运用群的理论及稳定子码的基本原理构造出新的CSS型量子卷积码稳定子码生成元,并描述了其编码网络.接着,利用量子置换SWAP门定义推导出量子Turbo乘积码的交织编码矩阵.最后,推导出量子Turbo乘积码的译码迹距离与经典Turbo乘积码的译码距离的对应关系,并提出量子Turbo乘积码的编译码实现方案.这种编译码方法具有高度结构化,设计思路简单,网络易于实施的特点. 关键词： CSS码 量子卷积码 量子Turbo乘积码 量子纠错编码     

Undetermined states: how to find them and their applications

We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are proposed. One is to establish the relation between codewords of the stabilizer quantum error correction codes (SQECCs) and the undetermined states. The other is to study the local complementation rules of the graph states. As an application, the undetermined states can be exploited in the quantum secret sharing scheme. The security is guaranteed by their undetermineness.     

Decoherence by correlated noise and quantum error correction

We study the decoherence of a quantum computer in an environment which is inherently correlated in time and space. We first derive the nonunitary time evolution of the computer and environment in the presence of a stabilizer error correction code, providing a general way to quantify decoherence for a quantum computer. The general theory is then applied to the spin-boson model. Our results demonstrate that effects of long-range correlations can be systematically reduced by small changes in the error correction codes.     

Efficient Quantum Circuit for Encoding and Decoding of the [[8,3,5]] Stabilizer Code

A general protocol for constructing a complete efficient encoding and decoding quantum circuit of the [[8,3,5]] stabilizer code is proposed. The [[8,3,5]] stabilizer code is an eight-qubit code that protects a three-qubit state with up to one error, which is very important for quantum information processing. Single-qubit operations, two-qubit controlled gates and Toffoli gates are required in the proposed circuit. The current protocol can be generalized to all quantum stabilizer codes satisfying quantum Hamming bound, and implemented in some quantum systems.     

Standard form of qudit stabilizer groups

We investigate stabilizer codes with carrier qudits of equal dimension D, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding stabilizer, and this implies that the code and its stabilizer are dual to each other. We also show that any qudit stabilizer can be put in a canonical, or standard, form using a series of Clifford gates, and we provide an explicit efficient algorithm for doing this. Our work generalizes known results that were valid only for prime dimensional systems and may be useful in constructing efficient encoding/decoding quantum circuits for qudit stabilizer codes and better qudit quantum error correcting codes.     

Quantum secure direct communication and deterministic secure quantum communication

In this review article, we review the recent development of quantum secure direct communication (QSDC) and deterministic secure quantum communication (DSQC) which both are used to transmit secret message, including the criteria for QSDC, some interesting QSDC protocols, the DSQC protocols and QSDC network, etc. The difference between these two branches of quantum communication is that DSQC requires the two parties exchange at least one bit of classical information for reading out the message in each qubit, and QSDC does not. They are attractive because they are deterministic, in particular, the QSDC protocol is fully quantum mechanical. With sophisticated quantum technology in the future, the QSDC may become more and more popular. For ensuring the safety of QSDC with single photons and quantum information sharing of single qubit in a noisy channel, a quantum privacy amplification protocol has been proposed. It involves very simple CHC operations and reduces the information leakage to a negligible small level. Moreover, with the one-party quantum error correction, a relation has been established between classical linear codes and quantum one-party codes, hence it is convenient to transfer many good classical error correction codes to the quantum world. The one-party quantum error correction codes are especially designed for quantum dense coding and related QSDC protocols based on dense coding.      

Some New Quantum BCH Codes over Finite Fields

Quantum error correcting codes (QECCs) play an important role in preventing quantum information decoherence. Good quantum stabilizer codes were constructed by classical error correcting codes. In this paper, Bose–Chaudhuri–Hocquenghem (BCH) codes over finite fields are used to construct quantum codes. First, we try to find such classical BCH codes, which contain their dual codes, by studying the suitable cyclotomic cosets. Then, we construct nonbinary quantum BCH codes with given parameter sets. Finally, a new family of quantum BCH codes can be realized by Steane’s enlargement of nonbinary Calderbank-Shor-Steane (CSS) construction and Hermitian construction. We have proven that the cyclotomic cosets are good tools to study quantum BCH codes. The defining sets contain the highest numbers of consecutive integers. Compared with the results in the references, the new quantum BCH codes have better code parameters without restrictions and better lower bounds on minimum distances. What is more, the new quantum codes can be constructed over any finite fields, which enlarges the range of quantum BCH codes.     

Active suppression of dephasing in Josephson-junction qubits

Simple majority code correcting k dephasing errors by encoding a qubit of information into 2k+1 physical qubits is studied quantitatively. We derive an equation for quasicontinuous evolution of the density matrix of encoded quantum information under the error correction procedure in the presence of correlated dephasing noise. A specific design of a Josephson-junction nanocircuit implementing this scheme is suggested.     

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.     

Capabilities of a perturbed toric code as a quantum memory

We analyze the effect of typical, unknown perturbations on the 2D toric code when acting as a quantum memory, incorporating the effects of error correction on readout. By transforming the system into a 1D transverse Ising model undergoing an instantaneous quench, and making extensive use of Lieb-Robinson bounds, we prove that for a large class of perturbations, the survival time of stored information grows at least logarithmically with the system size. A uniform magnetic field saturates this scaling behavior. We show that randomizing the stabilizer strengths gives a polynomial survival time with a degree that depends on the strength of the perturbation.     

Index Coding with Multiple Interpretations

The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to decode their demanded messages with a minimum number of transmissions, referred to as an index code length. The problem of finding the minimum length index code that enables all receivers to correct a specific number of errors has also been studied. This work establishes a connection between index coding and error-correcting codes with multiple interpretations from the tree construction of nested cyclic codes. The notion of multiple interpretations using nested codes is as follows: different data packets are independently encoded, and then combined by addition and transmitted as a single codeword, minimizing the number of channel uses and offering error protection. The resulting packet can be decoded and interpreted in different ways, increasing the error correction capability, depending on the amount of side information available at each receiver. Motivating applications are network downlink transmissions, information retrieval from datacenters, cache management, and sensor networks.     

A study of quantum error correction by geometric algebra and liquid-state NMR spectroscopy

Quantum error correcting codes enable the information contained in a quantum state to be protected from decoherence due to external perturbations. Applied to NMR, this procedure does not alter normal relaxation, but rather converts the state of a 'data' spin into multiple quantum coherences involving additional ancilla spins. These multiple quantum coherences relax at differing rates, thus permitting the original state of the data to be approximately reconstructed by mixing them together in an appropriate fashion. This paper describes the operation of a simple, three-bit quantum code in the product operator formalism, and uses geometric algebra methods to obtain the error-corrected decay curve in the presence of arbitrary correlations in the external random fields. These predictions are confirmed in both the totally correlated and uncorrelated cases by liquid-state NMR experiments on ¹³C-labelled alanine, using gradient-diffusion methods to implement these idealized decoherence models. Quantum error correction in weakly polarized systems requires that the ancilla spins be prepared in a pseudo-pure state relative to the data spin, which entails a loss of signal that exceeds any potential gain through error correction. Nevertheless, this study shows that quantum coding can be used to validate theoretical decoherence mechanisms, and to provide detailed information on correlations in the underlying NMR relaxation dynamics.     

Relaxation of pseudo pure states: the role of cross-correlations

In quantum information processing by NMR one of the major challenges is relaxation or decoherence. Often it is found that the equilibrium mixed state of a spin system is not suitable as an initial state for computation and a definite initial state is required to be prepared prior to the computation. As these preferred initial states are non-equilibrium states, they are not stationary and are destroyed with time as the spin system relaxes toward its equilibrium, introducing error in computation. Since it is not possible to cut off the relaxation processes completely, attempts are going on to develop alternate strategies like quantum error correction codes or noiseless subsystems. Here we study the relaxation behavior of various pseudo pure states and analyze the role of cross-terms between different relaxation processes, known as cross-correlation. It is found that while cross-correlations accelerate the relaxation of certain pseudo pure states, they retard that of others.     

Experimental realization of decoherence-free subspace in neutron interferometry

A decoherence-free subspace (DFS) is an important class of quantum-error-correcting (QEC) codes that have been proposed for fault-tolerant quantum computation. The applications of QEC techniques, however, are not limited to quantum-information processing (QIP). Here we demonstrate how QEC codes may be used to improve experimental designs of quantum devices to achieve noise suppression. In particular, neutron interferometry is used as a test bed to show the potential for adding quantum error correction to quantum measurements. We built a five-blade neutron interferometer that incorporates both a standard Mach-Zender configuration and a configuration based on a DFS. Experiments verify that the DFS interferometer is protected against low-frequency mechanical vibrations. We anticipate these improvements will increase the range of applications for matter-wave interferometry.     

Structure of 2D Topological Stabilizer Codes

We provide a detailed study of the general structure of translationally invariant two-dimensional topological stabilizer quantum error correcting codes, including subsystem codes. We show that they can be understood in terms of the homology of string operators that carry a certain topological charge. In subsystem codes, two dual kinds of charges appear. We prove that two non-chiral codes are equivalent under local transformations iff they have isomorphic topological charges. Our approach emphasizes local properties over global ones.     

Low-overhead fault-tolerant error correction scheme based on quantum stabilizer codes

Fault-tolerant error-correction (FTEC) circuit is the foundation for achieving reliable quantum computation and remote communication. However, designing a fault-tolerant error correction scheme with a solid error-correction ability and low overhead remains a significant challenge. In this paper, a low-overhead fault-tolerant error correction scheme is proposed for quantum communication systems. Firstly, syndrome ancillas are prepared into Bell states to detect errors caused by channel noise. We propose a detection approach that reduces the propagation path of quantum gate fault and reduces the circuit depth by splitting the stabilizer generator into X-type and Z-type. Additionally, a syndrome extraction circuit is equipped with two flag qubits to detect quantum gate faults, which may also introduce errors into the code block during the error detection process. Finally, analytical results are provided to demonstrate the fault-tolerant performance of the proposed FTEC scheme with the lower overhead of the ancillary qubits and circuit depth.