The work defines the HRSE model for oracle description and complexity analysis, then gives the ASDT algorithm that produces oracle structures with a claimed optimal gate count for given qubits and shows 53.99% average depth reduction versus W-cycle in experiments with 10-20 variables.
Resource efficient Boolean function solver on quantum computer,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Modeling and Resource Optimization for Quantum Oracles
The work defines the HRSE model for oracle description and complexity analysis, then gives the ASDT algorithm that produces oracle structures with a claimed optimal gate count for given qubits and shows 53.99% average depth reduction versus W-cycle in experiments with 10-20 variables.