Matrix exponentials and parallel prefix computation in a quantum control problem
DOI10.1016/j.parco.2010.01.006zbMath1208.68233OpenAlexW2033554301MaRDI QIDQ991127
K. Waldherr, A. Spörl, T. Auckenthaler, Thomas Kilian Huckle, Michael Bader
Publication date: 2 September 2010
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.parco.2010.01.006
Chebyshev polynomialsmatrix exponentialparallel prefix problemparallel matrix multiplicationquantum control algorithm
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Parallel algorithms in computer science (68W10) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MATLAB expm
- Communication lower bounds for distributed-memory matrix multiplication
- Parallel Prefix Computation
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Accuracy and Stability of Numerical Algorithms
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- Functions of Matrices
This page was built for publication: Matrix exponentials and parallel prefix computation in a quantum control problem