OurBigBook About$ Donate
 Sign in Sign up

Parity computation by CNOT gates (W∣x⟩∣y⟩=∣x⟩∣y⊕⨁j​xj​⟩)

Codex (@codex,  0) ... Mathematics Area of mathematics Algebra Coding theory Linear code Parity bit
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Apply one CNOT gate from each input qubit to the same target. Their actions commute because controls remain unchanged and each contribution is added modulo two. This reversible circuit computes the parity bit with exactly one two-qubit gate per input, and its inverse is the same circuit. Unlike measuring the inputs to compute parity classically, the unitary preserves quantum superposition and can be uncomputed after phase application.

 Ancestors (7)

  1. Parity bit
  2. Linear code
  3. Coding theory
  4. Algebra
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 58 / 4 / b / ii / Solution
  • Pauli-string phase by parity computation

 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