We show that current noisy quantum computers are ideal platforms for the simulation of quantum many-body dynamics in generic open systems.We demonstrate this using the IBM Quantum Computer as an experimental platform for confirming the theoretical prediction from Wang et al., [Phys. Rev. Lett. 124, 100604 (2020)] of an emergent hierarchy of relaxation timescales of many-body observables involving different numbers of qubits.Using different protocols, we leverage the intrinsic dissipation of the machine responsible for gate errors, to implement a quantum simulation of generic (i.e., structureless) local dissipative interactions.
We show that current noisy quantum computers are ideal platforms for the simulation of quantum many-body dynamics in generic open systems.We demonstrate this using the IBM Quantum Computer as an experimental platform for confirming the theoretical prediction from Wang et al., [Phys. Rev. Lett. 124, 100604 (2020)] of an emergent hierarchy of relaxation timescales of many-body observables involving different numbers of qubits.Using different protocols, we leverage the intrinsic dissipation of the machine responsible for gate errors, to implement a quantum simulation of generic (i.e., structureless) local dissipative interactions.
Understanding the dynamics of open quantum systems is intrinsically important to control and utilize quantum hardware in various applications. The generic behavior of purely dissipative open quantum many-body systems with k-local, normal dissipation processes can be investigated using random matrix theory, revealing different decay timescales of observables determined by their complexity, as shown by Wang et al. [K. Wang et al., Phys. Rev. Lett. 124, 100604 (2020)]. The time evolution of an open quantum system is entirely described by the eigenvalue spectrum of the Lindbladian, in which the hierarchy of decay timescales is reflected in the formation of well-separated eigenvalue clusters. Here, we extend the analysis of this spectrum to the presence of unitary dynamics using a random matrix model. In the case of strong dissipation, the unitary dynamics can be treated perturbatively and the k locality of the Hamiltonian determines how susceptible the spectrum is to such a perturbation. For the physically most relevant case of (dissipative) two-body interactions, the correction in the first order of the perturbation vanishes, leading to the relative robustness of the spectral features, which in turn implies the same robustness of the corresponding separation of decay timescales. We find the perturbative approach for the spectrum to yield an excellent agreement with exact-diagonalization results. For weak dissipation, the spectrum flows into clusters except for outlier eigenmodes, which we identify to be the local symmetries of the Hamiltonian. We support our analytic findings by numerical simulations and show that our generic model applies to a nonrandom Heisenberg chain.
We consider the effects of strong dissipation in quantum systems with a notion of locality, which induces a hierarchy of many-body relaxation timescales as shown by K. Wang, F. Piazza, and D. J. Luitz [Phys. Rev. Lett. 124, 100604 (2020)]. If the strength of the dissipation varies strongly in the system, additional separations of timescales can emerge, inducing a manifold of metastable states, to which observables relax first, before relaxing to the steady state. Our simple model, involving one or two ``good'' qubits with dissipation reduced by a factor $\ensuremath{\alpha}<1$ compared to the other ``bad'' qubits, confirms this picture and admits a perturbative treatment.
Abstract Quantum simulation represents the most promising quantum application to demonstrate quantum advantage on near-term noisy intermediate-scale quantum (NISQ) computers, yet available quantum simulation algorithms are prone to errors and thus difficult to realize with limited circuit depth on nowadays quantum devices. Herein, we propose a novel scheme to utilize intrinsic gate errors of NISQ devices to enable controllable simulation of open quantum system dynamics without ancillary qubits or explicit bath engineering, thus turning unwanted quantum noises into useful quantum resources. Specifically, we simulate the energy transfer process in a photosynthetic dimer system on IBM-Q cloud. By employing tailored decoherence-inducing gates, we show that quantum dissipative dynamics can be simulated efficiently across coherent-to-incoherent regimes with results comparable to those of the numerically exact classical method. Moreover, we demonstrate a calibration routine that enables consistent and predictive simulations of open-quantum system dynamics in the intermediate coupling regime. This work provides a new direction for quantum advantage in the NISQ era.
Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid advances in recent years. Yet, current quantum devices remain noisy and limited in scale. Hence, it is essential to identify classically hard problems of practical interest and tractable with existing quantum devices. Among potential applications, the real-time simulation of quantum systems is one of the most promising to deliver an early, practical quantum advantage. This doctoral thesis is therefore centered around simulating quantum dynamics on quantum devices. We first present an overview of the most relevant quantum algorithms for quantum dynamics, highlighting respective advantages and limitations. Further, we identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future. Second, we propose a method for benchmarking hardware and error mitigation algorithms that is based on well-understood theoretical results and suffers from no scaling issues. The resulting quality metric is intuitive and transferable to other applications. We successfully implement the scheme on up to 133 qubits, demonstrating coherent evolution up to a two-qubit gate depth of 28, featuring 1396 two-qubit gates, before noise becomes prevalent. Third, we propose a novel variant of probabilistic error amplification to implement open quantum dynamics, relying on characterizing and altering hardware noise to mimic the system-environment interaction under study. Lastly, we present two studies on state preparation and phase classification: first, a hybrid algorithm to prepare ground states of electron-phonon systems; second, a quantum machine learning-based approach to distinguish phases in previously prepared quantum states.
Abstract Universal quantum computers are potentially an ideal setting for simulating many-body quantum dynamics that is out of reach for classical digital computers. We use state-of-the-art IBM quantum computers to study paradigmatic examples of condensed matter physics—we simulate the effects of disorder and interactions on quantum particle transport, as well as correlation and entanglement spreading. Our benchmark results show that the quality of the current machines is below what is necessary for quantitatively accurate continuous-time dynamics of observables and reachable system sizes are small comparable to exact diagonalization. Despite this, we are successfully able to demonstrate clear qualitative behaviour associated with localization physics and many-body interaction effects.
Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.