检索结果-内蒙古大学图书馆

Universal logical operations with a dynamical qubit in Floquet code

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Xuandong Li, Longcheng Wu, Zhiyi Guo, Zechen Huang, Peisheng Huang, Wenhui Li, Qixian Liang, Yongqi Liu, Yiting Sun, Daxiong Wang, Zilin Xie, Changrong Xiong, Yuzhe Yang, Xiaohan Zhang, Jiajian Zhang, Jiawei Zhang, Libo Zhang, Zihao Guo, Weijie Jiang, Ji Liu, Song Linpeng, Xiayu Niu, Jingjing Qiu, Jiawei Ren, Wenhui Tao, Ziyu Yuan, Yuefeng Zhou, Yuxuan Chu, Ji Zhong, Youpeng Sun, Xiaoming Yu, Dapeng Shenzhen Institute for Quantum Science and Engineering Southern University of Science and Technology Shenzhen518055 China International Quantum Academy Shenzhen518048 China Guangdong Provincial Key Laboratory of Quantum Science and Engineering Southern University of Science and Technology Shenzhen518055 China Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Center for Excellence in Topological Quantum Computation University of Chinese Academy of Sciences Beijing China School of Physics Peking University Beijing100871 China School of Physics Ningxia University Yinchuan750021 China Shenzhen Branch Hefei National Laboratory Shenzhen518048 China

Quantum error correction (QEC) protects quantum systems against inevitable noises and control inaccuracies, providing a pathway towards fault-tolerant (FT) quantum computation. However, the significant overhead of physical qubits required to encode a single logical qubit poses a major challenge for scalability and practical implementation. Floquet QEC codes, a recent innovation, mitigate this challenge by utilizing time-periodic measurements to introduce additional dynamical logical qubits, thereby enhancing resource efficiency in QEC. Here, we experimentally implement the Floquet-Bacon-Shor code on a superconducting quantum processor. We encode a dynamical logical qubit within a 3 × 3 lattice of data qubits, alongside a conventional static logical qubit. We demonstrate FT encoding and measurement of the two-qubit logical states and stabilize the states using repeated error detection cycles. Additionally, we showcase universal single-qubit logical gates on the dynamical qubit. By implementing a logical CNOT gate, we entangle the dynamical and static logical qubits, generating an error-detected logical Bell state with a fidelity of 75.9%. Our results highlight the potential of Floquet codes for scalable and resource-efficient FT quantum computation. Copyright © 2025, The Authors. All rights reserved.

关键词： Qubits

Efficient and Error-Resilient data Access Protocols for a Limited-Sized Quantum Random Access Memory

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Zhao-Yun Xue, Cheng Wang, Yun-Jie Sun, Tai-Ping Liu, Huan-Yu Zhuang, Xi-Ning Dou, Meng-Han Zou, Tian-Rui Fang, Yuan Wu, Yu-Chun Guo, Guo-Ping Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China Institute of the Advanced Technology University of Science and Technology of China Anhui Hefei230088 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Anhui Hefei230026 China CAS Center For Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Anhui Hefei230026 China Hefei National Laboratory Anhui Hefei230088 China Origin Quantum Computing Company Limited Anhui Hefei230026 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230026 China

Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size and a fully error-correction implementation, it is essential to consider a practical case where the QRAM has a limited size. In this work, we focus on the access of larger data sizes without keeping on increasing the size of the QRAM. Firstly, we address the challenge of word length, as real-world datasets typically have larger word lengths than the single-bit data that most previous studies have focused on. We propose a novel protocol for loading data with larger word lengths k without increasing the number of QRAM levels n. By exploiting the parallelism in the data query process, our protocol achieves a time complexity of O(n + k) and improves error scaling performance compared to existing approaches. Secondly, we provide a data-loading method for general-sized data access tasks when the number of data items exceeds 2n, which outperforms the existing hybrid QRAM+QROM architecture. Our method contributes to the development of time and error-optimized data access protocols for QRAM devices, reducing the qubit count and error requirements for QRAM implementation, and making it easier to construct practical QRAM devices with a limited number of physical qubits. © 2023, CC BY-NC-SA.

关键词： Error correction

Geometry Interaction Knowledge Graph Embeddings

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： Knowledge graph

ER: Equivariance Regularizer for Knowledge Graph Completion

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： Knowledge graph

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

学校读者我要写书评

暂无评论

IEEE Transactions on Vehicular technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

Adversarial U-network for Predicting Blood Oxygen Level-Dependent Time Series

学校读者我要写书评

暂无评论

Adversarial U-Network for Predicting Blood Oxygen Level-Depe...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Cong Bao Weihao Zheng Qin Zhang Songyu Yang Zhijun Yao Bin Hu Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China School of Medical Technology Beijing Institute of Technology Beijing China CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai Institutes for Biological Sciences Chinese Academy of Sciences Shanghai China Chinese Academy of Sciences Joint Research Center for Cognitive Neurosensor Technology of Lanzhou University & Institute of Semiconductors Lanzhou China

Functional magnetic resonance imaging (fMRI) plays a vital role in brain science as it measures and maps brain activity through the analysis of blood flow changes, offering valuable insights into cognitive functions and neural processes. However, due to the intricacy and dynamism of brain activity, conventional approaches failed to accurately predict the blood oxygen level-dependent (BOLD) time series in fMRI data. To tackle this issue, we proposed an end-to-end adversarial U-network (AUN) to verify the predictability of existing BOLD signals in primary cortex (i.e., primary visual, primary motor and primary sensory) and higher cortex(i.e., dorsolateral prefrontal and posterior cingulate). The model combined the U-network architecture and adversarial strategy to ensure that the predicted results capture both the intricate nonlinear details and the overall distribution characteristics. We performed the experiment using the Human Connectome Project (HCP) database. The results demonstrated the predictability of both primary and higher cortex, with primary cortex showing higher predictability. Additionally, the AUN performed better than other popular methods. We also found the improvement in dynamic functional connectivity (dFC) metrics through accurate prediction. The above results confirm the feasibility of predicting BOLD signals and their potential application in clinical settings. 1

关键词：

Match-ignition: Plugging PageRank into transformer for long-form text matching

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Pang, Liang Lan, Yanyan Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute for AI Industry Research Tsinghua University Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Neural text matching models have been widely used in community question answering, information retrieval, and dialogue. However, these models designed for short texts cannot well address the long-form text matching problem, because there are many contexts in long-form texts can not be directly aligned with each other, and it is difficult for existing models to capture the key matching signals from such noisy data. Besides, these models are computationally expensive for simply use all textual data indiscriminately. To tackle the effectiveness and efficiency problem, we propose a novel hierarchical noise filtering model, namely Match-Ignition. The main idea is to plug the well-known PageRank algorithm into the Transformer, to identify and filter both sentence and word level noisy information in the matching process. Noisy sentences are usually easy to detect because previous work has shown that their similarity can be explicitly evaluated by the word overlapping, so we directly use PageRank to filter such information based on a sentence similarity graph. Unlike sentences, words rely on their contexts to express concrete meanings, so we propose to jointly learn the filtering and matching process, to well capture the critical word-level matching signals. Specifically, a word graph is first built based on the attention scores in each self-attention block of Transformer, and key words are then selected by applying PageRank on this graph. In this way, noisy words will be filtered out layer by layer in the matching process. Experimental results show that Match-Ignition outperforms both SOTA short text matching models and recent long-form text matching models. We also conduct detailed analysis to show that Match-Ignition efficiently captures important sentences and words, to facilitate the long-form text matching process. © 2021, CC BY.

关键词：

A Novel Duo-Stage driven Deep Neural network Approach for Mitigating Electrode Shift Impact on Myoelectric Pattern Recognition Systems

学校读者我要写书评

暂无评论

A Novel Duo-Stage driven Deep Neural Network Approach for Mi...

IEEE International Workshop on Medical Measurement and Applications (MEMEA)

作者： Frank Kulwa Oluwarotimi Williams Samuel Mojisola Grace Asogbon Tolulope Tofunmi Oyemakinde Olumide Olayinka Obe Guanglin Li CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen Institute of Advanced Technology (SIAT) Chinese Academy of Sciences (CAS) Shenzhen Guangdong China Shenzhen College of Advanced Technology University of Chinese Academy of Sciences Shenzhen Guangdong China School of Computing and Engineering University of Derby Derby United Kingdom Department of Computer Science Federal University of Technology Akure Nigeria

A major barrier to the commercialization of pattern recognition (PR)-based myoelectric prostheses is the lack of robustness to confounding factors such as electrode shift which has been lingering for years. To overcome this challenge, a novel Duo-Stage Convolutional Neural network (DS-CNN) is proposed. The DS-CNN is comprised of two cascaded stages in which the first stage deciphers the occurrence of a particular kind of shift upon which a requisite CNN model is triggered in the second stage for accurate decoding of individual motion intent, which is necessary for initiating robust control of the prostheses. The proposed scheme works on raw EMG signals as input which reduces the preprocessing time that would be required in conventional machine learning-based PR schemes, to effectively mitigate both transverse and longitudinal shifts using the same network architecture. This approach was validated for four distinct electrode shift conditions (with shifts in the range of 7.50mm-10.05mm) in a dataset obtained from 18 able-bodied subjects that performed 8 classes of targeted hand gestures. The experimental results show that the proposed dual-stage driven deep neural network model can adequately resolve the effects of electrode shift with classification accuracy near the No-shift scenario (< 1.70% difference between shift mitigation and No shift scenarios). These outcomes suggest that our method can provide a practical solution for adaptation to electrode shift, thus improving the robustness of the EMG pattern recognition systems in both clinical and commercial settings.

关键词：

Fine-Grained Access Control with Privacy-Preserving data Retrieval for Cloud-Assisted IoV

学校读者我要写书评

暂无评论

IEEE Transactions on Vehicular technology 2025年

作者： Li, Wenchao Xia, Chunhe Yang, Simiao Wang, Kangming Huang, Guotao Huang, Luqi Guo, Fuchun Susilo, Willy Wang, Tianbo Beihang University School of Cyber Science and Technology Beijing100191 China University of Wollongong School of Computing and Information Technology Institute of Cybersecurity and Cryptology WollongongNSW2522 Australia Beihang University Beijing Key Laboratory of Network Technology Beijing100191 China Guangxi Normal University Guangxi Collab. Innovation Center of Multi-source Information Integration and Intelligent Processing Guilin541004 China Beihang University Sino-French Engineer School Beijing100191 China Beihang University Computer Science and Engineering School Beijing100191 China

In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal. © 2025 IEEE.

关键词： Differential privacy