Simulating quantum many-body systems is a key application for emerging quantum processors. While analog quantum simulation has already demonstrated quantum advantage, its digital counterpart has recently become the focus of intense research interest due to the availability of devices that aim to realize general-purpose quantum computers. In this perspective, we give a selective overview of the currently pursued approaches, review the advances in digital quantum simulation by comparing non-variational with variational approaches and identify hardware and algorithmic challenges. Based on this review, the question arises: What are the most promising problems that can be tackled with digital quantum simulation? We argue that problems of a qualitative nature are much more suitable for near-term devices then approaches aiming purely for a quantitative accuracy improvement.
Simulating quantum many-body systems is a key application for emerging quantum processors. While analog quantum simulation has already demonstrated quantum advantage, its digital counterpart has recently become the focus of intense research interest due to the availability of devices that aim to realize general-purpose quantum computers. In this perspective, we give a selective overview of the currently pursued approaches, review the advances in digital quantum simulation by comparing non-variational with variational approaches and identify hardware and algorithmic challenges. Based on this review, the question arises: What are the most promising problems that can be tackled with digital quantum simulation? We argue that problems of a qualitative nature are much more suitable for near-term devices then approaches aiming purely for a quantitative accuracy improvement.
Abstract The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present Review aims at giving a comprehensive outlook on the state‐of‐the‐art capabilities offered from these near‐term noisy devices as universal quantum simulators, that is, programmable quantum computers potentially able to calculate the time evolution of many physical models. First, a pedagogic overview on the basic theoretical background pertaining digital quantum simulations is given, with a focus on hardware‐dependent mapping of spin‐type Hamiltonians into the corresponding quantum circuit as a key initial step toward simulating more complex models. Then, the main experimental achievements obtained in the last decade are reviewed, focusing on the digital quantum simulation of such spin models by employing two leading quantum architectures. Their performances are compared, and future challenges are outlined, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long‐sought quantum advantage for the simulation of complex many‐body models in the physical sciences.
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.
In recent years, the rapidly advancing field of quantum computing has become a focal point of attention. However, issues such as scarcity of quantum hardware and noise pose challenges, leading to the reliance on quantum simulators running on classical computers for tasks like researching quantum algorithms and validating quantum chips. This paper discusses the main simulation methods used by different quantum simulators and explores various optimizations for mainstream full-amplitude state vector simulators and tensor network-based quantum simulators. Finally, we summarize the current status and future directions of quantum simulators. This paper also discusses algorithm-level and system-level optimizations that enhance simulator performance. Looking ahead, the development of quantum simulators faces challenges such as maximizing the use of quantum state properties and creating algorithms to overcome exponential growth issues in simulations. The future will likely focus on integrating high-performance computing resources, advancing optimization strategies, and tailoring simulations to specific applications, aiming for higher efficiency and precision in quantum simulations.
Quantum simulations consist in the intentional reproduction of physical or unphysical models into another more controllable quantum system. Beyond establishing communication vessels between unconnected fields, they promise to solve complex problems which may be considered as intractable for classical computers. From a historic perspective, two independent approaches have been pursued, namely, digital and analog quantum simulations. The former usually provide universality and flexibility, while the latter allows for better scalability. Here, we review recent literature merging both paradigms in the context of superconducting circuits, yielding: digital-analog quantum simulations. In this manner, we aim at getting the best of both approaches in the most advanced quantum platform involving superconducting qubits and microwave transmission lines. The discussed merge of quantum simulation concepts, digital and analog, may open the possibility in the near future for outperforming classical computers in relevant problems, enabling the reach of a quantum advantage.
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.
Quantum simulation, as a practical application of noisy quantum computing, has aided the study of exotic quantum matters and the implementation of algorithms that outperform classical approaches. Superconducting qubits, one of the most promising candidates for realizing universal quantum computing, possess state-of-the-art features like easy integration of qubits, long coherence time, and high-fidelity single- and two-qubit gates. These characteristics have enabled applications of digital quantum simulation in the fields of physics, chemistry, and computer science. In this review, we first present the basic concepts of superconducting qubits, quantum gates, and digital quantum simulations. We also explore recent progress in digital quantum simulations using superconducting qubits, especially in relation to quantum chemistry, quantum matters, combinatorial optimization, and quantum machine learning. Finally, we address the current challenges of digital quantum simulation with superconducting qubits, and provide a perspective on the future of the field.