As Accurate as Needed, as Efficient as Possible: Approximations in
DD-based Quantum Circuit Simulation
- URL: http://arxiv.org/abs/2012.05615v1
- Date: Thu, 10 Dec 2020 12:02:03 GMT
- Title: As Accurate as Needed, as Efficient as Possible: Approximations in
DD-based Quantum Circuit Simulation
- Authors: Stefan Hillmich, Richard Kueng, Igor L. Markov, and Robert Wille
- Abstract summary: Decision Diagrams (DDs) have previously shown to reduce the required memory in many important cases by exploiting redundancies in the quantum state.
We show that this reduction can be amplified by exploiting the probabilistic nature of quantum computers to achieve even more compact representations.
Specifically, we propose two new DD-based simulation strategies that approximate the quantum states to attain more compact representations.
- Score: 5.119310422637946
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers promise to solve important problems faster than
conventional computers. However, unleashing this power has been challenging. In
particular, design automation runs into (1) the probabilistic nature of quantum
computation and (2) exponential requirements for computational resources on
non-quantum hardware. In quantum circuit simulation, Decision Diagrams (DDs)
have previously shown to reduce the required memory in many important cases by
exploiting redundancies in the quantum state. In this paper, we show that this
reduction can be amplified by exploiting the probabilistic nature of quantum
computers to achieve even more compact representations. Specifically, we
propose two new DD-based simulation strategies that approximate the quantum
states to attain more compact representations, while, at the same time,
allowing the user to control the resulting degradation in accuracy. We also
analytically prove the effect of multiple approximations on the attained
accuracy and empirically show that the resulting simulation scheme enables
speed-ups up to several orders of magnitudes.
Related papers
- Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
Quantum computers have the potential to solve intractable problems.
One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems.
In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
arXiv Detail & Related papers (2024-06-05T18:00:01Z) - Quantum Resonant Dimensionality Reduction and Its Application in Quantum Machine Learning [2.7119354495508787]
We propose a quantum resonant dimension reduction (QRDR) algorithm based on the quantum resonant transition to reduce the dimension of input data.
After QRDR, the dimension of input data $N$ can be reduced into desired scale $R$, and the effective information of the original data will be preserved.
Our algorithm has the potential to be utilized in a variety of computing fields.
arXiv Detail & Related papers (2024-05-21T09:26:18Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - 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) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Distributed Quantum Computing with QMPI [11.71212583708166]
We introduce an extension of the Message Passing Interface (MPI) to enable high-performance implementations of distributed quantum algorithms.
In addition to a prototype implementation of quantum MPI, we present a performance model for distributed quantum computing, SENDQ.
arXiv Detail & Related papers (2021-05-03T18:30:43Z)
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.