Quantum state preparation for weighted d-DNNF
Steef Hegeman, Joon Hyung Lee, Alfons Laarman
Abstract
The quantum state preparation problem is to, given a description of a quantum state, efficiently generate a quantum circuit computing the state. We show that for quantum states described by weighted d-DNNF (deterministic, decomposable pseudo-Boolean circuits) a quantum circuit computing the state can be obtained in linear time up to complex arithmetic.
Create a lesson
Related papers
Single-Particle Spectral Estimation
Adrian Chapman, Charles Derby, Steven T. Flammia et al.
Learning SYK Hamiltonians
Anurag Anshu, Srinivasan Arunachalam, Sitan Chen et al.
From Permutation Symmetry to Communication Bounds and Additivity
Zahra Baghali Khanian, Debbie Leung, Graeme Smith
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
Fuchuan Wei, Kong-Wing Wu, Zhengwei Liu et al.
Polynomial-time classical and quantum simulation of quantum impurity models
Jiaqing Jiang, Nathan Ju, Ojas Parekh et al.
Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses
Omar Al-Ghattas, David Gamarnik, Bobak T Kiani