Function-dependent Phase Transform in Quantum Computing
Abstract
We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is pure or mixed. Thus we can use any qubits as an ancillary register even though they are entangled with others and are occupied by other computational process. We also show that our algorithm is optimal in the sense of the number of function evaluations.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.