Matrix exponentials and parallel prefix computation in a quantum control problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Communication lower bounds for distributed-memory matrix multiplication
- Functions of Matrices
- MATLAB expm
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Parallel Prefix Computation
- Parallelisation of block-recursive matrix multiplication in prefix computations
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The HLRB cluster as quantum CISC compiler. Matrix methods and applications for advanced quantum control by gradient-flow algorithms on parallel clusters
- The Scaling and Squaring Method for the Matrix Exponential Revisited
Cited in
(7)- Exploiting matrix symmetries and physical symmetries in matrix product states and tensor trains
- Computing enclosures for the matrix exponential
- Modeling complex quantum dynamics: evolution of numerical algorithms in the HPC context
- Parallelisation of block-recursive matrix multiplication in prefix computations
- \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers
- An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrödinger equation
- Parallel time integration using batched BLAS (Basic Linear Algebra Subprograms) routines
This page was built for publication: Matrix exponentials and parallel prefix computation in a quantum control problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991127)