Matthias Reumann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Matthias Reumann has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Christian B. Mendl
Technical University of Munich, Munich, Germany
1 shared publication - Damian Rovara
Technical University of Munich, Munich, Germany
1 shared publication - Daniel Haag
Max-Planck-Institut für Quantenoptik Hans-Kopfermann-Str. 1 85748 Garching Germany
1 shared publication - Lukas Burgholzer
Technical University of Munich
1 shared publication Maxine Luo
Max Planck Institute of Quantum Optics, Hans-Kopfermann-Strasse 1, 85748 Garching, Germany
1 shared publication- Patrick Hopf
Technical University of Munich
1 shared publication
Latest Publications
- Open Access
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 28 (3) , 95-103
Leveraging Years of Classical Compiler Expertise for Quantum Computing
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 28 (3) , 95-103
Open AccessLeveraging Years of Classical Compiler Expertise for Quantum Computing
- Open Access
- 2 July 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (14) , 6874-6886
Enhanced Krylov Methods for Molecular Hamiltonians: Reduced Memory Cost and Complexity Scaling via Tensor Hypercontraction
We introduce an algorithm that is simultaneously memory-efficient and low-scaling for applying ab initio molecular Hamiltonians to matrix-product states (MPS) via the tensor-hypercontraction (THC) format. These gains carry over to Krylov subspace methods, which can find low-lying eigenstates and simulate quantum time evolution while avoiding local minima and maintaining high accuracy. In our approach, the molecular Hamiltonian is represented as a sum of products of four MPOs, each with a bond dimension of only 2. Iteratively applying the MPOs to the current quantum state in MPS form, summing and recompressing the MPS leads to a scheme with the same asymptotic memory cost as the bare MPS and reduces the computational cost scaling compared to the Krylov method using a conventional MPO construction. We provide a detailed theoretical derivation of these statements and conduct supporting numerical experiments to demonstrate the advantage. Our algorithm is highly parallelizable and thus lends itself to large-scale HPC simulations.
- 2 July 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (14) , 6874-6886
Open AccessEnhanced Krylov Methods for Molecular Hamiltonians: Reduced Memory Cost and Complexity Scaling via Tensor Hypercontraction
We introduce an algorithm that is simultaneously memory-efficient and low-scaling for applying ab initio molecular Hamiltonians to matrix-product states (MPS) via the tensor-hypercontraction (THC) format. These gains carry over to Krylov subspace methods, which can find low-lying eigenstates and simulate quantum time evolution while avoiding local minima and maintaining high accuracy. In our approach, the molecular Hamiltonian is represented as a sum of products of four MPOs, each with a bond dimension of only 2. Iteratively applying the MPOs to the current quantum state in MPS form, summing and recompressing the MPS leads to a scheme with the same asymptotic memory cost as the bare MPS and reduces the computational cost scaling compared to the Krylov method using a conventional MPO construction. We provide a detailed theoretical derivation of these statements and conduct supporting numerical experiments to demonstrate the advantage. Our algorithm is highly parallelizable and thus lends itself to large-scale HPC simulations.