7th International Conference on Artificial Intelligence and Applications 2020
DOI: 10.5121/csit.2020.100307
|View full text |Cite
|
Sign up to set email alerts
|

Entanglement in Shor's Factoring Algorithm

Abstract: Quantum algorithms are well known for their higher efficiency compared to their classical counterparts. However, the origin of the speed-up offered by quantum algorithms is a debatable question. Using entanglement measure based on coefficient matrix, we investigate the entanglement features of the quantum states used in Shor's factoring algorithm. The results show that if and only if the order r is 1, the algorithm generates no entanglement. Finally, compare with published studies results (

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…These are all properties fulfilled by spin-network states belonging to the Hilbert space of TQFT and realizing a holonomic quantum computing system. [42,43] Focusing on a quantum Turing machine 𝔐, satisfying specific axioms [44] and resulting as an instantiation of a quantum simulator, it is possible to identify the computational space of 𝔐 with spin-network states, and hence code information in terms of irreducible representations of SU (2). Suppose for instance to recover as building blocks of 𝔐 an ordered collection of n + 1 mutually commuting angular momentum operators, which we denote as {J l }, with l = 1, … , n + 1.…”
Section: Marzuoli-rasetti Coding and Tqft As Quantum Simulatormentioning
confidence: 99%
See 1 more Smart Citation
“…These are all properties fulfilled by spin-network states belonging to the Hilbert space of TQFT and realizing a holonomic quantum computing system. [42,43] Focusing on a quantum Turing machine 𝔐, satisfying specific axioms [44] and resulting as an instantiation of a quantum simulator, it is possible to identify the computational space of 𝔐 with spin-network states, and hence code information in terms of irreducible representations of SU (2). Suppose for instance to recover as building blocks of 𝔐 an ordered collection of n + 1 mutually commuting angular momentum operators, which we denote as {J l }, with l = 1, … , n + 1.…”
Section: Marzuoli-rasetti Coding and Tqft As Quantum Simulatormentioning
confidence: 99%
“…They provide, as elements of the transfer matrices connecting any pair of states, the analog of the transition function of the quantum Turing Machine. [44] They also represent perfect tensor-networks, in the sense of ref. [17].…”
Section: Marzuoli-rasetti Coding and Tqft As Quantum Simulatormentioning
confidence: 99%