Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds.
Pascal BaßlerMarkus HeinrichMartin KlieschPublished in: Quantum (2024)
Keyphrases
- worst case
- optimal solution
- dynamic programming
- optimal cost
- asymptotically optimal
- asymptotic optimality
- lower bound
- upper bound
- worst case analysis
- complexity analysis
- search algorithm
- efficiently computable
- np hard
- computationally efficient
- error bounds
- finding optimal
- evolutionary algorithm
- error tolerance
- linear programming
- optimal or near optimal
- tight bounds
- optimal planning
- greedy heuristic
- space requirements
- steady state
- upper and lower bounds
- heuristic search
- heuristic methods
- optimal strategy
- space complexity
- exhaustive search