Related papers: Efficient Quantum Polar Codes Requiring No Preshar…
We consider situations in which i) Alice wishes to send quantum information to Bob via a noisy quantum channel, ii) Alice has a classical description of the states she wishes to send and iii) Alice can make use of a finite amount of…
We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and…
We investigate a scheme for implementing quantum dense coding via atomic ensembles, where prior distribution of the quantum entangled state is not needed. Our scheme also combines another two distinct advantages: atomic ensembles qubits…
Quantum resources enable secure quantum sensing (SQS) of remote systems, offering significant advantages in precision and security. However, decoherence in the quantum communication channel and during the evolution of quantum states can…
Quantum error correcting codes (QECCs) are the means of choice whenever quantum systems suffer errors, e.g., due to imperfect devices, environments, or faulty channels. By now, a plethora of families of codes is known, but there is no…
In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that can tolerate a high level of…
Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the…
We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to $N$ receivers who could only decode…
Dense coding is arguably the protocol that launched the field of quantum communication. Today, however, more than a decade after its initial experimental realization, the channel capacity remains fundamentally limited as conceived for…
The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum…
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be…
Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the…
In this paper, we propose a Polar coding scheme for parallel Gaussian channels. The encoder knows the sum rate of the parallel channels but does not know the rate of any channel. By using the nesting property of Polar code, we design a…
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…
Classically, coding theory has been concerned with the problem of transmitting a single message in a format which is robust to noise. Recently, researchers have turned their attention to designing coding schemes to make two-way…
In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the…
This paper presents a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. One of the key ingredients used to resist eavesdropping in this scheme is to depolarize all Pauli…
Quantum cryptography via key distribution mechanisms that utilize quantum entanglement between sender-receiver pairs will form the basis of future large-scale quantum networks. A key engineering challenge in such networks will be the…
An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, finite alphabet decoding performs concatenated compression operations on the…
A potential implementation of quantum-information schemes in semiconductor nanostructures is studied. To this end, the formal theory of quantum encoding for avoiding errors is recalled and the existence of noiseless states for model systems…