Login / Signup
On the Satisfiability of Quantum Circuits of Small Treewidth.
Mateus de Oliveira Oliveira
Published in:
CoRR (2014)
Keyphrases
</>
quantum computing
computational complexity
upper bound
boolean functions
logic circuits
search space
small number
high speed
quantum inspired
logic synthesis
np complete
objective function
satisfiability problem
propositional logic
orders of magnitude
decision procedures
space complexity
low cost
search algorithm