The development of quantum computing hardware is facing the challenge that current-day quantum processors, comprising 50–100 qubits, already operate outside the range of quantum simulation on classical computers. In this paper we demonstrate that the simulation of limits can be a potent diagnostic tool for the resilience of quantum information hardware against chaotic instabilities potentially mitigating this problem. As a testbed for our approach we consider the transmon qubit processor, a computing platform in which the coupling of large numbers of nonlinear quantum oscillators may trigger destabilizing chaotic resonances. We find that classical and quantum simulations lead to similar stability metrics (classical Lyapunov exponents vs quantum wave function participation ratios) in systems with O ( 10 ) transmons. However, the big advantage of classical simulation is that it can be pushed to large systems comprising up to thousands of qubits. We exhibit the utility of this classical toolbox by simulating all current IBM transmon chips, including the 433-qubit processor of the Osprey generation, as well as devices with 1 121 qubits (Condor generation). For realistic system parameters, we find a systematic increase of Lyapunov exponents with system size, suggesting that larger layouts require added efforts in information protection. Published by the American Physical Society 2024
The development of quantum computing hardware is facing the challenge that current-day quantum processors, comprising 50–100 qubits, already operate outside the range of quantum simulation on classical computers. In this paper we demonstrate that the simulation of limits can be a potent diagnostic tool for the resilience of quantum information hardware against chaotic instabilities potentially mitigating this problem. As a testbed for our approach we consider the transmon qubit processor, a computing platform in which the coupling of large numbers of nonlinear quantum oscillators may trigger destabilizing chaotic resonances. We find that classical and quantum simulations lead to similar stability metrics (classical Lyapunov exponents vs quantum wave function participation ratios) in systems with O ( 10 ) transmons. However, the big advantage of classical simulation is that it can be pushed to large systems comprising up to thousands of qubits. We exhibit the utility of this classical toolbox by simulating all current IBM transmon chips, including the 433-qubit processor of the Osprey generation, as well as devices with 1 121 qubits (Condor generation). For realistic system parameters, we find a systematic increase of Lyapunov exponents with system size, suggesting that larger layouts require added efforts in information protection. Published by the American Physical Society 2024
From the perspective of many-body physics, the transmon qubit architectures currently developed for quantum computing are systems of coupled nonlinear quantum resonators. A certain amount of intentional frequency detuning ('disorder') is crucially required to protect individual qubit states against the destabilizing effects of nonlinear resonator coupling. Here we investigate the stability of this variant of a many-body localized phase for system parameters relevant to current quantum processors developed by the IBM, Delft, and Google consortia, considering the cases of natural or engineered disorder. Applying three independent diagnostics of localization theory - a Kullback-Leibler analysis of spectral statistics, statistics of many-body wave functions (inverse participation ratios), and a Walsh transform of the many-body spectrum - we find that some of these computing platforms are dangerously close to a phase of uncontrollable chaotic fluctuations.
This study aims to analyze recent developments in quantum supremacy by comparing the computational performance of stabilized superconducting qubit systems with classical supercomputing capabilities. A systematic literature review was conducted on major experimental studies published between 2019 and 2024, focusing on random circuit sampling, qubit stability, gate fidelity, and computational runtime comparisons. The analysis covers key quantum processors, including Sycamore and Zuchongzhi, by evaluating three main parameters: number of qubits, circuit complexity, and performance gap relative to classical simulation.The results show that quantum processors with 50–100 qubits and high gate fidelity are able to complete specific sampling tasks within seconds to hours, whereas equivalent classical simulations would require thousands to billions of years. The findings also indicate that computational advantage increases exponentially with system scale and is strongly influenced by qubit stability and error suppression techniques. Although the demonstrated tasks remain specialized and not yet applicable to practical problems, the evidence confirms that stabilized qubit systems have achieved a measurable computational regime beyond classical feasibility.This review provides a clear synthesis of current experimental achievements and highlights that future progress toward practical quantum advantage depends on improvements in error correction, scalability, and hardware reliability.
With the increasing size of quantum processors, submodules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design primitive and parameter choice in time-consuming coordination between design, fabrication, and experimental validation. Here we show how one can design and test the performance of next-generation quantum hardware---by using existing quantum computers. Focusing on superconducting transmon processors as a prominent hardware platform, we compute the static and dynamic properties of individual and coupled transmons. We show how the energy spectra of transmons can be obtained by variational hybrid quantum-classical algorithms that are well suited for near-term noisy quantum computers. In addition, single- and two-qubit gate simulations are demonstrated via Suzuki-Trotter decomposition. Our methods pave a promising way towards designing candidate quantum processors when the demands of calculating submodule properties exceed the capabilities of classical computing resources.
In the effort to develop useful quantum computers, simulating quantum machines with conventional classical computing resources is a key capability. Such simulations will always face limits, preventing the emulation of quantum computers at substantial scale; however, by pushing the envelope through optimal choices of algorithms and hardware, the value of simulator tools can be maximized. This work reviews state-of-the-art numerical simulation methods, i.e., classical algorithms that emulate quantum computer evolution under specific operations. We focus on the mainstream state-vector and tensor-network paradigms, while briefly mentioning alternative methods. Moreover, we review the diverse applications of simulation across different facets of quantum computer development, including understanding the fundamental differences between quantum and classical computations, exploring algorithmic design for quantum advantage, predicting quantum processor performance at the design stage, and efficiently characterizing fabricated devices for rapid iterations. This review complements recent surveys of current tools and implementations; here, we aim to provide readers with an essential understanding of the theoretical basis of classical simulation methods, a detailed discussion of their advantages and limitations, and an overview of the demands and challenges arising from practical use cases.
In certain regimes, the fidelity of quantum states will decay at a rate set by the classical Lyapunov exponent. This serves both as one of the most important examples of the quantum-classical correspondence principle and as an accurate test for the presence of chaos. While detecting this phenomenon is one of the first useful calculations that noisy quantum computers without error correction can perform [G. Benenti et al., Phys. Rev. E 65, 066205 (2001)], a thorough study of the quantum sawtooth map reveals that observing the Lyapunov regime is just beyond the reach of present-day devices. We prove that there are three bounds on the ability of any device to observe the Lyapunov regime and give the first quantitatively accurate description of these bounds: (1) the Fermi golden rule decay rate must be larger than the Lyapunov rate, (2) the quantum dynamics must be diffusive rather than localized, and (3) the initial decay rate must be slow enough for Lyapunov decay to be observable. This last bound, which has not been recognized previously, places a limit on the maximum amount of noise that can be tolerated. The theory implies that an absolute minimum of 6 qubits is required. Recent experiments on IBM-Q and IonQ imply that some combination of a noise reduction by up to 100 × per gate and large increases in connectivity and gate parallelization are also necessary. Finally, scaling arguments are given that quantify the ability of future devices to observe the Lyapunov regime based on trade-offs between hardware architecture and performance.
This paper investigates the intersection of quantum chaos and quantum computing control. It explores the potential influence of chaotic behavior within quantum systems on computational processes and proposes control strategies to mitigate these effects. The core argument centers on the recognition of quantum chaos as a crucial, yet often overlooked, element in the precise control required for reliable quantum computation. Through the application of chaos theory, this work analyzes the manifestation of chaotic dynamics in quantum systems, detailing the implications for qubit stability and gate fidelity. Specific control techniques, including feedback mechanisms and tailored Hamiltonian designs, are examined and discussed, ultimately aiming to harness, rather than suppress, chaotic behavior to potentially enhance certain quantum algorithms. The research contributes to a deeper understanding of the complex relationship between quantum systems and chaos, providing a foundation for the development of more robust and adaptable quantum control protocols. The study utilizes mathematical formalism to rigorously define and analyze the concepts explored, focusing on key equations governing quantum dynamics and chaotic systems.