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:
Main Author: | Soltan Aghaei, Mohammad Reza |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2010
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/12444/1/FSKTM_2010_5A.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Quantum correlations and measurements in tri-partite quantum systems /
by: Bahari Idrus
Published: (2011) -
A study of analytical solutions to the bound state problem in non-relativistic quantum mechanics /
by: P. Rajesh Kumar K. Parameswaran Nair
Published: (2016) -
Quantum Entanglement Criteria /
by: Aini Syahida Sumairi
Published: (2013) -
Quantum anharmonic potentials with operator and factorization methods
by: Tan, Min Yang
Published: (2023) -
Two way quantum key distribution in imperfect settings /
by: Iskandar bin Bahari
Published: (2011)