Chi Zhang (张驰)'s Homepage

We investigate the construction of four-family supersymmetric Pati–Salam models from Type IIA orientifold with intersecting D6-branes. Utilizing the deterministic algorithm introduced in He W, Li T and Sun R (2021 arXiv: hep-th/2112.09632), we obtain 274 types of models with three rectangular tori and distinct gauge coupling relations at string scale, while 6 types of models with two rectangular tori and one tilted torus. In both cases, there exists a class of models with gauge coupling unification at string scale. In particular, for the models with two rectangular tori, one tilted torus and gauge coupling unification, the gaugino condensations are allowed, and thus supersymmetry breaking and moduli stabilization are possible for further phenomenological study.

We demonstrate two tasks in Quantum Natural Language Processing (QNLP): classification and disambiguation. For the classification task, we utilized an amplitude encoding algorithm and achieved perfect accuracy on the standard lambeq dataset, which is commonly used for benchmarking in quantum NLP. Additionally, we obtained accuracy from 55% to 72.5 % on a more complex and realistic Amazon review dataset, which is still a reasonable result, given the current capability of quantum computing and QNLP. Additionally, we found that UMAP is the best dimension reduction method in our experiment setting. All classification results were done on the default. qubit simulator in pennylane 0.36 python library. Our classification results highlight the potential of quantum algorithms in practical applications. For the disambiguation task, we selected 18 ambiguous nouns, 32 unambiguous nouns, and 18 different verbs. Our experiments using the QASM simulator within the qiskit Python library demonstrated that the simulator could perfectly differentiate between the various meanings of ambiguous nouns in different contexts, achieving perfect differentiation. Furthermore, we extended our study to a real quantum device, the ibm_kyoto quantum computer. There, we tested our disambiguation approach on a subset of 4 random nouns (two ambiguous and two unambiguous) and observed that ibm_kyoto could achieve an accuracy range of 82.1 % to 98.9% in disambiguation tasks, extending the datasets and improving the results of existing ambiguity resolution experiments [1]. Our work demonstrates the capability of quantum computing in dealing with real-world NLP tasks, hence contributing to the advancement of both QML and NLP.