A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth.
Mateus de Oliveira OliveiraPublished in: CoRR (2016)
Keyphrases
- lower bound
- upper bound
- constant factor
- quantum computing
- objective function
- space complexity
- computational complexity
- logic circuits
- lower and upper bounds
- linear functions
- branch and bound algorithm
- neural network
- branch and bound
- worst case
- np hard
- bounded treewidth
- pairwise
- high speed
- sample complexity
- search space
- logic synthesis
- memory requirements
- low power
- linear programming relaxation
- delay insensitive
- optimal solution