Dresden 2026 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
QI: Fachverband Quanteninformation
QI 1: Quantum Computing and Algorithms I
QI 1.4: Talk
Monday, March 9, 2026, 10:15–10:30, BEY/0137
Exploring Variational Entanglement Hamiltonians — •Yanick S. Kind1,2 and Benedikt Fauseweh1,2 — 1TU Dortmund, Dortmund, Germany — 2German Aerospace Center, Cologne, Germany
Recent advances in analog and digital quantum-simulation platforms have enabled exploration of the spectrum of entanglement Hamiltonians via variational algorithms. We investigate the convergence properties of a variational algorithm and benchmark the results against numerically exact calculations. By interpreting the cost function as an integral, we employ an iterative quadrature scheme, reducing the measurement overhead by several orders of magnitude. We further demonstrate that a modified Bisognano-Wichmann ansatz allows better convergence in lattice models and provides a diagnostic for quantum phase transitions. Finally, we show that a lower cost function does not necessarily lead to a lower trace distance. However, it still faithfully reproduces degeneracies in the entanglement spectrum, which are essential for topological applications. Y. S. Kind, B. Fauseweh, arXiv:2505.10530, 2025
Keywords: Entanglement Hamiltonian; Variational Algorithms; Quantum Classical Hybrid Methods