Fast simulation of quantum algorithms using circuit optimization
- URL: http://arxiv.org/abs/2010.09746v3
- Date: Thu, 21 Apr 2022 20:56:51 GMT
- Title: Fast simulation of quantum algorithms using circuit optimization
- Authors: Gian Giacomo Guerreschi
- Abstract summary: We propose a specialized compiler pass to reduce the simulation time for arbitrary circuits.
The communication overhead is reduced by changing the order in which state amplitudes are stored.
We then implement a compiler pass to exploit the novel functionalities.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Classical simulators play a major role in the development and benchmark of
quantum algorithms and practically any software framework for quantum
computation provides the option of running the algorithms on simulators.
However, the development of quantum simulators was substantially separated from
the rest of the software frameworks which, instead, focus on usability and
compilation. Here, we demonstrate the advantage of co-developing and
integrating simulators and compilers by proposing a specialized compiler pass
to reduce the simulation time for arbitrary circuits. While the concept is
broadly applicable, we present a concrete implementation based on the Intel
Quantum Simulator, a high-performance distributed simulator. As part of this
work, we extend its implementation with additional functionalities related to
the representation of quantum states. The communication overhead is reduced by
changing the order in which state amplitudes are stored in the distributed
memory, a concept analogous to the distinction between local and global qubits
for distributed Schroedinger-type simulators. We then implement a compiler pass
to exploit the novel functionalities by introducing special instructions
governing data movement as part of the quantum circuit. Those instructions
target unique capabilities of simulators and have no analogue in actual quantum
devices. To quantify the advantage, we compare the time required to simulate
random circuits with and without our optimization. The simulation time is
typically halved.
Related papers
- QOPS: A Compiler Framework for Quantum Circuit Simulation Acceleration with Profile Guided Optimizations [0.38836072943850625]
This work proposes a quantum compiler framework QOPS to enable profile-guided optimization (PGO) for quantum circuit simulation acceleration.
The simulator-specific PGO can be applied to the benchmarks to accelerate the simulation speed by a factor of 1.19.
As for the hardware-independent PGO, compared with the brute force mechanism, which achieves 21% performance improvement against the non-optimized version, the PGO can achieve 16% speedup with a factor of 63 less compilation time than the brute force approach.
arXiv Detail & Related papers (2024-10-12T01:54:09Z) - Compact quantum algorithms for time-dependent differential equations [0.0]
We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.
We generate hybrid quantum-classical algorithms that efficiently perform iterative matrix-vector multiplication and matrix inversion operations.
arXiv Detail & Related papers (2024-05-16T02:14:58Z) - 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) - Parallel Simulation of Quantum Networks with Distributed Quantum State
Management [56.24769206561207]
We identify requirements for parallel simulation of quantum networks and develop the first parallel discrete event quantum network simulator.
Our contributions include the design and development of a quantum state manager that maintains shared quantum information distributed across multiple processes.
We release the parallel SeQUeNCe simulator as an open-source tool alongside the existing sequential version.
arXiv Detail & Related papers (2021-11-06T16:51:17Z) - 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) - Fast quantum circuit simulation using hardware accelerated general
purpose libraries [69.43216268165402]
CuPy is a general purpose library (linear algebra) developed specifically for GPU-based quantum circuits.
For supremacy circuits the speedup is around 2x, and for quantum multipliers almost 22x compared to state-of-the-art C++-based simulators.
arXiv Detail & Related papers (2021-06-26T10:41:43Z) - Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits
at Exascale [57.84751206630535]
We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework.
The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators.
By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
arXiv Detail & Related papers (2021-04-21T13:26:42Z) - Efficient calculation of gradients in classical simulations of
variational quantum algorithms [0.0]
We present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time.
Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives.
It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators.
arXiv Detail & Related papers (2020-09-06T21:39:44Z) - Intel Quantum Simulator: A cloud-ready high-performance simulator of
quantum circuits [0.0]
We introduce the latest release of Intel Quantum Simulator (IQS), formerly known as qHiPSTER.
The high-performance computing capability of the software allows users to leverage the available hardware resources.
IQS allows to subdivide the computational resources to simulate a pool of related circuits in parallel.
arXiv Detail & Related papers (2020-01-28T19:00:25Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
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.