4 papers · 1 filter
Efficient Maximum Clique Detection via Grover's Algorithm with Real-time Global Size Tracking
Wenmin Han, Shiqi Zheng, Peian Chen +1
The maximum clique problem (MCP) is to find the largest complete subgraph in an undirected graph, that is, the subgraph in which there are edges between every two different vertice…
Self-Testing Positive Operator-Valued Measurements and Certifying Randomness
Wenjie Wang, Mengyan Li, Fenzhuo Guo +2
In the device-independent scenario, positive operator-valued measurements (POVMs) can certify more randomness than projective measurements. This paper self-tests a three-outcome ex…
Tight upper bound of the maximal quantum violation of Gisin's elegant Bell inequality and its application in randomness certification
Dan-Dan Hu, Meng-Yan Li, Fen-Zhuo Guo +3
The violation of a Bell inequality implies the existence of nonlocality, making device-independent randomness certification possible. This paper derives a tight upper bound for the…
Characterizing the set of quantum correlations in prepare-and-measure quantum chain-shaped networks
Yanning Jia, Fenzhuo Guo, YuKun Wang +2
We introduce a hierarchy of tests satisfied by any probability distribution that represents the quantum correlations generated in prepare-and-measure (P\&M) quantum chain-shape…