量子Generalized Reed-Solomon码

构造出了一族量子纠错码,这族码具有参数［［n,n-2k,k+1］］_q,是q维量子系统上的码,q是任意素数的幂.这族码的最小距离达到了理论上限,因此,以码距来说,它是最优的.证明了当2≤n≤q或者q²-q+2≤n≤q²时,码都是存在的. 关键词： 量子Generalized Reed-Solomon码 量子MDS码 量子纠错码 量子信息     

一类基于级联结构的量子好码

借助经典级联码的思想，详细阐述了通过适当选择量子码作为外码和内码，构造一般意义量子级联码的过程.在此基础上，通过选择量子RS码作为外码，一组特殊结构的量子码作为内码，具体构造出了一类量子级联码，证明了其是量子好码.在量子纠错码领域中，这是首次利用经典坏码构造出量子好码.     

量子稀疏图码的反馈式迭代译码

量子稀疏图码的译码可以由基于错误图样的和积译码算法来实现.本文在此基础上构建了一个新的反馈式迭代译码算法.其反馈策略不仅仅重新利用了错误图样,而且还利用了稳定子上相应元素的值和信道的错误模型.由此,本方法一方面可以克服传统的量子和积译码算法中遇到的所谓对称简并错误,另一方面还能反馈更多的有用信息到译码器中,帮助其产生有效的译码结果,大大提高译码器的译码能力.另外,本算法并没有增加量子测量的复杂度,而是对测量中所能获得的信息的更充分利用.     

量子Turbo码

量子纠错编码技术在量子通信和量子计算领域起着非常重要的作用.构造量子纠错编码的主要方法是借鉴经典纠错编码技术,目前几乎所有经典纠错编码方案都已经被移植到量子领域中来,然而在经典编码领域纠错性能最杰出的Turbo码却至今没有量子对应.提出了一种利用量子寄存器网络构造量子递归系统卷积码的简单实现方案,同时利用量子SWAP门设计了一种高效的量子交织器门组网络方案.最后仿照经典Turbo码的设计原理提出串行级联的量子Turbo码,同时提出了可行的译码方法.量子Turbo码不仅丰富了量子纠错码研究的领域,同时为解释 关键词： 量子递归系统卷积码 量子Turbo码 量子纠错编码 量子信息     

针对X-Z型Pauli信道的量子稀疏图码的反馈式和积译码算法

本文针对X-Z型Pauli量子信道构建了一个量子稀疏图码的反馈式和积译码算法.相比较之前的基本和积算法,该反馈式译码策略利用了错误图样的比较, 稳定子中相关元素的值,特别的还根据信道的特征充分考虑了各变量所占错误的比重,并由此来调整信息节点的概率分布.该反馈式策略起到了经典译码中的软判决技术的作用,不但克服了对称简并问题带来的不利影响,更重要的是还给译码器提供了更多的有效信息,从而大大提高了译码器的纠错译码能力.另外,反馈式译码和积译码算法是基于GF(4)的,大大拓展了和积译码器关于量子译码 关键词： 量子稀疏图码 和积算法 量子纠错码 量子信息     

加强的量子汉明限

通过研究具有相同重量的算子集合的性质,找到了任意维数纯量子稳定子码参数的新的解析上限.与目前所知最优的解析上限——著名的量子汉明限相比,本文提出的码限强于量子汉明限. 关键词： 量子汉明限 量子稳定子码 量子纠错码 量子信息     

差错基、量子码与群代数

本文找到了一种研究优质差错基和量子纠错码的新方法,即群代数方法, 它为差错基和量子码提供了一种代数表示. 利用这种代数表示, 建立了一系列关于最一般量子纠错码的线性规划限. 关键词： 群代数 差错基 量子纠错码 量子信息     

采用纠缠辅助量子LDPC码和检错重传策略的 量子直传通信方案

针对现有量子信息直传协议在有噪音量子信道下传输效率低及可靠性差的问题,提出了一种有效利用纠缠资源的量子安全直传通信方案.通过收发双方共享纠缠粒子作为辅助比特,采用纠缠辅助量子低密度校验码对量子态信息进行前向纠错保护,以提高系统在噪音环境下的传输可靠性.同时采用自动请求重传策略对量子态信息进行检错编码保护,当因窃听或强噪音导致译码获得的信息不正确时,则请求发端对该组信息进行编码重传操作.文中对所选用纠缠辅助量子低密度校验码在量子退极化噪音信道下的迭代译码性能进行了仿真,最后对方案的安全性进行了分析论证.     

采用纠缠辅助量子LDPC码和检错重传策略的量子直传通信方案

针对现有量子信息直传协议在有噪音量子信道下传输效率低及可靠性差的问题,提出了一种有效利用纠缠资源的量子安全直传通信方案.通过收发双方共享纠缠粒子作为辅助比特,采用纠缠辅助量子低密度校验码对量子态信息进行前向纠错保护,以提高系统在噪音环境下的传输可靠性.同时采用自动请求重传策略对量子态信息进行检错编码保护,当因窃听或强噪...     

量子Turbo乘积码

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

New Entanglement-Assisted Quantum MDS Codes Derived From Generalized Reed-Solomon Codes

International Journal of Theoretical Physics - Entanglement-assisted quantum error-correcting codes (abbreviate to EAQECCs) expand the usual paradigm of quantum error correction by allowing two...     

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.     

Allowable Generalized Quantum Gates

In this paper, we give the most general duality gates, or generalized quantum gates in duality quantum computers. Here we show by explicit construction that a n-bit duality quantum computer with d slits can be simulated perfectly with an ordinary quantum computer with n qubits and one auxiliary qudit. Using this model, we give the most general form of duality gates which is of the form ∑i=0^d-1piUi,and the pi ＇s are complex numbers with module less or equal to 1 and constrained by｜∑iPi｜≤1.     

A Generalized Quantum Theory

In quantum mechanics, the selfadjoint Hilbert space operators play a triple role as observables, generators of the dynamical groups and statistical operators defining the mixed states. One might expect that this is typical of Hilbert space quantum mechanics, but it is not. The same triple role occurs for the elements of a certain ordered Banach space in a much more general theory based upon quantum logics and a conditional probability calculus (which is a quantum logical model of the Lüders-von Neumann measurement process). It is shown how positive groups, automorphism groups, Lie algebras and statistical operators emerge from one major postulate—the non-existence of third-order interference [third-order interference and its impossibility in quantum mechanics were discovered by Sorkin (Mod Phys Lett A 9:3119–3127, 1994)]. This again underlines the power of the combination of the conditional probability calculus with the postulate that there is no third-order interference. In two earlier papers, its impact on contextuality and nonlocality had already been revealed.     

Generalized Quantum Two-Qutrit-State Splitting

A three-party scheme for splitting an arbitrary unknown two-qutrit state is proposed, where two nonmaximally-entangled three-qutrit states are taken as the quantum channel among three parties. With the sender＇s help, if and only if both receivers collaborate together, they can securely share the quantum state in a probabilistic way by introducing an ancilla qutrit and performing appropriate unitary operations. The relation between the success probability and coefficients characterizing the quantum channel is revealed. The security of the present scheme is analyzed and confirmed. Moreover, the generalization of the three-party scheme to more-party case is also sketched.     

Generalized Quantum Two-Qutrit-State Splitting

A three-party scheme for splitting an arbitrary unknown two-qutrit state is proposed, where two non-maximally-entangled three-qutrit states are taken as the quantum channel among three parties. With the sender's help, if and only if both receivers collaborate together, they can securely share the quantum state in a probabilistic way by introducing an ancilla qutrit and performing appropriate unitary operations. The relation between the success probability and coefficients characterizing the quantum channel is revealed. The security of the present scheme is analyzed and confirmed. Moreover, the generalization of the three-party scheme to more-party case is also sketched.     

Quantum quasi-cyclic low-density parity-check error-correcting codes

Due to the fault of the author(s) of the article entitled “Quantum quasi-cyclic low-density parity-check error-correcting codes”, published inChinese PhysicsB, 2009, Vol. 18, Issue 10, pp 4154--4160, has been found to partly copy from the articlearXiv:quant-ph/0701020v2on the arXiv preprint. So the above article inChinese PhysicsB has been withdrawn from the publication. [2 February 2010]