Evaluation of the Hamming weights of a class of linear codes based on Gauss sums

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems

A construction of qq-ary linear codes with two weights

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight distributions of the linear codes are determined in some cases based on Gauss sums. It is interesting that our construction can produce optimal or almost optimal codes. Furthermore, we show that our codes can be used to construct secret sharing schemes with interesting access structures and strongly regular graphs with new parameters.Comment: 19 page

Several classes of cyclic codes with either optimal three weights or a few weights

Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction of cyclic codes. As applications, we obtain a class of optimal three-weight codes achieving the Griesmer bound, which generalizes a Vega's result in \cite{V1}, and several classes of cyclic codes with only a few weights, which solve the open problem in \cite{V1}.Comment: 24 page

Boundary Kondo impurities in the generalized supersymmetric t-J model

We study the generalized supersymmetric t-J model with Kondo impurities in the boundaries. We first construct the higher spin operator K-matrix for the XXZ Heisenberg chain. Setting the boundary parameter to be a special value, we find a higher spin reflecting K-matrix for the supersymmetric t-J model. By using the Quantum Inverse Scattering Method, we obtain the eigenvalue and the corresponding Bethe ansatz equations.Comment: Latex file, 18 page

Cryptanalysis and improvement of a quantum-communication-based online shopping mechanism

Recently, Chou et al. [Electron Commer Res, DOI 10.1007/s10660-014-9143-6] presented a novel controlled quantum secure direct communication protocol which can be used for online shopping. The authors claimed that their protocol was immune to the attacks from both external eavesdropper and internal betrayer. However, we find that this protocol is vulnerable to the attack from internal betrayer. In this paper, we analyze the security of this protocol to show that the controller in this protocol is able to eavesdrop the secret information of the sender (i.e., the customer's shopping information), which indicates that it cannot be used for secure online shopping as the authors expected. Moreover, an improvement to resist the controller's attack is proposed.Comment: 9 page

Quantum Metrology via Repeated Quantum Nondemolition Measurements in "Photon Box"

In quantum metrology schemes, one generally needs to prepare $m$ copies of $N$ entangled particles, such as entangled photon states, and then they are detected in a destructive process to estimate an unknown parameter. Here, we present a novel experimental scheme for estimating this parameter by using repeated indirect quantum nondemolition measurements in the setup called "photon box". This interaction-based scheme is able to achieve the phase sensitivity scaling as $1/N$ with a Fock state of $N$ photons. Moreover, we only need to prepare one initial $N$-photon state and it can be used repetitively for $m$ trials of measurements. This new scheme is shown to sustain the quantum advantage for a much longer time than the damping time of Fock state and be more robust than the common strategy with exotic entangled states. To overcome the $2\pi/N$ periodic error in the estimation of the true parameter, we can employ a cascaded strategy by adding a real-time feedback interferometric layout.Comment: 5 pages, 3 figure

Quantum-enhanced metrology for multiple phase estimation with noise

We present a general framework to study the simultaneous estimation of multiple phases in the presence of noise as a discretized model for phase imaging. This approach can lead to nontrivial bounds of the precision for multiphase estimation. Our results show that simultaneous estimation (SE) of multiple phases is always better than individual estimation (IE) of each phase even in noisy environment. However with $d$ being the number of phases, the $O(d)$ advantage in the variance of the estimation, with which SE outperforms IE schemes for noiseless processes, may disappear asymptotically. When noise is low, those bounds recover the Heisenberg scale with the $O(d)$ advantage. The utility of the bound of multiple phase estimation for photon loss channels is exemplified.Comment: 9 pages, 2 figure

Genuine Correlations of Tripartite System

We define genuine total, classical and quantum correlations in tripartite systems. The measure we propose is based on the idea that genuine tripartite correlation exists if and only if the correlation between any bipartition does not vanish. We find in a symmetrical tripartite state, for total correlation and classical correlation, the genuine tripartite correlations are no less than pair-wise correlations. However, the genuine quantum tripartite correlation can be surpassed by the pair-wise quantum correlations. Analytical expressions for genuine tripartite correlations are obtained for pure states and rank-2 symmetrical states. The genuine correlations in both entangled and separable states are calculated.Comment: 5 pages, 3 figure

Darboux Transformation and Variable Separation Approach: the Nizhnik-Novikov-Veselov equation

Darboux transformation is developed to systematically find variable separation solutions for the Nizhnik-Novikov-Veselov equation. Starting from a seed solution with some arbitrary functions, the once Darboux transformation yields the variable separable solutions which can be obtained from the truncated Painlev\'e analysis and the twice Darboux transformation leads to some new variable separable solutions which are the generalization of the known results obtained by using a guess ansatz to solve the generalized trilinear equation.Comment: 12 pages, 6 figure

Sudden Change of Quantum Discord under Single Qubit Noise

We show that the sudden change of quantum correlation can occur even when only one part of the composite entangled state is exposed to a noisy environment. Our results are illustrated through the action of different noisy environments individually on a single qubit of quantum system. Composite noise on the whole of the quantum system is thus not the necessarily condition for the occurrence of sudden transition for quantum correlation.Comment: 6 pages, 4 figure