Variational Quantum Computation Integer Factorization Algorithm

The integer factorization problem is a major challenge in the field of computer science, and Shor’s algorithm provides a promising solution for this problem. However, Shor’s algorithm involves complex modular exponentiation computation, which leads to the construction of complicated quantum circuits...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of theoretical physics Ročník 62; číslo 11; s. 245
Hlavní autori:	Zhang, Xinglan, Zhang, Feng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 15.11.2023 Springer Nature B.V
Predmet:	Algorithms Circuits Complexity Computers Elementary Particles Factorization Integers Machine learning Mathematical and Computational Physics Optimization techniques Physics Physics and Astronomy Prime numbers Quantum computing Quantum Field Theory Quantum Physics Qubits (quantum computing) Theoretical Shor’s algorithm Variational quantum algorithm Variational quantum computation integer factorization algorithm Integer factorization Qiskit
ISSN:	1572-9575, 0020-7748, 1572-9575
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!