Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations.

Recent developments have revealed deterministic and exact protocols for performing complex conjugation, inversion, and transposition of a general d-dimensional unknown unitary operation using a finite number of queries to a black-box unitary operatio…

Preview only. Read the full abstract at the source