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 gates</title> <meta name="description" content="Search results for: quantum gates"> <meta name="keywords" content="quantum gates"> <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 gates" 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 gates"> <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> 646</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: quantum gates</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">646</span> Autonomous Quantum Competitive Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20A.%20Zidan">Mohammed A. Zidan</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Sagheer"> Alaa Sagheer</a>, <a href="https://publications.waset.org/abstracts/search?q=Nasser%20Metwally"> Nasser Metwally</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Real-time learning is an important goal that most of artificial intelligence researches try to achieve it. There are a lot of problems and applications which require low cost learning such as learn a robot to be able to classify and recognize patterns in real time and real-time recall. In this contribution, we suggest a model of quantum competitive learning based on a series of quantum gates and additional operator. The proposed model enables to recognize any incomplete patterns, where we can increase the probability of recognizing the pattern at the expense of the undesired ones. Moreover, these undesired ones could be utilized as new patterns for the system. The proposed model is much better compared with classical approaches and more powerful than the current quantum competitive learning approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=competitive%20learning" title="competitive learning">competitive learning</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20gates" title=" quantum gates"> quantum gates</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20gates" title=" quantum gates"> quantum gates</a>, <a href="https://publications.waset.org/abstracts/search?q=winner-take-all" title=" winner-take-all"> winner-take-all</a> </p> <a href="https://publications.waset.org/abstracts/25398/autonomous-quantum-competitive-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25398.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">472</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">645</span> Design and Implementation of Testable Reversible Sequential Circuits Optimized Power</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Manikandan">B. Manikandan</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Vijayaprabhu"> A. Vijayaprabhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The conservative reversible gates are used to designed reversible sequential circuits. The sequential circuits are flip-flops and latches. The conservative logic gates are Feynman, Toffoli, and Fredkin. The design of two vectors testable sequential circuits based on conservative logic gates. All sequential circuit based on conservative logic gates can be tested for classical unidirectional stuck-at faults using only two test vectors. The two test vectors are all 1s, and all 0s. The designs of two vectors testable latches, master-slave flip-flops and double edge triggered (DET) flip-flops are presented. We also showed the application of the proposed approach toward 100% fault coverage for single missing/additional cell defect in the quantum- dot cellular automata (QCA) layout of the Fredkin gate. The conservative logic gates are in terms of complexity, speed, and area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DET" title="DET">DET</a>, <a href="https://publications.waset.org/abstracts/search?q=QCA" title=" QCA"> QCA</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20logic%20gates" title=" reversible logic gates"> reversible logic gates</a>, <a href="https://publications.waset.org/abstracts/search?q=POS" title=" POS"> POS</a>, <a href="https://publications.waset.org/abstracts/search?q=SOP" title=" SOP"> SOP</a>, <a href="https://publications.waset.org/abstracts/search?q=latches" title=" latches"> latches</a>, <a href="https://publications.waset.org/abstracts/search?q=flip%20flops" title=" flip flops"> flip flops</a> </p> <a href="https://publications.waset.org/abstracts/42418/design-and-implementation-of-testable-reversible-sequential-circuits-optimized-power" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42418.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">304</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">644</span> Design of Parity-Preserving Reversible Logic Signed Array Multipliers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mojtaba%20Valinataj">Mojtaba Valinataj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reversible logic as a new favorable design domain can be used for various fields especially creating quantum computers because of its speed and intangible power consumption. However, its susceptibility to a variety of environmental effects may lead to yield the incorrect results. In this paper, because of the importance of multiplication operation in various computing systems, some novel reversible logic array multipliers are proposed with error detection capability by incorporating the parity-preserving gates. The new designs are presented for two main parts of array multipliers, partial product generation and multi-operand addition, by exploiting the new arrangements of existing gates, which results in two signed parity-preserving array multipliers. The experimental results reveal that the best proposed 4×4 multiplier in this paper reaches 12%, 24%, and 26% enhancements in the number of constant inputs, number of required gates, and quantum cost, respectively, compared to previous design. Moreover, the best proposed design is generalized for <em>n</em>×<em>n</em> multipliers with general formulations to estimate the main reversible logic criteria as the functions of the multiplier size. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=array%20multipliers" title="array multipliers">array multipliers</a>, <a href="https://publications.waset.org/abstracts/search?q=Baugh-Wooley%20method" title=" Baugh-Wooley method"> Baugh-Wooley method</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20detection" title=" error detection"> error detection</a>, <a href="https://publications.waset.org/abstracts/search?q=parity-preserving%20gates" title=" parity-preserving gates"> parity-preserving gates</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20computers" title=" quantum computers"> quantum computers</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20logic" title=" reversible logic"> reversible logic</a> </p> <a href="https://publications.waset.org/abstracts/68835/design-of-parity-preserving-reversible-logic-signed-array-multipliers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68835.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">259</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">643</span> Low-Cost Reversible Logic Serial Multipliers with Error Detection Capability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mojtaba%20Valinataj">Mojtaba Valinataj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays reversible logic has received many attentions as one of the new fields for reducing the power consumption. On the other hand, the processing systems have weaknesses against different external effects. In this paper, some error detecting reversible logic serial multipliers are proposed by incorporating the parity-preserving gates. This way, the new designs are presented for signed parity-preserving serial multipliers based on the Booth's algorithm by exploiting the new arrangements of existing gates. The experimental results show that the proposed 4×4 multipliers in this paper reach up to 20%, 35%, and 41% enhancements in the number of constant inputs, quantum cost, and gate count, respectively, as the reversible logic criteria, compared to previous designs. Furthermore, all the proposed designs have been generalized for n×n multipliers with general formulations to estimate the main reversible logic criteria as the functions of the multiplier size. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Booth%E2%80%99s%20algorithm" title="Booth’s algorithm">Booth’s algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20detection" title=" error detection"> error detection</a>, <a href="https://publications.waset.org/abstracts/search?q=multiplication" title=" multiplication"> multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=parity-preserving%20gates" title=" parity-preserving gates"> parity-preserving gates</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20computers" title=" quantum computers"> quantum computers</a>, <a href="https://publications.waset.org/abstracts/search?q=reversible%20logic" title=" reversible logic"> reversible logic</a> </p> <a href="https://publications.waset.org/abstracts/68832/low-cost-reversible-logic-serial-multipliers-with-error-detection-capability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68832.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">228</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">642</span> Quantum Computing with Qudits on a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aleksey%20Fedorov">Aleksey Fedorov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Building a scalable platform for quantum computing remains one of the most challenging tasks in quantum science and technologies. However, the implementation of most important quantum operations with qubits (quantum analogues of classical bits), such as multiqubit Toffoli gate, requires either a polynomial number of operation or a linear number of operations with the use of ancilla qubits. Therefore, the reduction of the number of operations in the presence of scalability is a crucial goal in quantum information processing. One of the most elegant ideas in this direction is to use qudits (multilevel systems) instead of qubits and rely on additional levels of qudits instead of ancillas. Although some of the already obtained results demonstrate a reduction of the number of operation, they suffer from high complexity and/or of the absence of scalability. We show a strong reduction of the number of operations for the realization of the Toffoli gate by using qudits for a scalable multi-qudit processor. This is done on the basis of a general relation between the dimensionality of qudits and their topology of connections, that we derived. <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=qudits" title=" qudits"> qudits</a>, <a href="https://publications.waset.org/abstracts/search?q=Toffoli%20gates" title=" Toffoli gates"> Toffoli gates</a>, <a href="https://publications.waset.org/abstracts/search?q=gate%20decomposition" title=" gate decomposition"> gate decomposition</a> </p> <a href="https://publications.waset.org/abstracts/126171/quantum-computing-with-qudits-on-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126171.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">147</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">641</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">640</span> Robust Quantum Image Encryption Algorithm Leveraging 3D-BNM Chaotic Maps and Controlled Qubit-Level Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vivek%20Verma">Vivek Verma</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjeev%20Kumar"> Sanjeev Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a novel quantum image encryption algorithm, using a 3D chaotic map and controlled qubit-level scrambling operations. The newly proposed 3D-BNM chaotic map effectively reduces the degradation of chaotic dynamics resulting from the finite word length effect. It facilitates the generation of highly unpredictable random sequences and enhances chaotic performance. The system’s efficacy is additionally enhanced by the inclusion of a SHA-256 hash function. Initially, classical plain images are converted into their quantum equivalents using the Novel Enhanced Quantum Representation (NEQR) model. The Generalized Quantum Arnold Transformation (GQAT) is then applied to disrupt the coordinate information of the quantum image. Subsequently, to diffuse the pixel values of the scrambled image, XOR operations are performed using pseudorandom sequences generated by the 3D-BNM chaotic map. Furthermore, to enhance the randomness and reduce the correlation among the pixels in the resulting cipher image, a controlled qubit-level scrambling operation is employed. The encryption process utilizes fundamental quantum gates such as C-NOT and CCNOT. Both theoretical and numerical simulations validate the effectiveness of the proposed algorithm against various statistical and differential attacks. Moreover, the proposed encryption algorithm operates with low computational complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3D%20Chaotic%20map" title="3D Chaotic map">3D Chaotic map</a>, <a href="https://publications.waset.org/abstracts/search?q=SHA-256" title=" SHA-256"> SHA-256</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20image%20encryption" title=" quantum image encryption"> quantum image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Qubit%20level%20scrambling" title=" Qubit level scrambling"> Qubit level scrambling</a>, <a href="https://publications.waset.org/abstracts/search?q=NEQR" title=" NEQR"> NEQR</a> </p> <a href="https://publications.waset.org/abstracts/193776/robust-quantum-image-encryption-algorithm-leveraging-3d-bnm-chaotic-maps-and-controlled-qubit-level-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193776.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">10</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">639</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">638</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">637</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">636</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">635</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">634</span> Gaussian Operations with a Single Trapped Ion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bruna%20G.%20M.%20Ara%C3%BAjo">Bruna G. M. Araújo</a>, <a href="https://publications.waset.org/abstracts/search?q=Pedro%20M.%20M.%20Q.%20Cruz"> Pedro M. M. Q. Cruz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this letter, we review the literature of the major concepts that govern Gaussian quantum information. As we work with quantum information and computation with continuous variables, Gaussian states are needed to better describe these systems. Analyzing a single ion locked in a Paul trap we use the interaction picture to obtain a toolbox of Gaussian operations with the ion-laser interaction Hamiltionian. This is achieved exciting the ion through the combination of two lasers of distinct frequencies corresponding to different sidebands of the external degrees of freedom. First we study the case of a trap with 1 mode and then the case with 2 modes. In this way, we achieve different continuous variables gates just by changing the external degrees of freedom of the trap and combining the Hamiltonians of blue and red sidebands. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paul%20trap" title="Paul trap">Paul trap</a>, <a href="https://publications.waset.org/abstracts/search?q=ion-laser%20interaction" title=" ion-laser interaction"> ion-laser interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20operations" title=" Gaussian operations"> Gaussian operations</a> </p> <a href="https://publications.waset.org/abstracts/18445/gaussian-operations-with-a-single-trapped-ion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18445.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">686</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">633</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">632</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">631</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">630</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">629</span> Dynamic Fault Tree Analysis of Dynamic Positioning System through Monte Carlo Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20S.%20Cheliyan">A. S. Cheliyan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20K.%20Bhattacharyya"> S. K. Bhattacharyya </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dynamic Positioning System (DPS) is employed in marine vessels of the offshore oil and gas industry. It is a computer controlled system to automatically maintain a ship’s position and heading by using its own thrusters. Reliability assessment of the same can be analyzed through conventional fault tree. However, the complex behaviour like sequence failure, redundancy management and priority of failing of events cannot be analyzed by the conventional fault trees. The Dynamic Fault Tree (DFT) addresses these shortcomings of conventional Fault Tree by defining additional gates called dynamic gates. Monte Carlo based simulation approach has been adopted for the dynamic gates. This method of realistic modeling of DPS gives meaningful insight into the system reliability and the ability to improve the same. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20positioning%20system" title="dynamic positioning system">dynamic positioning system</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20fault%20tree" title=" dynamic fault tree"> dynamic fault tree</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo%20simulation" title=" Monte Carlo simulation"> Monte Carlo simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20assessment" title=" reliability assessment "> reliability assessment </a> </p> <a href="https://publications.waset.org/abstracts/58683/dynamic-fault-tree-analysis-of-dynamic-positioning-system-through-monte-carlo-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58683.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">774</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">628</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">627</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">626</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">625</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">624</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">623</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">622</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">621</span> A Low-Voltage Synchronous Command for JFET Rectifiers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Monginaud">P. Monginaud</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20C.%20Baudey"> J. C. Baudey </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The synchronous, low-voltage command for JFET Rectifiers has many applications: indeed, replacing the traditional diodes by these components allows enhanced performances in gain, linearity and phase shift. We introduce here a new bridge, including JFET associated with pull-down, bipolar command systems, and double-purpose logic gates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=synchronous" title="synchronous">synchronous</a>, <a href="https://publications.waset.org/abstracts/search?q=rectifier" title=" rectifier"> rectifier</a>, <a href="https://publications.waset.org/abstracts/search?q=MOSFET" title=" MOSFET"> MOSFET</a>, <a href="https://publications.waset.org/abstracts/search?q=JFET" title=" JFET"> JFET</a>, <a href="https://publications.waset.org/abstracts/search?q=bipolar%20command%20system" title=" bipolar command system"> bipolar command system</a>, <a href="https://publications.waset.org/abstracts/search?q=push-pull%20circuits" title=" push-pull circuits"> push-pull circuits</a>, <a href="https://publications.waset.org/abstracts/search?q=double-purpose%20logic%20gates" title=" double-purpose logic gates"> double-purpose logic gates</a> </p> <a href="https://publications.waset.org/abstracts/4289/a-low-voltage-synchronous-command-for-jfet-rectifiers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4289.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">365</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">620</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">619</span> Area Efficient Carry Select Adder Using XOR Gate Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahendrapal%20Singh%20Pachlaniya">Mahendrapal Singh Pachlaniya</a>, <a href="https://publications.waset.org/abstracts/search?q=Laxmi%20Kumre"> Laxmi Kumre</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The AOI (AND – OR- INVERTER) based design of XOR gate is proposed in this paper with less number of gates. This new XOR gate required four basic gates and basic gate include only AND, OR, Inverter (AOI). Conventional XOR gate required five basic gates. Ripple Carry Adder (RCA) used in parallel addition but propagation delay time is large. RCA replaced with Carry Select Adder (CSLA) to reduce propagation delay time. CSLA design with dual RCA considering carry = ‘0’ and carry = ‘1’, so it is not an area efficient adder. To make area efficient, modified CSLA is designed with single RCA considering carry = ‘0’ and another RCA considering carry = ‘1’ replaced with Binary to Excess 1 Converter (BEC). Now replacement of conventional XOR gate by new design of XOR gate in modified CSLA reduces much area compared to regular CSLA and modified CSLA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CSLA" title="CSLA">CSLA</a>, <a href="https://publications.waset.org/abstracts/search?q=BEC" title=" BEC"> BEC</a>, <a href="https://publications.waset.org/abstracts/search?q=XOR%20gate" title=" XOR gate"> XOR gate</a>, <a href="https://publications.waset.org/abstracts/search?q=area%20efficient" title=" area efficient"> area efficient</a> </p> <a href="https://publications.waset.org/abstracts/41782/area-efficient-carry-select-adder-using-xor-gate-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41782.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">361</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">618</span> Analysis on Yogyakarta Istimewa Citygates on Urban Area Arterial Roads</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nizar%20Caraka%20Trihanasia">Nizar Caraka Trihanasia</a>, <a href="https://publications.waset.org/abstracts/search?q=Suparwoko"> Suparwoko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to analyze the design model of city gates on arterial roads as Yogyakarta’s “Istimewa” (special) identity. City marketing has become a trend among cities in the past few years. It began to compete with each other in promoting their identity to the world. One of the easiest ways to recognize the identity is by knowing the image of the city which can be seen through architectural buildings or urban elements. The idea is to recognize how the image of the city can represent Yogyakarta’s identity, which is limited to the contribution of the city gates distinctiveness on Yogyakarta urban area. This study has concentrated on the aspect of city gates as built environment that provides a diversity, configuration and scale of development that promotes a sense of place and community. The visual analysis will be conducted to interpreted the existing Yogyakarta city gates (as built environment) focussing on some variables of 1) character and pattern, 2) circulation system establishment, and 3) open space utilisation. Literature review and site survey are also conducted to understand the relationship between the built environment and the sense of place in the community. This study suggests that visually the Yogyakarta city gate model has strong visual characters and pattern by using the concept of a sense of place of Yogyakarta community value. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=visual%20analysis" title="visual analysis">visual analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=model" title=" model"> model</a>, <a href="https://publications.waset.org/abstracts/search?q=Yogyakarta%20%E2%80%9CIstimewa%E2%80%9D" title=" Yogyakarta “Istimewa”"> Yogyakarta “Istimewa”</a>, <a href="https://publications.waset.org/abstracts/search?q=citygates" title=" citygates"> citygates</a> </p> <a href="https://publications.waset.org/abstracts/53761/analysis-on-yogyakarta-istimewa-citygates-on-urban-area-arterial-roads" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53761.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">258</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">617</span> Future of Nanotechnology in Digital MacDraw</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pejman%20Hosseinioun">Pejman Hosseinioun</a>, <a href="https://publications.waset.org/abstracts/search?q=Abolghasem%20Ghasempour"> Abolghasem Ghasempour</a>, <a href="https://publications.waset.org/abstracts/search?q=Elham%20Gholami"> Elham Gholami</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamed%20Sarbazi"> Hamed Sarbazi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Considering the development in global semiconductor technology, it is anticipated that gadgets such as diodes and resonant transistor tunnels (RTD/RTT), Single electron transistors (SET) and quantum cellular automata (QCA) will substitute CMOS (Complementary Metallic Oxide Semiconductor) gadgets in many applications. Unfortunately, these new technologies cannot disembark the common Boolean logic efficiently and are only appropriate for liminal logic. Therefor there is no doubt that with the development of these new gadgets it is necessary to find new MacDraw technologies which are compatible with them. Resonant transistor tunnels (RTD/RTT) and circuit MacDraw with enhanced computing abilities are candida for accumulating Nano criterion in the future. Quantum cellular automata (QCA) are also advent Nano technological gadgets for electrical circuits. Advantages of these gadgets such as higher speed, smaller dimensions, and lower consumption loss are of great consideration. QCA are basic gadgets in manufacturing gates, fuses and memories. Regarding the complex Nano criterion physical entity, circuit designers can focus on logical and constructional design to decrease complication in MacDraw. Moreover Single electron technology (SET) is another noteworthy gadget considered in Nano technology. This article is a survey in future of Nano technology in digital MacDraw. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nano%20technology" title="nano technology">nano technology</a>, <a href="https://publications.waset.org/abstracts/search?q=resonant%20transistor%20tunnels" title=" resonant transistor tunnels"> resonant transistor tunnels</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20cellular%20automata" title=" quantum cellular automata"> quantum cellular automata</a>, <a href="https://publications.waset.org/abstracts/search?q=semiconductor" title=" semiconductor"> semiconductor</a> </p> <a href="https://publications.waset.org/abstracts/37247/future-of-nanotechnology-in-digital-macdraw" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37247.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">265</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%20gates&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&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%20gates&page=21">21</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&page=22">22</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=quantum%20gates&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>