Approximation of Quantum States Using Decision Diagrams
Preprint
Abstract
The computational power of quantum computers poses major challenges to new design tools since representing pure quantum states typically requires exponentially large memory. As shown previously, decision diagrams can reduce these memory requirements by exploiting redundancies. In this work, we demonstrate further reductions by allowing for small inaccuracies in the quantum state representation. Such inaccuracies are legitimate since quantum computers themselves experience gate and measurement errors and since quantum algorithms are somewhat resistant to errors (even without error correction). We develop four dedicated schemes that exploit these observations and effectively approximate quantum states represented by decision diagrams. We empirically show that the proposed schemes reduce the size of decision diagrams by up to several orders of magnitude while controlling the fidelity of approximate quantum state representations.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Quantum Algorithm Implementations for BeginnersACM Transactions on Quantum Computing, 2022
- How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing2019
- Characterizing quantum supremacy in near-term devicesNature Physics, 2018
- Low-Depth Quantum Simulation of MaterialsPhysical Review X, 2018
- One-pass Design of Reversible Circuits: Combining Embedding and Synthesis for Reversible LogicIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2017
- QMDDs: Efficient Quantum Function Representation and ManipulationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2015
- A practical introduction to tensor networks: Matrix product states and projected entangled pair statesAnnals of Physics, 2014
- An XQDD-Based Verification Method for Quantum CircuitsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
- Algorithms for quantum computation: discrete logarithms and factoring2002
- Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functionsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998