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

arXiv:1208.2610

Quantum Chaos and Quantum Computing Structures

Carlos Pedro Gonçalves

Published Aug 13, 2012• 0 citations
arXivHTMLPDF

Abstract

A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects of emerging nonlinear dynamics and chaos upon the quantum averages of relevant observables and quantum probabilities are exemplified for a version of Chirikov's standard map on \mathbb{C} . Both the individual orbits and ensemble properties are addressed so that the Poincaré map for Chirikov's standard map, in the current quantum setting, is reinterpreted in terms of a quantum ensemble which is then formally introduced within the formalized system of quantum computing structures, in terms of quantum register machines, revealing three phases of quantum ensemble dynamics: the regular, the chaotic and an intermediate phase called complex quantum stochastic phase which shares similarities to the edge of chaos notion from classical cellular automata and classical random boolean networks' evolutionary computation.

DOI
10.48550/arxiv.1208.2610

Related papers

Quantum-Based Computation Utilizing Chaotic Quantum Systems

Jincheng Zhang

This paper explores a novel approach to computation leveraging the inherent complexity of quantum chaotic systems. The core concept involves harnessing the unpredictable dynamics of these systems for parallel processing and simulation, offering a potentially transformative paradigm for computation. We present a theoretical framework for constructing and utilizing such systems, emphasizing the connection between quantum chaos and classical chaos. The system's dynamics are governed by a set of coupled nonlinear differential equations, representing a modified logistic map. The key innovation lies in exploiting the sensitive dependence on initial conditions characteristic of chaotic systems to generate a multitude of independent calculations concurrently. This approach aims to overcome limitations associated with traditional parallel computing architectures and potentially unlock new computational capabilities. The theoretical framework is presented, and a simplified mathematical model is outlined to illustrate the fundamental principles. Further research will focus on developing practical implementations and exploring the potential applications of this quantum-based computation method. ---

•Aug 28, 2026•0 citations

Based on Chaos Theory Quantum Computing Algorithm Design

Jincheng Zhang

This paper explores the potential of utilizing chaos theory to enhance quantum computing algorithms. The core concept involves mapping chaotic systems onto quantum bits (qubits), leveraging the inherent properties of chaos – sensitivity to initial conditions, nonlinearity, and complex dynamics – to develop novel quantum algorithms. Specifically, we propose a "Chaos Quantum Simulation Algorithm" (CQSA) designed to address challenges in quantum computation, such as decoherence and computational complexity. The CQSA aims to exploit the chaotic nature of the system to perform computations more efficiently and with improved stability. This work presents a theoretical framework and the fundamental equations for the CQSA, detailing the mapping process and the core computational steps. The potential impact of this approach on future quantum computing architectures and algorithm design is discussed.

•Sep 5, 2026•0 citations

The Emergence of Chaos in Quantum Mechanics

Emilio Fiordilino

Nonlinearity in Quantum Mechanics may have extrinsic or intrinsic origins and is a liable route to a chaotic behaviour that can be of difficult observations. In this paper, we propose two forms of nonlinear Hamiltonian, which explicitly depend upon the phase of the wave function and produce chaotic behaviour. To speed up the slow manifestation of chaotic effects, a resonant laser field assisting the time evolution of the systems causes cumulative effects that might be revealed, at least in principle. The nonlinear Schrödinger equation is solved within the two-state approximation; the solution displays features with characteristics similar to those found in chaotic Classical Mechanics: sensitivity on the initial state, dense power spectrum, irregular filling of the Poincaré map and exponential separation of the trajectories of the Bloch vector σ in the Bloch sphere.

Symmetry•May 8, 2020•5 citations

Geometric Chaos: A Quantum Computing Paradigm

Jincheng Zhang

This paper investigates the application of geometric chaos theory as a foundational paradigm for quantum computing, specifically focusing on the modeling and prediction of time series data. We propose a novel framework that leverages the inherent nonlinear dynamics and self-organization exhibited by geometric chaos to enhance prediction accuracy and provide more robust decision-making capabilities. The core mechanism centers on mapping time series data to the geometric chaos framework, utilizing the unique properties of this system to identify long-term trends and patterns. This approach offers a significant advancement over traditional time series models by explicitly addressing the fundamental characteristics of chaotic systems. This paper demonstrates the potential of this paradigm to achieve more accurate risk assessment and optimization in complex scenarios.

•Sep 5, 2026•0 citations

Simulating quantum chaos on a quantum computer

Amit Kumar Anand, Sanchit Srivastava, Sayan Gangopadhyay +1 more

Noisy intermediate-scale quantum (NISQ) computers provide a new experimental platform for investigating the behaviour of complex quantum systems. We show that currently available NISQ devices can be used for versatile quantum simulations of chaotic systems. We introduce a classical-quantum hybrid approach for exploring the dynamics of the chaotic quantum kicked top (QKT) on a quantum computer. The programmability of this approach allows us to experimentally explore a broad range of QKT chaoticity parameter regimes inaccessible to previous studies. Furthermore, the number of gates in our simulation does not increase with the number of kicks, thus making it possible to study the QKT evolution for arbitrary number of kicks without fidelity loss. Using a publicly accessible NISQ computer (IBMQ), we observe periodicities in the evolution of the 2-qubit QKT, as well as signatures of chaos in the time-averaged 2-qubit entanglement. We also demonstrate a connection between entanglement and delocalization in the 2-qubit QKT, confirming theoretical predictions.

arXiv:2107.09809•Scientific Reports•Nov 6, 2024•3 citations

Unitary Maps and Quantum Artificial Neural Networks

Carlos Pedro Gonçalves

Unitary quantum maps provide a bridge between classical and quantum dynamical systems theories, having been applied within the context of quantum chaos research. When applied to quantum artificial neural networks, as models of networked quantum computation, unitary quantum maps allow one to address these networks as quantum networked dynamical systems. In this chapter, we address the application of these maps to quantum artificial neural networks, specifically studying the simulation and implementation of these maps for quantum recurrent neural networks, simulating these networks as dynamical computational systems and researching the topological properties of the series of neural firing operators’ quantum averages for nonstationary network states. We also research the results of a simulation of one of these networks on a quantum computer by cloud-based access to IBM Q Experience resources. The results show the emergence of complex dynamics, fitting into similar classes as those of classical cellular automata and coupled maps, including topological markers of chaos, edge of chaos and fractal attractors in the sequences of quantum averages. The implications for quantum complexity research, quantum chaos theory and quantum computing are addressed.

IntechOpen eBooks•Apr 9, 2024•0 citations
A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects of emerging nonlinear dynamics and chaos upon the quantum averages of relevant observables and quantum probabilities are exemplified for a version of Chirikov's standard map on \mathbb{C} . Both the individual orbits and ensemble properties are addressed so that the Poincaré map for Chirikov's standard map, in the current quantum setting, is reinterpreted in terms of a quantum ensemble which is then formally introduced within the formalized system of quantum computing structures, in terms of quantum register machines, revealing three phases of quantum ensemble dynamics: the regular, the chaotic and an intermediate phase called complex quantum stochastic phase which shares similarities to the edge of chaos notion from classical cellular automata and classical random boolean networks' evolutionary computation.
This paper explores a novel approach to computation leveraging the inherent complexity of quantum chaotic systems. The core concept involves harnessing the unpredictable dynamics of these systems for parallel processing and simulation, offering a potentially transformative paradigm for computation. We present a theoretical framework for constructing and utilizing such systems, emphasizing the connection between quantum chaos and classical chaos. The system's dynamics are governed by a set of coupled nonlinear differential equations, representing a modified logistic map. The key innovation lies in exploiting the sensitive dependence on initial conditions characteristic of chaotic systems to generate a multitude of independent calculations concurrently. This approach aims to overcome limitations associated with traditional parallel computing architectures and potentially unlock new computational capabilities. The theoretical framework is presented, and a simplified mathematical model is outlined to illustrate the fundamental principles. Further research will focus on developing practical implementations and exploring the potential applications of this quantum-based computation method. ---
This paper explores the potential of utilizing chaos theory to enhance quantum computing algorithms. The core concept involves mapping chaotic systems onto quantum bits (qubits), leveraging the inherent properties of chaos – sensitivity to initial conditions, nonlinearity, and complex dynamics – to develop novel quantum algorithms. Specifically, we propose a "Chaos Quantum Simulation Algorithm" (CQSA) designed to address challenges in quantum computation, such as decoherence and computational complexity. The CQSA aims to exploit the chaotic nature of the system to perform computations more efficiently and with improved stability. This work presents a theoretical framework and the fundamental equations for the CQSA, detailing the mapping process and the core computational steps. The potential impact of this approach on future quantum computing architectures and algorithm design is discussed.
Nonlinearity in Quantum Mechanics may have extrinsic or intrinsic origins and is a liable route to a chaotic behaviour that can be of difficult observations. In this paper, we propose two forms of nonlinear Hamiltonian, which explicitly depend upon the phase of the wave function and produce chaotic behaviour. To speed up the slow manifestation of chaotic effects, a resonant laser field assisting the time evolution of the systems causes cumulative effects that might be revealed, at least in principle. The nonlinear Schrödinger equation is solved within the two-state approximation; the solution displays features with characteristics similar to those found in chaotic Classical Mechanics: sensitivity on the initial state, dense power spectrum, irregular filling of the Poincaré map and exponential separation of the trajectories of the Bloch vector σ in the Bloch sphere.
This paper investigates the application of geometric chaos theory as a foundational paradigm for quantum computing, specifically focusing on the modeling and prediction of time series data. We propose a novel framework that leverages the inherent nonlinear dynamics and self-organization exhibited by geometric chaos to enhance prediction accuracy and provide more robust decision-making capabilities. The core mechanism centers on mapping time series data to the geometric chaos framework, utilizing the unique properties of this system to identify long-term trends and patterns. This approach offers a significant advancement over traditional time series models by explicitly addressing the fundamental characteristics of chaotic systems. This paper demonstrates the potential of this paradigm to achieve more accurate risk assessment and optimization in complex scenarios.
Noisy intermediate-scale quantum (NISQ) computers provide a new experimental platform for investigating the behaviour of complex quantum systems. We show that currently available NISQ devices can be used for versatile quantum simulations of chaotic systems. We introduce a classical-quantum hybrid approach for exploring the dynamics of the chaotic quantum kicked top (QKT) on a quantum computer. The programmability of this approach allows us to experimentally explore a broad range of QKT chaoticity parameter regimes inaccessible to previous studies. Furthermore, the number of gates in our simulation does not increase with the number of kicks, thus making it possible to study the QKT evolution for arbitrary number of kicks without fidelity loss. Using a publicly accessible NISQ computer (IBMQ), we observe periodicities in the evolution of the 2-qubit QKT, as well as signatures of chaos in the time-averaged 2-qubit entanglement. We also demonstrate a connection between entanglement and delocalization in the 2-qubit QKT, confirming theoretical predictions.
Unitary quantum maps provide a bridge between classical and quantum dynamical systems theories, having been applied within the context of quantum chaos research. When applied to quantum artificial neural networks, as models of networked quantum computation, unitary quantum maps allow one to address these networks as quantum networked dynamical systems. In this chapter, we address the application of these maps to quantum artificial neural networks, specifically studying the simulation and implementation of these maps for quantum recurrent neural networks, simulating these networks as dynamical computational systems and researching the topological properties of the series of neural firing operators’ quantum averages for nonstationary network states. We also research the results of a simulation of one of these networks on a quantum computer by cloud-based access to IBM Q Experience resources. The results show the emergence of complex dynamics, fitting into similar classes as those of classical cellular automata and coupled maps, including topological markers of chaos, edge of chaos and fractal attractors in the sequences of quantum averages. The implications for quantum complexity research, quantum chaos theory and quantum computing are addressed.