PreprintarXiv licencearXiv
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.
Related
- Imaginary-time-enhanced feedback-based quantum algorithms for ground-state preparation
- Distinct Feedback-Strength Requirements for Quantum-State Ensemble Preparation under Channel-Equivalent Monitoring
- Counterdiabatic quantum optimization for efficient state preparation in the Schwinger model
- Natural proofs for quantum state preparation lower bounds
- Quantum State Preparation for Complex-Valued Amplitudes
BibTeX
@misc{hegeman2026quantum,
title = {{Quantum state preparation for weighted d-DNNF}},
author = {Steef Hegeman and Joon Hyung Lee and Alfons Laarman},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.02094},
eprint = {2610.02094},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.02094},
}
RIS
TY - UNPB
TI - Quantum state preparation for weighted d-DNNF
AU - Steef Hegeman
AU - Joon Hyung Lee
AU - Alfons Laarman
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.02094
UR - https://arxiv.org/abs/2610.02094
AB - 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.
ER -