تقرير
Quantum Algorithmic Gate-Based Computing: Grover Quantum Search Algorithm Design in Quantum Software Engineering
| العنوان: | Quantum Algorithmic Gate-Based Computing: Grover Quantum Search Algorithm Design in Quantum Software Engineering |
|---|---|
| المؤلفون: | Ulyanov, Sergey V., Ulyanov, Viktor S. |
| سنة النشر: | 2023 |
| المجموعة: | Quantum Physics |
| مصطلحات موضوعية: | Quantum Physics, 81-08, 81-05, 68T40, 93C85 |
| الوصف: | The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators. Input to QA in this case is always the same. Output of QA says which problem coded. In some sense, give a function to QA to analyze and QA returns its property as an answer without quantitative computing. QA studies qualitative properties of the functions. The core of any QA is a set of unitary quantum operators or quantum gates. In practical representation, quantum gate is a unitary matrix with particular structure. The size of this matrix grows exponentially with an increase in the number of inputs, which significantly limits the QA simulation on a classical computer with von Neumann architecture. Quantum search algorithm (QSA) - models apply for the solution of computer science problems as searching in unstructured data base, quantum cryptography, engineering tasks, control system design, robotics, smart controllers, etc. Grovers algorithm is explained in details along with implementations on a local computer simulator. The presented article describes a practical approach to modeling one of the most famous QA on classical computers, the Grover algorithm. Comment: arXiv admin note: text overlap with arXiv:quant-ph/0112105 by other authors |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2304.13703 |
| رقم الأكسشن: | edsarx.2304.13703 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |