SearcharxivSearch

arXiv subjects

Masanori Ohya

Publications and source records attributed to Masanori Ohya.

At least 19 recordsLinked to original sources

A Quantum-like Model of Selection Behavior

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.

econ.GN

Quantum Information Biology: from information interpretation of quantum mechanics to applications in molecular biology and cognitive psychology

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).

quant-ph

Violation of contextual generalization of the Leggett-Garg inequality for recognition of ambiguous figures

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.

q-bio.NC

On correlations and mutual entropy in quantum composed systems

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.

quant-ph

Double blinding-attack on entanglement-based quantum key distribution protocols

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%.

quant-ph

A general quantum information model for the contextual dependent systems breaking the classical probability law

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.

quant-ph

Multiple-Photon Absorption Attack on Entanglement-Based Quantum Key Distribution Protocols

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.

quant-ph

Classical Signal Model for Quantum Channels

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

quant-ph

Quantum Dynamical Entropy of Spin Systems

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.

quant-ph

Complexity in Quantum System and Its Application to Brain Function

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.

quant-ph

A Description of Quantum Chaos

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.

quant-ph

Mutual Entropy in Quantum Information and Information Genetics

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.

quant-ph

Information Dynamics and its Application to Recognition Process

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.

quant-ph

On Quantum Capacity and its Bound

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.

quant-ph

New quantum algorithm for studying NP-complete problems

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.

quant-ph

Quantum Algorithm for SAT Problem and Quantum Mutual Entropy

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.

quant-ph

Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm

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.

quant-ph