scientific article; zbMATH DE number 7651029

DOI10.4230/LIPIcs.TQC.2020.2MaRDI QIDQ5874384

Shuchen Zhu, Nikhil S. Mande, Justin Thaler

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2002.08389

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum query complexityapproximate degreedual polynomials\(k\)-distinctness

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Approximate Degree in Classical and Quantum Computing

This page was built for publication: