Year: 2025
Type: preprint
Abstract: In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed that the resulting operation must act on arbitrary, and thus unknown, input states. In this work, we explore a variant of this framework in which the operation remains unknown, but the input state is fixed and known. We argue that this assumption is well-motivated in certain practical contexts, such as unitary programming, and show that classical knowledge of the input state can significantly enhance performance. We demonstrate that in the SAR protocol, this knowledge leads to an exponential advantage through a repeat-until-success strategy, highlighting the operational power of known-state higher-order transformations. Moreover, this assumption allows us to distinguish between protocols designed for pure, bipartite, and mixed states, which enables us to identify the class of mixed states for which deterministic and exact implementation becomes possible.
Source: arXiv (Cornell University)
Institutions: LIP6, The University of Tokyo
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4416620379
Cites:
Cited by:
Related to: