An Efficient Algorithmic Way to Construct Boltzmann Machine Representations for Arbitrary Stabilizer Code

Restricted Boltzmann machines (RBMs) have demonstrated considerable success as variational quantum states; however, their representational power remains incompletely understood. In this work, we present an analytical proof that RBMs can exactly and efficiently represent stabilizer code states (a class of highly entangled quantum states that are central to quantum error correction). Given a set of stabilizer generators, we develop an efficient algorithm to determine both the RBM architecture and the exact values of its parameters. Our findings provide new insights into the expressive power of RBMs, highlighting their capability to encode highly entangled states, and may serve as a useful tool for the classical simulation of quantum error-correcting codes.