A new compilation method produces quantum oracle circuits with at most 4c_∧(f) T gates and c_∧(f) ancillae, where c_∧ is the Boolean multiplicative complexity of f.
A meet-in- the-middle algorithm for fast synthesis of depth-optimal quantum circ uits,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits
A new compilation method produces quantum oracle circuits with at most 4c_∧(f) T gates and c_∧(f) ancillae, where c_∧ is the Boolean multiplicative complexity of f.