Search

Entanglement-assisted quantum error-correcting codes expand the usual paradigm of quantum error correction by allowing two parties to make use of pre-shared entanglement. This entanglement can increase either the rate of communication or the number of correctable errors. By employing generalized Reed–Solomon codes, we construct several classes of entanglement-assisted quantum maximum distance separable (EAQMDS) codes in this paper. Consequently, the results show that many of these EAQMDS codes have much larger minimum distance than ones available in the literature. Meanwhile, some of these EAQMDS codes are new in the sense that the parameters of these codes are not covered by the previously known ones, whose required number of maximally entangled states is more flexible. [ABSTRACT FROM AUTHOR]

We present new applications of q-binomials, also known as Gaussian binomial coefficients. Our main theorems determine cardinalities of certain error-correcting codes based on Varshamov–Tenengolts codes and prove a curious phenomenon relating to deletion spheres. [ABSTRACT FROM AUTHOR]

Entanglement-assisted quantum error-correcting codes (abbreviate to EAQECCs) expand the usual paradigm of quantum error correction by allowing two parties to make use of pre-shared entanglement. It is well-known that we can construct an EAQECC from arbitrary classical linear code. In this paper, we construct several classes of entanglement-assisted quantum MDS (EAQMDS) codes by utilizing generalized Reed-Solomon (GRS) codes. The main contribution of the paper is extend the code length of EAQMDS in the literature (Guo et al. 2019). Consequently, the results show that almost all of these EAQMDS codes are new in the sense that the parameters of these codes are not covered by the previously known ones. [ABSTRACT FROM AUTHOR]

We first show that a class of operators acting on a given bipartite pure state on ℋA ⊗ ℋB can shrink its supports on ℋA ⊗ ℋB to only ℋA or ℋB while keeping its mappings. Using this result, we show how to systematically construct the decoders of the quantum error-correcting codes against erasure errors. The implications of the results for the operator dictionary in the AdS/CFT correspondence are also discussed. The "sub- algebra code with complementary recovery" introduced in the recent work of Harlow is a quantum error-correcting code that shares many common features with the AdS/CFT correspondence. We consider it under the restriction of the bulk (logical) Hilbert space to a subspace that generally has no tensor factorization into subsystems. In this code, the central operators of the reconstructed algebra on the boundary subregion can emerge as a consequence of the restriction of the bulk Hilbert space. Finally, we show a theorem in this code which implies the validity of not only the entanglement wedge reconstruction but also its converse statement with the central operators. [ABSTRACT FROM AUTHOR]

In order to protect the privacy of query users and databases, a quantum private query protocol under noisy conditions is proposed and studied. It is a one-way quantum protocol that not only protects user privacy, but also prevents eavesdropping. And in the protocol initialization phase, the identity is verified by the quantum entanglement pair. Through key distribution, a user only knows a part of the key, and the accuracy of the original key needs to be considered. Channel noise directly affects the transmission result of quantum bits and reduces the transmission accuracy. In addition, the presence of eavesdropper Eve may also affect the transmission of qubits. The receiver corrects the error by using quantum error correction technology, thereby improving the efficiency of protocol communication. [ABSTRACT FROM AUTHOR]

The cryptographic robustness of quantum key distribution (QKD) with phase–time coding against a photon number splitting (PNS) attack is analyzed. The line length up to which a secret key distribution is guaranteed is determined both by the protocol itself and by the efficiency of error correction in raw keys. The effect of different parameters of avalanche single-photon detectors on the length of the secret key distribution line is investigated. To correct errors, various versions of low-density parity-check (LDPC) codes are considered whose efficiency today is the closest to the Shannon theoretical limit. [ABSTRACT FROM AUTHOR]

The pace of development of the microelectronic industry and the progress in the development of computer-aided design tools make problems associated with the development of combinational circuits that are resistant to short self-clearing faults relevant again. These faults occur due to a combination of many different factors, such as extreme operating conditions and transition to nanometer design standards. Structural redundancy methods are often used to solve this problem by the principles of the noiseless coding theory to protect information during its transmission over communication channels. However, these methods have a significant drawback, i.e., large structural redundancy. In this paper, we propose to use an approach based on the synthesis of fault-tolerant combinational circuits based on the spectral R-code to solve the problem of developing fault tolerant combinational circuits. If a specific part of the coder is protected using special technological means, this code can correct a single-bit error and detect a double-bit error. The resulting circuit has less structural redundancy compared to the traditional method of triple modular redundancy (TMR). An approach is also proposed based on partitioning circuit outputs into groups followed by synthesizing fault-tolerant combinational circuits based on the R-code, which increases the probability of error detection/correction, to minimize the probability of multiple-bit errors within a combinational circuit. The paper presents the results of a series of numerical experiments that show the efficiency of the proposed approaches. [ABSTRACT FROM AUTHOR]

We propose a new structure of a self-checking combinational device where, based on the properties of parity and Berger codes, as well as a code with the detection of all double errors in information vectors, the problem of detecting all single faults of logical elements can be solved without transforming the structure of the source device. The properties of binary codes with the detection of all double errors that can be used in constructing the proposed structure are considered. We give an example of constructing a new structure. [ABSTRACT FROM AUTHOR]

Two families of new asymmetric quantum codes are constructed in this paper. The first family is the asymmetric quantum codes with length $$n=q^{m}-1$$ over $$F_{q}$$ , where $$q\ge 5$$ is a prime power. The second one is the asymmetric quantum codes with length $$n=3^{m}-1$$ . These asymmetric quantum codes are derived from the CSS construction and pairs of nested BCH codes. Moreover, let the defining set $$T_{1}=T_{2}^{-q}$$ , then the real Z-distance of our asymmetric quantum codes are much larger than $$\delta _\mathrm{max}+1$$ , where $$\delta _\mathrm{max}$$ is the maximal designed distance of dual-containing narrow-sense BCH code, and the parameters presented here have better than the ones available in the literature. [ABSTRACT FROM AUTHOR]

We propose a method for improving noise immunity in data transmission channels for telemetry information systems by providing double byte data error correction with minimal time delay. [ABSTRACT FROM AUTHOR]

As the technology scales down, shrinking geometry and layout dimension, on- chip interconnects are exposed to different noise sources such as crosstalk coupling, supply voltage fluctuation and temperature variation that cause random and burst errors. These errors affect the reliability of the on-chip interconnects. Hence, error correction codes integrated with noise reduction techniques are incorporated to make the on-chip interconnects robust against errors. The proposed error correction code uses triplication error correction scheme as crosstalk avoidance code (CAC) and a parity bit is added to it to enhance the error correction capability. The proposed error correction code corrects all the error patterns of one bit error, two bit errors. The proposed code also corrects 7 out of 10 possible three bit error patterns and detects burst errors of three. Hybrid Automatic Repeat Request (HARQ) system is employed when burst errors of three occurs. The performance of the proposed codec is evaluated for residual flit error rate, codec area, power, delay, average flit latency and link energy consumption. The proposed codec achieves four magnitude order of low residual flit error rate and link energy minimization of over 53 % compared to other existing error correction schemes. Besides the low residual flit error rate, and link energy minimization, the proposed codec also achieves up to 4.2 % less area and up to 6 % less codec power consumption compared to other error correction codes. The less codec area, codec power consumption, low link energy and low residual flit error rate make the proposed code appropriate for on chip interconnection link. [ABSTRACT FROM AUTHOR]

Two error correction schemes are proposed for word-oriented binary memories that can be affected by erasures, i.e. errors with known location but unknown value. The erasures considered here are due to the drifting of the electrical parameter used to encode information outside the normal ranges associated to a logic 0 or a logic 1 value. For example, a dielectric breakdown in a magnetic memory cell may reduce its electrical resistance sensibly below the levels which correspond to logic 0 and logic 1 values stored in healthy memory cells. Such deviations can be sensed during memory read operations and the acquired information can be used to boost the correction capability of an error-correcting code (ECC). The proposed schemes enable the correction of double-bit errors based on the combination of erasure information with single-bit error correction and double-bit error detection (SEC-DED) codes or shortened (SEC) codes. The correction of single-bit errors is always guaranteed. Ways to increase the number of double-bit and triple-bit errors that can be detected by shortened SEC and SEC-DED codes are considered in order to augment the error correction capability of the proposed solutions. [ABSTRACT FROM AUTHOR]