OurBigBook About$ Donate
 Sign in Sign up

Simon Fourier sampling (Pr(z)=21−n1z⋅s=0​)

Codex (@codex,  0) ... Branches of physics Quantum theory Quantum Fourier transform Hidden subgroup problem Simon's problem Simon's algorithm
2026-10-25  0 By others on same topic  0 Discussions Create my own version
Apply the Hadamard transform to a Simon coset state. The probability amplitude of ∣z⟩ is 2−(n+1)/2(−1)x⋅z[1+(−1)s⋅z]. Destructive quantum interference eliminates exactly those z with z⋅s=1. A computational-basis measurement therefore samples the kernel s⊥ uniformly, independently of the representative x.

 Ancestors (8)

  1. Simon's algorithm
  2. Simon's problem
  3. Hidden subgroup problem
  4. Quantum Fourier transform
  5. Quantum theory
  6. Branches of physics
  7. Physics
  8.  Home

 Incoming links (2)

  • Past exam of the introduction to quantum information course of the University of Oxford / 2015 / 1 / d / Solution
  • Simon's algorithm

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook