A Quantum Processing Framework for Quantum Algorithms

سال انتشار: 1391
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 48

فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_MJEE-6-3_001

تاریخ نمایه سازی: 3 آبان 1402

چکیده مقاله:

The focus of this study is on developing a framework for a Quantum Algorithm Processing Unit (QAPU) with the  hybrid architecture for classical-quantum algorithms. The framework is used to increase the implementation performance of quantum algorithms and design Quantum Processing Units (QPU). The framework shows a general plan for the architecture of quantum processors who is capable of run the quantum algorithms. In particular, the QAPU can be used as a quantum node to design a quantum multicomputer. At first, the hybrid architecture is designed for the quantum algorithms. Then, the relationship between the classical and the quantum part of hybrid algorithms is extracted, and main stages of the hybrid algorithm are developed. Next, the framework of the QAPU is designed. Furthermore, the framework is implemented and simulated for the existing quantum algorithms on a classic computer. It is shown that the framework is appropriate for quantum algorithms.

کلیدواژه ها:

نویسندگان

Mohammad Reza Soltan Aghaei

Department of Computer Engineering, Khorasgan Branch, Islamic Azad University, Isfahan, Iran

Zuriati Ahmad Zukarnain

Department of Communication Technology and Network, Faculty of Computer Science,UPM, Malaysia

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • R. Van Meter, K. Nemoto, W. J. Munro, and K. ...
  • R. Van Meter and M. Oskin, “Architectural implications of quantum ...
  • R. Van Meter, K. M. Itoh, and T. D. Ladd, ...
  • D. Deutsch and R. Jozsa, “Rapid Solution of Problems by ...
  • P. W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete ...
  • L. K. Grover, “A Fast Quantum Mechanical Algorithm for Database ...
  • L. K. Grover, “Fixed-point quantum search,”Physical Review Letters, vol. ۹۵, ...
  • G. Brassard, P. Høyer, and A. Tapp, “Quantum counting,” in ...
  • C. H. Bennett and others, “Strengths and Weaknesses of Quantum ...
  • C. Zalka, “Grover’s quantum searching algorithm is optimal,”Physical Review A, ...
  • D. Simon, “On the power of quantum computation,” in ۳۵th ...
  • S. Hallgren, “Polynomial-time quantum algorithms for pell's equation and the ...
  • Y. Aharonov, L. Davidovich, and N. Zagury, “Quantum random walks,”Physical ...
  • J. Kempe, “Quantum random walks: an introductory overview,”Contemporary Physics, vol. ...
  • S. Lloyd and J. J. E. Slotine, “Quantum feedback with ...
  • R. Ruskov and A. N. Korotkov, “Quantum feedback control of ...
  • M. A. Nielsen and I. L. Chuang, Quantum Computation and ...
  • T. Nishino, “Mathematical models of quantum computation,”New Generation Computing, vol. ...
  • A. M. Wang,“A Universal Quantum Network-Quantum Central Processing Unit”,Chinese Physics ...
  • A. Barenco, D. Deutsch, A. Ekert, and R. Jozsa, “Conditional ...
  • A. M. Wang “Quantum Central Processing Unit and Quantum Algorithm,”Chinese ...
  • M. R. Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ...
  • M. R. Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ...
  • M. R. Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ...
  • نمایش کامل مراجع