Controlling quantum chaos via Parrondo strategies on noisy intermediate-scale quantum hardware

• URL: http://arxiv.org/abs/2506.11225v2
• Date: Tue, 04 Nov 2025 01:55:45 GMT
• Title: Controlling quantum chaos via Parrondo strategies on noisy intermediate-scale quantum hardware
• Authors: Aditi Rath, Dinesh Kumar Panda, Colin Benjamin,
• Abstract summary: We explore and control quantum chaos in NISQ systems using discrete-time quantum walks (DTQW) on cyclic graphs.<n>We experimentally realize the transition from quantum chaos to order via DTQW dynamics on both odd and even cyclic graphs.<n>Our results demonstrate a practical approach to probing and harnessing controlled chaotic dynamics on real quantum hardware.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Advancements in Noisy Intermediate-Scale Quantum (NISQ) computing are steadily pushing these systems toward outperforming classical supercomputers on specific, well-defined computational tasks. In this work, we explore and control quantum chaos in NISQ systems using discrete-time quantum walks (DTQW) on cyclic graphs. To efficiently implement quantum walks on NISQ hardware, we employ the quantum Fourier transform (QFT) to diagonalize the conditional shift operator, optimizing circuit depth and fidelity. We experimentally realize the transition from quantum chaos to order via DTQW dynamics on both odd and even cyclic graphs, specifically 3- and 4-cycle graphs, using the counterintuitive Parrondo's paradox strategy across three different NISQ devices. While the 4-cycle graphs exhibit high-fidelity quantum evolution, the 3-cycle implementation shows significant fidelity improvement when augmented with dynamical decoupling pulses. Our results demonstrate a practical approach to probing and harnessing controlled chaotic dynamics on real quantum hardware, laying the groundwork for future quantum algorithms and cryptographic protocols based on quantum walks.

Related papers

• Continuous-time quantum walk on a random graph using quantum circuits [0.0]
  Quantum walks, particularly continuous-time quantum walks (CTQW), have emerged as powerful tools for modeling quantum transport, simulating complex dynamics, and developing quantum algorithms with potential speedups over classical counterparts.<n>We present a scalable quantum circuit formalism to simulate CTQW on random graph structures, especially focusing on ErdHos-R'enyi random graphs.
  arXiv  Detail & Related papers  (2025-10-16T17:24:14Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Quantum Visual Fields with Neural Amplitude Encoding [70.86293548779774]
  We introduce a new type of Quantum Implicit Neural Representation (QINR) for 2D image and 3D geometric field learning.<n>QVF encodes classical data into quantum statevectors using neural amplitude encoding grounded in a learnable energy manifold.<n>Our ansatz follows a fully entangled design of learnable parametrised quantum circuits, with quantum (unitary) operations performed in the real Hilbert space.
  arXiv  Detail & Related papers  (2025-08-14T17:59:52Z)
• Circuit compression for 2D quantum dynamics [6.9629737395580715]
  Quantum algorithms for the dynamics of quantum systems typically require deep quantum circuits.<n>We leverage Pauli propagation techniques to develop a strategy for compressing circuits.<n>Our circuit compression scheme brings us one step closer to a practical quantum advantage.
  arXiv  Detail & Related papers  (2025-07-02T16:52:21Z)
• Cycle-Aware ZZ Crosstalk Mitigation on Quantum Hardware [2.6242820867975123]
  ZZ crosstalk and decoherence hinder superconducting quantum computing.<n>We formulate the problem by integrating quantum cycles and two forms of qubit interference.<n>We then propose CYCO, a CYcle-aware ZZ Crosstalk Optimization algorithm.
  arXiv  Detail & Related papers  (2025-03-17T14:13:05Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum Computing for Solid Mechanics and Structural Engineering -- a Demonstration with Variational Quantum Eigensolver [3.8061090528695534]
  Variational quantum algorithms exploit the features of superposition and entanglement to optimize a cost function efficiently. We implement and demonstrate the numerical processes on the 5-qubit and 7-qubit quantum processors on the IBM Qiskit platform.
  arXiv  Detail & Related papers  (2023-08-28T17:52:47Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Assisted quantum simulation of open quantum systems [0.0]
  We introduce the quantum-assisted quantum algorithm, which reduces the circuit depth of UQA via NISQ technology. We present two quantum-assisted quantum algorithms for simulating open quantum systems.
  arXiv  Detail & Related papers  (2023-02-26T11:41:02Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Simulating quantum chaos on a quantum computer [0.0]
  We introduce a novel classical-quantum hybrid approach for exploring the dynamics of the chaotic quantum kicked top (QKT) on a universal quantum computer. We observe periodicities in the evolution of the 2-qubit QKT, as well as signatures of chaos in the time-averaged 2-qubit entanglement.
  arXiv  Detail & Related papers  (2021-07-20T23:52:01Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Efficient Quantum Simulation of Open Quantum System Dynamics on Noisy Quantum Computers [0.0]
  We show that quantum dissipative dynamics can be simulated efficiently across coherent-to-incoherent regimes. This work provides a new direction for quantum advantage in the NISQ era.
  arXiv  Detail & Related papers  (2021-06-24T10:37:37Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.