TY - JOUR

T1 - Matrix exponentials and parallel prefix computation in a quantum control problem

AU - Auckenthaler, T.

AU - Bader, M.

AU - Huckle, T.

AU - Spörl, A.

AU - Waldherr, K.

PY - 2010/5

Y1 - 2010/5

N2 - Quantum control plays a key role in quantum technology, in particular for steering quantum systems. As problem size grows exponentially with the system size, it is necessary to deal with fast numerical algorithms and implementations. We improved an existing code for quantum control concerning two linear algebra tasks: the computation of the matrix exponential and efficient parallelisation of prefix matrix multiplication. For the matrix exponential we compare three methods: the eigendecomposition method, the Padé method and a polynomial expansion based on Chebyshev polynomials. We show that the Chebyshev method outperforms the other methods both in terms of computation time and accuracy. For the prefix problem we compare the tree-based parallel prefix scheme, which is based on a recursive approach, with a sequential multiplication scheme where only the individual matrix multiplications are parallelised. We show that this fine-grain approach outperforms the parallel prefix scheme by a factor of 2-3, depending on parallel hardware and problem size, and also leads to lesser memory requirements. Overall, the improved linear algebra implementations not only led to a considerable runtime reduction, but also allowed us to tackle problems of larger size on the same parallel compute cluster.

AB - Quantum control plays a key role in quantum technology, in particular for steering quantum systems. As problem size grows exponentially with the system size, it is necessary to deal with fast numerical algorithms and implementations. We improved an existing code for quantum control concerning two linear algebra tasks: the computation of the matrix exponential and efficient parallelisation of prefix matrix multiplication. For the matrix exponential we compare three methods: the eigendecomposition method, the Padé method and a polynomial expansion based on Chebyshev polynomials. We show that the Chebyshev method outperforms the other methods both in terms of computation time and accuracy. For the prefix problem we compare the tree-based parallel prefix scheme, which is based on a recursive approach, with a sequential multiplication scheme where only the individual matrix multiplications are parallelised. We show that this fine-grain approach outperforms the parallel prefix scheme by a factor of 2-3, depending on parallel hardware and problem size, and also leads to lesser memory requirements. Overall, the improved linear algebra implementations not only led to a considerable runtime reduction, but also allowed us to tackle problems of larger size on the same parallel compute cluster.

KW - Chebyshev polynomials

KW - Matrix exponential

KW - Parallel matrix multiplication

KW - Parallel prefix problem

KW - Quantum control algorithm

UR - http://www.scopus.com/inward/record.url?scp=77953132134&partnerID=8YFLogxK

U2 - 10.1016/j.parco.2010.01.006

DO - 10.1016/j.parco.2010.01.006

M3 - Article

AN - SCOPUS:77953132134

SN - 0167-8191

VL - 36

SP - 359

EP - 369

JO - Parallel Computing

JF - Parallel Computing

IS - 5-6

ER -