arXiv subjects

Santosh Kumar

Publications and source records attributed to Santosh Kumar.

119 records · Page 7Linked to original sources

arXiv2013

Query Processing Performance and Searching Over Encrypted Data By Using An Efficient Algorithm

Data is the central asset of today's dynamically operating organization and their business. This data is usually stored in database. A major consideration is applied on the security of that data from the unauthorized access and intruders. Data encryption is a strong option for security of data in database and especially in those organizations where security risks are high. But there is a potential disadvantage of performance degradation. When we apply encryption on database then we should compromise between the security and efficient query processing. The work of this paper tries to fill this gap. It allows the users to query over the encrypted column directly without decrypting all the records. It's improves the performance of the system. The proposed algorithm works well in the case of range and fuzzy match queries.

cs.DB↗

arXiv2013

Distribution of Scattering Matrix Elements in Quantum Chaotic Scattering

Scattering is an important phenomenon which is observed in systems ranging from the micro- to macroscale. In the context of nuclear reaction theory the Heidelberg approach was proposed and later demonstrated to be applicable to many chaotic scattering systems. To model the universal properties, stochasticity is introduced to the scattering matrix on the level of the Hamiltonian by using random matrices. A long-standing problem was the computation of the distribution of the off-diagonal scattering-matrix elements. We report here an exact solution to this problem and present analytical results for systems with preserved and with violated time-reversal invariance. Our derivation is based on a new variant of the supersymmetry method. We also validate our results with scattering data obtained from experiments with microwave billiards.

cond-mat.stat-mech↗

arXiv2013

Random matrix ensembles: Wang-Landau algorithm for spectral densities

We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to simultaneously investigate the thermodynamic properties. This approach is a powerful alternative to the conventionally used Monte Carlo simulations based on the Boltzmann sampling, and is ideally suited for investigating beta-ensembles.

cond-mat.stat-mech↗

arXiv2012

Quantum processing by adiabatic transfer through a manifold of dark states

We consider a network whose nodes are electromagnetic cavities, each coupled to a single three-level atom. The nodes are connected by optical fibers. Each atom is addressed by a control laser, which along with the cavity field drives atomic transitions. The network can be in the form of chain or two and three dimensional arrays of $N$-cavities connected by $N_B$ fibers. Following the work on two-cavity system by Pellizzari, we find that under certain conditions, the system possesses two kinds of dark states. The first kind are $N$ states corresponding to atomic excitations at each node and these are our logical states for quantum processing. The second kind are $N_B$ degenerate dark states on pairs of sites connected by a fibre. By manipulating intensities and phases of control lasers on the cavities, one can pass adiabatically among these dark states due to their degeneracy. This network operates as a $N$-level quantum system in which one can generate computationally useful states by protocols of external controls. We obtain numerical results for small chains and lattices to demonstrate some quantum operations like the transport of states across the array, generation of W-states and Fourier-like states. We also discuss effects of dissipation and limitations of the model.

quant-ph↗

arXiv2011

Entanglement in random pure states: Spectral density and average von Neumann entropy

Quantum entanglement plays a crucial role in quantum information, quantum teleportation and quantum computation. The information about the entanglement content between subsystems of the composite system is encoded in the Schmidt eigenvalues. We derive here closed expressions for the spectral density of Schmidt eigenvalues for all three invariant classes of random matrix ensembles. We also obtain exact results for average von Neumann entropy. We find that maximum average entanglement is achieved if the system belongs to the symplectic invariant class.

cond-mat.stat-mech↗

arXiv2011

Universal Spectral Correlations in Orthogonal-Unitary and Symplectic-Unitary Crossover Ensembles of Random Matrices

Orthogonal - unitary and symplectic - unitary crossover ensembles of random matrices are relevant in many contexts, especially in the study of time reversal symmetry breaking in quantum chaotic systems. Using skew-orthogonal polynomials we show that the same generic form of n-level correlation functions are obtained for the Jacobi family of crossover ensembles, including the Laguerre and Gaussian cases. For large matrices we find universal forms of unfolded correlation functions when expressed in terms of a rescaled transition parameter with arbitrary initial level density.

math-ph↗

arXiv2011

Conductance Distributions in Chaotic Mesoscopic Cavities

We consider the conductance distributions in chaotic mesoscopic cavities for all three invariant classes of random matrices for the arbitrary number of channels N1, N2 in the connecting leads. We show that the Laplace transforms of the distributions can be expressed in terms of determinants in the unitary case and Pfaffians in the orthogonal and symplectic cases. The inverse Laplace transforms then give the exact distributions. This formalism is particularly useful for small values of N = min (N1, N2), and thus is of direct experimental relevance. We also obtain the conductance distributions for orthogonal-unitary and symplectic-unitary crossover ensembles.

cond-mat.mes-hall↗

arXiv2011

Jacobi Crossover Ensembles of Random Matrices and Statistics of Transmission Eigenvalues

We study the transition in conductance properties of chaotic mesoscopic cavities as time-reversal symmetry is broken. We consider the Brownian motion model for transmission eigenvalues for both types of transitions, viz., orthogonal-unitary and symplectic-unitary crossovers depending on the presence or absence of spin-rotation symmetry of the electron. In both cases the crossover is governed by a Brownian motion parameter τ, which measures the extent of time-reversal symmetry breaking. It is shown that the results obtained correspond to the Jacobi crossover ensembles of random matrices. We derive the level density and the correlation functions of higher orders for the transmission eigenvalues. We also obtain the exact expressions for the average conductance, average shot-noise power and variance of conductance, as functions of τ, for arbitrary number of modes (channels) in the two leads connected to the cavity. Moreover, we give the asymptotic result for the variance of shot-noise power for both the crossovers, the exact results being too long. In the τ \rightarrow 0 and τ \rightarrow \infty limits the known results for the orthogonal (or symplectic) and unitary ensembles are reproduced. In the weak time-reversal symmetry breaking regime our results are shown to be in agreement with the semiclassical predictions.

cond-mat.stat-mech↗

arXiv2011

Random Matrix Model for Nakagami-Hoyt Fading

Random matrix model for the Nakagami-q (Hoyt) fading in multiple-input multiple-output (MIMO) communication channels with arbitrary number of transmitting and receiving antennas is considered. The joint probability density for the eigenvalues of H†H (or HH†), where H is the channel matrix, is shown to correspond to the Laguerre crossover ensemble of random matrices and is given in terms of a Pfaffian. Exact expression for the marginal density of eigenvalues is obtained as a series consisting of associated Laguerre polynomials. This is used to study the effect of fading on the Shannon channel capacity. Exact expressions for higher order density correlation functions are also given which can be used to study the distribution of channel capacity.

cs.IT↗

arXiv2011

Stage Staffing Scheme for Copyright Protection in Multimedia

Copyright protection has become a need in today's world. To achieve a secure copyright protection we embedded some information in images and videos and that image or video is called copyright protected. The embedded information can't be detected by human eye but some attacks and operations can tamper that information to breach protection. So in order to find a secure technique of copyright protection, we have analyzed image processing techniques i.e. Spatial Domain (Least Significant Bit (LSB)), Transform Domain (Discrete Cosine Transform (DCT)), Discrete Wavelet Transform (DWT) and there are numerous algorithm for watermarking using them. After having a good understanding of the same we have proposed a novel algorithm named as Stage Staffing Algorithm that generates results with high effectiveness, additionally we can use self extracted-watermark technique to increase the security and automate the process of watermark image. The proposed algorithm provides protection in three stages. We have implemented the algorithm and results of the simulations are shown. The various factors affecting spatial domain watermarking are also discussed.

cs.MM↗

arXiv2005

Nonbinary stabilizer codes over finite fields

One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. In past years, many good quantum error-correcting codes had been derived as binary stabilizer codes. Fault-tolerant quantum computation prompted the study of nonbinary quantum codes, but the theory of such codes is not as advanced as that of binary quantum codes. This paper describes the basic theory of stabilizer codes over finite fields. The relation between stabilizer codes and general quantum codes is clarified by introducing a Galois theory for these objects. A characterization of nonbinary stabilizer codes over GF(q) in terms of classical codes over GF(q^2) is provided that generalizes the well-known notion of additive codes over GF(4) of the binary case. This paper derives lower and upper bounds on the minimum distance of stabilizer codes, gives several code constructions, and derives numerous families of stabilizer codes, including quantum Hamming codes, quadratic residue codes, quantum Melas codes, quantum BCH codes, and quantum character codes. The puncturing theory by Rains is generalized to additive codes that are not necessarily pure. Bounds on the maximal length of maximum distance separable stabilizer codes are given. A discussion of open problems concludes this paper.

quant-ph↗