Related papers: Quantum Algorithm for SAT Problem and Quantum Mutu…
Quantum mechanics and information theory are among the most important scientific discoveries of the last century. Although these two areas initially developed separately it has emerged that they are in fact intimately related. In this…
The study of mutual entropy (information) and capacity in classica l system was extensively done after Shannon by several authors like Kolmogor ov and Gelfand. In quantum systems, there have been several definitions of t he mutual entropy…
There are important algorithms built upon a mixture of basic techniques described; for example, the Fast Fourier Transform (FFT) employs both Divide-and-Conquer and Transform-and-Conquer techniques. In this article, the evolution of a…
We address the problem of quantifying the information content of a source for an arbitrary information theory, where the information content is defined in terms of the asymptotic achievable compression rate. The functions that solve this…
A framework for a quantum mechanical information theory is introduced that is based entirely on density operators, and gives rise to a unified description of classical correlation and quantum entanglement. Unlike in classical (Shannon)…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
Currently, 'time' does not play any essential role in quantum information theory. In this sense, quantum information theory is underdeveloped similarly to how quantum physics was underdeveloped before Erwin Schrodinger introduced his famous…
Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor…
In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum…
Regarding the strange properties of quantum entropy and entanglement, e.g., the negative quantum conditional entropy, we revisited the foundations of quantum entropy, namely, von Neumann entropy, and raised the new method of quantum…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…
The information content of a source is defined in terms of the minimum number of bits needed to store the output of the source in a perfectly recoverable way. A similar definition can be given in the case of quantum sources, with qubits…
Quantum entropy is an important measure for describing the uncertainty of a quantum state, more uncertainty in subsystems implies stronger quantum entanglement between subsystems. Our goal in this work is to quantify bipartite entanglement…
A method of representing probabilistic aspects of quantum systems is introduced by means of a density function on the space of pure quantum states. In particular, a maximum entropy argument allows us to obtain a natural density function…
Information plays an important role in our understanding of the physical world. We hence propose an entropic measure of information for any physical theory that admits systems, states and measurements. In the quantum and classical world,…
In this paper, we show an interesting connection between a quantum sampling technique and quantum uncertainty. Namely, we use the quantum sampling technique, introduced by Bouman and Fehr, to derive a novel entropic uncertainty relation…
We live in the information age. Claude Shannon, as the father of the information age, gave us a theory of communications that quantified an "amount of information," but, as he pointed out, "no concept of information itself was defined."…
Quantum information theory, particularly its entropic formulations, has made remarkable strides in characterizing quantum systems and tasks. However, a critical dimension remains underexplored: computational efficiency. While classical…
The von Neumann entropy plays a vital role in quantum information theory. The von Neumann entropy determines, e.g., the capacities of quantum channels. Also, entropies of composite quantum systems are important for future quantum networks,…