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

作者： Garreis, Rebekka Swiss Federal Institute of Technology Zurich

学位级别：博士

quantum computers promise a revolution in information processing and communi- cation. They can be used to better solve optimization problems in fields as diverse as defense, financial trading, and medicine. Conventional classical computers store information in bits, which can be in one of two states '0' or '1'. Similarly, a quantum computer will operate on quantum bits, known as qubits. A qubit can consist of any superposition of its two states ('0' and '1'), and entanglement between several qubits can be used to implement quantum algorithms. quantum states are eas- ily destroyed by interaction with their environment, and so they must be isolated from their surroundings, but the preparation and measurement of quantum states require such interactions. Today, there are many mature qubit systems, such as semiconductor qubits, superconducting qubits, or trapped ions. In a semiconductor spin qubit the '0' and '1' are encoded by preparing two different spin states. These qubits have the advantage that their operation and fabrication of gate electrodes are similar to conventional transistors. However, the life time of the spin states, which determines the viability of the qubit, is limited by interactions with nuclear spin in the embedding material as well as magnetic moments due to nearby impurities. Spin qubits in graphene suffer comparatively little from these problems. 99 % of the carbon atoms have zero net nuclear spin, yielding weak spin-orbit and hyperfine interactions. Due to its crystal structure, graphene exhibits, in addition to spin degeneracy, a valley degeneracy, which offers a new platform of rich physics and the possibility of valley qubits. The past five years have seen the first electrostatically defined quantum point contacts and quantum dots in graphene-based nanostructures, resulting in the investigation of the excited state spectrum. We have also seen the first demonstrations of Pauli spin and valley blockade, the in situ tuning from an electron-like

关键词：

来源：评论

学校读者我要写书评

暂无评论

quantum Artificial Hummingbird Algorithm for Feature Selection of Social IoT

引用

IEEE ACCESS 2023年 11卷 66257-66278页

作者： Abd Elaziz, Mohamed Dahou, Abdelghani Al-Betar, Mohammed Azmi El-Sappagh, Shaker Oliva, Diego Aseeri, Ahmad O. Zagazig Univ Fac Sci Dept Math Zagazig 44519 Egypt Galala Univ Fac Comp Sci & Engn Suez Egypt Ajman Univ Coll Engn & Informat Technol Artificial Intelligence Res Ctr AIRC Ajman U Arab Emirates Lebanese Amer Univ Dept Elect & Comp Engn Byblos 135053 Lebanon Middle East Univ MEU Res Unit Amman 11831 Jordan Univ Ahmed Draia Math & Comp Sci Dept Adrar 01000 Algeria Al Balqa Appl Univ Al Huson Univ Coll Dept Informat Technol Irbid 19117 Jordan Benha Univ Fac Comp & Artificial Intelligence Informat Syst Dept Banha 13518 Egypt Univ Guadalajara Dept Innovac Basada Informac & Conocimiento CUCEI Guadalajara 44430 Mexico Prince Sattam Bin Abdulaziz Univ Coll Comp Engn & Sci Dept Comp Sci Al Kharj 11942 Saudi Arabia

The Internet of Things (IoT) benefits from social networking platforms in establishing and enhancing social-oriented services, information, and autonomous social relationships. Social IoT (SIoT) systems can boost the user experience in the real world in several applications, including healthcare, transportation, and entertainment. However, the collected data from various interconnected SIoT systems is massive, demanding robust and efficient processing algorithms, feature extraction, selection, and inference. This work presents an enhanced Artificial Hummingbird algorithm (AHA) for feature selection (FS). The enhanced version of AHA is performed using the advantages of quantum-based optimization. The main aim of using quantum is to improve the population's exploration ability while discovering feasible regions. Extensive experiments utilizing eighteen UCI datasets were conducted to validate the developed FS method, QAHA. The QAHA is compared with other FS methods, and the experimental established its efficiency. Moreover, a set of four datasets from SIoT are used to evaluate the applicability of QAHA to the real-world setting. The results using these datasets indicate the high performance of QAHA to increase the accuracy by decreasing the number of features. In the case of UCI datasets, the average accuracy of the developed QAHA is 93% among the eighteen datasets. Whereas, In the case of the SIoT datasets, the developed QAHA has an accuracy of nearly 90.7%, 98.7%, 92.2%, and 84.6% for the Trajectory, GAS sensors, Hepatitis, and MovementAAL datasets, respectively.

关键词： Artificial hummingbird algorithm feature selection swarm optimization quantum-based optimization social Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based quantum Computation

引用

Physical Review Letters 2024年第5期133卷 050601-050601页

作者： Yuki Takeuchi NTT Communication Science Laboratories <a href="https://***/00berct97">NTT Corporation</a> 3-1 Morinosato Wakamiya Atsugi Kanagawa 243-0198 Japan and NTT Research Center for Theoretical Quantum Information <a href="https://***/00berct97">NTT Corporation</a> 3-1 Morinosato Wakamiya Atsugi Kanagawa 243-0198 Japan.

There are two types of universality in measurement-based quantum computation (MBQC): strict and computational. It is well known that the former is stronger than the latter. We present a method of transforming from a certain type of computationally universal MBQC to a strictly universal one. Our method simply replaces a single qubit in a resource state with a Pauli-Y eigenstate. We applied our method to show that hypergraph states can be made strictly universal with only Pauli measurements, while only computationally universal hypergraph states were known.

关键词： quantum algorithms & computation quantum computation quantum computing models quantum information architectures & platforms quantum information processing

来源：评论

学校读者我要写书评

暂无评论

Perfect state transfer by means of discrete-time quantum walk on the complete bipartite graph

引用

PHYSICA SCRIPTA 2024年第1期99卷 015110-015110页

作者： Huang, Jiani Li, Dan Li, Panlong Zhou, Yuqian Yang, Yuguang Nanjing Univ Aeronaut & Astronaut Dept Comp Sci & Technol Nanjing Peoples R China Beijing Univ Technol Dept Comp Sci & Technol Beijing Peoples R China

Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.

关键词： quantum walk perfect state transfer complete bipartite graph

来源：评论

学校读者我要写书评

暂无评论

quantum circuit generation for amplitude encoding using a transformer decoder

引用

Physical Review Applied 2024年第4期22卷 L041001页

作者： Shunsuke Daimon Yu-ichiro Matsushita Quantum Materials and Applications Research Center Laboratory for Materials and Structures Institute of Innovative Research Quemix Inc. Taiyo Life Nihombashi Building 2-11-2 Nihombashi Chuo-ku Tokyo 103-0027 Japan Department of Physics

quantum data encoding is a crucial step in harnessing the power of noisy intermediate-scale quantum computers. To efficiently encode classical data into a quantum state, it is essential to find shallow quantum circuits that are resilient to noise and errors. Here we propose a transformer-decoder model that generates optimal quantum circuits for data encoding. We found that our model requires only a small amount of training data to successfully encode classical information into a quantum state, even for previously unseen inputs. This indicates its understanding of the global structure of quantum circuits in the training data. Notably, our trained model can find shallower quantum circuits than those provided during training, suggesting its potential to uncover efficient circuit structures that have not been explored before. This work paves the way for the development of robust and scalable quantum algorithms.

关键词： Machine learning Natural language processing quantum circuits quantum information processing quantum software quantum state transfer

来源：评论

学校读者我要写书评

暂无评论

High-dimensional graphs convolution for quantum walks photonic applications

引用

quantum information processing 2024年第5期23卷 175-175页

作者： Abramov, Roman Fedichkin, Leonid Tsarev, Dmitry Alodjants, Alexander Tech Univ Munich Arcisstr 21 D-80333 Munich Germany Russian Acad Sci Valiev Inst Phys & Technol Moscow 117218 Russia ITMO Univ Inst Adv Data Transfer Kronverksky Pr 49bldg St Petersburg 197101 Russia South Ural State Univ Inst Nat & Exact Sci Quantum Light Engn Lab Lenin Ave 76 Chelyabinsk 454080 Russia

quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics. Our method is based on the fact that some graphs represent a result of Kronecker's product of line graphs. We support our methods by means of various numerical experiments that check quantum and classical random walks on hypercycles and their convolutions. Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.

关键词： quantum walks quantum algorithms Hypercycles Hypercubes Photonic waveguide arrays

来源：评论

学校读者我要写书评

暂无评论

ArtA: automating Design Space Exploration of spin-qubit architectures

引用

quantum information processing 2025年第6期24卷 1-36页

作者： Paraskevopoulos, Nikiforos Hamel, David Sarkar, Aritra Almudever, C. G. Feld, Sebastian Quantum and Computer Engineering Department Delft University of Technology Delft The Netherlands QuTech Delft University of Technology Delft The Netherlands Computer Engineering Department Universitat Politècnica de València Valencia Spain

In the fast-paced field of quantum computing, identifying the architectural characteristics that will enable quantum processors to achieve high performance across a diverse range of quantum algorithms continues to pose a significant challenge. Given the extensive and costly nature of experimentally testing different designs, this paper introduces the first Design Space Exploration (DSE) for quantum-dot spin-qubit architectures. Utilizing the upgraded SpinQ compilation framework, this study explores a substantial design space comprising 29,312 spin-qubit-based architectures and applies an innovative optimization tool, ArtA (Artificial Architect), to speed up the design space traversal. ArtA can leverage 17 optimization configurations, significantly reducing exploration times by up to 99.1% compared to a traditional brute force approach while maintaining the same result quality. After a comprehensive evaluation of best-matching optimization configurations per quantum circuit, ArtA suggests specific as well as universal architectural features that provide optimal performance across the examined circuits. Our work demonstrates that combining DSE methodologies with optimization algorithms can be effectively used to generate meaningful design insights for quantum processor development.

关键词： Design Space Exploration quantum dots Spin-qubit architectures Optimization algorithms Compilation quantum processing unit design

来源：评论

学校读者我要写书评

暂无评论

quantum walk on simplicial complexes for simplicial community detection

引用

quantum information processing 2024年第6期23卷 199-199页

作者： Song, Euijun TopolyTech Namyangju Si Gyeonggi South Korea

quantum walks have emerged as a transformative paradigm in quantum information processing and can be applied to various graph problems. This study explores discrete-time quantum walks on simplicial complexes, a higher-order generalization of graph structures. Simplicial complexes, encoding higher-order interactions through simplices, offer a richer topological representation of complex systems. Since the conventional classical random walk cannot directly detect community structures, we present a quantum walk algorithm to detect higher-order community structures called simplicial communities. We utilize the Fourier coin to produce entangled translation states among adjacent simplices in a simplicial complex. The potential of our quantum algorithm is tested on Zachary's karate club network. This study may contribute to understanding complex systems at the intersection of algebraic topology and quantum walk algorithms.

关键词： quantum walk Algebraic topology Simplicial complex Networks Clustering

来源：评论

学校读者我要写书评

暂无评论

Cancer Gene Selection Algorithm Based on Neighborhood Rough Sets Combined with quantum Genetic Techniques 2

Cancer Gene Selection Algorithm Based on Neighborhood Rough ...

引用

2024 International Conference on Medical Artificial Intelligence

作者： Zhang Jiangtao Zhang Xiaoxia Lei Wenjing Wang Guoyin Chongqing Univ Posts & Telecommun Chongqing Peoples R China Lanzhou Univ Sch Management Lanzhou Gansu Peoples R China Chongqing Univ Posts & Telecommun Coll Comp & Informat Sci Chongqing Normal Univ Chongqing Peoples R China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620;9798350377613

Rough Set Theory (RST) is a commonly used and effective data processing tool. To extend the range of data that RST and its related theories can handle, researchers have proposed many innovative approaches based on the Pawlak model. This paper presents an efficient phased method that incorporates a quantum genetic algorithm to address the problem of attribute reduction in high-dimensional data analysis and accelerate the computation process. The research method is mainly divided into three stages: first, feature importance assessment is used to classify the feature set into three categories: deterministic, chaotic, and redundant, with redundant features being eliminated;second, the quantum genetic algorithm is applied to optimize the chaotic feature set, ensuring effective partitioning while retaining dataset information;third, the core set undergoes fine-tuning to adjust the distribution of specific attributes, making it closely align with the decision distribution, thereby achieving rapid attribute reduction. To further discuss the ability of this reduction algorithm to eliminate redundant attributes, comparative experiments were conducted using four different algorithms, and speed validation was performed using five cancer gene datasets with over 10,000 dimensions. The experimental results show that this method not only effectively reduces computational complexity but also overcomes the limitations of rough set theory, significantly enhancing the ability to handle large datasets, and demonstrates its potential and application prospects in high-dimensional data analysis.

关键词： attribute reduction quantum genetic high-dimensional data rough set theory

来源：评论

学校读者我要写书评

暂无评论

quantum vs classical genetic algorithms: A numerical comparison shows faster convergence

Quantum vs classical genetic algorithms: A numerical compari...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Ibarrondo, Ruben Gatti, Giancarlo Sanz, Mikel Univ Basque Country UPV EHU Dept Phys Chem Leioa 48940 Spain Univ Basque Country UPV EHU EHU Quantum Ctr Leioa 48940 Spain Ikerbasque Basque Fdn Sci Bilbao 48009 Spain BCAM Alameda Mazarredo 14 Bilbao 48009 Spain

ISBN: (纸本)9781665487689

Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution. quantum computation is a new computational paradigm which exploits quantum resources to speed up information processing tasks. Therefore, it is sensible to explore the potential enhancement in the performance of genetic algorithms by introducing quantum degrees of freedom. Along this line, a modular quantum genetic algorithm has recently been proposed, with individuals encoded in independent registers comprising exchangeable quantum subroutines [1], which leads to different variants. Here, we address the numerical benchmarking of these algorithms against classical genetic algorithms, a comparison missing from previous literature. To overcome the severe limitations of simulating quantum algorithms, our approach focuses on measuring the effect of quantum resources on the performance. In order to isolate the effect of the quantum resources on the performance, we selected the classical variants to resemble the fundamental characteristics of the quantum genetic algorithms. Under these conditions, we encode an optimization problem in a two-qubit Hamiltonian and face the problem of finding its ground state. A numerical analysis based on a sample of 200 random cases shows that some quantum variants outperform all classical ones in convergence speed towards a near-optimal result. Additionally, we have considered a diagonal Hamiltonian and the Hamiltonian of the hydrogen molecule to complete the analysis with two relevant use-cases. If this advantage holds for larger systems, quantum genetic algorithms would provide a new tool to address optimization problems with quantum computers.

关键词： quantum computing genetic algorithms optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：