Quantum generalized least squares method in system identification
From MaRDI portal
Publication:6566209
DOI10.1007/S11128-024-04443-5zbMATH Open1542.68067MaRDI QIDQ6566209
Ali Madady, Mehdi Ramezani, Sadegh Kalantari
Publication date: 3 July 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
computational complexitysystem identificationquantum algorithmquantum generalized least squares error
Quantum computation (81P68) Identification in stochastic control theory (93E12) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Title not available (Why is that?)
- Fast quantum algorithms for least squares regression and statistic leverage scores
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- Modifications to the number field sieve
- Quantum Fourier transform in computational basis
- Integer multiplication in time \(O(n\log n)\)
- Quantum Computation and Quantum Information
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Literature survey on low rank approximation of matrices
- IV.—On Least Squares and Linear Combination of Observations
- Nonlinear System Identification
- Least squares parameter estimation and multi-innovation least squares methods for linear fitting problems from noisy data
This page was built for publication: Quantum generalized least squares method in system identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566209)
