Demonstration of hypergraph-state quantum information processing

Area of Science:

• Quantum Information Science
• Quantum Computing
• Entanglement

Background:

• Complex entangled states are crucial for measurement-based quantum computations.
• Graph-state quantum computing relies on entanglement structure and qubit connectivity.
• Hypergraph entanglement generalizes graph entanglement, allowing arbitrary qubit interactions.

Purpose of the Study:

• To experimentally prepare, certify, and process complete categories of four-qubit hypergraph states.
• To demonstrate hypergraph states as a resource for arbitrary quantum computation with Pauli universality.
• To prototype hypergraph entanglement for quantum information processing.

Main Methods:

• Utilized a fully reprogrammable silicon-photonic quantum chip.
• Employed local unitary equivalence for state categorization.
• Certified genuine multipartite entanglement using entanglement witnesses and Mermin inequality violations.
• Implemented a measurement-based protocol and resource state verification using color-encoded stabilizers and local Pauli measurements.

Main Results:

• Successfully prepared and certified complete categories of four-qubit hypergraph states.
• Demonstrated violations of Mermin inequalities, confirming genuine multipartite entanglement without loopholes.
• Benchmarked building blocks for hypergraph-state quantum computation through a measurement-based protocol.

Conclusions:

• Hypergraph states represent a more general class of quantum resource states than graph states.
• Experimental realization on a silicon-photonic platform showcases the potential of hypergraph entanglement.
• This work prototypes hypergraph entanglement as a versatile resource for advanced quantum information processing.