Algorithmic representation of the quantum operators and fast quantum algorithms
Автор: Barchatova Irina, Hagiwara Tahiko, Ulyanov Sergey
Журнал: Сетевое научное издание «Системный анализ в науке и образовании» @journal-sanse
Статья в выпуске: 3, 2014 года.
Бесплатный доступ
The simplest technique for simulating a quantum algorithm (QA) is described and is based on the direct matrix representation of the quantum operators. This approach is stable and precise, but it requires allocation of operator’s matrices in the computer’s memory. Since the size of the operators grows exponentially, this approach is useful for simulation of QAs with a relatively small number of qubits (e.g., approximately 11 qubits on a typical desktop computer). Using this approach it is relatively simple to simulate the operation of a QA and to perform fidelity analysis. Two special search algorithms: Shor’s and Grover’s QA are described.
Quantum operators, fast quantum algorithms, аlgorithmic representation
Короткий адрес: https://sciup.org/14122611
IDR: 14122611
Список литературы Algorithmic representation of the quantum operators and fast quantum algorithms
- Ulyanov S.V., Litvintseva L.V., Ulyanov I.S. et all. Quantum information and quantum computational intelligence: Classically efficient simulation of fast quantum algorithms (SW&HW implementations). - Note del Polo Ricerca. - Milano: Universita degli Studi di Milano Publ, 2004. - Vol. 79. - URL: http://www.qcoptimizer.com.
- Ulyanov S.V. Efficient simulation system of quantum algorithms on classical computer based on fast algorithm: Patent US 2006/0224547 A1. - 2006.
- Ulyanov S.V. Fast algorithm for efficient simulation of quantum algorithm gates on classical computer // Systemics, Cybernetics and Informatics. - 2004. - Vol. 2. - № 3. - Pp. 63-68.
