Related papers: A Construction of Quantum Codes via A Class of Cla…
We propose constructive approaches for the optimization of binary classical communication over a general noisy qubit quantum channel, for both the error probability and the classical capacity functionals. After showing that the optimal…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
Recently, Lin and Pryadko presented the quantum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a…
This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…
One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains. The ability of quantum computers to scale computations exponentially imply better…
This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS for short) codes. These codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal…
Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated…
In this paper, we introduce a new family of stabilizer quantum LDPC codes derived from the classical linear codes $L_k$ and $L_k^{+}$, defined via sub-exceding functions. In previous work, these codes demonstrated strong performance in…
In this study, we investigate the construction of quantum CSS duadic codes with dimensions greater than one. We introduce a method for extending smaller splittings of quantum duadic codes to create larger, potentially degenerate quantum…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…
Toric varieties and their associated toric codes, as well as determination of their parameters with intersection theory, are presented in the two dimensional case. Linear Secret Sharing Schemes with strong multiplication are constructed…
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…
Classical program analysis techniques, such as abstract interpretation and symbolic execution, are essential for ensuring software correctness, optimizing performance, and enabling compiler optimizations. However, these techniques face…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
Neural networks are being used to improve the probing of the state spaces of many particle systems as approximations to wavefunctions and in order to avoid the recurring sign problem of quantum monte-carlo. One may ask whether the usual…
Machine Learning classification models learn the relation between input as features and output as a class in order to predict the class for the new given input. Quantum Mechanics (QM) has already shown its effectiveness in many fields and…