Compute-phase-uncompute construction

Starting the answer qubit in

∣0 ⟩

U_{f}, Z, U_{f}

∣ x ⟩ ∣0 ⟩

to

(- 1)^{f (x)} ∣ x ⟩ ∣0 ⟩

. It realizes a phase oracle with two standard-oracle queries while returning the answer register to its initial state.

 Ancestors (5)

 Incoming links (9)

Brassard–Høyer–Tapp collision algorithm
Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 58 / 4 / b / iii / Solution
Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 324 / 2 / b / Solution
Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 324 / 2 / b / iii / Solution
Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 324 / 3 / b / ii / Solution
Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 324 / 3 / b / i / Solution
Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 3 / 10D / b / Solution
Pauli-string phase by parity computation
Two-qubit parity phase gate

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version