دانلود و نمایش مقالات مرتبط با Quantum walks::صفحه 1
دانلود بهترین مقالات isi همراه با ترجمه فارسی 2

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Quantum walks

تعداد مقالات یافته شده: 6
ردیف عنوان نوع
1 Hash Function Based on Controlled Alternate Quantum Walks With Memory (September 2021)
عملکرد هش بر اساس راه رفتن کوانتومی جایگزین کنترل شده با حافظه (سپتامبر 2021)-2022
We propose a Quantum inspired Hash Function using controlled alternate quantum walks with Memory on cycles (QHFM), where the jth message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the jth time step, and the hash value is calculated from the resulting probability distribution of the walker. Numerical simulation shows that the proposed hash function has near-ideal statistical performance and is at least on a par with the state-of-the-art hash functions based on quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property; and theoretical analysis indicates that the time and space complexity of the new scheme are not greater than those of its peers. The good performance of QHFM suggests that quantum walks that differ not only in coin operators but also in memory lengths can be combined to build good hash functions, which, in turn, enriches the construction of controlled alternate quantum walks.
INDEX TERMS: Controlled alternate quantum walks (CAQW) | hash function | quantum walks with memory (QWM) | statistical properties | time and space complexity.
مقاله انگلیسی
2 An R-Convolution Graph Kernel Based on Fast Discrete-Time Quantum Walk
یک هسته گراف R-Convolution بر اساس راه رفتن کوانتومی سریع زمان گسسته -2022
In this article, a novel R-convolution kernel, named the fast quantum walk kernel (FQWK), is proposed for unattributed graphs. In FQWK, the similarity of the neighborhood-pair substructure between two nodes is measured via the superposition amplitude of quantum walks between those nodes. The quantum interference in this kind of local substructures provides more information on the substructures so that FQWK can capture finer-grained local structural features of graphs. In addition, to efficiently compute the transition amplitudes of multistep discrete-time quantum walks, a fast recursive method is designed. Thus, compared with all the existing kernels based on the quantum walk, FQWK has the highest computation speed. Extensive experiments demonstrate that FQWK outperforms state-of-the-art graph kernels in terms of classification accuracy for unattributed graphs. Meanwhile, it can be applied to distinguish a larger family of graphs, including cospectral graphs, regular graphs, and even strong regular graphs, which are not distinguishable by classical walk-based methods.
Index Terms: Discrete-time quantum walk (DTQW) | graph classification | graph kernel | R-convolution kernel.
مقاله انگلیسی
3 Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure
آموزش شبکه عصبی مصنوعی کلاسیک با استفاده از راه رفتن کوانتومی به عنوان یک روش جستجو-2022
This article proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic weights of a classical artificial neural network. Each vertex of this complete graph represents a possible synaptic weight set in the w-dimensional search space, where w is the number of weights of the neural network. To know the number of iterations required a priori to obtain the solutions is one of the main advantages of the procedure. Another advantage is that the proposed method does not stagnate in local minimums. Thus, it is possible to use the quantum walk search procedure as an alternative to the backpropagation algorithm. The proposed method was employed for a XOR problem to prove the proposed concept. To solve this problem, the proposed method trained a classical artificial neural network with nine weights. However, the procedure can find solutions for any number of dimensions. The results achieved demonstrate the viability of the proposal, contributing to machine learning and quantum computing researches.
Index Terms: Artificial neural networks training | quantum computing | quantum walk | search algorithm
مقاله انگلیسی
4 A novel image steganography technique based on quantum substitution boxes
یک تکنیک جدید استگانوگرافی تصویر مبتنی بر جعبه های جایگزینی کوانتومی-2019
Substitution boxes play an essential role in designing secure cryptosystems. With the evolution of quantum technologies, current data security mechanisms may be broken due to their construction based on mathematical computation. Quantum walks, a universal quantum computational model, play an essential role in designing quantum algorithms. We utilize the benefits of quantum walks to present a novel technique for constructing substitution boxes (S-boxes) based on quantum walks (QWs). The performance of the presented QWs S-box technique is evaluated by S-box evaluation criteria, and our results prove that the constructed S-box has vital qualities for viable applications in security purposes. Furthermore, a new technique for image steganography is constructed. The proposed technique is an integrated mechanism between classical data hiding and quantum walks to achieve better security for the embedded data. The embedding and extraction procedures are controlled by QWs S-box. The inclusion of cryptographic QWs S-box ensures the security of both embedding and extraction phases. At the extraction phase, only the stego image and the secret values are needed for constructing the secret data. Experimental results demonstrate that the presented technique has a high-security, high embedding capacity and good visual quality.
Keywords:Data hiding | Image steganography | Quantum walks | Cryptography | Substitution boxes
مقاله انگلیسی
5 Controlled alternate quantum walks based privacy preserving healthcare images in Internet of Things
حفظ حریم خصوصی کوانتومی متناوب مبتنی بر حفظ حریم خصوصی مبتنی بر حفظ تصاویر مراقبت های بهداشتی در اینترنت اشیاء-2019
The development of quantum computers and quantum algorithms conveys a challenging scenario for several cryptographic protocols due to the mathematical scaffolding upon which those protocols have been built. Quantum walks constitute a universal quantum computational model which is widely used in various fields, including quantum algorithms and cryptography. Quantum walks can be utilized as a powerful tool for the development of modern chaos-based cryptographic applications due to their nonlinear dynamical behavior and high sensitivity to initial conditions. In this paper, we propose new encryption mechanism for privacy preserving Internet of Things-based healthcare systems in order to protect the patients’ privacy. The encryption/decryption processes are based on controlled alternate quantum walks. The proposed cryptosystem approach is composed of two phases: substitution and permutation, both based on independently computed quantum walks. Simulation results and numerical analysis of our data provide enough evidence to reasonably conjecture that our image encryption protocol is robust and efficient for protecting patients’ privacy protection.
Keywords: Image encryption | Quantum walks | Healthcare | Privacy preserving | Internet of Things
مقاله انگلیسی
6 Efficient quantum-based security protocols for information sharing and data protection in 5G networks
پروتکل های امنیتی مبتنی بر کوانتومی کارآمد برای به اشتراک گذاری اطلاعات و محافظت از داده ها در شبکه های 5G-2019
Fifth generation (5G) networks aim at utilizing many promising communication technologies, such as Cloud Computing, Network Slicing, and Software Defined Networking. Supporting a massive number of connected devices with 5G advanced technologies and innovating new techniques will surely bring tremendous challenges for trust, security and privacy. Therefore, secure mechanisms and protocols are required as the basis for 5G networks to address this security challenges and follow securityby- design but also security-by-operations rules. In this context, new efficient cryptographic protocols and mechanisms are needed in order to design and achieve information sharing and data protection protocols in 5G networks. In the literature, several security schemes based on unproven assumptions of computational complexity and mathematical models were proposed. However, the cryptanalysis is able to break most of the existing proposals in the presence of several weakest links in the designs. Recently, quantum walks (QWs) have been introduced as an excellent mechanism for generating cryptographic keys due to its nonlinear chaotic dynamical performance, high sensitivity to initial control parameters, stability and very large key space theoretically strong enough to resist various known attacks. This paper firstly proposes two efficient hash function mechanisms for 5G networks applications based on QWs, namely QWHF-1 and QWHF-2. Then, based on these hash functions, two efficient security protocols for securing data in 5G network scenario are proposed. Performance analyses and simulation results show that the proposed approaches are characterized with high security, efficiency, and robustness against several well-known attacks which nominate them as excellent candidates for securing 5G applications.
Keywords: 5G networks | Security protocols | Authentication | Quantum hash function | Quantum walks
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 2985 :::::::: بازدید دیروز: 3097 :::::::: بازدید کل: 37252 :::::::: افراد آنلاین: 44