Quantum entanglement in n-qubit real equally weighted states
Ri Qu, Yanru Bao

TL;DR
This paper investigates the entanglement properties of n-qubit real equally weighted states used in quantum algorithms, classifying them into seven groups based on structural degrees and analyzing their multipartite entanglement features.
Contribution
It provides a novel classification of n-qubit real equally weighted states and analyzes their entanglement characteristics, enhancing understanding of their role in quantum algorithms.
Findings
States are classified into 7 parts based on structural degrees.
Multipartite entanglement features vary across different classes.
Insights into entanglement structure aid quantum algorithm analysis.
Abstract
The n-qubit real equally weighted states are employed in some quantum algorithms including Deutsch-Jozsa, Grover, Simon, and so on. We qualitatively investigate the entanglement properties of n-qubit real equally weighted states. Firstly, all of the n-qubit real equally weighted states are classified into 7 parts by means of their structural degrees. Then we analyze the multipartite entanglement features of the states in every part by means of separable and similar degrees.
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
