RECORD
Quantum Entanglement involved in Grover's and Shor's algorithms: the four-qubit case
Quantum Physics · Submitted 21 Nov 2018
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures (numerical ones most of the time). One can ask a different question: what about a qualitative measure of entanglement ? In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms. We treat in this article the case of pure four-qubit systems.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. | contribution 0.95 | 0.77 | 0.04 | asserted 0.67 |
| s1 | So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures (numerical ones most of the time). | background 0.98 | 0.04 | 0.02 | asserted 1.00 |
| s2 | One can ask a different question: what about a qualitative measure of entanglement ? | gap 0.87 | 0.07 | 0.03 | unclear 0.63 |
| s3 | In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms. | contribution 0.95 | 0.57 | 0.08 | asserted 0.75 |
| s4 | We treat in this article the case of pure four-qubit systems. | contribution 0.42 | 0.74 | 0.03 | asserted 0.98 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures (numerical ones most of the time). One can ask a different question: what about a qualitative measure of entanglement ? In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms. We treat in this article the case of pure four-qubit systems.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.