An algorithm based on LimTDD diagrams prepares an n-qubit state from a diagram with p reduced paths in O(np) time and with O(n^2p) three-qubit gates, beating ADD-based, Qiskit, and QuICT on structured states.
Prioritizing quantum computing use cases in the drug discovery and development pipeline,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Quantum State Preparation Based on LimTDD
An algorithm based on LimTDD diagrams prepares an n-qubit state from a diagram with p reduced paths in O(np) time and with O(n^2p) three-qubit gates, beating ADD-based, Qiskit, and QuICT on structured states.