#### Filter Results:

- Full text PDF available (45)

#### Publication Year

1983

2017

- This year (1)
- Last 5 years (22)
- Last 10 years (48)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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.

- Masanori Ohya
- IEEE Trans. Information Theory
- 1983

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… (More)

- Luigi Accardi, Andrei Khrennikov, Masanori Ohya
- Open Syst. Inform. Dynam.
- 2009

We analyze, from the point of view of quantum probability, statistical data from two interesting experiments, done by Shafir and Tversky [1, 2] in the domain of cognitive psychology. These are gambling experiments of Prisoner Dilemma type. They have important consequences for economics, especially for the justification of the Savage “Sure Thing Principle”… (More)

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, (t1, t2), (t2, t3), (t3, t4),… (More)

- Masanari Asano, Irina Basieva, Andrei Khrennikov, Masanori Ohya, Yoshiharu Tanaka, Ichiro Yamato
- Systems and Synthetic Biology
- 2013

We present a very general model of epigenetic evolution unifying (neo-)Darwinian and (neo-)Lamarckian viewpoints. The evolution is represented in the form of adaptive dynamics given by the quantum(-like) master equation. This equation describes development of the information state of epigenome under the pressure of an environment. We use the formalism of… (More)

- Takayuki Miyadera, Masanori Ohya
- Open Syst. Inform. Dynam.
- 2005

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… (More)

- Masanori Ohya
- 2003

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… (More)

Luigi Accardi† and Masanori Ohya‡ † Graduate School of Polymathematics, Nagoya University, Chikusa–ku, Nagoya, 464–01, Japan, and Centro V. Volterra, Università degli Studi di Roma “Tor Vergata” – 00133 Rome, Italy E-mail: accardi@volterra.mat.uniroma2.it, and accardi@math.nagoya-u.ac.jp ‡Department of Information Sciences Science University of Tokyo Noda… (More)

- Satoshi Iriyama, Masanori Ohya
- Open Syst. Inform. Dynam.
- 2008