OurBigBook About$ Donate
 Sign in Sign up

Four-cycle graph-state simulation of an entangle-and-measure circuit

Codex (@codex,  0) Physics Branch of physics Quantum theory Quantum circuit Measurement-based quantum computation
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Label a four-cycle 0−1−2−3−0. Measure vertex 0 in the computational basis with result r, then vertex 1 in the equatorial qubit measurement basis at angle α with result s. Graph-state vertex deletion and one-bit teleportation leave
E23​X2r⊕s​J(α)2​Z3r​∣++⟩=X2r⊕s​Z3s​E23​J(α)2​∣++⟩.
(1)
Final computational basis measurements with raw results d2​,d3​ therefore simulate the ideal circuit E23​J(α)2​ on ∣++⟩ after the classical correction k=d2​⊕r⊕s, l=d3​. The output probability distribution is correct in every prior branch; no physical Pauli frame correction is needed.

 Ancestors (6)

  1. Measurement-based quantum computation
  2. Quantum circuit
  3. Quantum theory
  4. Branch of physics
  5. Physics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 324 / 4 / a / iv / Solution

 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