Multipartite entanglement in quantum algorithms
D. Bru{\ss}, C. Macchiavello

TL;DR
This paper analyzes the multipartite entanglement properties of quantum states used in key quantum algorithms, revealing that most instances involve complex entanglement structures.
Contribution
It provides a detailed analysis of entanglement features in prominent quantum algorithms, highlighting the prevalence of multipartite entanglement.
Findings
Most instances in the analyzed algorithms involve multipartite entanglement.
The study offers insights into the entanglement structure of quantum algorithm states.
Multipartite entanglement is common in the examined quantum algorithms.
Abstract
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
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.
