CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: quantum algorithms</title> <meta name="description" content="Search results for: quantum algorithms"> <meta name="keywords" content="quantum algorithms"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="quantum algorithms" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="quantum algorithms"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 2591</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: quantum algorithms</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2591</span> Quantum Cryptography: Classical Cryptography Algorithms’ Vulnerability State as Quantum Computing Advances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tydra%20Preyear">Tydra Preyear</a>, <a href="https://publications.waset.org/abstracts/search?q=Victor%20Clincy"> Victor Clincy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum computing presents many computational advantages over classical computing methods due to the utilization of quantum mechanics. The capability of this computing infrastructure poses threats to standard cryptographic systems such as RSA and AES, which are designed for classical computing environments. This paper discusses the impact that quantum computing has on cryptography, while focusing on the evolution from classical cryptographic concepts to quantum and post-quantum cryptographic concepts. Standard Cryptography is essential for securing data by utilizing encryption and decryption methods, and these methods face vulnerability problems due to the advancement of quantum computing. In order to counter these vulnerabilities, the methods that are proposed are quantum cryptography and post-quantum cryptography. Quantum cryptography uses principles such as the uncertainty principle and photon polarization in order to provide secure data transmission. In addition, the concept of Quantum key distribution is introduced to ensure more secure communication channels by distributing cryptographic keys. There is the emergence of post-quantum cryptography which is used for improving cryptographic algorithms in order to be more secure from attacks by classical and quantum computers. Throughout this exploration, the paper mentions the critical role of the advancement of cryptographic methods to keep data integrity and privacy safe from quantum computing concepts. Future research directions that would be discussed would be more effective cryptographic methods through the advancement of technology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20cryptography" title=" quantum cryptography"> quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20integrity%20and%20privacy" title=" data integrity and privacy"> data integrity and privacy</a> </p> <a href="https://publications.waset.org/abstracts/189381/quantum-cryptography-classical-cryptography-algorithms-vulnerability-state-as-quantum-computing-advances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189381.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">26</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2590</span> A Generalized Space-Efficient Algorithm for Quantum Bit String Comparators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khuram%20Shahzad">Khuram Shahzad</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20Usman%20Khan"> Omar Usman Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum bit string comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in programming languages. Consequently, QBSCs play a crucial role in various algorithms that can be executed or adapted for quantum computers. The development of efficient and generalized comparators for any n-qubit length has long posed a challenge, as they have a high-cost footprint and lead to quantum delays. Comparators that are efficient are associated with inputs of fixed length. As a result, comparators without a generalized circuit cannot be employed at a higher level, though they are well-suited for problems with limited size requirements. In this paper, we introduce a generalized design for the comparison of two n-qubit logic states using just two ancillary bits. The design is examined on the basis of qubit requirements, ancillary bit usage, quantum cost, quantum delay, gate operations, and circuit complexity and is tested comprehensively on various input lengths. The work allows for sufficient flexibility in the design of quantum algorithms, which can accelerate quantum algorithm development. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20comparator" title="quantum comparator">quantum comparator</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20algorithm" title=" quantum algorithm"> quantum algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=space-efficient%20comparator" title=" space-efficient comparator"> space-efficient comparator</a>, <a href="https://publications.waset.org/abstracts/search?q=comparator" title=" comparator"> comparator</a> </p> <a href="https://publications.waset.org/abstracts/193195/a-generalized-space-efficient-algorithm-for-quantum-bit-string-comparators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193195.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">15</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2589</span> Introducing Quantum-Weijsberg Algebras by Redefining Quantum-MV Algebras: Characterization, Properties, and Other Important Results</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lavinia%20Ciungu">Lavinia Ciungu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the last decades, developing algebras related to the logical foundations of quantum mechanics became a central topic of research. Generally known as quantum structures, these algebras serve as models for the formalism of quantum mechanics. In this work, we introduce the notion of quantum-Wajsberg algebras by redefining the quantum-MV algebras starting from involutive BE algebras. We give a characterization of quantum-Wajsberg algebras, investigate their properties, and show that, in general, quantum-Wajsberg algebras are not (commutative) quantum-B algebras. We also define the ∨-commutative quantum-Wajsberg algebras and study their properties. Furthermore, we prove that any Wajsberg algebra (bounded ∨-commutative BCK algebra) is a quantum-Wajsberg algebra, and we give a condition for a quantum-Wajsberg algebra to be a Wajsberg algebra. We prove that Wajsberg algebras are both quantum-Wajsberg algebras and commutative quantum-B algebras. We establish the connection between quantum-Wajsberg algebras and quantum-MV algebras, proving that the quantum-Wajsberg algebras are term equivalent to quantum-MV algebras. We show that, in general, the quantum-Wajsberg algebras are not commutative quantum-B algebras and if a quantum-Wajsberg algebra is self-distributive, then the corresponding quantum-MV algebra is an MV algebra. Our study could be a starting point for the development of other implicative counterparts of certain existing algebraic quantum structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum-Wajsberg%20algebra" title="quantum-Wajsberg algebra">quantum-Wajsberg algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum-MV%20algebra" title=" quantum-MV algebra"> quantum-MV algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=MV%20algebra" title=" MV algebra"> MV algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=Wajsberg%20algebra" title=" Wajsberg algebra"> Wajsberg algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=BE%20algebra" title=" BE algebra"> BE algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum-B%20algebra" title=" quantum-B algebra"> quantum-B algebra</a> </p> <a href="https://publications.waset.org/abstracts/192449/introducing-quantum-weijsberg-algebras-by-redefining-quantum-mv-algebras-characterization-properties-and-other-important-results" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192449.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">15</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2588</span> Quantum Entangled States and Image Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20%20Singh">Sanjay Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Sushil%20Kumar"> Sushil Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Rashmi%20Jain"> Rashmi Jain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum registering is another pattern in computational hypothesis and a quantum mechanical framework has a few helpful properties like Entanglement. We plan to store data concerning the structure and substance of a basic picture in a quantum framework. Consider a variety of n qubits which we propose to use as our memory stockpiling. In recent years classical processing is switched to quantum image processing. Quantum image processing is an elegant approach to overcome the problems of its classical counter parts. Image storage, retrieval and its processing on quantum machines is an emerging area. Although quantum machines do not exist in physical reality but theoretical algorithms developed based on quantum entangled states gives new insights to process the classical images in quantum domain. Here in the present work, we give the brief overview, such that how entangled states can be useful for quantum image storage and retrieval. We discuss the properties of tripartite Greenberger-Horne-Zeilinger and W states and their usefulness to store the shapes which may consist three vertices. We also propose the techniques to store shapes having more than three vertices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Greenberger-Horne-Zeilinger" title="Greenberger-Horne-Zeilinger">Greenberger-Horne-Zeilinger</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20storage%20and%20retrieval" title=" image storage and retrieval"> image storage and retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20entanglement" title=" quantum entanglement"> quantum entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=W%20states" title=" W states"> W states</a> </p> <a href="https://publications.waset.org/abstracts/67732/quantum-entangled-states-and-image-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67732.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">306</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2587</span> Deep Reinforcement Learning Model Using Parameterised Quantum Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lokes%20Parvatha%20Kumaran%20S.">Lokes Parvatha Kumaran S.</a>, <a href="https://publications.waset.org/abstracts/search?q=Sakthi%20Jay%20Mahenthar%20C."> Sakthi Jay Mahenthar C.</a>, <a href="https://publications.waset.org/abstracts/search?q=Sathyaprakash%20P."> Sathyaprakash P.</a>, <a href="https://publications.waset.org/abstracts/search?q=Jayakumar%20V."> Jayakumar V.</a>, <a href="https://publications.waset.org/abstracts/search?q=Shobanadevi%20A."> Shobanadevi A.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the evolution of technology, the need to solve complex computational problems like machine learning and deep learning has shot up. But even the most powerful classical supercomputers find it difficult to execute these tasks. With the recent development of quantum computing, researchers and tech-giants strive for new quantum circuits for machine learning tasks, as present works on Quantum Machine Learning (QML) ensure less memory consumption and reduced model parameters. But it is strenuous to simulate classical deep learning models on existing quantum computing platforms due to the inflexibility of deep quantum circuits. As a consequence, it is essential to design viable quantum algorithms for QML for noisy intermediate-scale quantum (NISQ) devices. The proposed work aims to explore Variational Quantum Circuits (VQC) for Deep Reinforcement Learning by remodeling the experience replay and target network into a representation of VQC. In addition, to reduce the number of model parameters, quantum information encoding schemes are used to achieve better results than the classical neural networks. VQCs are employed to approximate the deep Q-value function for decision-making and policy-selection reinforcement learning with experience replay and the target network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20machine%20learning" title=" quantum machine learning"> quantum machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=variational%20quantum%20circuit" title=" variational quantum circuit"> variational quantum circuit</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20reinforcement%20learning" title=" deep reinforcement learning"> deep reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20information%20encoding%20scheme" title=" quantum information encoding scheme"> quantum information encoding scheme</a> </p> <a href="https://publications.waset.org/abstracts/152629/deep-reinforcement-learning-model-using-parameterised-quantum-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152629.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">134</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2586</span> Quantum Statistical Machine Learning and Quantum Time Series</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Omar%20Alzeley">Omar Alzeley</a>, <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Utev"> Sergey Utev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Minimizing a constrained multivariate function is the fundamental of Machine learning, and these algorithms are at the core of data mining and data visualization techniques. The decision function that maps input points to output points is based on the result of optimization. This optimization is the central of learning theory. One approach to complex systems where the dynamics of the system is inferred by a statistical analysis of the fluctuations in time of some associated observable is time series analysis. The purpose of this paper is a mathematical transition from the autoregressive model of classical time series to the matrix formalization of quantum theory. Firstly, we have proposed a quantum time series model (QTS). Although Hamiltonian technique becomes an established tool to detect a deterministic chaos, other approaches emerge. The quantum probabilistic technique is used to motivate the construction of our QTS model. The QTS model resembles the quantum dynamic model which was applied to financial data. Secondly, various statistical methods, including machine learning algorithms such as the Kalman filter algorithm, are applied to estimate and analyses the unknown parameters of the model. Finally, simulation techniques such as Markov chain Monte Carlo have been used to support our investigations. The proposed model has been examined by using real and simulated data. We establish the relation between quantum statistical machine and quantum time series via random matrix theory. It is interesting to note that the primary focus of the application of QTS in the field of quantum chaos was to find a model that explain chaotic behaviour. Maybe this model will reveal another insight into quantum chaos. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation%20techniques" title=" simulation techniques"> simulation techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20probability" title=" quantum probability"> quantum probability</a>, <a href="https://publications.waset.org/abstracts/search?q=tensor%20product" title=" tensor product"> tensor product</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20series" title=" time series"> time series</a> </p> <a href="https://publications.waset.org/abstracts/52720/quantum-statistical-machine-learning-and-quantum-time-series" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52720.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">469</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2585</span> To Ensure Maximum Voter Privacy in E-Voting Using Blockchain, Convolutional Neural Network, and Quantum Key Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bhaumik%20Tyagi">Bhaumik Tyagi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mandeep%20Kaur"> Mandeep Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Kanika%20Singla"> Kanika Singla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The advancement of blockchain has facilitated scholars to remodel e-voting systems for future generations. Server-side attacks like SQL injection attacks and DOS attacks are the most common attacks nowadays, where malicious codes are injected into the system through user input fields by illicit users, which leads to data leakage in the worst scenarios. Besides, quantum attacks are also there which manipulate the transactional data. In order to deal with all the above-mentioned attacks, integration of blockchain, convolutional neural network (CNN), and Quantum Key Distribution is done in this very research. The utilization of blockchain technology in e-voting applications is not a novel concept. But privacy and security issues are still there in a public and private blockchains. To solve this, the use of a hybrid blockchain is done in this research. This research proposed cryptographic signatures and blockchain algorithms to validate the origin and integrity of the votes. The convolutional neural network (CNN), a normalized version of the multilayer perceptron, is also applied in the system to analyze visual descriptions upon registration in a direction to enhance the privacy of voters and the e-voting system. Quantum Key Distribution is being implemented in order to secure a blockchain-based e-voting system from quantum attacks using quantum algorithms. Implementation of e-voting blockchain D-app and providing a proposed solution for the privacy of voters in e-voting using Blockchain, CNN, and Quantum Key Distribution is done. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hybrid%20blockchain" title="hybrid blockchain">hybrid blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20e-voting%20system" title=" secure e-voting system"> secure e-voting system</a>, <a href="https://publications.waset.org/abstracts/search?q=convolutional%20neural%20networks" title=" convolutional neural networks"> convolutional neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20key%20distribution" title=" quantum key distribution"> quantum key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=one-time%20pad" title=" one-time pad"> one-time pad</a> </p> <a href="https://publications.waset.org/abstracts/160604/to-ensure-maximum-voter-privacy-in-e-voting-using-blockchain-convolutional-neural-network-and-quantum-key-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160604.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">94</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2584</span> Navigating Cyber Attacks with Quantum Computing: Leveraging Vulnerabilities and Forensics for Advanced Penetration Testing in Cybersecurity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sayor%20Ajfar%20Aaron">Sayor Ajfar Aaron</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashif%20Newaz"> Ashif Newaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Sajjat%20Hossain%20Abir"> Sajjat Hossain Abir</a>, <a href="https://publications.waset.org/abstracts/search?q=Mushfiqur%20Rahman"> Mushfiqur Rahman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the transformative potential of quantum computing in the field of cybersecurity, with a focus on advanced penetration testing and forensics. It explores how quantum technologies can be leveraged to identify and exploit vulnerabilities more efficiently than traditional methods and how they can enhance the forensic analysis of cyber-attacks. Through theoretical analysis and practical simulations, this study highlights the enhanced capabilities of quantum algorithms in detecting and responding to sophisticated cyber threats, providing a pathway for developing more resilient cybersecurity infrastructures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cybersecurity" title="cybersecurity">cybersecurity</a>, <a href="https://publications.waset.org/abstracts/search?q=cyber%20forensics" title=" cyber forensics"> cyber forensics</a>, <a href="https://publications.waset.org/abstracts/search?q=penetration%20testing" title=" penetration testing"> penetration testing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title=" quantum computing"> quantum computing</a> </p> <a href="https://publications.waset.org/abstracts/185867/navigating-cyber-attacks-with-quantum-computing-leveraging-vulnerabilities-and-forensics-for-advanced-penetration-testing-in-cybersecurity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185867.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">67</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2583</span> Empowering a New Frontier in Heart Disease Detection: Unleashing Quantum Machine Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sadia%20Nasrin%20Tisha">Sadia Nasrin Tisha</a>, <a href="https://publications.waset.org/abstracts/search?q=Mushfika%20Sharmin%20Rahman"> Mushfika Sharmin Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=Javier%20Orduz"> Javier Orduz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Machine learning is applied in a variety of fields throughout the world. The healthcare sector has benefited enormously from it. One of the most effective approaches for predicting human heart diseases is to use machine learning applications to classify data and predict the outcome as a classification. However, with the rapid advancement of quantum technology, quantum computing has emerged as a potential game-changer for many applications. Quantum algorithms have the potential to execute substantially faster than their classical equivalents, which can lead to significant improvements in computational performance and efficiency. In this study, we applied quantum machine learning concepts to predict coronary heart diseases from text data. We experimented thrice with three different features; and three feature sets. The data set consisted of 100 data points. We pursue to do a comparative analysis of the two approaches, highlighting the potential benefits of quantum machine learning for predicting heart diseases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20machine%20learning" title="quantum machine learning">quantum machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=SVM" title=" SVM"> SVM</a>, <a href="https://publications.waset.org/abstracts/search?q=QSVM" title=" QSVM"> QSVM</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20product%20state" title=" matrix product state"> matrix product state</a> </p> <a href="https://publications.waset.org/abstracts/171382/empowering-a-new-frontier-in-heart-disease-detection-unleashing-quantum-machine-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171382.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">94</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2582</span> Threshold (K, P) Quantum Distillation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shashank%20Gupta">Shashank Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlos%20Cid"> Carlos Cid</a>, <a href="https://publications.waset.org/abstracts/search?q=William%20John%20Munro"> William John Munro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum distillation is the task of concentrating quantum correlations present in N imperfect copies to M perfect copies (M < N) using free operations by involving all P the parties sharing the quantum correlation. We present a threshold quantum distillation task where the same objective is achieved but using lesser number of parties (K < P). In particular, we give an exact local filtering operations by the participating parties sharing high dimension multipartite entangled state to distill the perfect quantum correlation. Later, we bridge a connection between threshold quantum entanglement distillation and quantum steering distillation and show that threshold distillation might work in the scenario where general distillation protocol like DEJMPS does not work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20networks" title="quantum networks">quantum networks</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20distillation" title=" quantum distillation"> quantum distillation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20key%20distribution" title=" quantum key distribution"> quantum key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=entanglement%20distillation" title=" entanglement distillation"> entanglement distillation</a> </p> <a href="https://publications.waset.org/abstracts/186155/threshold-k-p-quantum-distillation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186155.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">45</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2581</span> Quantum Kernel Based Regressor for Prediction of Non-Markovianity of Open Quantum Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diego%20Tancara">Diego Tancara</a>, <a href="https://publications.waset.org/abstracts/search?q=Raul%20Coto"> Raul Coto</a>, <a href="https://publications.waset.org/abstracts/search?q=Ariel%20Norambuena"> Ariel Norambuena</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoseein%20T.%20Dinani"> Hoseein T. Dinani</a>, <a href="https://publications.waset.org/abstracts/search?q=Felipe%20Fanchini"> Felipe Fanchini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum machine learning is a growing research field that aims to perform machine learning tasks assisted by a quantum computer. Kernel-based quantum machine learning models are paradigmatic examples where the kernel involves quantum states, and the Gram matrix is calculated from the overlapping between these states. With the kernel at hand, a regular machine learning model is used for the learning process. In this paper we investigate the quantum support vector machine and quantum kernel ridge models to predict the degree of non-Markovianity of a quantum system. We perform digital quantum simulation of amplitude damping and phase damping channels to create our quantum dataset. We elaborate on different kernel functions to map the data and kernel circuits to compute the overlapping between quantum states. We observe a good performance of the models. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum" title="quantum">quantum</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=kernel" title=" kernel"> kernel</a>, <a href="https://publications.waset.org/abstracts/search?q=non-markovianity" title=" non-markovianity"> non-markovianity</a> </p> <a href="https://publications.waset.org/abstracts/165769/quantum-kernel-based-regressor-for-prediction-of-non-markovianity-of-open-quantum-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165769.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">180</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2580</span> A Hybrid Classical-Quantum Algorithm for Boundary Integral Equations of Scattering Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Damir%20Latypov">Damir Latypov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A hybrid classical-quantum algorithm to solve boundary integral equations (BIE) arising in problems of electromagnetic and acoustic scattering is proposed. The quantum speed-up is due to a Quantum Linear System Algorithm (QLSA). The original QLSA of Harrow et al. provides an exponential speed-up over the best-known classical algorithms but only in the case of sparse systems. Due to the non-local nature of integral operators, matrices arising from discretization of BIEs, are, however, dense. A QLSA for dense matrices was introduced in 2017. Its runtime as function of the system's size N is bounded by O(√Npolylog(N)). The run time of the best-known classical algorithm for an arbitrary dense matrix scales as O(N².³⁷³). Instead of exponential as in case of sparse matrices, here we have only a polynomial speed-up. Nevertheless, sufficiently high power of this polynomial, ~4.7, should make QLSA an appealing alternative. Unfortunately for the QLSA, the asymptotic separability of the Green's function leads to high compressibility of the BIEs matrices. Classical fast algorithms such as Multilevel Fast Multipole Method (MLFMM) take advantage of this fact and reduce the runtime to O(Nlog(N)), i.e., the QLSA is only quadratically faster than the MLFMM. To be truly impactful for computational electromagnetics and acoustics engineers, QLSA must provide more substantial advantage than that. We propose a computational scheme which combines elements of the classical fast algorithms with the QLSA to achieve the required performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20linear%20system%20algorithm" title="quantum linear system algorithm">quantum linear system algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=boundary%20integral%20equations" title=" boundary integral equations"> boundary integral equations</a>, <a href="https://publications.waset.org/abstracts/search?q=dense%20matrices" title=" dense matrices"> dense matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=electromagnetic%20scattering%20theory" title=" electromagnetic scattering theory"> electromagnetic scattering theory</a> </p> <a href="https://publications.waset.org/abstracts/130056/a-hybrid-classical-quantum-algorithm-for-boundary-integral-equations-of-scattering-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130056.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">154</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2579</span> Detailed Quantum Circuit Design and Evaluation of Grover's Algorithm for the Bounded Degree Traveling Salesman Problem Using the Q# Language</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wenjun%20Hou">Wenjun Hou</a>, <a href="https://publications.waset.org/abstracts/search?q=Marek%20Perkowski"> Marek Perkowski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling Salesman problem is famous in computing and graph theory. In short, it asks for the Hamiltonian cycle of the least total weight in a given graph with N nodes. All variations on this problem, such as those with K-bounded-degree nodes, are classified as NP-complete in classical computing. Although several papers propose theoretical high-level designs of quantum algorithms for the Traveling Salesman Problem, no quantum circuit implementation of these algorithms has been created up to our best knowledge. In contrast to previous papers, the goal of this paper is not to optimize some abstract complexity measures based on the number of oracle iterations, but to be able to evaluate the real circuit and time costs of the quantum computer. Using the emerging quantum programming language Q# developed by Microsoft, which runs quantum circuits in a quantum computer simulation, an implementation of the bounded-degree problem and its respective quantum circuit were created. To apply Grover’s algorithm to this problem, a quantum oracle was designed, evaluating the cost of a particular set of edges in the graph as well as its validity as a Hamiltonian cycle. Repeating the Grover algorithm with an oracle that finds successively lower cost each time allows to transform the decision problem to an optimization problem, finding the minimum cost of Hamiltonian cycles. N log₂ K qubits are put into an equiprobablistic superposition by applying the Hadamard gate on each qubit. Within these N log₂ K qubits, the method uses an encoding in which every node is mapped to a set of its encoded edges. The oracle consists of several blocks of circuits: a custom-written edge weight adder, node index calculator, uniqueness checker, and comparator, which were all created using only quantum Toffoli gates, including its special forms, which are Feynman and Pauli X. The oracle begins by using the edge encodings specified by the qubits to calculate each node that this path visits and adding up the edge weights along the way. Next, the oracle uses the calculated nodes from the previous step and check that all the nodes are unique. Finally, the oracle checks that the calculated cost is less than the previously-calculated cost. By performing the oracle an optimal number of times, a correct answer can be generated with very high probability. The oracle of the Grover Algorithm is modified using the recalculated minimum cost value, and this procedure is repeated until the cost cannot be further reduced. This algorithm and circuit design have been verified, using several datasets, to generate correct outputs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20circuit%20optimization" title=" quantum circuit optimization"> quantum circuit optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms" title=" quantum algorithms"> quantum algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20quantum%20algorithms" title=" hybrid quantum algorithms"> hybrid quantum algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20programming" title=" quantum programming"> quantum programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Grover%E2%80%99s%20algorithm" title=" Grover’s algorithm"> Grover’s algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=bounded-degree%20TSP" title=" bounded-degree TSP"> bounded-degree TSP</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20cost" title=" minimal cost"> minimal cost</a>, <a href="https://publications.waset.org/abstracts/search?q=Q%23%20language" title=" Q# language"> Q# language</a> </p> <a href="https://publications.waset.org/abstracts/111077/detailed-quantum-circuit-design-and-evaluation-of-grovers-algorithm-for-the-bounded-degree-traveling-salesman-problem-using-the-q-language" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111077.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">190</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2578</span> Optimizing Quantum Machine Learning with Amplitude and Phase Encoding Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Om%20Viroje">Om Viroje</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum machine learning represents a frontier in computational technology, promising significant advancements in data processing capabilities. This study explores the significance of data encoding techniques, specifically amplitude and phase encoding, in this emerging field. By employing a comparative analysis methodology, the research evaluates how these encoding techniques affect the accuracy, efficiency, and noise resilience of quantum algorithms. Our findings reveal that amplitude encoding enhances algorithmic accuracy and noise tolerance, whereas phase encoding significantly boosts computational efficiency. These insights are crucial for developing robust quantum frameworks that can be effectively applied in real-world scenarios. In conclusion, optimizing encoding strategies is essential for advancing quantum machine learning, potentially transforming various industries through improved data processing and analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20machine%20learning" title="quantum machine learning">quantum machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20encoding" title=" data encoding"> data encoding</a>, <a href="https://publications.waset.org/abstracts/search?q=amplitude%20encoding" title=" amplitude encoding"> amplitude encoding</a>, <a href="https://publications.waset.org/abstracts/search?q=phase%20encoding" title=" phase encoding"> phase encoding</a>, <a href="https://publications.waset.org/abstracts/search?q=noise%20resilience" title=" noise resilience"> noise resilience</a> </p> <a href="https://publications.waset.org/abstracts/193480/optimizing-quantum-machine-learning-with-amplitude-and-phase-encoding-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193480.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">14</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2577</span> Stern-Gerlach Force in Quantum Magnetic Field and Schrodinger's Cat</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mandip%20Singh">Mandip Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum entanglement plays a fundamental role in our understanding of counter-intuitive aspects of quantum reality. If classical physics is an approximation of quantum physics, then quantum entanglement should persist at a macroscopic scale. In this paper, a thought experiment is presented where a free falling spin polarized Bose-Einstein condensate interacts with a quantum superimposed magnetic field of nonzero gradient. In contrast to the semiclassical Stern-Gerlach experiment, the magnetic field and the spin degrees of freedom both are considered to be quantum mechanical in a generalized scenario. As a consequence, a Bose-Einstein condensate can be prepared at distinct locations in space in a sense of quantum superposition. In addition, the generation of Schrodinger-cat like quantum states shall be presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Schrodinger-cat%20quantum%20states" title="Schrodinger-cat quantum states">Schrodinger-cat quantum states</a>, <a href="https://publications.waset.org/abstracts/search?q=macroscopic%20entanglement" title=" macroscopic entanglement"> macroscopic entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=macroscopic%20quantum%20fields" title=" macroscopic quantum fields"> macroscopic quantum fields</a>, <a href="https://publications.waset.org/abstracts/search?q=foundations%20of%20quantum%20physics" title=" foundations of quantum physics"> foundations of quantum physics</a> </p> <a href="https://publications.waset.org/abstracts/74746/stern-gerlach-force-in-quantum-magnetic-field-and-schrodingers-cat" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74746.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">189</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2576</span> Science behind Quantum Teleportation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ananya%20G.">Ananya G.</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Varshitha"> B. Varshitha</a>, <a href="https://publications.waset.org/abstracts/search?q=Shwetha%20S."> Shwetha S.</a>, <a href="https://publications.waset.org/abstracts/search?q=Kavitha%20S.%20N."> Kavitha S. N.</a>, <a href="https://publications.waset.org/abstracts/search?q=Praveen%20Kumar%20Gupta"> Praveen Kumar Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Teleportation is the ability to travel by just reappearing at some other spot. Though teleportation has never been achieved, quantum teleportation is possible. Quantum teleportation is a process of transferring the quantum state of a particle onto another particle, under the circumstance that one does not get to know any information about the state in the process of transformation. This paper presents a brief overview of quantum teleportation, discussing the topics like Entanglement, EPR Paradox, Bell's Theorem, Qubits, elements for a successful teleport, some examples of advanced teleportation systems (also covers few ongoing experiments), applications (that includes quantum cryptography), and the current hurdles for future scientists interested in this field. Finally, major advantages and limitations to the existing teleportation theory are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=teleportation" title="teleportation">teleportation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20teleportation" title=" quantum teleportation"> quantum teleportation</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20entanglement" title=" quantum entanglement"> quantum entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=qubits" title=" qubits"> qubits</a>, <a href="https://publications.waset.org/abstracts/search?q=EPR%20paradox" title=" EPR paradox"> EPR paradox</a>, <a href="https://publications.waset.org/abstracts/search?q=bell%20states" title=" bell states"> bell states</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20particles" title=" quantum particles"> quantum particles</a>, <a href="https://publications.waset.org/abstracts/search?q=spooky%20action%20at%20a%20distance" title=" spooky action at a distance"> spooky action at a distance</a> </p> <a href="https://publications.waset.org/abstracts/148679/science-behind-quantum-teleportation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148679.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">117</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2575</span> Particle Swarm Optimization and Quantum Particle Swarm Optimization to Multidimensional Function Approximation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diogo%20Silva">Diogo Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=Fadul%20Rodor"> Fadul Rodor</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlos%20Moraes"> Carlos Moraes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work compares the results of multidimensional function approximation using two algorithms: the classical Particle Swarm Optimization (PSO) and the Quantum Particle Swarm Optimization (QPSO). These algorithms were both tested on three functions - The Rosenbrock, the Rastrigin, and the sphere functions - with different characteristics by increasing their number of dimensions. As a result, this study shows that the higher the function space, i.e. the larger the function dimension, the more evident the advantages of using the QPSO method compared to the PSO method in terms of performance and number of necessary iterations to reach the stop criterion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PSO" title="PSO">PSO</a>, <a href="https://publications.waset.org/abstracts/search?q=QPSO" title=" QPSO"> QPSO</a>, <a href="https://publications.waset.org/abstracts/search?q=function%20approximation" title=" function approximation"> function approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=AI" title=" AI"> AI</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multidimensional%20functions" title=" multidimensional functions"> multidimensional functions</a> </p> <a href="https://publications.waset.org/abstracts/81790/particle-swarm-optimization-and-quantum-particle-swarm-optimization-to-multidimensional-function-approximation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81790.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">589</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2574</span> Aperiodic and Asymmetric Fibonacci Quasicrystals: Next Big Future in Quantum Computation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jatindranath%20Gain">Jatindranath Gain</a>, <a href="https://publications.waset.org/abstracts/search?q=Madhumita%20DasSarkar"> Madhumita DasSarkar</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudakshina%20Kundu"> Sudakshina Kundu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum information is stored in states with multiple quasiparticles, which have a topological degeneracy. Topological quantum computation is concerned with two-dimensional many body systems that support excitations. Anyons are elementary building block of quantum computations. When anyons tunneling in a double-layer system can transition to an exotic non-Abelian state and produce Fibonacci anyons, which are powerful enough for universal topological quantum computation (TQC).Here the exotic behavior of Fibonacci Superlattice is studied by using analytical transfer matrix methods and hence Fibonacci anyons. This Fibonacci anyons can build a quantum computer which is very emerging and exciting field today’s in Nanophotonics and quantum computation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quasicrystals" title=" quasicrystals"> quasicrystals</a>, <a href="https://publications.waset.org/abstracts/search?q=Multiple%20Quantum%20wells%20%28MQWs%29" title=" Multiple Quantum wells (MQWs)"> Multiple Quantum wells (MQWs)</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20matrix%20method" title=" transfer matrix method"> transfer matrix method</a>, <a href="https://publications.waset.org/abstracts/search?q=fibonacci%20anyons" title=" fibonacci anyons"> fibonacci anyons</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20hall%20effect" title=" quantum hall effect"> quantum hall effect</a>, <a href="https://publications.waset.org/abstracts/search?q=nanophotonics" title=" nanophotonics"> nanophotonics</a> </p> <a href="https://publications.waset.org/abstracts/41369/aperiodic-and-asymmetric-fibonacci-quasicrystals-next-big-future-in-quantum-computation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41369.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">390</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2573</span> The Magnetized Quantum Breathing in Cylindrical Dusty Plasma</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Abdikian">A. Abdikian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A quantum breathing mode has been theatrically studied in quantum dusty plasma. By using linear quantum hydrodynamic model, not only the quantum dispersion relation of rotation mode but also void structure has been derived in the presence of an external magnetic field. Although the phase velocity of the magnetized quantum breathing mode is greater than that of unmagnetized quantum breathing mode, attenuation of the magnetized quantum breathing mode along radial distance seems to be slower than that of unmagnetized quantum breathing mode. Clearly, drawing the quantum breathing mode in the presence and absence of a magnetic field, we found that the magnetic field alters the distribution of dust particles and changes the radial and azimuthal velocities around the axis. Because the magnetic field rotates the dust particles and collects them, it could compensate the void structure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=the%20linear%20quantum%20hydrodynamic%20model" title="the linear quantum hydrodynamic model">the linear quantum hydrodynamic model</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20magnetized%20quantum%20breathing%20mode" title=" the magnetized quantum breathing mode"> the magnetized quantum breathing mode</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20quantum%20dispersion%20relation%20of%20rotation%20mode" title=" the quantum dispersion relation of rotation mode"> the quantum dispersion relation of rotation mode</a>, <a href="https://publications.waset.org/abstracts/search?q=void%20structure" title=" void structure"> void structure</a> </p> <a href="https://publications.waset.org/abstracts/69938/the-magnetized-quantum-breathing-in-cylindrical-dusty-plasma" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69938.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">298</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2572</span> Quantum Entanglement and Thermalization in Superconducting Two-Qubit Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Karami">E. Karami</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Bohloul"> M. Bohloul</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Najmadi"> P. Najmadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The superconducting system is a suitable system for quantum computers. Quantum entanglement is a fundamental phenomenon that is key to the power of quantum computers. Quantum entanglement has been studied in different superconducting systems. In this paper, we are investigating a superconducting two-qubit system as a macroscopic system. These systems include two coupled Quantronium circuits. We calculate quantum entanglement and thermalization for system evolution and compare them. We observe, thermalization and entanglement have different behavior, and equilibrium thermal state has maximum entanglement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=macroscopic%20system" title="macroscopic system">macroscopic system</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20entanglement" title=" quantum entanglement"> quantum entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=thermalization" title=" thermalization"> thermalization</a>, <a href="https://publications.waset.org/abstracts/search?q=superconducting%20system" title=" superconducting system"> superconducting system</a> </p> <a href="https://publications.waset.org/abstracts/148726/quantum-entanglement-and-thermalization-in-superconducting-two-qubit-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148726.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">155</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2571</span> Reinforcement Learning the Born Rule from Photon Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rodrigo%20S.%20Piera">Rodrigo S. Piera</a>, <a href="https://publications.waset.org/abstracts/search?q=Jailson%20Sales%20Ara%C2%B4ujo"> Jailson Sales Ara´ujo</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriela%20B.%20Lemos"> Gabriela B. Lemos</a>, <a href="https://publications.waset.org/abstracts/search?q=Matthew%20B.%20Weiss"> Matthew B. Weiss</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20B.%20DeBrota"> John B. DeBrota</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20H.%20Aguilar"> Gabriel H. Aguilar</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacques%20L.%20Pienaar"> Jacques L. Pienaar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Born rule was historically viewed as an independent axiom of quantum mechanics until Gleason derived it in 1957 by assuming the Hilbert space structure of quantum measurements [1]. In subsequent decades there have been diverse proposals to derive the Born rule starting from even more basic assumptions [2]. In this work, we demonstrate that a simple reinforcement-learning algorithm, having no pre-programmed assumptions about quantum theory, will nevertheless converge to a behaviour pattern that accords with the Born rule, when tasked with predicting the output of a quantum optical implementation of a symmetric informationally-complete measurement (SIC). Our findings support a hypothesis due to QBism (the subjective Bayesian approach to quantum theory), which states that the Born rule can be thought of as a normative rule for making decisions in a quantum world [3]. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20Bayesianism" title="quantum Bayesianism">quantum Bayesianism</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20theory" title=" quantum theory"> quantum theory</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20information" title=" quantum information"> quantum information</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20measurement" title=" quantum measurement"> quantum measurement</a> </p> <a href="https://publications.waset.org/abstracts/175290/reinforcement-learning-the-born-rule-from-photon-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/175290.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">109</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2570</span> Quantum Dots with Microwave Propagation in Future Quantum Internet Protocol for Mobile Telephony</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20B.%20R.%20Hazarika">A. B. R. Hazarika</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present paper, Quantum dots of ZnS are used to study the faster microwave propagation in space and on earth which will be difficult to bypass as quantum key encryption-decryption is difficult to decode. The present study deals with Quantum internet protocol which is much faster, safer and secure in microwave propagation than the present Internet Protocol v6, which forms the aspect of our study. Assimilation of hardware, Quantum dots with Quantum protocol theory beautifies the aspect of the study. So far to author’s best knowledge, the study on mobile telephony with Quantum dots long-term evolution (QDLTE) has not been studied earlier, which forms the aspect of the study found that the Bitrate comes out to be 102.4 Gbps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption" title="encryption">encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20protocol" title=" internet protocol"> internet protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=microwave" title=" microwave"> microwave</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20telephony" title=" mobile telephony"> mobile telephony</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20key%20encryption" title=" quantum key encryption"> quantum key encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20dots" title=" quantum dots"> quantum dots</a> </p> <a href="https://publications.waset.org/abstracts/89901/quantum-dots-with-microwave-propagation-in-future-quantum-internet-protocol-for-mobile-telephony" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89901.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">173</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2569</span> Secure Optical Communication System Using Quantum Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehab%20AbdulRazzaq%20Hussein">Ehab AbdulRazzaq Hussein</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum cryptography (QC) is an emerging technology for secure key distribution with single-photon transmissions. In contrast to classical cryptographic schemes, the security of QC schemes is guaranteed by the fundamental laws of nature. Their security stems from the impossibility to distinguish non-orthogonal quantum states with certainty. A potential eavesdropper introduces errors in the transmissions, which can later be discovered by the legitimate participants of the communication. In this paper, the modeling approach is proposed for QC protocol BB84 using polarization coding. The single-photon system is assumed to be used in the designed models. Thus, Eve cannot use beam-splitting strategy to eavesdrop on the quantum channel transmission. The only eavesdropping strategy possible to Eve is the intercept/resend strategy. After quantum transmission of the QC protocol, the quantum bit error rate (QBER) is estimated and compared with a threshold value. If it is above this value the procedure must be stopped and performed later again. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=security" title="security">security</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20distribution" title=" key distribution"> key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20protocols" title=" quantum protocols"> quantum protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=Quantum%20Cryptography%20%28QC%29" title=" Quantum Cryptography (QC)"> Quantum Cryptography (QC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Quantum%20Key%20Distribution%20%28QKD%29." title=" Quantum Key Distribution (QKD)."> Quantum Key Distribution (QKD).</a> </p> <a href="https://publications.waset.org/abstracts/2413/secure-optical-communication-system-using-quantum-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2413.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">406</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2568</span> Using Wavelet Uncertainty Relations in Quantum Mechanics: From Trajectories Foam to Newtonian Determinism</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paulo%20Castro">Paulo Castro</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20R.%20Croca"> J. R. Croca</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Gatta"> M. Gatta</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Moreira"> R. Moreira</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Owing to the development of quantum mechanics, we will contextualize the foundations of the theory on the Fourier analysis framework, thus stating the unavoidable philosophical conclusions drawn by Niels Bohr. We will then introduce an alternative way of describing the undulatory aspects of quantum entities by using gaussian Morlet wavelets. The description has its roots in de Broglie's realistic program for quantum physics. It so happens that using wavelets it is possible to formulate a more general set of uncertainty relations. A set from which it is possible to theoretically describe both ends of the behavioral spectrum in reality: the indeterministic quantum trajectorial foam and the perfectly drawn Newtonian trajectories. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=philosophy%20of%20quantum%20mechanics" title="philosophy of quantum mechanics">philosophy of quantum mechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20realism" title=" quantum realism"> quantum realism</a>, <a href="https://publications.waset.org/abstracts/search?q=morlet%20wavelets" title=" morlet wavelets"> morlet wavelets</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty%20relations" title=" uncertainty relations"> uncertainty relations</a>, <a href="https://publications.waset.org/abstracts/search?q=determinism" title=" determinism"> determinism</a> </p> <a href="https://publications.waset.org/abstracts/144113/using-wavelet-uncertainty-relations-in-quantum-mechanics-from-trajectories-foam-to-newtonian-determinism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144113.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">171</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2567</span> Network Connectivity Knowledge Graph Using Dwave Quantum Hybrid Solvers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nivedha%20Rajaram">Nivedha Rajaram</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid Quantum solvers have been given prime focus in recent days by computation problem-solving domain industrial applications. D’Wave Quantum Computers are one such paragon of systems built using quantum annealing mechanism. Discrete Quadratic Models is a hybrid quantum computing model class supplied by D’Wave Ocean SDK - a real-time software platform for hybrid quantum solvers. These hybrid quantum computing modellers can be employed to solve classic problems. One such problem that we consider in this paper is finding a network connectivity knowledge hub in a huge network of systems. Using this quantum solver, we try to find out the prime system hub, which acts as a supreme connection point for the set of connected computers in a large network. This paper establishes an innovative problem approach to generate a connectivity system hub plot for a set of systems using DWave ocean SDK hybrid quantum solvers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20quantum%20solver" title=" hybrid quantum solver"> hybrid quantum solver</a>, <a href="https://publications.waset.org/abstracts/search?q=DWave%20annealing" title=" DWave annealing"> DWave annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20knowledge%20graph" title=" network knowledge graph"> network knowledge graph</a> </p> <a href="https://publications.waset.org/abstracts/150932/network-connectivity-knowledge-graph-using-dwave-quantum-hybrid-solvers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150932.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">127</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2566</span> Tailoring the Parameters of the Quantum MDS Codes Constructed from Constacyclic Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaskarn%20Singh%20Bhullar">Jaskarn Singh Bhullar</a>, <a href="https://publications.waset.org/abstracts/search?q=Divya%20Taneja"> Divya Taneja</a>, <a href="https://publications.waset.org/abstracts/search?q=Manish%20Gupta"> Manish Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajesh%20Kumar%20Narula"> Rajesh Kumar Narula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The existence conditions of dual containing constacyclic codes have opened a new path for finding quantum maximum distance separable (MDS) codes. Using these conditions parameters of length n=(q²+1)/2 quantum MDS codes were improved. A class of quantum MDS codes of length n=(q²+q+1)/h, where h>1 is an odd prime, have also been constructed having large minimum distance and these codes are new in the sense as these are not available in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hermitian%20construction" title="hermitian construction">hermitian construction</a>, <a href="https://publications.waset.org/abstracts/search?q=constacyclic%20codes" title=" constacyclic codes"> constacyclic codes</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclotomic%20cosets" title=" cyclotomic cosets"> cyclotomic cosets</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20MDS%20codes" title=" quantum MDS codes"> quantum MDS codes</a>, <a href="https://publications.waset.org/abstracts/search?q=singleton%20bound" title=" singleton bound"> singleton bound</a> </p> <a href="https://publications.waset.org/abstracts/55714/tailoring-the-parameters-of-the-quantum-mds-codes-constructed-from-constacyclic-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55714.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2565</span> An Authentication Protocol for Quantum Enabled Mobile Devices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Natarajan%20Venkatachalam">Natarajan Venkatachalam</a>, <a href="https://publications.waset.org/abstracts/search?q=Subrahmanya%20V.%20R.%20K.%20Rao"> Subrahmanya V. R. K. Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=Vijay%20Karthikeyan%20Dhandapani"> Vijay Karthikeyan Dhandapani</a>, <a href="https://publications.waset.org/abstracts/search?q=Swaminathan%20Saravanavel"> Swaminathan Saravanavel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The quantum communication technology is an evolving design which connects multiple quantum enabled devices to internet for secret communication or sensitive information exchange. In future, the number of these compact quantum enabled devices will increase immensely making them an integral part of present communication systems. Therefore, safety and security of such devices is also a major concern for us. To ensure the customer sensitive information will not be eavesdropped or deciphered, we need a strong authentications and encryption mechanism. In this paper, we propose a mutual authentication scheme between these smart quantum devices and server based on the secure exchange of information through quantum channel which gives better solutions for symmetric key exchange issues. An important part of this work is to propose a secure mutual authentication protocol over the quantum channel. We show that our approach offers robust authentication protocol and further our solution is lightweight, scalable, cost-effective with optimized computational processing overheads. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20cryptography" title="quantum cryptography">quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20key%20distribution" title=" quantum key distribution"> quantum key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20quantum%20communication" title=" wireless quantum communication"> wireless quantum communication</a>, <a href="https://publications.waset.org/abstracts/search?q=authentication%20protocol" title=" authentication protocol"> authentication protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20enabled%20device" title=" quantum enabled device"> quantum enabled device</a>, <a href="https://publications.waset.org/abstracts/search?q=trusted%20third%20party" title=" trusted third party"> trusted third party</a> </p> <a href="https://publications.waset.org/abstracts/99935/an-authentication-protocol-for-quantum-enabled-mobile-devices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99935.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">174</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2564</span> Quantum Technologies, the Practical Challenges to It, and Ideas to Build an Inclusive Quantum Platform, Shoonya Ecosystem (Zero-Point Energy)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Partha%20Pratim%20Kalita">Partha Pratim Kalita</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As sound can be converted to light, light can also be deduced to sound. There are technologies to convert light to sound, but there are not many technologies related to the field where sound can be converted to a distinct vibrational sequence of light. Like the laws under which the principles of sound work, there are principles for the light to become quantum in nature. Thus, as we move from sound to the subtler aspects of light, we are moving from 3D to 5D. Either we will be making technologies of 3D in today’s world, or we will be really interested in making technologies of the 5D, depends on our understanding of how quantum 5D works. Right now, the entire world is talking about quantum, which is about the nature and behavior of subatomic particles, which is 5D. In practice, they are using metals and machines based on atomic structures. If we talk of quantum without taking note of the technologies of 5D and beyond, we will only be reinterpreting relative theories in the name of quantum. This paper, therefore, will explore the possibilities of moving towards quantum in its real essence with the Shoonya ecosystem (zero-point energy). In this context, the author shall highlight certain working models developed by him, which are currently in discussion with the Indian government. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20mechanics" title="quantum mechanics">quantum mechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20technologies" title=" quantum technologies"> quantum technologies</a>, <a href="https://publications.waset.org/abstracts/search?q=healthcare" title=" healthcare"> healthcare</a>, <a href="https://publications.waset.org/abstracts/search?q=shoonya%20ecosystem" title=" shoonya ecosystem"> shoonya ecosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20consciousness" title=" human consciousness"> human consciousness</a> </p> <a href="https://publications.waset.org/abstracts/141841/quantum-technologies-the-practical-challenges-to-it-and-ideas-to-build-an-inclusive-quantum-platform-shoonya-ecosystem-zero-point-energy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141841.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">195</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2563</span> Portfolio Risk Management Using Quantum Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Doutre">Thomas Doutre</a>, <a href="https://publications.waset.org/abstracts/search?q=Emmanuel%20De%20Meric%20De%20Bellefon"> Emmanuel De Meric De Bellefon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes the application of local-search metaheuristic quantum annealing to portfolio opti- mization. Heuristic technics are particularly handy when Markowitz’ classical Mean-Variance problem is enriched with additional realistic constraints. Once tailored to the problem, computational experiments on real collected data have shown the superiority of quantum annealing over simulated annealing for this constrained optimization problem, taking advantages of quantum effects such as tunnelling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=portfolio%20risk%20management" title=" portfolio risk management"> portfolio risk management</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20annealing" title=" quantum annealing"> quantum annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/40564/portfolio-risk-management-using-quantum-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40564.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">383</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2562</span> An Improved Many Worlds Quantum Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Dan">Li Dan</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Junsuo"> Zhao Junsuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Wenjun"> Zhang Wenjun </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20genetic%20algorithm" title="quantum genetic algorithm">quantum genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=many%20worlds" title=" many worlds"> many worlds</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20training%20operator" title=" quantum training operator"> quantum training operator</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization%20operator" title=" combinatorial optimization operator"> combinatorial optimization operator</a> </p> <a href="https://publications.waset.org/abstracts/16842/an-improved-many-worlds-quantum-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16842.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">745</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=86">86</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=87">87</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>