In terms of reflection transformation of a matrix product state （MPS）, the parity of the MPS is defined. Based on the reflective parity non-conserved MPS pair we construct the even-parity state ｜ψe〉 and the odd-p...In terms of reflection transformation of a matrix product state （MPS）, the parity of the MPS is defined. Based on the reflective parity non-conserved MPS pair we construct the even-parity state ｜ψe〉 and the odd-parity state ｜ψσ〉. It is interesting to find that the parity non-conserved reflective MPS pair have no long-range correlations; instead the even-parity state ｜ψe〉 and the odd-parity state ｜ψo〉 constructed from them have the same long-range correlations for the parity non-conserved block operators. Moreover, the entanglement between a block of n contiguous spins and the rest of the spin chain for the states ｜ψe〉 and ｜ψo〉 is larger than that for the reflective MPS pair except for n = 1, and the difference of them approaches 1 monotonically and asymptotically from 0 as n increases from 1. These characteristics indicate that MPS parity as a conserved physical quantity represents a kind of coherent collective quantum mode, and that the parity conserved MPSs contain more correlation, coherence, and entanglement than the parity non-conserved ones.展开更多
We investigate entanglement of assistance without and with decoherence using a local non-Hermitian operation, i.e.,parity–time(PT) symmetric operation. First we give the explicit expressions of entanglement of assist...We investigate entanglement of assistance without and with decoherence using a local non-Hermitian operation, i.e.,parity–time(PT) symmetric operation. First we give the explicit expressions of entanglement of assistance for a general W-like state of a three-qubit system under a local parity–time symmetric operation. Then for a famous W state without decoherence, we find that entanglement of assistance shared by two parties can be obviously enhanced with the assistance of the third party by a local parity–time symmetric operation. For the decoherence case, we provide two schemes to show the effects of local parity–time symmetric operation on improvement of entanglement of assistance against amplitude damping noise. We find that for the larger amplitude damping case the scheme of PT symmetric operation performed on one of two parties with the influence of noise is superior to that of PT symmetric operation performed on the third party without the influence of noise in suppressing amplitude damping noise. However, for the smaller amplitude damping case the opposite result is given. The obtained results imply that the local PT symmetric operation method may have potential applications in quantum decoherence control.展开更多
In this paper, a novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization is proposed for regularly structured low density parity-check(LDPC) codes. A weighted measure is intr...In this paper, a novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization is proposed for regularly structured low density parity-check(LDPC) codes. A weighted measure is introduced for each check-sum of the parity-check matrix and a scaling factor is used to weaken the overestimation of extrinsic information. Furthermore, the updating process of the reliability measure takes advantage of turbo-like iterative decoding strategy. The main computational complexity of the proposed algorithm only includes logical and integer operations with the bit uniform quantization criterion. Simulation results show that the novel decoding algorithm can achieve excellent error-correction performance and a fast decoding convergence speed.展开更多
A family of array codes with a maximum distance separable（MDS） property, named L codes, is proposed. The greatest strength of L codes is that the number of rows（columns） in a disk array does not be restricted by t...A family of array codes with a maximum distance separable（MDS） property, named L codes, is proposed. The greatest strength of L codes is that the number of rows（columns） in a disk array does not be restricted by the prime number, and more disks can be dynamically appended in a running storage system. L codes can tolerate at least two disk erasures and some sector loss simultaneously, and can tolerate multiple disk erasures（greater than or equal to three） under a certain condition. Because only XOR operations are needed in the process of encoding and decoding, L codes have very high computing efficiency which is roughly equivalent to X codes. Analysis shows that L codes are particularly suitable for large-scale storage systems.展开更多
基金Supported by the Scientific Research Foundation of CUIT under Grant No.KYTZ201024the National Natural Science Foundation of China under Grant Nos.10775100,10974137 the Fund of Theoretical Nuclear Center of HIRFL of China
文摘In terms of reflection transformation of a matrix product state （MPS）, the parity of the MPS is defined. Based on the reflective parity non-conserved MPS pair we construct the even-parity state ｜ψe〉 and the odd-parity state ｜ψσ〉. It is interesting to find that the parity non-conserved reflective MPS pair have no long-range correlations; instead the even-parity state ｜ψe〉 and the odd-parity state ｜ψo〉 constructed from them have the same long-range correlations for the parity non-conserved block operators. Moreover, the entanglement between a block of n contiguous spins and the rest of the spin chain for the states ｜ψe〉 and ｜ψo〉 is larger than that for the reflective MPS pair except for n = 1, and the difference of them approaches 1 monotonically and asymptotically from 0 as n increases from 1. These characteristics indicate that MPS parity as a conserved physical quantity represents a kind of coherent collective quantum mode, and that the parity conserved MPSs contain more correlation, coherence, and entanglement than the parity non-conserved ones.
基金Project supported by China Postdoctoral Science Foundation(Grant No.2017M622582)the Natural Science Foundation of Hunan Province of China(Grant No.2015JJ3092)+2 种基金the Research Foundation of Education Bureau of Hunan Province of China(Grant No.16B177)Applied Characteristic Disciplines in Hunan Province-Electronic Science and Technology of ChinaHunan-Provincial Key Laboratory of Photoelectric Information Integration and Optical Manufacturing Technology
文摘We investigate entanglement of assistance without and with decoherence using a local non-Hermitian operation, i.e.,parity–time(PT) symmetric operation. First we give the explicit expressions of entanglement of assistance for a general W-like state of a three-qubit system under a local parity–time symmetric operation. Then for a famous W state without decoherence, we find that entanglement of assistance shared by two parties can be obviously enhanced with the assistance of the third party by a local parity–time symmetric operation. For the decoherence case, we provide two schemes to show the effects of local parity–time symmetric operation on improvement of entanglement of assistance against amplitude damping noise. We find that for the larger amplitude damping case the scheme of PT symmetric operation performed on one of two parties with the influence of noise is superior to that of PT symmetric operation performed on the third party without the influence of noise in suppressing amplitude damping noise. However, for the smaller amplitude damping case the opposite result is given. The obtained results imply that the local PT symmetric operation method may have potential applications in quantum decoherence control.
基金supported by the National Natural Science Foundation of China(Nos.61472464,61671091 and 61471075)the Natural Science Foundation of Chongqing Science and Technology Commission(No.cstc2015jcyj A0554)+1 种基金the Program for Innovation Team Building at Institutions of Higher Education in Chongqing(No.J2013-46)the Undergraduate Science Research Training Project for Chongqing University of Posts and Telecommunications(No.A2016-61)
文摘In this paper, a novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization is proposed for regularly structured low density parity-check(LDPC) codes. A weighted measure is introduced for each check-sum of the parity-check matrix and a scaling factor is used to weaken the overestimation of extrinsic information. Furthermore, the updating process of the reliability measure takes advantage of turbo-like iterative decoding strategy. The main computational complexity of the proposed algorithm only includes logical and integer operations with the bit uniform quantization criterion. Simulation results show that the novel decoding algorithm can achieve excellent error-correction performance and a fast decoding convergence speed.
基金supported by the National Natural Science Foundation of China under Grant No.61202250
文摘A family of array codes with a maximum distance separable（MDS） property, named L codes, is proposed. The greatest strength of L codes is that the number of rows（columns） in a disk array does not be restricted by the prime number, and more disks can be dynamically appended in a running storage system. L codes can tolerate at least two disk erasures and some sector loss simultaneously, and can tolerate multiple disk erasures（greater than or equal to three） under a certain condition. Because only XOR operations are needed in the process of encoding and decoding, L codes have very high computing efficiency which is roughly equivalent to X codes. Analysis shows that L codes are particularly suitable for large-scale storage systems.
