دسته بندی:

محاسبات کوانتومی - Quantum-Computing

---

سال انتشار:

2022

---

عنوان انگلیسی مقاله:

Memristor Crossbar Arrays Performing Quantum Algorithms

---

ترجمه فارسی عنوان مقاله:

آرایه های ضربدری ممریستور که الگوریتم های کوانتومی را انجام می دهند

---

منبع:

ieee - ieee Transactions on Circuits and Systems I: Regular Papers;2022;69;2;10:1109/TCSI:2021:3123575

---

نویسنده:

Iosif-Angelos Fyrigos; Vasileios Ntinas; Nikolaos Vasileiadis; Georgios Ch. Sirakoulis; Panagiotis Dimitrakis; Yue Zhang; Ioannis G. Karafyllidis

---

چکیده انگلیسی:

There is a growing interest in quantum computers and quantum algorithm development. It has been proved that ideal quantum computers, with zero error rates and large decoherence times, can solve problems that are intractable for today’s classical computers. Quantum computers use two resources, superposition and entanglement, that have no classical analog. Since quantum computer platforms that are currently available comprise only a few dozen of qubits, the use of quantum simulators is essential in developing and testing new quantum algorithms. We present a novel quantum simulator based on memristor crossbar circuits and use them to simulate well-known quantum algorithms, namely the Deutsch and Grover quantum algorithms. In quantum computing the dominant algebraic operations are matrix-vector multiplications. The execution time grows exponentially with the simulated number of qubits, causing an exponential slowdown in quantum algorithm execution using classical computers. In this work, we show that the inherent characteristics of memristor arrays can be used to overcome this problem and that memristor arrays can be used not only as independent quantum simulators but also as a part of a quantum computer stack where classical computers accelerators are connected. Our memristive crossbar circuits are re-configurable and can be programmed to simulate any quantum algorithm.
Index Terms— Memristors | memristor crossbars | quantum algorithms | quantum simulators.

---

---

قیمت: رایگان

---

توضیحات اضافی:

---

---

---