QI 1: Quantum Computing and Algorithms I
Monday, March 9, 2026, 09:30–12:45, BEY/0137
 |
09:30 |
QI 1.1 |
The Complexity of Simulating Inertially Coupled Bosonic Hamiltonians — •Refik Mansuroglu, Lilith Zschetzsche, and Norbert Schuch
|
|
|
|
09:45 |
QI 1.2 |
Equivalence of Quantum Walk and Coupled Classical Oscillator Simulation — •Lilith Zschetzsche, Refik Mansuroglu, András Molnár, and Norbert Schuch
|
|
|
|
10:00 |
QI 1.3 |
Block encoding and QSVT for solving differential equations — •Abhishek Setty
|
|
|
|
10:15 |
QI 1.4 |
Exploring Variational Entanglement Hamiltonians — •Yanick S. Kind and Benedikt Fauseweh
|
|
|
|
10:30 |
QI 1.5 |
The sub-Riemannian geometry of measurement based quantum computation — •Lukas Hantzko
|
|
|
|
10:45 |
QI 1.6 |
Entanglement-informed construction of variational quantum circuits — Alina Joch, Götz Uhrig, and •Benedikt Fauseweh
|
|
|
| |
11:00 |
|
30min. break
|
|
|
|
11:30 |
QI 1.7 |
Measurement-driven Quantum Approximate Optimization — •Tobias Stollenwerk and Stuart Hadfield
|
|
|
|
11:45 |
QI 1.8 |
Greens Function on Quantum Computers: Error Mitigation and application in Dynamical Mean Field Theory — •Jannis Ehrlich, Aljoscha F. Baumann, Daniel F. Urban, and Christian Elsässer
|
|
|
|
12:00 |
QI 1.9 |
Generation of Fermionic Gaussian States: Optimal and Approximate Matchgate Circuits — •Marc Langer, Raúl Morral-Yepes, Adam Gammon-Smith, Frank Pollmann, and Barbara Kraus
|
|
|
|
12:15 |
QI 1.10 |
Adaptive, efficient and provable energy estimation on noisy intermediate-scale quantum computers — •Bruno Murta, Alexander Gresch, and Martin Kliesch
|
|
|
|
12:30 |
QI 1.11 |
A Constant Measurement Quantum Algorithm for Graph Connectivity — •Maximilian Balthasar Mansky, Chonfai Kam, and Claudia Linnhoff-Popien
|
|
|
