Shengjun Wu

Chen-Xun Weng, Ming-Yang Li, Nai-Rui Xu et al.

Zero-knowledge proofs (ZKPs) are widely applied in digital economies, such as cryptocurrencies and smart contracts, for establishing trust and privacy between untrusted parties. Classical ZKPs rely on computational assumptions and are vulnerable to quantum attacks. While a recent advance suggests quantum-sound symmetric relativistic ZKPs for the graph three-coloring problem without computational assumptions, the high round complexity, which leads to unachievable runtime and overall randomness cost, renders them impractical for real-life deployment. To overcome this, we develop an efficient asymmetric relativistic ZKP protocol using relativistic bit commitments, and prove its quantum soundness by relating it to the nonlocal Clauser-Horne-Shimony-Holt (CHSH) game. Our protocol achieves a linear relationship between the round complexity and the number of edges, and thus significantly improves practical feasibility. In addition, we implement a proof-of-principle experiment which completes all interactive rounds in about 0.22 seconds and requires an overall randomness cost of 430.81 MB. Our work illustrates the powerful potential of integrating special relativity with quantum theory in trustless cryptography, paving the way for robust applications against quantum attacks in distrustful Internet environments.

Andi Chen, Hua-Lei Yin, Zeng-Bing Chen et al.

In this paper, we propose two hybrid quantum-inspired neural networks with adaptive residual and dense connections respectively for pattern recognition. We explain the frameworks of the symmetrical circuit models in the quantum-inspired layers in our hybrid models. We also illustrate the potential superiority of our hybrid models to prevent gradient explosion owing to the sine and cosine functions in the quantum-inspired layers. Groups of numerical experiments on generalization power showcase that our hybrid models are comparable to the pure classical models with different noisy datasets utilized. Furthermore, the comparison between our hybrid models and a state-of-the-art hybrid quantum-classical convolutional network demonstrates 3%-4% higher accuracy of our hybrid densely-connected model than the hybrid quantum-classical network. Additionally, compared with other two hybrid quantum-inspired residual networks, our hybrid models showcase a little higher accuracy on image datasets with asymmetrical noises. Simultaneously, in terms of groups of robustness experiments, the outcomes demonstrate that our two hybrid models outperform pure classical models notably in resistance to adversarial parameter attacks with various asymmetrical noises. They also indicate the slight superiority of our densely-connected hybrid model over the hybrid quantum-classical network to both symmetrical and asymmetrical attacks. Meanwhile, the accuracy of our two hybrid models is a little bit higher than that of the two hybrid quantum-inspired residual networks. In addition, an ablation study indicate that the recognition accuracy of our two hybrid models is 2%-3% higher than that of the traditional quantum-inspired neural network without residual or dense connection. Eventually, we discuss the application scenarios of our hybrid models by analyzing their computational complexity.