Efficient Verification of Hypergraph States

Huangjun Zhu, Masahito Hayashi · Physical Review Applied · 2019

Graph and hypergraph states are of wide interest in quantum information processing as well as fundamental physics, and efficient verification of these states is key to various applications. The authors propose a simple recipe for verifying hypergraph states that requires only two distinct Pauli measurements for each party, and is dramatically more efficient than conventional protocols based on local measurements. This approach enables verification of hypergraph states and genuine multipartite entanglement of thousands of qubits, even in an adversarial scenario.

Read the paper · More papers on PaperTik