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

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.

21 pages, 24 figures, 6 tables; accepted for publication in Phys. Rev. E

References in corpus (15)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Noisy intermediate-scale quantum (NISQ) algorithms
• Universal computation by quantum walk
• Quantum Walk in Position Space with Single Optically Trapped Atoms
• Computing with spin qubits at the surface code error threshold
• Brownian motion and gambling: from ratchets to paradoxical games
• Quantum state revivals in quantum walks on cycles
• Quantum bounds on the generalized Lyapunov exponents
• Learning How to Dynamically Decouple
• Order from chaos in quantum walks on cyclic graphs
• Efficient implementation of discrete-time quantum walks on quantum computers
• 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