View source for Phase kickback


In [[Quantum computing|quantum computing]], '''phase kickback''' refers to the fact that controlled operations have effects on their controls, in addition to on their targets, and that these effects correspond to phasing operations.<ref>{{Cite web|url=https://www.youtube.com/watch?v=p7m6zrZf58s|title=QTM3x_2018_29_Phase_kickback-video|date=2 January 2021 |via=www.youtube.com}}</ref><ref>{{Cite web|url=https://medium.com/nerd-for-tech/one-try-qc-explained-5b466c199616|title=One try &#124; QC Explained|first=Pavan|last=Jayasinha|date=March 1, 2021}}</ref><ref>{{Cite web|url=https://www.youtube.com/watch?v=EjdngeGXWEg|title=Qubits vs Bits: The Kickback Effect|date=22 September 2021 |via=www.youtube.com}}</ref> 

When a controlled operation, such as a [[Controlled NOT gate|Controlled NOT (CNOT) gate]], is applied to two qubits, the phase of the second (target) qubit is conditioned on the state of the first (control) qubit. 
Because the phase of the second qubit is being “kicked back” to the first qubit, this phenomenon was coined “phase kickback” in 1997 by [[Biography:Richard Cleve|Richard Cleve]], [[Biography:Artur Ekert|Artur Ekert]], Chiara Macchiavello, and [[Biography:Michele Mosca|Michele Mosca]] through a paper that solved the Deustch-Jozsa problem.<ref>{{Cite journal |last1=Cleve |first1=Richard |last2=Ekert |first2=Artur |last3=Macchiavello |first3=Chiara |last4=Mosca |first4=Michele |date=1998-01-08 |title=Quantum Algorithms Revisited |journal=Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences |volume=454 |issue=1969 |pages=339–354 |doi=10.1098/rspa.1998.0164 |issn=1364-5021|arxiv=quant-ph/9708016 |bibcode=1998RSPSA.454..339C }}</ref>{{Primary source inline|date=March 2025}}

For example, when a [[Controlled NOT gate|controlled NOT gate]]'s target qubit is in the state <math>1/\sqrt{2} (|0\rangle - |1\rangle)</math>, the effect of the controlled NOT gate is equivalent to the effect of applying a Pauli Z gate to the controlled NOT's control qubit.
Phase kickback is one of the key effects that distinguishes quantum computation from classical computation.
Phase kickback also provides a justification for why qubits would be disrupted by measurements: a measurement is an operation that flips a classical bit (the result) with the flip being controlled by a quantum bit (the qubit being measured).
This creates kickback from the bit to the qubit, randomizing the qubit's phase.

[[File:Kickback measure.png|thumb|right|Measuring an operator P (whose eigenvalues are +1 and -1) by using phase kickback onto the control of a controlled P operation.]]

[[File:Cx-eq-hhcxhh.png|thumb|right|A CNOT gate may appear to only act the control on the target, but surrounding it with Hadamard gates reveals it also acts the target on the control.]]

[[File:Cx vs hczh.png|thumb|right|A CNOT appears asymmetric, but can be transformed into a symmetric operation by Hadamard gates. Symmetric operations don't distinguish target and control, resulting in effects like phase kickback.]]

Phase kickback occurs because the basis transformations that distinguish targets from controls are available as operations.
For example, surrounding a [[Controlled NOT gate|controlled NOT gate]] with four Hadamard gates produces a compound operation whose effect is equivalent to a controlled NOT gate, but with the roles of its control qubit and target qubit exchanged.
More abstractly, phase kickback occurs because the eigendecomposition of controlled operations makes no significant distinction between controls and targets.
For example, the controlled Z gate is a symmetric operation that has the same effect if its target and control are switched, and a controlled NOT gate can be decomposed into a Hadamard gate on its target, then a controlled Z gate, then a second Hadamard gate on its target.<ref>{{Cite web|url=https://algassert.com/post/1706|title=Thinking of Operations as Controls|website=algassert.com}}</ref>
This decomposition reveals that, at the core of the apparently-asymmetric controlled-NOT gate, there is a symmetric effect that does not distinguish between control and target.

Phase kickback can be used to measure an operator <math>P</math> whose eigenvalues are +1 and -1.
This is a common technique for measuring operators in quantum error correcting codes, such as the surface code.<ref>{{Cite journal|url=https://link.aps.org/doi/10.1103/PhysRevA.86.032324|title=Surface codes: Towards practical large-scale quantum computation|first1=Austin G.|last1=Fowler|first2=Matteo|last2=Mariantoni|first3=John M.|last3=Martinis|first4=Andrew N.|last4=Cleland|date=September 18, 2012|journal=Physical Review A|volume=86|issue=3|pages=032324|via=APS|doi=10.1103/PhysRevA.86.032324|arxiv=1208.0928|bibcode=2012PhRvA..86c2324F |s2cid=119277773 }}</ref>
The procedure is as follows.
Initialize a control qubit <math>c</math> in the <math>|0\rangle</math> state, then apply a Hadamard gate <math>H</math> to <math>c</math>, then apply <math>P</math> controlled by <math>c</math>, then apply another Hadamard gate <math>H</math> to <math>c</math>, then measure <math>c</math> in the computational basis.
Phase kickback results in the +1 eigenstates of <math>P</math> having no effect on <math>c</math>, while -1 eigenstates apply a Pauli <math>Z</math> to <math>c</math>.
The surrounding Hadamard gates turn the Pauli <math>Z</math> (a phase flip) into a Pauli <math>X</math> (a bit flip).
So <math>c</math> gets flipped from <math>|0\rangle</math> to <math>|1\rangle</math> when the state is in the -1 eigenstate of <math>P</math>.
The measurement operation reveals whether <math>c</math> is <math>|0\rangle</math> or <math>|1\rangle</math>, which reveals whether the state was in the +1 or -1 eigenspace of <math>P</math>.

== Requirements ==
Phase kickback requires the following conditions to be met: <ref>{{Cite web |last=Smetanin |first=Eduard |date=November 24, 2019 |title=Phase Kickback |url=https://eduardsmetanin.github.io/PhaseKickback.pdf |access-date=April 27, 2024}}</ref>

* The control qubit(s) must be in a superposition'''.''' Otherwise, applying a controlled operation will only affect the global phase, which has no physical meaning and cannot change the physical qubit state.  If the control qubit(s) are not in superposition, the following will occur:
<math>
|1\rangle |\psi\rangle \xrightarrow{\text{Controlled}-U}|1 \rangle U | \psi \rangle = |1 \rangle e^{i \phi} \cong |1 \rangle | \psi \rangle</math> This shows that if the control qubit is not in a superposition, phase kickback will not occur and the output of the controlled operation will be equal to the input. 

* '''<math>|\psi\rangle</math>''' must be an eigenvector of controlled operator''' <math>U</math>.''' When '''<math>|\psi\rangle</math>''' is an eigenvector of <math>U</math>, <math>U| \psi \rangle = e^{i \phi} | \psi \rangle</math>.  At point B of the above circuit, the system will then have state <math>\frac{|0 \rangle | \psi \rangle + | 1 \rangle e^{i \phi} | \psi \rangle} {\sqrt{2}} = \frac{|0 \rangle +  e^{i \phi} | 1 \rangle} {\sqrt{2}}|\psi \rangle</math>. Now, <math>e^{i \phi}</math> will be associated with the first qubit when this state is factored out into individual states (assuming the system is not entangled). From this, it can be seen that when '''<math>|\psi\rangle</math>''' is an eigenvector of <math>U</math>, the control qubit is able to change by being multiplied by the phase while the target qubit remains unchanged. 
* Operator <math>U</math> must be used in a controlled way'''.'''  In many examples, the operator <math>U</math> is controlled by <math>|0\rangle</math> or <math>|1\rangle</math>, but in reality, it can be any function of the control qubit. The operator must be applied in a controlled way; otherwise, if <math>U</math> is applied unconditionally, only the global phase of the state would be changed. This produces a similar effect as when the control qubits are not in superposition, where applying <math>U</math> appears to have no effect on the state. 

== Applications ==

=== Quantum Fourier transform ===
[[Quantum Fourier transform]] is the quantum analogue of the classical [[Discrete Fourier transform|discrete Fourier transform]] (DFT), as it takes quantum states represented as superpositions of basis states, and utilizes phase kickback to transform them into frequency-domain representation.

The phase kickback phenomenon occurs in the QFT algorithm when a controlled phase rotation gate is applied to a qubit in superposition – the Fourier transform will take the output of the phase kickback state back to the initial control qubit.<ref name=":0">{{Cite web |last=Bacon |first=Dave |title=Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms |url=https://courses.cs.washington.edu/courses/cse599d/06wi/lecturenotes10.pdf |access-date=April 27, 2024}}</ref>

=== Quantum phase estimation ===
[[Quantum phase estimation algorithm|Quantum phase estimation]] (QPE) is a quantum algorithm that exploits phase kickback to efficiently estimate the eigenvalues of unitary operators. It is a crucial part of many quantum algorithms, including Shor’s algorithm, for [[Integer factorization|integer factorization]].

To estimate the phase angle corresponding to the eigenvalue '''<math>|\psi\rangle</math>''' of a unitary operator <math>U</math>, the algorithm must:

# Prepare the input state '''<math>|\psi\rangle</math>''' and an ancillary qubit in the '''<math>|+\rangle</math>''' state
# Apply phase kickback through controlled operations using operator <math>U</math> to the ancillary qubit. Phase kickback transfers the phase information from the eigenstates of <math>U</math> to the state of the ancillary qubit.
# Perform an inverse quantum Fourier transform on the ancillary qubit.
# Measure the ancillary qubit to determine the phase corresponding to the eigenvalue of <math>U</math>.

Phase kickback allows a quantum setup to estimate eigenvalues exponentially quicker than classical algorithms. This is essential for quantum algorithms such as [[Shor's algorithm|Shor’s algorithm]], where quantum phase estimation is used to factor large integers efficiently. <ref name=":0" />

=== Deustch–Jozsa algorithm ===
The [[Deutsch–Jozsa algorithm|Deustch–Jozsa algorithm]], and by association the [[Bernstein–Vazirani algorithm|Bernstein-Vazirani algorithm]], determines whether an inputted function is constant (same value for all inputs) or balanced (half 0s and half 1s) using as few queries to the [[Black box|black box]] function as possible. Phase kickback is critical; when the oracle is applied to the superposition state, it introduces phase kickback depending on whether the function is constant or balanced. If the function is constant, the oracle flips the sign of the amplitude of all input states, leading to constructive interference among all states. This allows a high probability of measuring the all-zero state. The flipping of signs of the input states requires phase kickback. On the other hand, when the function is balanced, the oracle does not introduce any phase kickback and the interference pattern among the states already cancels out as it is. This leads to an equal probability of measuring any of the input states. <ref>{{Cite web |last=Biswas |first=Shrey |date=2021-02-14 |title=The Deutsch-Jozsa Algorithm: Quantum Algorithms Untangled |url=https://medium.com/quantum-untangled/quantum-untangled-quantum-computing-deutsch-jozsa-algorithm-guide-untangled-27adf4205913 |access-date=2024-04-27 |website=Quantum Untangled |language=en}}</ref>

=== Grover's algorithm ===
[[Grover's algorithm|Grover’s algorithm]] is a quantum algorithm for unstructured search that finds the unique input to a [[Black box|black box]] function given its output. Phase kickback occurs in Grover's algorithm during the application of the oracle, which is typically a controlled operator that flips the sign of the target qubit's state. When this controlled operation is applied to the target qubit, the sign is flipped, and the phase of the target qubit is transferred backwards to the control qubit. In other words, the oracle can highlight certain target states by modifying the phase of the corresponding control qubit. <ref>{{Cite web |title=Grover's algorithm {{!}} IBM Quantum Learning |url=https://learning.quantum.ibm.com/course/fundamentals-of-quantum-algorithms/grovers-algorithm |access-date=2024-04-27 |website=learning.quantum.ibm.com}}</ref> This has impactful applications as a problem-solving tool, demonstration of performance advantages in quantum computing, and [[Quantum cryptography|quantum cryptography]]. 

As seen, phase kickback is a crucial step in many famous, powerful quantum algorithms and applications. Its ability to transfer states backwards also enables other concepts such as [[Quantum error correction|quantum error correction]] and [[Quantum teleportation|quantum teleportation]].  

== References ==
{{reflist}}

[[Category:Quantum computing]]

{{Sourceattribution|Phase kickback}}