A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth.
Mateus de Oliveira OliveiraPublished in: SODA (2018)
Keyphrases
- lower bound
- upper bound
- space complexity
- quantum computing
- objective function
- constant factor
- search space
- logic circuits
- branch and bound
- computational complexity
- branch and bound algorithm
- optimal solution
- high speed
- linear functions
- boolean functions
- lower and upper bounds
- np hard
- bounded treewidth
- quantum computation
- evolutionary algorithm
- search algorithm
- logic synthesis
- quantum inspired