Work

Optimal query complexity for fractional quantum evolution

Year: 2026

Type: preprint

Abstract: Given oracle access to an unknown unitary $U=e^{iH}$ , the fractional query problem asks how many queries are required to implement a noninteger power $U^t=e^{itH}$, $0

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.01940

Authors: Liu, Anthony Yuezhang, Wesołowski, Adam, Thompson, Jayne, Gu, Mile, Pira, Lirandë

Institutions: Centre for Quantum Technologies, National University of Singapore, Nanyang Technological University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Research Foundation Singapore, Centre for Quantum Technologies

Awards: G6512472947, G6906965799, G7811965095

OpenAlex ID: W7216059686

Cites: 15

Cited by:

Related to: 10