Quantum state preparation for weighted d-DNNF

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.

Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)

arXiv:2610.02094 [quant-ph]

(or arXiv:2610.02094v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.02094 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.