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

Comparative investigation of quantum and classical kernel functions applied in support vector machine algorithms

quantum information processing 2025年第4期24卷 1-30页

作者： Abdulsalam, Ghada Ahmad, Irfan King Fahd Univ Petr & Minerals Informat & Comp Sci Dept Dhahran 31261 Saudi Arabia SDAIA KFUPM JRC Artificial Intelligence Dhahran 31261 Saudi Arabia

quantum kernels in modern computational paradigms present a revolutionary approach to machine learning by harnessing the power of quantum mechanics to redefine how data is processed and analysed. This study examines the performance and applicability of quantum kernels in machine learning models by investigating their potential among different tasks and datasets against classical kernels. The study utilized the radial basis function (RBF), linear, polynomial, and sigmoid classical kernel functions besides quantum kernel and fidelity state vector quantum kernels. The classical support vector classifier (SVC) and quantum support vector classifier (QSVC) with classical and quantum kernels were employed to perform classification tasks on different datasets, namely Cleveland, Framingham, CHSL, Glass Identification, Obesity, and Academic Success. Additionally, support vector regressor (SVR) and quantum support vector regressor (QSVR), employing classical and quantum kernels, were applied for regression tasks using Concrete, Abalone, Aquatic Toxicity, Auto MPG, and Auction Verification datasets. The results of the study provided insights into the performance of quantum kernels when applied to both classical and quantum SVM models regarding classification and regression tasks. In classification tasks, the quantum kernels provided significant competitiveness in terms of accuracy, precision, recall, and F1 measure scores when compared to the classical kernels. Moreover, the quantum kernels have demonstrated promising outcomes in regression tasks, outperforming the classical kernels by achieving less mean squared error (MSE), mean absolute error (MAE), and superior R-squared scores.

关键词： quantum machine learning quantum kernel functions quantum support vector machine Classification Regression

来源：评论

学校读者我要写书评

暂无评论

quantum circuit designs of efficient squaring

引用

quantum information processing 2025年第2期24卷 1-18页

作者： Cho, Seong-Min Lee, Changyeol Seo, Seung-Hyun Hanyang Univ Grad Sch Dept Elect & Elect Engn Seoul 04763 South Korea Hanyang Univ Sch Elect Engn Dept Civil & Environm Engn ERICA Ansan 15588 Gyeonggi Do South Korea

quantum squaring circuits have been used as helpful arithmetic modules in various quantum algorithms for calculating series expansions or distances of vectors, etc. quantum multipliers can replace quantum squaring circuits, but squaring with quantum multipliers is inefficient because it involves using quantum gates for unnecessary bitwise multiplication. In this paper, we propose a depth-optimized quantum circuit dedicated to squaring by eliminating these unnecessary quantum gates and implementing quantum gates in parallel. We also discuss the optimal distribution of the partial products to reduce further the gate cost of the quantum adder used for the sum of the partial products. The proposed partial product distribution method lowers the quantum adder's number of gates and depth by half. Our quantum squaring circuit is the most efficient, with an average improvement of 68% and 79.7% in T-count and T-depth, respectively, compared to existing quantum squaring circuits. Despite the increased qubit counts caused by the depth optimization, we demonstrate that the proposed circuit has the smallest KQT\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {KQ}_\textrm{T}$$\end{document}.

关键词： quantum circuits Squaring T-depth optimization

来源：评论

学校读者我要写书评

暂无评论

Improved Real-Time Post-processing for quantum Random Number Generators

引用

ADVANCED quantum TECHNOLOGIES 2024年第7期7卷

作者： Li, Qian Sun, Xiaoming Zhang, Xingjian Zhou, Hongyi Shenzhen Res Inst Big Data Shenzhen lnternat Ctr Industrial&Applied Math Shenzhen 518172 Peoples R China Chinese Acad Sci Inst Comp Technol State Key Lab Processors Beijing 100190 Peoples R China Tsinghua Univ Inst Interdisciplinary Informat Sci Ctr Quantum Informat Beijing 100084 Peoples R China

Randomness extraction is a key problem in cryptography and theoretical computer science. With the recent rapid development of quantum cryptography, quantum-proof randomness extraction has also been widely studied, addressing the security issues in the presence of a quantum adversary. In contrast with conventional quantum-proof randomness extractors characterizing the input raw data as min-entropy sources, it is found that the input raw data generated by a large class of trusted-device quantum random number generators can be characterized as the so-called reverse block source. This fact enables us to design improved extractors. Two novel quantum-proof randomness extractors for reverse block sources that realize real-time block-wise extraction are proposed specifically. In comparison with the general min-entropy randomness extractors, the designs achieve a significantly higher extraction speed and a longer output data length with the same seed length. In addition, they enjoy the property of online algorithms, which process the raw data on the fly without waiting for the entire input raw data to be available. These features make the design an adequate choice for the real-time post-processing of practical quantum random number generators. Applying the extractors to the raw data generated by a widely used quantum random number generator, a simulated extraction speed as high as 300 Gbps is achieved. Novel quantum randomness extractors are proposed against quantum side information. Unlike traditional approaches, the techniques are tailored for reverse block source. The methods achieve significantly higher extraction speeds and longer output data lengths with the same seed length. In addition, the raw data are processed on the fly without waiting for the entire input data available. image

关键词： post-processing quantum cryptography quantum-proof extractor

来源：评论

学校读者我要写书评

暂无评论

quantum image cryptography based on continuous chaotic maps

引用

MICROSYSTEM TECHNOLOGIES-MICRO-AND NANOSYSTEMS-information STORAGE AND processing SYSTEMS 2025年第6期31卷 1365-1380页

作者： Satre, Shilpa M. Joshi, Bharti DY Patil Deemed Be Univ Ramrao Adik Inst Technol Dept Comp Engn Navi Mumbai 400706 Maharashtra India

Images are significant data carriers because they are more challenging to transfer or store securely than text data because they include large amounts of digital data with high redundancy and volume. As a result, image security has grown in importance and relevance to researchers. Images can be shielded against a variety of risks with security, including eavesdropping and illegal copying and alteration. To transform an image into an unidentified format that can be sent via a medium, image encryption is utilized. Because of the potential quantum risk to the existing cryptographic encryption methods and the quick advancement towards the development of quantum computers, quantum image encryption algorithms have recently drawn increasing amounts of attention. The majority of quantum image encryption techniques such as diffusion and scrambling, involve two separate rounds. In this model, the three different chaotic maps are used separately for scrambling the images to determine the performance of the quantum image cryptography with different combinations of the model. At first, the hash256 algorithm is used for generating the quantum key and the forward diffusion takes place for diffusing the first pixel to the final pixel of the input image information. Then, the three different chaotic maps such as pixel permutation, Chen attractor and Lorenz attractor are used for scrambling the input image. Finally, the bit-level permutation and backward diffusion process are considered for the scrambled image. For evaluating the performance of the quantum image cryptography based on the three different chaotic maps, the NPCR, UACI, Entropy, SSIM, correlation characteristics and histogram analysis are determined. From this evaluation, the Lorenz attractor chaotic map performs better than the pixel permutation and Chen attractor. The attained NPCR, UACI, Entropy and SSIM of the CASIA2 dataset for Lorenz attractor are improved than the pixel permutation and Chen attractor. Thus, from t

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

UNBIASED quantum PHASE ESTIMATION

引用

quantum information & COMPUTATION 2023年第1-2期23卷 16-26页

作者： Lu, Xi Lin, Hongwei Zhejiang Univ Sch Math Sci Hangzhou 310027 Peoples R China

quantum phase estimation algorithm (PEA) is one of the most important algorithms in early studies of quantum computation. However, we find that the PEA is not an unbiased estimation, which prevents the estimation error from achieving an arbitrarily small level. In this paper, we propose an unbiased phase estimation algorithm (UPEA) based on the original PEA. We also show that a maximum likelihood estimation (MLE) post-processing step applied on UPEA has a smaller mean absolute error than MLE applied on PEA. In the end, we apply UPEA to quantum counting, and use an additional correction step to make the quantum counting algorithm unbiased.

关键词： quantum Algorithm Phase Estimation quantum Counting

来源：评论

学校读者我要写书评

暂无评论

quantum computing basics, applications and future perspectives

引用

JOURNAL OF MOLECULAR STRUCTURE 2024年 1308卷

作者： Balamurugan, K. S. Sivakami, A. Mathankumar, M. Prasad, Yalla Jnan Devi Satya Ahmad, Irfan Karpaga Vinayaga Coll Engn & Technol Dept Elect & Commun Engn Chengalpattu 603308 Tamil Nadu India Sri Eshwar Coll Engn Dept Phys Coimbatore 641202 Tamilnadu India Karpaga Vinayaga Coll Engn & Technol Dept Comp Sci & Engn Chennai 608308 Tamil Nadu India Malla Reddy Univ Dept Comp Sci & Engn Hyderabad 500043 Telangana India King Khalid Univ Coll Appl Med Sci Dept Clin Lab Sci Abha Saudi Arabia

quantum Computing observed a significant rise to public and technologies in past three decades, the reason behind for the development of quantum computing is to solve various problems which are so complex that traditional (classical) computers were not able to solve. New technologies, hardware components and software advancements are being discovered all around the world in order to use this powerful tool. But in addition to the development of technologies and the attempt to scale up the quantum computers, new challenges and problems too came in light which makes it tough for further progress in the quest to unlock the true development of quantum computers. Various methods has been identified for quantum information processing (QIP), but the error rates were more than what we would expect often resulting in inappropriate computations which eventually gives inaccurate *** this work, we discuss about the prominent hardware and software methods to build the quantum computers with low error rates and better accuracy, we will look onto the topics related to qubits and its principles which are incorporated in quantum processing Units (QPUs) which govern the working of quantum computers, the topics of quantum algorithms and its methodology are also been discussed to provide a clear understanding of the manipulation of qubits according to the purpose needed. In addition to that we will talk about the applications like quantum teleportation and cryptography which utilizes the quantum computers, and discuss about the future enhancements which can be done using this technology.

关键词： Qubits quantum computing quantum cryptography Superposition

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of a quantum identity-based signature and its improvement

引用

quantum information processing 2024年第9期23卷 1-16页

作者： Rao, Y. Sreenivasa Srivastava, Vikas Mohanty, Tapaswini Debnath, Sumit Kumar Natl Inst Technol Warangal Dept Math Warangal 506004 Telangana India Natl Inst Technol Jamshedpur Dept Math Jamshedpur 831014 India IIT Madras Dept Math Chennai 600036 India

Digital signatures are one of the key cryptographic components for providing authenticity and non-repudiation. To circumvent the need of certificates, Shamir in 1984 introduced identity-based signature (IBS). Nearly all of the existing state-of-the-art IBS schemes are relying on the number-theoretic hardness assumptions. Unfortunately, these hard problems are insecure and face a threat in quantum world. Thus, it is high time to design and analyze IBS algorithms that can resist quantum attacks and provide long-term security. quantum cryptography is one such technique to provide quantum-safe IBS. In this paper, we cryptanalyze the quantum cryptography-based IBS of Huang et al. (Huang et al. in quantum Inf Process 22(1):36, 2022). We show that the design in (Huang et al. in quantum Inf Process 22(1):36, 2022) is not secure against public key generator forgery attack, collusion attacks, and intercept and resend attacks. Next, we modify the design of (Huang et al. in quantum Inf Process 22(1):36, 2022) and propose a new quantum IBS (namely qIBS) which is secure against the aforementioned attacks.

关键词： Digital signature Identity-based signature quantum secure signature Cryptanalysis Key-controlled quantum onetime pad

来源：评论

学校读者我要写书评

暂无评论

quantum information processing and quantum Simulation with Programmable Rydberg Atom Arrays

Quantum Information Processing and Quantum Simulation with P...

引用

作者： Levine, Harry Jay Harvard University

学位级别：Ph.D.

A frontier challenge in quantum science and technology is the construction of scalable quantum systems which can operate in regimes beyond classical simulatability. Such systems can be used as tools for simulating and exploring complex phenomena in quantum physics; they can also be used to benchmark and test quantum algorithms. Several experimental platforms, based on a variety of quantum mechanical building blocks, are currently being pursued with these goals in mind, with state-of-the-art systems capable of controlling up to around fifty particles. In this thesis, we present the development of a new platform based on individually controlled neutral atoms. In this approach, hundreds of individual atoms are trapped in an array of optical tweezers, and they are sorted in real-time into programmable geometries in one and two dimensions. After initialization of an array, atom interactions are switched on by coherent excitation to highly excited Rydberg states, resulting in a rich spin Hamiltonian. We experimentally advance several key aspects of this platform, developing new tools for controlling strongly interacting atom arrays and probing novel quantum phases and non-equilibrium dynamics. We additionally utilize Rydberg interactions to entangle atoms, demonstrating high fidelity universal quantum logic gates as well as the preparation of fully entangled Schrödinger cat states. This work highlights the prospects for scalable quantum simulation and quantum information processing beyond the limit of classical computation using neutral atom arrays.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Characterization of the Complexity of Computing the Minimum Mean Square Error of Causal Prediction

引用

IEEE TRANSACTIONS ON information THEORY 2024年第9期70卷 6627-6638页

作者： Boche, Holger Pohl, Volker Poor, H. Vincent Tech Univ Munich Chair Theoret Informat Technol D-80333 Munich Germany BMBF Res Hub 6G Life D-80333 Munich Germany Ctr Quantum Sci & Technol MCQST D-80799 Munich Germany Munich Quantum Valley MQV D-80807 Munich Germany Princeton Univ Dept Elect & Comp Engn Princeton NJ 08544 USA

This paper investigates the complexity of computing the minimum mean square prediction error for wide-sense stationary stochastic processes. It is shown that if the spectral density of the stationary process is a strictly positive, computable continuous function then the minimum mean square error (MMSE) is always a computable number. Nevertheless, we also show that the computation of the MMSE is a #P-1 complete problem on the set of strictly positive, polynomial-time computable, continuous spectral densities. This means that if, as widely assumed, FP1 not equal #P-1 , then there exist strictly positive, polynomial-time computable continuous spectral densities for which the computation of the MMSE is not polynomial-time computable. These results show in particular that under the widely accepted assumptions of complexity theory, the computation of the MMSE is generally much harder than an $NP_{1}$ complete problem.

关键词： Stochastic processes Finite impulse response filters Computational complexity Turing machines Signal processing algorithms Filtering theory Prediction algorithms Wiener prediction filter minimum mean square error computability Turing machine complexity theory complexity blowup

来源：评论

学校读者我要写书评

暂无评论

Distributed quantum circuit partitioning and optimization based on combined spectral clustering and search tree strategies

引用

Chinese Physics B 2025年第5期34卷 237-248页

作者： Zilu Chen Zhijin Guan Shuxian Zhao Xueyun Cheng School of Artificial Intelligence and Computer Science Nantong UniversityNantong 226019China College of Engineering the Internet of Things Taihu UniversityWuxi 214063China Jiangsu Huihuan Environmental Protection Technology Co. Ltd.Nantong 226010China

In the current noisy intermediate-scale quantum(NISQ)era,a single quantum processing unit(QPU)is insufficient to implement large-scale quantum algorithms;this has driven extensive research into distributed quantum computing(DQC).DQC involves the cooperative operation of multiple QPUs but is concurrently challenged by excessive communication *** address this issue,this paper proposes a quantum circuit partitioning method based on spectral *** approach transforms quantum circuits into weighted graphs and,through computation of the Laplacian matrix and clustering techniques,identifies candidate partition schemes that minimize the total weight of the ***,a global gate search tree strategy is introduced to meticulously explore opportunities for merged transfer of global gates,thereby minimizing the transmission cost of distributed quantum circuits and selecting the optimal partition scheme from the ***,the proposed method is evaluated through various comparative *** experimental results demonstrate that spectral clustering-based partitioning exhibits robust stability and efficiency in runtime in quantum circuits of different *** experiments involving the quantum Fourier transform algorithm and Revlib quantum circuits,the transmission cost achieved by the global gate search tree strategy is significantly optimized.

关键词： NISQ era distributed quantum computing quantum circuit partitioning transmission cost

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：