Variational decision diagrams for quantum-inspired machine learning applications
arXiv:2502.04271 · doi:10.1103/wfkx-5k1p
Abstract
Decision diagrams (DDs) have emerged as an efficient tool for simulating quantum circuits due to their capacity to exploit data redundancies in quantum states and quantum operations, enabling the efficient computation of probability amplitudes. However, their application in quantum machine learning (QML) has remained unexplored. This paper introduces variational decision diagrams (VDDs), a novel graph structure that combines the structural benefits of DDs with the adaptability of variational methods for efficiently representing quantum states. We investigate the trainability of VDDs by applying them to the ground state estimation problem for transverse-field Ising and Heisenberg Hamiltonians. Analysis of gradient variance suggests that training VDDs is possible, as no signs of vanishing gradients--also known as barren plateaus--are observed. This work provides new insights into the use of decision diagrams in QML as an alternative to design and train variational ansätze.
11 pages, 3 figures, presented at Quantum Information in Spain (ICE-9)
References in corpus (22)
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Deep autoregressive models for the efficient variational simulation of many-body quantum systems
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systems
- Simulating Quantum Materials with Digital Quantum Computers
- Efficient tensor network simulation of IBM's largest quantum processors
- Quantum circuits for exact unitary -designs and applications to higher-order randomized benchmarking
- Quantum computing for chemistry and physics applications from a Monte Carlo perspective
- Quantum Convolutional Neural Networks are Effectively Classically Simulable
- Lie-algebraic classical simulations for quantum computing
- CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
- Many-Qudit representation for the Travelling Salesman Problem Optimisation
- Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras