About
What to expect
The talk looks at where and how quantum algorithms can outperform classical computation.
- Complexity of quantum-annealing algorithms
- Limitations for combinatorial optimization problems
- New optimal-control algorithms for quantum systems
- Tools from stochastic path-integral control and weak measurement theory
FAQ
Where can I find the event page?
The agenda page is here:
**ru.nl
Who organizes it?
Donders Centre for Neuroscience
Donders Institute for Brain, Cognition and Behaviour
Faculty of Science
What does Aarón study in his dissertation?
He investigates the computational complexity of quantum-annealing algorithms and their potential advantage compared with classical methods. The work also sheds light on the limits of quantum annealing for combinatorial optimization problems.
What else does the research cover?
Aarón develops new optimal-control algorithms for quantum systems. He combines stochastic path-integral control, geometric optimization, quantum feedback control and weak measurement theory.
Getting there
Radboud Universiteit, Houtlaan 4, 6525 XZ Nijmegen, Gelderland, NL
Open in Maps (opens in a new window)