Problem
Research questions and friction points this paper is trying to address.
Quantum state preparation
weighted d-DNNF
quantum circuit
pseudo-Boolean circuits
Quantum state preparation for weighted d-DNNF
🤖 AI Summary
This study addresses the bottleneck of excessive circuit generation complexity in weighted d-DNNF-based quantum state preparation, which hinders its efficient application in quantum computing. To overcome this limitation, we propose a linear-time-complexity quantum circuit construction scheme that deeply integrates the structural properties of weighted d-DNNFs with complex arithmetic optimization algorithms. This approach successfully reduces the complexity of quantum circuit generation to a linear level, achieving near-linear-time efficient quantum state preparation. By breaking through conventional efficiency constraints, our method establishes a scalable new paradigm for the rapid compilation of complex quantum states, thereby facilitating more practical and high-performance implementations within quantum computing frameworks.
📝 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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Quantum state preparation
weighted d-DNNF
quantum circuit
linear time complexity
pseudo-Boolean circuits
🔎 Similar Papers
No similar papers found.
