The quantum query complexity of the determinant
type: Item
instance of: scholarly article
title: The quantum query complexity of the determinant
zbMATH Open document ID: 1191.68350
author: Sebastian Dörn
author: Thomas Thierauf
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5721995
zbMATH Keywords: computational complexity
zbMATH Keywords: quantum query complexity
zbMATH Keywords: determinant
zbMATH Keywords: matrix power
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.11.006
OpenAlex ID: W2009579056
cites work: Quantum lower bounds by quantum arguments
cites work: Quantum Algorithms for Matching and Network Flows
cites work: Quantum lower bounds by polynomials
cites work: SOFSEM 2004: Theory and Practice of Computer Science
cites work: Quantum Algorithms for Element Distinctness
cites work: Quantum cryptanalysis of hash and claw-free functions
cites work: Quantum verification of matrix products
cites work: Combinatorial matrix theory
cites work: Q3907599
cites work: Automata, Languages and Programming
cites work: The Quantum Query Complexity of Algebraic Properties
cites work: The Quantum Complexity of Group Testing
cites work: Quantum algorithms for the triangle problem
cites work: Q4259990
cites work: Determinant: Old Algorithms, New Insights
cites work: A combinatorial approach to matrix algebra
DOI: 10.1016/J.IPL.2008.11.006
description: scientific article; zbMATH DE number 5721995