相关论文: On Shor's conjecture on the accessible information…
Braunstein and Caves (1994) proposed to use Helstrom's {\em quantum information} number to define, meaningfully, a metric on the set of all possible states of a given quantum system. They showed that the quantum information is nothing else…
Quantum decision theory is introduced here, and new basis for this theory is proposed. It is first based upon the author's general arguments for the Hilbert space formalism in quantum theory, next on arguments for the Born rule, that is,…
We consider probabilistic theories in which the most elementary system, a two-dimensional system, contains one bit of information. The bit is assumed to be contained in any complete set of mutually complementary measurements. The…
In this paper, two conjectures which were proposed in [Phys. Rev. A \textbf{82}, 052122(2010)] on the correlations in a bipartite state $\rho^{AB}$ are studied. If the mutual information $I\Pa{\rho^{AB}}$ between two quantum systems $A$ and…
In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures…
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the…
Realist, no-collapse interpretations of quantum mechanics, such as Everett's, face the probability problem: how to justify the norm-squared (Born) rule from the wavefunction alone. While any basis-independent measure can only be…
A new kind of duality has been proposed by Carr related to the quantum description of black holes, the so-called Compton/Schwarzschild duality \cite{Carr:2015nqa}. In this context, a new form for a Generalized Uncertainty Principle has…
Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding…
Quantum theory has evolved from a set of provisional rules to an indispensable framework that underlies much of modern technology and infrastructure. Yet, after a century, Born's probability postulate remains at odds with the theory's…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
"Bounds on information combining" are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in…
We derive the probabilities of measurement results from Schroedinger's equation plus a definition of macroscopic as a particular kind of thermodynamic limit. Bohr's insight that a measurement apparatus must be classical in nature and…
While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the…
Irreversibility in quantum measurements is considered from the point of quantum information theory. For that purpose the information transfer between the measured object S and measuring system O is analyzed. It's found that due to the…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
Niels Bohr proposed that the outcome of the measurement becomes objective and real, and, hence, classical, when its results can be communicated by classical means. In this work we revisit Bohr's postulate using modern tools from the quantum…
Shor's factoring algorithm provides a super-polynomial speed-up over all known classical factoring algorithms. Here, we address the question of which quantum properties fuel this advantage. We investigate a sequential variant of Shor's…
Classical and quantum information theory are simply explained. To be more specific it is clarified why Shannon entropy is used as measure of classical information and after a brief review of quantum mechanics it is possible to demonstrate…
The transition from classical to quantum mechanics rests on the recognition that the structure of information is not what we thought it was: there are operational, i.e., phenomenal, probabilistic correlations that lie outside the polytope…