Quantum Processing Framework And Hybrid Algorithms For Routing Problems
The theory of quantum complexity determines when quantum computers may offer a computational speed-up over classical computers. At present, there are only a few general well-known techniques in the field of quantum computing and finding the problems that are amenable to quantum speedups is a high...
Saved in:
主要作者: | Soltan Aghaei, Mohammad Reza |
---|---|
格式: | Thesis |
語言: | English English |
出版: |
2010
|
主題: | |
在線閱讀: | http://psasir.upm.edu.my/id/eprint/12444/1/FSKTM_2010_5A.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Quantum circuit complexity in Riemannian geometry of 3-qubit quantum fourier transform
由: Chew, Kang Ying
出版: (2022) -
Quantum correlations and measurements in tri-partite quantum systems /
由: Bahari Idrus
出版: (2011) -
A study of analytical solutions to the bound state problem in non-relativistic quantum mechanics /
由: P. Rajesh Kumar K. Parameswaran Nair
出版: (2016) -
Quantum Entanglement Criteria /
由: Aini Syahida Sumairi
出版: (2013) -
Quantum anharmonic potentials with operator and factorization methods
由: Tan, Min Yang
出版: (2023)