In this proof-of-concept paper we show that tensor product approach is efficient for control of large quantum systems, such as Heisenberg spin wires, which are essential for emerging quantum computing technologies. We compute optimal control sequences using GRAPE method, applying the recently developed tAMEn algorithm to calculate evolution of quantum states represented in the tensor train format to reduce storage. Using tensor product algorithms we can overcome the curse of dimensionality and compute the optimal control pulse for a 41 spin system on a single workstation with fully controlled accuracy and huge savings of computational time and memory. The use of tensor product algorithms opens new approaches for development of quantum computers with 50–100 qubits.
|Title of host publication||Integral Methods in Science and Engineering|
|Subtitle of host publication||Analytic Treatment and Numerical Approximations|
|Editors||Christian Constanda, Paul Harris|
|Publisher||Springer International Publishing|
|Number of pages||13|
|Publication status||E-pub ahead of print - 19 Jul 2019|