Moritz Reh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Moritz Reh has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Martin Gärttner
Friedrich Schiller University Jena
9 shared publications Markus Schmitt
Forschungszentrum Jülich GmbH, Peter Grünberg Institute, Quantum Control (PGI-8), 52425 Jülich, Germany
3 shared publications- Markus Schmitt
Forschungszentrum Jülich
2 shared publications Martin Gärttner
Kirchhoff-Institut für Physik Universität Heidelberg Im Neuenheimer Feld 227 69120 Heidelberg Germany
2 shared publications- Helmut Strobel
Universität Heidelberg
1 shared publication - Markus K. Oberthaler
Universität Heidelberg
1 shared publication
Latest Publications
- Open Access
- 1 April 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (4) , 043004
Entropy estimation in a spin-1 Bose-Einstein condensate
We investigate the information extractable from measurement distributions of two non-commuting spin observables in a multi-well spin-1 Bose–Einstein condensate. We provide a variety of analytic and numerical evidence that suitably chosen classical entropies and classical mutual informations thereof contain the typical feature of quantum entropies known in quantum field theories, that is, the area law, even in the non-Gaussian regime and for a non-zero temperature. Towards a feasible experimental implementation, we estimate entropic quantities from a finite number of samples without any additional assumptions on the underlying quantum state using k-nearest neighbor estimators.
- 1 April 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (4) , 043004
Open AccessEntropy estimation in a spin-1 Bose-Einstein condensate
We investigate the information extractable from measurement distributions of two non-commuting spin observables in a multi-well spin-1 Bose–Einstein condensate. We provide a variety of analytic and numerical evidence that suitably chosen classical entropies and classical mutual informations thereof contain the typical feature of quantum entropies known in quantum field theories, that is, the area law, even in the non-Gaussian regime and for a non-zero temperature. Towards a feasible experimental implementation, we estimate entropic quantities from a finite number of samples without any additional assumptions on the underlying quantum state using k-nearest neighbor estimators.
- Open Access
Sample-efficient estimation of entanglement entropy through supervised learning
We explore a supervised machine learning approach to estimate the entanglement entropy of multi-qubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's estimate and benchmark against the best known conventional estimation algorithms. For states that are contained in the training distribution, we observe convergence in a regime of sample sizes in which the baseline method fails to give correct estimates, while extrapolation only seems possible for regions close to the training regime. As a further application of our method, highly relevant for quantum simulation experiments, we estimate the quantum mutual information for non-unitary evolution by training our model on different noise strengths.
Open AccessSample-efficient estimation of entanglement entropy through supervised learning
We explore a supervised machine learning approach to estimate the entanglement entropy of multi-qubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's estimate and benchmark against the best known conventional estimation algorithms. For states that are contained in the training distribution, we observe convergence in a regime of sample sizes in which the baseline method fails to give correct estimates, while extrapolation only seems possible for regions close to the training regime. As a further application of our method, highly relevant for quantum simulation experiments, we estimate the quantum mutual information for non-unitary evolution by training our model on different noise strengths.
- 2 January 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (1) , 012403
Sample-efficient estimation of entanglement entropy through supervised learning
We explore a supervised machine-learning approach to estimate the entanglement entropy of multiqubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's estimate and benchmark against the best-known conventional estimation algorithms. For states that are contained in the training distribution, we observe convergence in a regime of sample sizes in which the baseline method fails to give correct estimates, while extrapolation only seems possible for regions close to the training regime. As a further application of our method, highly relevant for quantum simulation experiments, we estimate the quantum mutual information for nonunitary evolution by training our model on different noise strengths.
- 2 January 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (1) , 012403
Sample-efficient estimation of entanglement entropy through supervised learning
We explore a supervised machine-learning approach to estimate the entanglement entropy of multiqubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's estimate and benchmark against the best-known conventional estimation algorithms. For states that are contained in the training distribution, we observe convergence in a regime of sample sizes in which the baseline method fails to give correct estimates, while extrapolation only seems possible for regions close to the training regime. As a further application of our method, highly relevant for quantum simulation experiments, we estimate the quantum mutual information for nonunitary evolution by training our model on different noise strengths.
- 9 May 2023
- Published by American Physical Society (APS) in Physical Review B
- Vol. 107 (19) , 195115
Optimizing design choices for neural quantum states
Neural quantum states are a new family of variational Ansätze for quantum-many body wave functions with advantageous properties in the notoriously challenging case of two spatial dimensions. Since their introduction, a wide variety of different network architectures have been employed to study paradigmatic models in quantum many-body physics with a particular focus on quantum spin models. Nonetheless, many questions remain about the effect that the choice of architecture has on the performance on a given task. In this work, we present a unified comparison of a selection of popular network architectures and symmetrization schemes employed for ground-state searches of prototypical spin Hamiltonians, namely, the two-dimensional transverse-field Ising model and the model. In the presence of a nontrivial sign structure of the ground states, we find that the details of symmetrization crucially influence the performance. We describe this effect in detail and discuss its consequences, especially for autoregressive models, as their direct sampling procedure is not compatible with the symmetrization procedure that we found to be optimal.- 9 May 2023
- Published by American Physical Society (APS) in Physical Review B
- Vol. 107 (19) , 195115
Optimizing design choices for neural quantum states
Neural quantum states are a new family of variational Ansätze for quantum-many body wave functions with advantageous properties in the notoriously challenging case of two spatial dimensions. Since their introduction, a wide variety of different network architectures have been employed to study paradigmatic models in quantum many-body physics with a particular focus on quantum spin models. Nonetheless, many questions remain about the effect that the choice of architecture has on the performance on a given task. In this work, we present a unified comparison of a selection of popular network architectures and symmetrization schemes employed for ground-state searches of prototypical spin Hamiltonians, namely, the two-dimensional transverse-field Ising model and the model. In the presence of a nontrivial sign structure of the ground states, we find that the details of symmetrization crucially influence the performance. We describe this effect in detail and discuss its consequences, especially for autoregressive models, as their direct sampling procedure is not compatible with the symmetrization procedure that we found to be optimal.- Open Access
Optimizing Design Choices for Neural Quantum States
Neural quantum states are a new family of variational ansätze for quantum-many body wave functions with advantageous properties in the notoriously challenging case of two spatial dimensions. Since their introduction a wide variety of different network architectures has been employed to study paradigmatic models in quantum many-body physics with a particular focus on quantum spin models. Nonetheless, many questions remain about the effect that the choice of architecture has on the performance on a given task. In this work, we present a unified comparison of a selection of popular network architectures and symmetrization schemes employed for ground state searches of prototypical spin Hamiltonians, namely the two-dimensional transverse-field Ising model and the J1-J2 model. In the presence of a non-trivial sign structure of the ground states, we find that the details of symmetrization crucially influence the performance. We describe this effect in detail and discuss its consequences, especially for autoregressive models, as their direct sampling procedure is not compatible with the symmetrization procedure that we found to be optimal.
Open AccessOptimizing Design Choices for Neural Quantum States
Neural quantum states are a new family of variational ansätze for quantum-many body wave functions with advantageous properties in the notoriously challenging case of two spatial dimensions. Since their introduction a wide variety of different network architectures has been employed to study paradigmatic models in quantum many-body physics with a particular focus on quantum spin models. Nonetheless, many questions remain about the effect that the choice of architecture has on the performance on a given task. In this work, we present a unified comparison of a selection of popular network architectures and symmetrization schemes employed for ground state searches of prototypical spin Hamiltonians, namely the two-dimensional transverse-field Ising model and the J1-J2 model. In the presence of a non-trivial sign structure of the ground states, we find that the details of symmetrization crucially influence the performance. We describe this effect in detail and discuss its consequences, especially for autoregressive models, as their direct sampling procedure is not compatible with the symmetrization procedure that we found to be optimal.
- Open Access
Variational Monte Carlo Approach to Partial Differential Equations with Neural Networks
The accurate numerical solution of partial differential equations is a central task in numerical analysis allowing to model a wide range of natural phenomena by employing specialized solvers depending on the scenario of application. Here, we develop a variational approach for solving partial differential equations governing the evolution of high dimensional probability distributions. Our approach naturally works on the unbounded continuous domain and encodes the full probability density function through its variational parameters, which are adapted dynamically during the evolution to optimally reflect the dynamics of the density. For the considered benchmark cases we observe excellent agreement with numerical solutions as well as analytical solutions in regimes inaccessible to traditional computational approaches.
Open AccessVariational Monte Carlo Approach to Partial Differential Equations with Neural Networks
The accurate numerical solution of partial differential equations is a central task in numerical analysis allowing to model a wide range of natural phenomena by employing specialized solvers depending on the scenario of application. Here, we develop a variational approach for solving partial differential equations governing the evolution of high dimensional probability distributions. Our approach naturally works on the unbounded continuous domain and encodes the full probability density function through its variational parameters, which are adapted dynamically during the evolution to optimally reflect the dynamics of the density. For the considered benchmark cases we observe excellent agreement with numerical solutions as well as analytical solutions in regimes inaccessible to traditional computational approaches.
- Open Access
- 1 December 2022
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 3 (4) , 04LT02
Variational Monte Carlo approach to partial differential equations with neural networks
The accurate numerical solution of partial differential equations (PDEs) is a central task in numerical analysis allowing to model a wide range of natural phenomena by employing specialized solvers depending on the scenario of application. Here, we develop a variational approach for solving PDEs governing the evolution of high dimensional probability distributions. Our approach naturally works on the unbounded continuous domain and encodes the full probability density function through its variational parameters, which are adapted dynamically during the evolution to optimally reflect the dynamics of the density. In contrast to previous works, this dynamical adaptation of the parameters is carried out using an explicit prescription avoiding iterative gradient descent. For the considered benchmark cases we observe excellent agreement with numerical solutions as well as analytical solutions for tasks that are challenging for traditional computational approaches.
- 1 December 2022
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 3 (4) , 04LT02
Open AccessVariational Monte Carlo approach to partial differential equations with neural networks
The accurate numerical solution of partial differential equations (PDEs) is a central task in numerical analysis allowing to model a wide range of natural phenomena by employing specialized solvers depending on the scenario of application. Here, we develop a variational approach for solving PDEs governing the evolution of high dimensional probability distributions. Our approach naturally works on the unbounded continuous domain and encodes the full probability density function through its variational parameters, which are adapted dynamically during the evolution to optimally reflect the dynamics of the density. In contrast to previous works, this dynamical adaptation of the parameters is carried out using an explicit prescription avoiding iterative gradient descent. For the considered benchmark cases we observe excellent agreement with numerical solutions as well as analytical solutions for tasks that are challenging for traditional computational approaches.
- Open Access
Efficient quantum state tomography with convolutional neural networks
Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography scheme which relies on approximating the probability distribution over the outcomes of an informationally complete measurement in a variational manifold represented by a convolutional neural network. We show an excellent representability of prototypical ground- and steady states with this ansatz using a number of variational parameters that scales polynomially in system size. This compressed representation allows us to reconstruct states with high classical fidelities outperforming standard methods such as maximum likelihood estimation. Furthermore, it achieves a reduction of the estimation error of observables by up to an order of magnitude compared to their direct estimation from experimental data.
Open AccessEfficient quantum state tomography with convolutional neural networks
Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography scheme which relies on approximating the probability distribution over the outcomes of an informationally complete measurement in a variational manifold represented by a convolutional neural network. We show an excellent representability of prototypical ground- and steady states with this ansatz using a number of variational parameters that scales polynomially in system size. This compressed representation allows us to reconstruct states with high classical fidelities outperforming standard methods such as maximum likelihood estimation. Furthermore, it achieves a reduction of the estimation error of observables by up to an order of magnitude compared to their direct estimation from experimental data.
- Open Access
- 23 September 2022
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-8
Efficient quantum state tomography with convolutional neural networks
Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography scheme which relies on approximating the probability distribution over the outcomes of an informationally complete measurement in a variational manifold represented by a convolutional neural network. We show an excellent representability of prototypical ground- and steady states with this ansatz using a number of variational parameters that scales polynomially in system size. This compressed representation allows us to reconstruct states with high classical fidelities outperforming standard methods such as maximum likelihood estimation. Furthermore, it achieves a reduction of the estimation error of observables by up to an order of magnitude compared to their direct estimation from experimental data.
- 23 September 2022
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-8
Open AccessEfficient quantum state tomography with convolutional neural networks
Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography scheme which relies on approximating the probability distribution over the outcomes of an informationally complete measurement in a variational manifold represented by a convolutional neural network. We show an excellent representability of prototypical ground- and steady states with this ansatz using a number of variational parameters that scales polynomially in system size. This compressed representation allows us to reconstruct states with high classical fidelities outperforming standard methods such as maximum likelihood estimation. Furthermore, it achieves a reduction of the estimation error of observables by up to an order of magnitude compared to their direct estimation from experimental data.
- Open Access
- 23 August 2022
- Published by Stichting SciPost in SciPost Physics Codebases
- p. 002
jVMC: Versatile and performant variational Monte Carlo leveraging automated differentiation and GPU acceleration
The introduction of Neural Quantum States (NQS) has recently given a new twist to variational Monte Carlo (VMC). The ability to systematically reduce the bias of the wave function ansatz renders the approach widely applicable. However, performant implementations are crucial to reach the numerical state of the art. Here, we present a Python codebase that supports arbitrary NQS architectures and model Hamiltonians. Additionally leveraging automatic differentiation, just-in-time compilation to accelerators, and distributed computing, it is designed to facilitate the composition of efficient NQS algorithms.
- 23 August 2022
- Published by Stichting SciPost in SciPost Physics Codebases
- p. 002
Open AccessjVMC: Versatile and performant variational Monte Carlo leveraging automated differentiation and GPU acceleration
The introduction of Neural Quantum States (NQS) has recently given a new twist to variational Monte Carlo (VMC). The ability to systematically reduce the bias of the wave function ansatz renders the approach widely applicable. However, performant implementations are crucial to reach the numerical state of the art. Here, we present a Python codebase that supports arbitrary NQS architectures and model Hamiltonians. Additionally leveraging automatic differentiation, just-in-time compilation to accelerators, and distributed computing, it is designed to facilitate the composition of efficient NQS algorithms.