arrow
返回

Approximating Decision Diagrams for Quantum Circuit Simulation

delete2022-07-27
delete6
delete
OA
AI
S
Stefan Hillmich *
A
Alwin Zulehner
R
Richard Kueng
I
Igor L. Markov
R
Robert Wille
DOI:10.1145/3530776delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Quantum computers promise to solve important problems faster than conventional computers ever could. Underneath is a fundamentally different computational primitive that introduces new challenges for the development of software tools that aid designers of corresponding quantum algorithms. The different computational primitives render classical simulation of quantum circuits particularly challenging. While the logic simulation of conventional circuits is comparatively simple with linear complexity with respect to the number of gates, quantum circuit simulation has to deal with the exponential memory requirements to represent quantum states on non-quantum hardware with respect to the number of qubits. Decision Diagrams (DDs) address this challenge through exploitation of redundancies in matrices and vectors to provide significantly more compact representations in many cases. Moreover, the probabilistic nature of quantum computations enables another angle to tackle the complexity: Quantum algorithms are resistant to some degree against small inaccuracies in the quantum state as these only lead to small changes in the outcome probabilities. We propose to exploit this resistance against (small) errors to gain even more compact decision diagrams. In this work, we investigate the potential of approximation in quantum circuit simulation in detail. To this end, we first present four dedicated schemes that exploit the error resistance and efficiently approximate quantum states represented by decision diagrams. Subsequently, we propose two simulation strategies that utilize those approximations schemes in order to improve the efficiency of DD-based quantum circuit simulation, while, at the same time, allowing the user to control the resulting degradation in accuracy. We empirically show that the proposed approximation schemes reduce the size of decision diagrams substantially and also analytically prove the effect of multiple approximations on the attained accuracy. Eventually, this enables speed-ups of the resulting approximate quantum circuit simulation of up to several orders of magnitudes-again, while controlling the fidelity of the result.
Keyword:
SUPREMACY

期刊

A
ACM Transactions on Quantum Computing
IF:
6.8
论文数:
542
被引数:
508

机构

J
Johannes Kepler University Linz
学者数:
5.5K
论文数: 4.6K
被引数: 106
U
University of Michigan
学者数:
6.4W
论文数: 5.3W
被引数: 124
U
university of michigan system
学者数:
9.1W
论文数: 8.6W
被引数: 133
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
QuEST and High Performance Simulation of Quantum ComputersQuEST与量子计算机的高性能仿真
err2019-07-24
err161
errOAAI
errJones, Tyson; Brown, Anna; Bush, Ian; Benjamin, Simon C.
err分享
err收藏
Characterizing quantum supremacy in near-term devices表征近期设备中的量子至高无上
err2018-04-23
err762
errOAAI
errBoixo, Sergio; Isakov, Sergei, V; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut
err分享
err收藏
Structural Basis of the Iron Storage Function of Frataxin from Single-Particle Reconstruction of the Iron-Loaded Oligomer
err2008-04-05
err0
errOAAI
errUlrika Schagerlöf; Hans Elmlund; Oleksandr Gakh; Gustav Nordlund; Hans Hebert; Martin Lindahl; Grazia Isaya; Salam Al-Karadaghi
err分享
err收藏
学者 查看更多内容