arXiv subjects
Publications and source records attributed to Masanori Ohya.
We propose a new approach to define chaos in dynamical systems from the point of view of Information Dynamics. Observation of chaos in reality depends upon how to observe it, for instance, how to take the scale in space and time. Therefore it is natural to abandon taking several mathematical limiting procedures. We take account of them, and chaos degree previously introduced is redefined in this paper.
We propose a new approach to solve an NP complete problem by means of stochastic limit.
We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum Turing Machine. Our result suggests that halting scheme of Quantum Turing Machine and quantum complexity theory based upon the existing halting scheme sholud be reexamined.
Following the previous paper in which quantum teleportation is rig orously discussed with coherent entangled states given by beam splittings, we further discuss two types of models, perfect teleportation model and non-perfect teleportation model, in general scheme. Then the difference among several models, i.e., the perfect models and the non-perfect models, is studied. Our teleportation models are constructed by means of coherent states in some Fock space with counting measures, so that our model can be treated in the frame of usual optical communication.
Quantum entanglements, describing truly quantum couplings, are stu died and classified from the point of view of quantum compound states. We show that c lassical-quantum correspondences such as quantum encodings can be treated as d-entanglements leading to a special class of the separable compound states. The mutual information of the d-compound and entangled states lead to two di fferent types of entropies for a given quantum state: the von Neumann entrop y, which is achieved as the supremum of the information over all d-entanglem ents, and the dimensional entropy, which is achieved at the standard entangl ement, the true quantum entanglement, coinciding with a d-entanglement only in the commutative case. The q-capacity of a quantum noiseless channel, defi ned as the supremum over all entanglements, is given as the logarithm of the dimensionality of the input von Neumann algebra. It can double the classical capacity, achieved as the supremum over all semi-quantum couplings (d-entang lements, or encodings), which is bounded by the logarithm of the dimensional ity of a maximal Abelian subalgebra.
The mathematical structure of quantum entanglement is studied and classified from the point of view of quantum compound states. We show that t he classical-quantum correspondences such as encodings can be treated as dia gonal (d-) entanglements. The mutual entropy of the d-compound and entangled states lead to two different types of entropies for a given quantum state: t he von Neumann entropy, which is achieved as the supremum of the information over all d-entanglements, and the dimensional entropy, which is achieved at the standard entanglement, the true quantum entanglement, coinciding with a d-entanglement only in the case of pure marginal states. The q-capacity of a quantum noiseless channel, defined as the supremum over all entanglements, i s given by the logarithm of the dimensionality of the input algebra. It doub les the classical capacity, achieved as the supremum over all d-entanglement s (encodings), which is bounded by the logarithm of the dimensionality of a maximal Abelian subalgebra.
An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine the quantum computer with the chaotic dynamics amplifier based on the logistic map. We discuss a possible implementation of such a chaotic quantum computation by using the atomic quantum computer with quantum gates described by the Hartree-Fock equations. In this case, in principle, one can build not only standard linear quantum gates but also nonlinear gates and moreover they obey to Fermi statistics. This new type of entaglement related with Fermi statistics can be interesting also for quantum communication theory.
Quantum teleportation has been introduced by Benett et al. and dis cussed by a number of authors in the framework of the singlet state. Recentl y, a rigorous formulation of the teleportation problem of arbitrary quantum states by means of quantum channel was given in [IOS] based on the general c hannel theoretical formulation of the quantum gates introduced in [OW]. In t his note we discuss a generalization of the scheme proposed in [IOS] and we give a general method to solve the teleportation problem in spaces of arbitr ary finite dimensions.
Quantum teleportation is rigorously discussed with coherent entang led states given by beam splittings. The mathematical scheme of beam splitti ng has been used to study quantum communication and quantum stochastic. We d iscuss the teleportation process by means of coherent states in this scheme for the following two cases: (1) Delete the vacuum part from coherent states, whose compensation provides us a perfect teleportation from Alice to Bob. (2) Use fully realistic (physical) coherent states, which give s a non-perfect teleportation but shows that it is exact when the average en ergy (density) of the coherent vectors goes to infinity.
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 algorithm.
Chaos degree defined through two complexities in information dynamics is applied to some deterministic dynamical models. It is shown that this degree well describes the chaostic feature of the models.
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 for classical input and quantum output. In 1983, the autho r defined the fully quantum mechanical mutual entropy by means of the relati ve entropy of Umegaki, and it has been used to compute the capacity of quant um channel for quantum communication process; quantum input-quantum output. Recently, a correlated state in quantum syatems, so-called quantum entangled state or quantum entanglement, are used to study quntum information, in part icular, quantum computation, quantum teleportation, quantum cryptography. In this paper, we mainly discuss three things below: (1) We point out the di fference between the capacity of quantum channel and that of classical-quant um-classical channel. (2) So far the entangled state is merely defined as a non-separable state, we give a wider definition of the entangled state and c lassify the entangled states into three categories. (3) The quantum mutual e ntropy for an entangled state is discussed. The above (2) and (3) are a join t work with Belavkin.
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 for classical input and quantum output. In 1983, the autho r defined the fully quantum mechanical mutual entropy by means of the relati ve entropy of Umegaki, and he extended it to general quantum systems by the relative entropy of Araki and Uhlmann. When the author introduced the quantu m mutual entropy, he did not indicate that it contains other definitions of the mutual entropy including classical one, so that there exist several misu nderstandings for the use of the mutual entropy (information) to compute the capacity of quantum channels. Therefore in this note we point out that our quantum mutual entropy generalizes others and where the m isuse occurs.
Kolmogorov introduced a concept of Epsilon-entropy to analyze information in classical continuous system. The fractal dimension of geometrical sets was introduced by Mandelbrot as a new criterion to analyze the complexity of these sets. The Epsilon-entropy and the fractal dimension of a state in general quantum system were introduced by one of the present authors in order to characterize chaotic properties of general states. In this paper, we show that Epsilon-entropy of a state includes Kolmogorov Epsilon-entropy, and the fractal dimension of a state describe fractal structure of Gaussian measures.
The dynamics of an atom on the Jaynes-Cummings model has been studied by an atomic inversion, von Neumann entropy and so on. In this letter, we will treat the Jaynes-Cummings model as a problem in non-equilibrium statistical mechanics and apply quantum mutual entropy to study the irreversible dynamics of a state for the atom on this model.