相关论文: Improved Quantum Information Set Decoding
Quantum information scrambling is a unitary process that destroys local correlations and spreads information throughout the system, effectively hiding it in nonlocal degrees of freedom. In principle, unscrambling this information is…
In this paper, we consider the problem of iterative detection and decoding (IDD) for multi-antenna systems using low-density parity-check (LDPC) codes. The proposed IDD system consists of a soft-input soft-output parallel interference (PIC)…
In this paper we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local…
Quantum computing promises to improve the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than…
We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-check (qLDPC) code and fault-tolerant quantum circuits. DTDs…
Efficient decoding to estimate error locations from outcomes of syndrome measurement is the prerequisite for quantum error correction. Decoding in presence of circuit-level noise including measurement errors should be considered in case of…
Quantum Key Distribution (QKD) protocols enable two distant parties to communicate with information-theoretically proven secrecy. However, these protocols are generally vulnerable to potential mismatches between the physical modeling and…
Information is encoded in a qubit in the form of its Bloch vector. In this paper, we propose protocols for remote transfers of information in a known and an unknown qubit to qudits using $SU(2)$- invariant $\frac{1}{2}\otimes S$ discordant…
Atomic systems, ranging from trapped ions to ultracold and Rydberg atoms, offer unprecedented control over both internal and external degrees of freedom at the single-particle level. They are considered among the foremost candidates for…
Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial…
We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…
Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes…
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a…
In the original BB84 protocol by Bennett and Brassard, an eavesdropper is detected because his attempts to intercept information result in a quantum bit error rate (QBER) of at least 25%. Here we design an alternative quantum key…
The potential impact of quantum machine learning algorithms on industrial applications remains an exciting open question. Conventional methods for encoding classical data into quantum computers are not only too costly for a potential…
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…
Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are…
This paper presents a joint typicality framework for encoding and decoding nested linear codes for multi-user networks. This framework provides a new perspective on compute-forward within the context of discrete memoryless networks. In…
We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length $tk$ and dimension $k$ is called a complementary information set code of order $t$ ($t$-CIS code for short) if it has $t$ pairwise…
We study a quantum stochastic neural network (QSNN) based on quantum stochastic walks on a graph, and use gradient descent to update the network parameters. We apply a toy model of QSNN with a few neurons to the problems of function…