Sample-efficient estimation of entanglement entropy through supervised learning
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 42 references indexed in Scilit:
- Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methodsMachine Learning, 2021
- Experimental quantum compressed sensing for a seven-qubit systemNature Communications, 2017
- A practical introduction to tensor networks: Matrix product states and projected entangled pair statesAnnals of Physics, 2014
- The density-matrix renormalization group in the age of matrix product statesAnnals of Physics, 2011
- Efficient quantum state tomographyNature Communications, 2010
- Entanglement detectionPhysics Reports, 2009
- Squeezing and entanglement in a Bose–Einstein condensateNature, 2008
- Metal–insulator transition in a weakly interacting many-electron system with localized single-particle statesAnnals of Physics, 2006
- Entanglement of the orbital angular momentum states of photonsNature, 2001
- Bell inequalities and the separability criterionPhysics Letters A, 2000