Work

An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree

Year: 2025

Type: article

Source: Computational Complexity

DOI: 10.1007/s00037-025-00277-4

Authors: Andris Ambainis, Aleksandrs Belovs

Institution: University of Latvia

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4414773749

FWCI:

Cites: 16

Cited by:

Related to: 10