Machine-learning certification of multipartite entanglement for noisy quantum hardware
Andreas J. C. Fuchs, Eric Brunner, Jiheon Seong, Hyeokjea Kwon,, Seungchan Seo, Joonwoo Bae, Andreas Buchleitner, Edoardo G. Carnio

TL;DR
This paper introduces a machine learning-based method to certify multipartite entanglement in noisy quantum hardware by analyzing measurement data to determine entanglement across different partitions.
Contribution
It presents a novel certification pipeline combining measurement statistics and non-linear dimensionality reduction to classify entanglement in multipartite quantum states.
Findings
High accuracy on simulated data
Effective application to IBM quantum hardware
Robustness to noise and state purity variations
Abstract
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a significant challenge, since a state can be entangled with respect to many different of its partitions. We develop a certification pipeline that feeds the statistics of random local measurements into a non-linear dimensionality reduction algorithm, to determine with respect to which partitions a given quantum state is entangled. After training a model on randomly generated quantum states, entangled in different partitions and of varying purity, we verify the accuracy of its predictions on simulated test data, and finally apply it to states prepared on IBM quantum computing hardware.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
