#### Filter Results:

#### Publication Year

1983

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Viacheslav P Belavkin, Masanori Ohya
- 2002

The operational structure of quantum couplings and entangle-ments is studied and classified for semifinite von Neumann algebras. We show that the classical-quantum correspondences such as quantum encodings can be treated as diagonal semi-classical (d-) couplings, and the entanglements characterized by truly quantum (q-) couplings, can be regarded as truly… (More)

- Masanori Ohya, Natsuki Masuda
- 1998

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 (sat-isfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum algorithm.

- Masanori Ohya, Igor V Volovich
- 2008

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)

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)

- Masanori Ohya
- 1998

There exists an important problem whether there exists an algorithm to solve an NP-complete problem in polynomial time. In this paper, a new concept of quantum adaptive stochastic systems is proposed, and it is shown that it can be used to solve the problem above.

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 cog-nitive 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 proceed towards an application of the mathematical formalism of quantum mechanics to cognitive psychology — the problem of decision-making in games of the Prisoners Dilemma type. These games were used as tests of rationality of players. Experiments performed in cognitive psychology by Shafir and Tversky [1, 2], Croson [3], Hofstader [4, 5] demonstrated… (More)

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