#### Filter Results:

#### Publication Year

1983

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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

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.

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)

- Cristian S. Calude, Michael J. Dinneen, +34 authors Hirotada Kobayashi
- 2007

- Masanori Ohya
- IEEE Trans. Information Theory
- 1983

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)

- S. FURUICHI, Masanori Ohya
- 2007

We axiomatically characterize the Tsallis entropy of a finite quantum system. In addition, we derive a continuity property of Tsallis entropy. This gives a generalization of the Fannes' inequality.

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

- Masanori Ohya
- 1998

- Luigi Accardi, Masanori Ohya
- VLSI
- 2003

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.