Controlling quantum chaos via Parrondo strategies on noisy intermediate-scale quantum hardware
arXiv:2506.11225 · doi:10.1103/m89r-2dy5
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.
arXiv comment21 pages, 24 figures, 6 tables; accepted for publication in Phys. Rev. E
References in corpus (35)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Noisy intermediate-scale quantum (NISQ) algorithms
- Universal computation by quantum walk
- Observation of discrete time-crystalline order in a disordered dipolar many-body system
- Demonstration of a small programmable quantum computer with atomic qubits
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Observation of topologically protected bound states in a one dimensional photonic system
- Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
- Computing with spin qubits at the surface code error threshold
- Universal quantum computation using the discrete time quantum walk
- Controlling discrete quantum walks: coins and intitial states
- Experimental Two-dimensional Quantum Walk on a Photonic Chip
- Simulating dynamic quantum phase transitions in photonic quantum walks
- Dynamical moments reveal a topological quantum transition in a photonic quantum walk
- Quantum walks can find a marked element on any graph
- Brownian motion and gambling: from ratchets to paradoxical games
- Experimental realisation of a delayed-choice quantum walk
- Dynamic-Disorder-Induced Enhancement of Entanglement in Photonic Quantum Walks
- Decoherence induced by a chaotic environment: A quantum walker with a complex coin
- Higher winding number in a non-unitary photonic quantum walk
- Black-box Hamiltonian simulation and unitary implementation
- Universal quantum computing using single-particle discrete-time quantum walk
- Discrete-time quantum walk algorithm for ranking nodes on a network
- Quantum state revivals in quantum walks on cycles
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- Quantum bounds on the generalized Lyapunov exponents
- Order from chaos in quantum walks on cyclic graphs
- Testing quantum speedups in exciton transport through a photosynthetic complex using quantum stochastic walks
- Efficient implementation of discrete-time quantum walks on quantum computers
- Learning How to Dynamically Decouple
- Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
- Recurrent generation of maximally entangled single particle states via quantum walks on cyclic graphs
- Designing three-way entangled and nonlocal two-way entangled single particle states via alternate quantum walks
- Phase vs coin vs position disorder as a probe for the resilience and revival of single particle entanglement in cyclic quantum walks