Characterization of exact two-query quantum algorithms

DOI10.1016/J.IC.2024.105166MaRDI QIDQ6543265

Shaoliang Ye, Wei Yang, Liusheng Huang

Publication date: 24 May 2024

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Boolean functionquantum query complexityexact query algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Complexity measures and decision tree complexity: a survey.
• A group algebraic approach to NPN classification of Boolean functions
• On exact quantum query complexity
• Quantum algorithms revisited
• Separations in Query Complexity Based on Pointer Functions
• Quantum lower bounds by polynomials
• Quantum Walk Algorithm for Element Distinctness
• Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem

This page was built for publication: Characterization of exact two-query quantum algorithms

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