Quantitative extensions of Araújo et al.'s phase obstruction for Liu, Wesołowski, Thompson, Gu and Pira's uncontrolled fractional-evolution question

Extending Araújo, Feix, Costa and Brukner's global-phase argument (2014), we answer negatively the question in Liu, Wesołowski, Thompson, Gu and Pira, Optimal query complexity for fractional quantum evolution, arXiv:2610.01940v1 (1 October 2026), Section V, page 7, unnumbered Uncontrolled access paragraph, with its prescribed branch and uniform channel criterion. For 0=2, ordinary queries have an unhalved diamond-error floor sin(pi*t), independent of their number. Retaining a pure full output strengthens the bound to 2*sin(pi*min(t,1-t)/2). The same argument gives the endpoint order of the best attainable error and classifies continuously differentiable phase functions on this branch: arbitrarily accurate ordinary-access implementation is possible exactly for integer powers, up to a constant phase.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24414716
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantitative extensions of Araújo et al.'s phase obstruction for Liu, Wesołowski, Thompson, Gu and Pira's uncontrolled fractional-evolution question

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Quantitative extensions of Araújo et al.'s phase obstruction for Liu, Wesołowski, Thompson, Gu and Pira's uncontrolled fractional-evolution question

Wenlin Zhang, Haobo Ma
preprint en

Abstract

Extending Araújo, Feix, Costa and Brukner's global-phase argument (2014), we answer negatively the question in Liu, Wesołowski, Thompson, Gu and Pira, Optimal query complexity for fractional quantum evolution, arXiv:2610.01940v1 (1 October 2026), Section V, page 7, unnumbered Uncontrolled access paragraph, with its prescribed branch and uniform channel criterion. For 0=2, ordinary queries have an unhalved diamond-error floor sin(pi*t), independent of their number. Retaining a pure full output strengthens the bound to 2*sin(pi*min(t,1-t)/2). The same argument gives the endpoint order of the best attainable error and classifies continuously differentiable phase functions on this branch: arbitrarily accurate ordinary-access implementation is possible exactly for integer powers, up to a constant phase.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon