Verification of colorable hypergraph states with stabilizer test
Hong Tao, and Xiaoqian Zhang, and Lei Shao, and Xiaoqing Tan

TL;DR
This paper introduces a fault-tolerant stabilizer test protocol for verifying large-scale colorable hypergraph states in quantum systems, simplifying measurements and enabling applications like blind quantum computing.
Contribution
It presents a novel verification method using only Pauli-X and Z measurements, improving efficiency over adaptive stabilizer tests for hypergraph states.
Findings
Protocol is fault-tolerant and measurement-efficient.
Applicable to blind quantum computing.
Simplifies verification process for hypergraph states.
Abstract
Many-body quantum states, as a matter of fact, are extremely essential to solve certain mathematical problems or simulate quantum systems in measurement-based quantum computation. However, how to verify large scale quantum states, such as hypergraph states, is an exceedingly hard task for multi-body quantum systems. Here, we propose a novel fault-tolerant solution for verification of colorable hypergraph states by using stabilizer test. Compared with the adaptive stabilizer test, our protocol is dramatically facilitating by making only Pauli-X and Pauli-Z measurement. As to appliance, it will be also applied to blind quantum computing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
