Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits

The determinant can be computed by classical circuits of depth $O(\log^2 n)$, and therefore it can also be computed in classical space $O(\log^2 n)$. Recent progress by Ta-Shma [Ta13] implies a method to approximate the determinant of Hermitian matrices with condition number $\kappa$ in quantum spac...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Boix-Adserà, Enric, Eldar, Lior, Mehraban, Saeed
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Computer Science - Distributed, Parallel, and Cluster Computing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!