Search

In this paper, we introduce a new model of selection behavior under risk that describes an essential cognitive process for comparing values of objects and making a selection decision. This model is constructed by the quantum-like approach that employs the state representation specific to quantum theory, which has the mathematical framework beyond the classical probability theory. We show that our quantum approach can clearly explain the famous examples of anomalies for the expected utility theory, the Ellsberg paradox, the Machina paradox and the disparity between WTA and WTP. Further, we point out that our model mathematically specifies the characteristics of the probability weighting function and the value function, which are basic concepts in the prospect theory.

We discuss foundational issues of quantum information biology (QIB) -- one of the most successful applications of the quantum formalism outside of physics. QIB provides a multi-scale model of information processing in bio-systems: from proteins and cells to cognitive and social systems. This theory has to be sharply distinguished from "traditional quantum biophysics". The latter is about quantum bio-physical processes, e.g., in cells or brains. QIB models the dynamics of information states of bio-systems. It is based on the quantum-like paradigm: complex bio-systems process information in accordance with the laws of quantum information and probability. This paradigm is supported by plenty of statistical bio-data collected at all scales, from molecular biology and genetics/epigenetics to cognitive psychology and behavioral economics. We argue that the information interpretation of quantum mechanics (its various forms were elaborated by Zeilinger and Brukner, Fuchs and Mermin, and D' Ariano) is the most natural interpretation of QIB. We also point out that QBIsm (Quantum Bayesianism) can serve to find a proper interpretation of bio-quantum probabilities. Biologically QIB is based on two principles: a) adaptivity; b) openness (bio-systems are fundamentally open). These principles are mathematically represented in the framework of a novel formalism -- quantum adaptive dynamics which, in particular, contains the standard theory of open quantum systems as a special case of adaptivity (to environment).

We interpret the Leggett-Garg (LG) inequality as a kind of contextual probabilistic inequality in which one combines data collected in experiments performed for three different contexts. In the original version of the inequality these contexts have the temporal nature and they are given by three pairs of instances of time, $(t_1, t_2), (t_2, t_3), (t_3, t_4),$ where $t_1 < t_2 < t_3.$ We generalize LG conditions of macroscopic realism and noninvasive measurability in the general contextual framework. Our formulation is done in the purely probabilistic terms: existence of the context independent joint probability distribution $P$ and the possibility to reconstruct the experimentally found marginal (two dimensional) probability distributions from the $P.$ We derive an analog of the LG inequality, "contextual LG inequality", and use it as a test of "quantum-likeness" of statistical data collected in a series of experiments on recognition of ambiguous figures. In our experimental study the figure under recognition is the Schroeder stair which is shown with rotations for different angles. Contexts are encoded by dynamics of rotations: clockwise, anticlockwise, and random. Our data demonstrated violation of the contextual LG inequality for some combinations of aforementioned contexts. Since in quantum theory and experiments with quantum physical systems this inequality is violated, e.g., in the form of the original LG-inequality, our result can be interpreted as a sign that the quantum(-like) models can provide a more adequate description of the data generated in the process of recognition of ambiguous figures., Comment: Presented at the conference Quantum Interactions 14, University of Leicester, July 2014; submitted to Physica Scripta, IOP; new version contains discussions on Bell and contextuality, marginal selectivity, Kolmogorovization of contextual data

We study the correlations of classical and quantum systems from the information theoretical points of view. We analyze a simple measure of correlations based on entropy (such measure was already investigated as the degree of entanglement by Belavkin, Matsuoka and Ohya). Contrary to naive expectation, it is shown that separable state might possesses stronger correlation than an entangled state.

We propose a double blinding-attack on entangled-based quantum key distribution protocols. The principle of the attack is the same as in existing blinding attack except that instead of blinding the detectors on one side only, Eve is blinding the detectors of both Alice and Bob. In the BBM92 protocol, the attack allows Eve to get a full knowledge of the key and remain undetected even if Alice and Bob are using 100% efficient detectors. The attack can be easily extended to Ekert protocol, with an efficiency as high as 85.3%., Comment: 4 pages

There exist several phenomena (systems) breaking the classical probability laws. Such systems are contextual dependent adaptive systems. In this paper, we present a new mathematical formula to compute the probability in those systems by using the concepts of the adaptive dynamics and quantum information theory -- quantum channels and the lifting. The basic examples of the contextual dependent phenomena can be found in quantum physics. And recently similar examples were found in biological and psychological sciences. Our novel approach is motivated by traditional quantum probability, but it is general enough to describe aforementioned phenomena outside of quantum physics.

In elaborating on the multiple-photon absorption attack on Ekert protocol proposed in arXiv:1011.4740, we show that it can be used in other entanglement-based protocols, in particular the BBM92 protocol. In this attack, the eavesdropper (Eve) is assumed to be in control of the source, and she sends pulses correlated in polarization (but not entangled) containing several photons at frequencies for which only multiple-photon absorptions are possible in Alice's and Bob's detectors. Whenever the photons stemming from one pulse are dispatched in such a way that the number of photons is insufficient to trigger a multiple-photon absorption in either channel, the pulse remains undetected. We show that this simple feature is enough to reproduce the type of statistics on the detected pulses that are considered as indicating a secure quantum key distribution, even though the source is actually a mixture of separable states. The violation of Bell inequalities measured by Alice and Bob increases with the order of the multiple-photon absorption that Eve can drive into their detectors, while the measured quantum bit error rate decreases as a function of the same variable. We show that the attack can be successful even in the simplest case of a two-photon absorption or three-photon absorption attack, and we discuss possible countermeasures, in particular the use of a fair sampling test., Comment: 11 pages, 7 figures, 1 table

Recently it was shown that the main distinguishing features of quantum mechanics (QM) can be reproduced by a model based on classical random fields, so called prequantum classical statistical field theory (PCSFT). This model provides a possibility to represent averages of quantum observables, including correlations of observables on subsystems of a composite system (e.g., entangled systems), as averages with respect to fluctuations of classical (Gaussian) random fields. In this note we consider some consequences of PCSFT for quantum information theory. They are based on the observation \cite{W} of two authors of this paper that classical Gaussian channels (important in classical signal theory) can be represented as quantum channels. Now we show that quantum channels can be represented as classical linear transformations of classical Gaussian signal

Hirota's results given in (Hirota.M.,1981) on the asymptotically stability are generalized to the price-scaled price adjustment process.

A measure describing the chaos of a dynamics was introduced by two complexities in information dynamics, and it is called the chaos degree. In particular, the entropic chaos degree has been used to characterized several dynamical maps such that logistis, Baker's, Tinckerbel's in classical or quantum systems. In this paper, we give a new treatment of quantum chaos by defining the entropic chaos degree for quantum transition dynamics, and we prove that every non-chaotic quantum dynamics, e.g., dissipative dynamics, has zero chaos degree. A quantum spin 1/2 system is studied by our chaos degree, and it is shown that this degree well describes the chaotic behavior of the spin system., Comment: 17pages, 2 figures

After Shannon, entropy becomes a fundamental quantity to describe not only uncertainity or chaos of a system but also information carried by the system. Shannon's important discovery is to give a mathematical expression of the mutual entropy (information), information transmitted from an input system to an output system, by which communication processes could be analyzed on the stage of mathematical science. In this paper, first we review the quantum mutual entropy and discuss its uses in quantum information theory, and secondly we show how the classical mutual entropy can be used to analyze genomes, in particular, those of HIV., Comment: 26 pages

The complexity and the chaos degree can be used to examine the chaotic aspects of not only several nonlinear classical and quantum physical physics but also life sciences. We will construct a model describing the function of brain in the context of Quantum Information Dynamics., Comment: 11 pages, 1 figure

We touch the problem of finding simplified models for the recognition process. We are interested in how the input signal arriving at the brain is entangled (connected) to the memory already stored and the consciousness that existed in the brain, and how a part of the signal will be finally stored as a memory., Comment: 19 pages, 1 figure

The quantum capacity of a pure quantum channel and that of classical-quantum-classical channel are discussed in detail based on the fully quantum mechanical mutual entropy. It is proved that the quantum capacity generalizes the so-called Holevo bound., Comment: 10 pages

It is von Neumann who opened the window for today's Information epoch. He defined quantum entropy including Shannon's information more than 20 years ahead of Shannon, and he introduced a concept what computation means mathematically. In this paper I will report two works that we have recently done, one of which is on quantum algorithum in generalized sense solving the SAT problem (one of NP complete problems) and another is on quantum mutual entropy properly describing quantum communication processes., Comment: 19 pages, Proceedings of the von Neumann Centennial Conference: Linear Operators and Foundations of Quantum Mechanics, Budapest, Hungary, 15-20 October, 2003

Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete problems and argue that the problem, in principle, can be solved in polynomial time by using our new quantum algorithm., Comment: 11 pages, 1 figure

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., Comment: 14 pages, 3 figures

Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm., Comment: 19 pages

We propose a new approach to solve an NP complete problem by means of stochastic limit., Comment: 8 pages

We investigate a quantum dynamical entropy of one-dimesional quantum spin systems. We show that the dynamical entropy is bounded from above by a quantity which is related with group velocity determined by the interaction and mean entropy of the state., Comment: 10 pages

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., Comment: 2 pages

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., Comment: 30 pages, Latex2e

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., Comment: 20 pages, Latex2e

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., Comment: 11 pages, 1 figure

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., Comment: 16 pages, Latex 2e

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., Comment: 25 pages, Latex 2e

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., Comment: 15 pages, Latex2e

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., Comment: 15 pages, 17 figures, Latex2e, Submitted to Chaos, Solitons & Fractals

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., Comment: 8 pages, 1 figure, Latex2e

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., Comment: 10 pages, Latex2e

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., Comment: 13 pages, Latex

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., Comment: 17 pages, Latex, Submitted to Journal of Mathematical Physics

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., Comment: RevTeX, 4 pages with a figure(eps file), submitted to Physical Review Letters