Mozafari, FereshteDe Micheli, GiovanniYang, Yuxiang2022-10-242022-10-242022-10-242022-08-2910.1103/PhysRevA.106.022617https://infoscience.epfl.ch/handle/20.500.14299/191560WOS:000861237600009Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state to prepare has a certain structure that allows for faster preparation. In this paper, we consider quantum states that can be efficiently represented by (reduced) decision diagrams, a versatile data structure for the representation and analysis of Boolean functions. We design an algorithm that utilizes the structure of decision diagrams to prepare their associated quantum states. Our algorithm has a circuit complexity that is linear in the number of paths in the decision diagram. Numerical experiments show that our algorithm reduces the circuit complexity by up to 31.85% compared to the state-of-the-art algorithm, when preparing generic n-qubit states with n(3) nonzero amplitudes. Additionally, for states with sparse decision diagrams, including the initial state of the quantum Byzantine agreement protocol, our algorithm reduces the number of controlled-NOTs by 86.61-99.9%.OpticsPhysics, Atomic, Molecular & ChemicalOpticsPhysicstext::journal::journal article::research article