A Herculean task: Classical simulation of quantum computers
- URL: http://arxiv.org/abs/2302.08880v1
- Date: Fri, 17 Feb 2023 13:59:53 GMT
- Title: A Herculean task: Classical simulation of quantum computers
- Authors: Xiaosi Xu, Simon Benjamin, Jinzhao Sun, Xiao Yuan, and Pan Zhang
- Abstract summary: This work reviews the state-of-the-art numerical simulation methods that emulate quantum computer evolution under specific operations.
We focus on the mainstream state-vector and tensor-network paradigms while briefly mentioning alternative methods.
- Score: 4.12322586444862
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the effort to develop useful quantum computers simulating quantum machines
with conventional computing resources is a key capability. Such simulations
will always face limits preventing the emulation of quantum computers of
substantial scale but by pushing the envelope as far as possible through
optimal choices of algorithms and hardware the value of the simulator tool is
maximized. This work reviews the state-of-the-art numerical simulation methods
i.e. the 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 such as understanding the fundamental difference between quantum
and classical computations exploring algorithm design spaces for quantum
advantage predicting quantum processor performance at the design stage and
characterizing fabricated devices efficiently for fast iterations. This review
complements recent surveys on today's tools and implementations here we seek to
acquaint the reader with an essential understanding of the theoretical basis of
classical simulations detailed discussions on the advantages and limitations of
different methods and the demands and challenges arising from practical use
cases.
Related papers
- Simulation of Quantum Computers: Review and Acceleration Opportunities [0.0]
Quantum computing has the potential to revolutionize multiple fields by solving complex problems that can not be solved in reasonable time with current classical computers.
Currently, the most practical way to develop and test quantum algorithms is to use classical simulators of quantum computers.
This review provides an overview of the components of a quantum computer, the levels at which these components and the whole quantum computer can be simulated, and an analysis of different state-of-the-art acceleration approaches.
arXiv Detail & Related papers (2024-10-16T15:19:12Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study [11.29246196323319]
We describe NASA's work in assessing and advancing the potential of quantum computing.
We discuss advances in algorithms, both near- and longer-term, and the results of our explorations on current hardware and with simulations.
This work also includes physics-inspired classical algorithms that can be used at application scale today.
arXiv Detail & Related papers (2024-06-21T19:05:42Z) - Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation.
We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
arXiv Detail & Related papers (2024-04-10T14:27:07Z) - Distributed Simulation of Statevectors and Density Matrices [0.0]
This manuscript presents a plethora of novel algorithms for distributed full-state simulation of gates, operators, noise channels and other calculations in digital quantum computers.
We show how a simple, common but seemingly restrictive distribution model actually permits a rich set of advanced facilities.
Our results are derived in language familiar to a quantum information theory audience, and our algorithms formalised for the scientific simulation community.
arXiv Detail & Related papers (2023-11-02T18:00:36Z) - Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum
Circuit Simulation [65.93830818469833]
tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind.
We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level.
We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
arXiv Detail & Related papers (2023-02-13T19:00:00Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - A Reorder Trick for Decision Diagram Based Quantum Circuit Simulation [0.4358626952482686]
We study two classes of quantum circuits on which the state-of-the-art decision diagram based simulators failed to perform well in terms of simulation time.
We propose a simple and powerful reorder trick to boost the simulation of such quantum circuits.
arXiv Detail & Related papers (2022-11-14T04:55:25Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z) - Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular
Simulations on Quantum Computing Devices [0.0]
We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies.
We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
arXiv Detail & Related papers (2020-04-23T18:35:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.