Approximate degree lower bounds for oracle identification problems

DOI10.4230/LIPICS.TQC.2023.1MaRDI QIDQ6640409FDOQ6640409

Authors: Mark Bun, Nadezhda Voronova 

Publication date: 20 November 2024

zbMATH Keywords

communication complexitypolynomial methodquantum query complexityapproximate degreepolynomial approximationsordered search

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

This page was built for publication: Approximate degree lower bounds for oracle identification problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640409)