Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Open Systems & Information Dynamics

Chaos Amplification Process Can Be Described by the GKSL Master Equation

K. Furusho, Satoshi Iriyama, M. Ohya

Published Jun 1, 2017• 1 citation
Publisher

Abstract

In 2000, Ohya et al. proposed a quantum algorithm with the amplification process of success probability, so-called chaos amplifier. They defined the process based on the logistic map, and its chaos behaviour amplifies the probability very fast. In this paper, we construct the chaos amplifier using a lifting map, a master equation and a partial trace. We also calculate the condition on the Lindblad operators in the GKSL master equation to achieve an effective amplification.

DOI
10.1142/s1230161217500081

Related papers

On efficien quantum algorithm using classical amplificatio process

Satoshi Iriyama, Masanori Ohya

Ohya and Volovich proposed the polynomial time quantum algorithm to solve SAT problem which is one of NP-complete problems. This algorithm contains effective amplification process, so called a Chaos Amplifie, based on classical Chaotic dynamics. Recently we described this process by the GKSL master equation on two qubits system. In this talk, we introduce an efficien quantum algorithm for searching problem using the Chaos Amplifie.

IEEE International Conference on Cognitive Informatics•Aug 1, 2014•0 citations

Quantum turing machine and brain model represented by Fock space

Satoshi Iriyama, Masanori Ohya

The adaptive dynamics is known as a new mathematics to treat with a complex phenomena, for example, chaos, quantum algorithm and psychological phenomena. In this paper, we briefly review the notion of the adaptive dynamics, and explain the definition of the generalized Turing machine (GTM) and recognition process represented by the Fock space. Moreover, we show that there exists the quantum channel which is described by the GKSL master equation to achieve the Chaos Amplifier used in [M. Ohya and I. V. Volovich, J. Opt. B 5(6) (2003) 639., M. Ohya and I. V. Volovich, Rep. Math. Phys. 52(1) (2003) 25.]

International Journal of Quantum Information•May 13, 2016•0 citations

An elementary construction of the GKSL master equation for N-level systems

Matthew Ziemke

The GKSL master equation for N-level systems provides a necessary and sufficient form for the generator of a quantum dynamical semigroup in the Schrodinger picture where the underlying Hilbert space is $\mathbb{C}^N$. In this paper we provide a detailed, self-contained, and elementary construction of the GKSL master equation for an N-level system. We also provide necessary and sufficient conditions for forms of generators of semigroups which have some, but not all, of the defining properties of quantum dynamical semigroups. We do this in such a way to illuminate how each defining property of a quantum dynamical semigroup contributes to the form of the generators.

arXiv:2409.03135•Sep 5, 2024•0 citations

On Generalized Quantum Turing Machine and Its Applications

Satoshi Iriyama, Masanori Ohya

Ohya and Volovich discussed a quantum algorithm for the SAT problem with a chaos amplification process (OMV SAT algorithm) and showed that the number of steps it performed was polynomial in input size. In this paper, we define a generalized quantum Turing machine (GQTM) and related computational complexity. Then we show that there exists a GQTM which recognizes the SAT problem in polynomial time. Moreover, we discuss the problem of finding the quantum algorithm for a partial recursive function.

Open Systems & Information Dynamics•Aug 13, 2009•0 citations

Connection between the GKSL master equation and the Landauer formula

Misa Nozaki, Takatoshi Fujita

We derive a current formula within the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation formalism for a non-interacting system, and identify the conditions under which it reduces to the Landauer formula.

arXiv:2606.27132•Jun 25, 2026•0 citations

Generalized quantum Turing machine and its use to find an algorithm solving NP-Complete problem

Satoshi Iriyama, Masanori Ohya

Ohya and Volovich found the quantum algorithm with a chaos dynamics, called the OV SAT algorithm which enabled to solve NP-Complete problem in polynomial time. It is proved that the unitary operator of the quantum algorithm can be constructed by a product of so called fundamental gates. To discuss the computational complexity rigorously, we introduced a generalized quantum Turing machine(GQTM) where the computational process is given by quantum channels including a dispative dynamics and the configuration is represented by density operators. In this paper, we explain the GQTM and the OV SAT algorithm, then we discuss the computational complexity of OV SAT algorithm. Finally, we introduce some resent results and topics by use of GQTM.

International Symposium on Applied Sciences in Biomedical and Communication Technologies•Nov 1, 2010•1 citation
In 2000, Ohya et al. proposed a quantum algorithm with the amplification process of success probability, so-called chaos amplifier. They defined the process based on the logistic map, and its chaos behaviour amplifies the probability very fast. In this paper, we construct the chaos amplifier using a lifting map, a master equation and a partial trace. We also calculate the condition on the Lindblad operators in the GKSL master equation to achieve an effective amplification.
The adaptive dynamics is known as a new mathematics to treat with a complex phenomena, for example, chaos, quantum algorithm and psychological phenomena. In this paper, we briefly review the notion of the adaptive dynamics, and explain the definition of the generalized Turing machine (GTM) and recognition process represented by the Fock space. Moreover, we show that there exists the quantum channel which is described by the GKSL master equation to achieve the Chaos Amplifier used in [M. Ohya and I. V. Volovich, J. Opt. B 5(6) (2003) 639., M. Ohya and I. V. Volovich, Rep. Math. Phys. 52(1) (2003) 25.]
The GKSL master equation for N-level systems provides a necessary and sufficient form for the generator of a quantum dynamical semigroup in the Schrodinger picture where the underlying Hilbert space is CN\mathbb{C}^NCN. In this paper we provide a detailed, self-contained, and elementary construction of the GKSL master equation for an N-level system. We also provide necessary and sufficient conditions for forms of generators of semigroups which have some, but not all, of the defining properties of quantum dynamical semigroups. We do this in such a way to illuminate how each defining property of a quantum dynamical semigroup contributes to the form of the generators.
Ohya and Volovich found the quantum algorithm with a chaos dynamics, called the OV SAT algorithm which enabled to solve NP-Complete problem in polynomial time. It is proved that the unitary operator of the quantum algorithm can be constructed by a product of so called fundamental gates. To discuss the computational complexity rigorously, we introduced a generalized quantum Turing machine(GQTM) where the computational process is given by quantum channels including a dispative dynamics and the configuration is represented by density operators. In this paper, we explain the GQTM and the OV SAT algorithm, then we discuss the computational complexity of OV SAT algorithm. Finally, we introduce some resent results and topics by use of GQTM.