Matrix exponentials and parallel prefix computation in a quantum control problem

Parallel Computing

Volumn 36, Issue 5-6, 2010, Pages 359-369

  Auckenthaler, T ^a   Bader, M ^a   Huckle, T ^a   Sporl A ^a   Waldherr, K ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Chebyshev polynomials; Matrix exponential; Parallel matrix multiplication; Parallel prefix problem; Quantum control algorithm

Indexed keywords

CHEBYSHEV POLYNOMIALS; MATRIX EXPONENTIALS; PARALLEL MATRIX MULTIPLICATION; PARALLEL PREFIX; QUANTUM CONTROL ALGORITHM;

ALGORITHMS; CONTROL THEORY; POLYNOMIALS; QUANTUM ELECTRONICS; QUANTUM OPTICS;

MATRIX ALGEBRA;

EID: 77953132134     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2010.01.006     Document Type: Article

References (27)

1. M. Bader, S. Hanigk, T. Huckle, Parallelisation of block recursive matrix multiplication in prefix computations, in: C. Bischof et al. (Eds.), Parallel Computing: Architectures, Algorithms and Applications, Proceedings of the ParCo, Parallel Computing 2007, vol. 38 of NIC Series, 2008.
2. Choi J., Dongarra J., and Walker D. PUMMA: parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency: Pract. Exp. 6 7 (1994) 543-570
3. Cirac J.I., and Zoller P. Quantum-computing with cold trapped ions. Phys. Rev. Lett 74 (1995) 4091-4094
4. Gradl T., Spörl A., Glaser S., Schulte-Herbrüggen T., and Huckle T. Parallelising matrix operations on clusters for an optimal-controlled quantum compiler. Lecture Notes in Computer Science vol. 4128 (2006), Springer
5. Grover L.K. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79 (1997) 325-328
6. A. Gupta, V. Kumar, Scalability of parallel algorithms for matrix multiplication, in: International Conference on Parallel Processing - ICPP'93, vol. 3, 1993.
7. Higham N.J. Accuracy and Stability of Numerical Algorithms. second ed. (2002), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
8. Higham N.J. The scaling and squaring method for the matrix exponential revisited. SIAM J. Matrix Anal. Appl. 26 4 (2005) 1179-1193
9. Higham N.J. Functions of Matrices: Theory and Computation (2008), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
10. T. Huckle, T. Schulte-Herbrüggen, A. Spörl, K. Waldherr, S. Glaser, Using the HLRB-II cluster as a quantum CISC-compiler, in: High Performance Computing in Science and Engineering, Garching 2007, Springer, 2008.
11. Irony D., Toledo S., and Tiskin A. Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput. 64 9 (2004) 1017-1026
12. Kane B.E. A silicon-based nuclear spin quantum computer. Nature (London) 393 (1998) 133-137
13. n) and control of spin systems. Chem. Phys. 267 (2001) 11-23
14. Khaneja N., Heitmann B., Spörl A., Yuan H., Schulte-Herbrüggen T., and Glaser S.J. Shortest paths for efficient control of indirectly coupled qubits. Phys. Rev. A 75 (2007) 012322
15. Khaneja N., Reiss T., Kehlet C., Schulte-Herbrüggen T., and Glaser S.J. Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms. J. Magn. Reson. 172 (2005) 296-305
16. M. Krishnan, J. Nieplocha, SRUMMA: a matrix multiplication algorithm suitable for clusters and scalable shared memory systems, in: Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04), 2004.
17. Ladner R.E., and Fischer M.J. Parallel prefix computation. J. ACM 27 4 (1980) 831-838
18. Makhlin Y., Schön G., and Shnirman A. Quantum-state engineering with Josephson-junction devices. Rev. Mod. Phys. 73 (2001) 357-400
19. Moler C., and van Loan C. Nineteen dubious ways to compute the exponential of a matrix. SIAM Rev. 20 4 (1978) 801-836
20. Moler C., and van Loan C. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Rev. 45 1 (2003) 3-49
21. Nielsen M.A., and Chuang I.L. Quantum Computation and Quantum Information (2000), Cambridge University Press, Cambridge, UK
22. Rivlin T.J. Chebyshev Polynomials (1990), Wiley-Interscience
23. Schulte-Herbrüggen T., Spörl A.K., Khaneja N., and Glaser S.J. Optimal control-based efficient synthesis of building blocks of quantum algorithms: a perspective from network complexity towards time complexity. Phys. Rev. A 72 (2005) 042331
24. Shor P.W. Polynomial-time algorithms for prime factorisation and discrete logarithm on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509
25. A.K. Spörl, T. Schulte-Herbrüggen, S.J. Glaser, V. Bergholm, M.J. Storcz, J. Ferber, F.K. Wilhelm, Optimal control of coupled Josephson qubits, Phys. Rev. A 75 (2007) 012302, e-print: .
26. van de Geijn R., and Watts J. SUMMA: scalable universal matrix multiplication algorithm. Concurrency: Pract. Exp. 9 4 (1997) 255-274
27. H. Yuan, R. Zeier, N. Khaneja, Elliptic functions and efficient control of ising spin chains with unequal couplings (2007), e-print: .