Speaker
Description
Hypergraph states form an interesting family of multi-qubit
quantum states which are useful for quantum error correction,
non-locality and measurement-based quantum computing. They are
a generalisation of graph and cluster states. The states can be
represented by hypergraphs, where the vertices and hyperedges
represent qubits and entangling gates, respectively.
For quantum information processing, one needs high-fidelity
entangled states, but in practice most states are noisy.
Purification protocols address this problem and provide a
method to transform a certain number of copies of a noisy
state into single high-fidelity state. There exists a purification
protocol for hypergraph states [1]. In my talk, I will first
reformulate the purification protocol in a graphical manner,
which makes it intuitively understandable. Based on this, I
will propose systematic extensions, which naturally arise from
the graphical formalism.
[1] T. Carle et al., Phys. Rev. A 87, 012328 (2013)
| Category | Other |
|---|
