In this paper, we investigate the use of quaternary reliability statisti...
We address the maximum size of binary codes and binary constant weight c...
We study the maximum cardinality problem of a set of few distances in th...
We study the upper bounds for A(n,d), the maximum size of codewords with...
While quantum weight enumerators establish some of the best upper bounds...
In this paper, we study the problem of learning quantum circuits of a ce...
Quantum information needs to be protected by quantum error-correcting co...
A stabilizer code over GF(q=2^l) corresponds to a classical additive cod...
Codes based on sparse matrices have good performance and can be efficien...
Quantum error correction is necessary to protect logical quantum states ...
Quantum stabilizer codes constructed from sparse matrices have good
perf...
Given that approximate quantum error-correcting (AQEC) codes have a
pote...
Near-term quantum computers are likely to have small depths due to short...
Performing active quantum error correction to protect fragile quantum st...
A quantum network, which involves multiple parties pinging each other wi...
The famous Shannon impossibility result says that any encryption scheme ...