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

quantum information processing with bosonic qubits in circuit QED

quantum SCIENCE AND TECHNOLOGY 2021年第3期6卷

作者： Joshi, Atharv Noh, Kyungjoo Gao, Yvonne Y. Natl Univ Singapore Ctr Quantum Technol Singapore Singapore AWS Ctr Quantum Comp Pasadena CA 91125 USA

The unique features of quantum theory offer a powerful new paradigm for information processing. Translating these mathematical abstractions into useful algorithms and applications requires quantum systems with significant complexity and sufficiently low error rates. Such quantum systems must be made from robust hardware that can coherently store, process, and extract the encoded information, as well as possess effective quantum error correction (QEC) protocols to detect and correct errors. Circuit quantum electrodynamics (cQED) provides a promising hardware platform for implementing robust quantum devices. In particular, bosonic encodings in cQED that use multi-photon states of superconducting cavities to encode information have shown success in realizing hardware-efficient QEC. Here, we review recent developments in the theory and implementation of QEC with bosonic codes and report the progress made toward realizing fault-tolerant quantum information processing with cQED devices.

关键词： bosonic qubits quantum error correction circuit QED superconducting circuits fault-tolerant quantum computation quantum information science bosonic QEC codes

来源：评论

学校读者我要写书评

暂无评论

Evolution strategies: application in hybrid quantum-classical neural networks

引用

quantum information processing 2023年第3期22卷 1-17页

作者： Friedrich, Lucas Maziero, Jonas Univ Fed Santa Maria Ctr Nat & Exact Sci Phys Dept Roraima Ave 1000 BR-97105900 Santa Maria RS Brazil

With the rapid development of quantum computers, several applications are being proposed for them. quantum simulations, simulation of chemical reactions, solution of optimization problems and quantum neural networks (QNNs) are some examples. However, problems such as noise, limited number of qubits and circuit depth, and gradient vanishing must be resolved before we can use them to their full potential. In the field of quantum machine learning, several models have been proposed. In general, in order to train these different models, we use the gradient of a cost function with respect to the model parameters. In order to obtain this gradient, we must compute the derivative of this function with respect to the model parameters. One of the most used methods in the literature to perform this task is the parameter-shift rule method. This method consists of evaluating the cost function twice for each parameter of the QNN. A problem with this method is that the number of evaluations grows linearly with the number of parameters. In this work, we study an alternative method, called evolution strategies (ES), which are a family of black box optimization algorithms which iteratively update the parameters using a search gradient. An advantage of the ES method is that in using it, one can control the number of times the cost function will be evaluated. We apply the ES method to the binary classification task, showing that this method is a viable alternative for training QNNs. However, we observe that its performance will be strongly dependent on the hyperparameters used. Furthermore, we also observe that this method, alike the parameter shift rule method, suffers from the problem of gradient vanishing.

关键词： quantum neural networks Evolution strategies Binary classification Hybrid quantum-classical neural networks

来源：评论

学校读者我要写书评

暂无评论

A GNN-based predictor for quantum architecture search

引用

quantum information processing 2023年第2期22卷 1-15页

作者： He, Zhimin Zhang, Xuefen Chen, Chuangtao Huang, Zhiming Zhou, Yan Situ, Haozhen Foshan Univ Sch Elect & Informat Engn Foshan 528000 Peoples R China Foshan Univ Sch Mechatron Engn & Automat Foshan 528000 Peoples R China Macau Univ Sci & Technol Fac Innovat Engn Macau Peoples R China Wuyi Univ Sch Econ & Management Jiangmen 529020 Peoples R China South China Agr Univ Coll Math & Informat Guangzhou 510642 Peoples R China

The performance of the variational quantum algorithm (VQA) highly depends on the structure of the quantum circuit. quantum architecture search (QAS) algorithm aims to automatically search out high-performance quantum circuits for given VQA tasks. However, current QAS algorithms need to calculate the ground-truth performances of a large number of quantum circuits during the searching process, especially for large-scale quantum circuits, which is very time-consuming. In this paper, we propose a predictor based on a graph neural network (GNN), which can largely reduce the computational complexity of the performance evaluation and accelerate the QAS algorithm. We denote the quantum circuit with a directed acyclic graph (DAG), which can well represent the structural and topological information of the quantum circuit. A GNN-based encoder with an asynchronous message-passing scheme is used to encode discrete circuit structures into continuous feature representations, which mimics the computational routine of a quantum circuit on the quantum data. Simulations on the 6-qubit and 10-qubit variational quantum eigensolver (VQE) show that the proposed predictor can learn the latent relationship between circuit structures and their performances. It effectively filters out poorly performing circuits and samples the most promising quantum circuits for evaluation, which avoids a significant computational cost in the performance evaluation and largely improves the sample efficiency.

关键词： quantum architecture search Variational quantum algorithm Graph neural network

来源：评论

学校读者我要写书评

暂无评论

A novel fault-tolerant quantum divider and its simulation

引用

quantum information processing 2022年第5期21卷 1-15页

作者： Yuan, Suzhen Gao, Shengwei Wen, Chao Wang, Yuchan Qu, Hong Wang, Yan Chongqing Univ Posts & Telecommun Coll Opto Elect Engn Chongqing 400065 Peoples R China Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611730 Peoples R China

Efficient quantum circuits of algebraic operations are vital for quantum algorithms. In this paper, we propose a novel fault-tolerant quantum divider based on long division algorithm using Clifford+T gates. Firstly, two efficient quantum subtractors are designed which we call them equal-bit subtractor and unequal-bit subtractor. The advantage of these quantum subtractors is that the number of the constant inputs is 2, which will dramatically reduce the qubit cost. Then, based on the quantum comparator and the quantum subtractors, we propose a novel fault-tolerant quantum divider. Compared with existing work, the proposed quantum divider has better performances in quantum cost, T-depth, T-count, qubit cost, constant inputs and garbage outputs. Finally, we simulate these algorithms on IBM quantum Experience (IBM Q Experience) platform, and the probability histograms show that these algorithms are feasible and efficient.

关键词： quantum divider quantum subtractor Fault-tolerant quantum simulation

来源：评论

学校读者我要写书评

暂无评论

New results on quantum boomerang attacks

引用

quantum information processing 2023年第4期22卷 1-27页

作者： Zou, Hongkai Zou, Jian Luo, Yiyuan College of Computer and Data Science Fuzhou University Fuzhou China Key Lab of Information Security of Network Systems Fuzhou University Fuzhou China School of Information Sciences and Technology Huizhou University Huizhou China

At SAC 2021, Frixons et al. proposed quantum boomerang attacks that can effectively recover the keys of block ciphers in the quantum setting. Based on their work, we further consider how to quantize the generic boomerang attacks proposed by Biham et al. at FSE 2002, so as to obtain more generic quantum boomerang attacks. Similar to Frixons et al.’s work, we only consider quantum key recovery attacks in the single-key setting. With the help of some famous quantum algorithms, this paper presents two methods to convert the attacks of Biham et al. into some new quantum key recovery attacks. In order to proof our methods, we apply our new ideas to attack Serpent-256 and ARIA-196. To sum up, for Serpent-256, we give valid 9-round and 10-round quantum key recovery attacks respectively. The quantum time complexity of 9-round and 10-round of Serpent-256 is 2 115.43 and 2 126.6 respectively. Furthermore, we show a valid quantum key attack on 6-round ARIA-196 which has a time complexity of 2 89.8 with negligible memory. The time complexity of the above quantum attacks are better than the corresponding classical attacks and quantum generic key recovery attack via Grover’s algorithm. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

关键词： quantum theory

来源：评论

学校读者我要写书评

暂无评论

quantum Computing algorithms and Real-World Applications

Quantum Computing Algorithms and Real-World Applications

引用

作者： Huang, Li School of Education Shanghai Industrial and Commercial Polytechnic Shanghai201809 China

quantum computing is a cutting-edge field of research based on the principles of quantum mechanics, and if it uses qubits for computation, it will be very different from traditional binary-based computation. quantum computers, by contrast, are theoretically more accurate and efficient than conventional computers because they can process larger amounts of information simultaneously. Moreover, research in this field is not only a major breakthrough in computing technology, but also has the potential to revolutionize many fields of science and engineering. Not only that, quantum computing can also break current encryption algorithms and help develop new and more secure technologies in cryptography, help understand and design new materials in material science, and solve complex optimization problems in areas such as logistics, finance, and data analysis. The experimental analysis shows that the processing accuracy of the quantum computing algorithm system in the experimental test is 97.02%, and the computing speed is 96.23% within 10 s. Although quantum computers are still in the early stages of development, their potential and application prospects have attracted great attention from scientists and engineers around the world. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

quantum bounds for 2D-grid and Dyck language

引用

quantum information processing 2023年第5期22卷 1-29页

作者： Ambainis, Andris Balodis, Kaspars Iraids, Janis Khadiev, Kamil Klevicks, Vladislavs Prusis, Krisjanis Shen, Yixin Smotrovs, Juris Vihrovs, Jevgenijs Univ Latvia Fac Comp Ctr Quantum Comp Sci Riga Latvia Kazan Fed Univ Inst Computat Math & Informat Technol Kazan Russia Univ London Informat Secur Grp Royal Holloway Egham England

We study the quantum query complexity of two problems. First, we consider the problem of determining whether a sequence of parentheses is a properly balanced one (a Dyck word), with a depth of at most k. We call this the Dyck(k,n) problem. We prove a lower bound of Omega (c(k) root n), showing that the complexity of this problem increases exponentially in k. Here n is the length of the word. When k is a constant, this is interesting as a representative example of star-free languages for which a surprising O (root n) query quantum algorithm was recently constructed by Aaronson et al. (Electron Colloquium Comput Complex (ECCC) 26:61, 2018). Their proof does not give rise to a general algorithm. When k is not a constant, DYCKk,n is not context-free. We give an algorithm with O (root n(logn)(0.5)k) quantum queries for DYCKk,n for all k. This is better than the trivial upper bound n for k = o ((log(n)) | (log log n) ). Second, we consider connectivity problems on grid graphs in 2 dimensions, if some of the edges of the gridmay be missing. By embedding the "balanced parentheses" problem into the grid, we show a lower bound of ohm (n(1.5-epsilon)) for the directed 2D grid and Omega(n(2-epsilon)) for the undirected 2D grid. We present two algorithms for particular cases of the problem. The directed problem is interesting as a black-box model for a class of classical dynamic programming strategies including the one that is usually used for the well-known edit distance problem. We also show a generalization of this result to more than 2 dimensions

关键词： quantum query complexity quantum algorithms Dyck language Grid path

来源：评论

学校读者我要写书评

暂无评论

Research on the Application of Improved quantum Evolution Algorithm in Computer Network Routing Selection 2

Research on the Application of Improved Quantum Evolution Al...

引用

2nd IEEE Global Conference on Communications and information Technologies, GCCIT 2024

作者： Li, Lin Sichuan College of Culture and Arts Sichuan Mianyang China

ISBN: (数字)9798350388916

ISBN: (纸本)9798350388916

In order to meet the challenges of applied research in computer network routing, in view of the shortcomings of the existing D-P algorithms, this study proposes an innovative application research method based on improved quantum evolution algorithms. The new solution leverages the principles of QEA theory to accurately identify and locate key influencing factors, and accordingly to classify indicators wisely to reduce potential interference. At the same time, by using the unique mechanism of improving the quantum evolution algorithm, the design strategy of the application in the selection is cleverly constructed. The empirical results show that the proposed scheme shows a significant improvement compared with the traditional D-P algorithm in the key performance indicators such as the accuracy of the application research and the processing efficiency of key factors in routing selection, showing its obvious strong advantages. In computer networks, the applied research in routing plays a vital role, which can accurately predict and optimize the growth trend and output results of the applied research in computer network routing. However, in the face of complex simulation tasks, traditional D-P algorithms show some inherent shortcomings, especially when dealing with multi-level challenges, their performance is often unsatisfactory. To overcome this problem, this study introduces a new idea of applied research in the routing selection of improved quantum evolution algorithm optimization, and accurately controls the influencing parameters through the QEA theory, and uses this as the road map for index allocation, and then uses the improved quantum evolution algorithm to innovate and construct a system scheme. The test results clearly point out that in the context of the evaluation criteria, the new scheme has been significantly optimized in terms of accuracy and processing speed for a variety of challenges, showing stronger performance superiority. Therefore, in the applic

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Generalized quantum Data-Syndrome Codes and Belief Propagation Decoding for Phenomenological Noise

引用

IEEE TRANSACTIONS ON information THEORY 2025年第3期71卷 1824-1840页

作者： Kuo, Kao-Yueh Lai, Ching-Yi Univ Sheffield Sch Math & Phys Sci Sheffield S3 7RH England Natl Yang Ming Chiao Tung Univ Inst Commun Engn Hsinchu 30010 Taiwan

quantum stabilizer codes often struggle with syndrome errors due to measurement imperfections. Typically, multiple rounds of syndrome extraction are employed to ensure reliable error information. In this paper, we consider phenomenological decoding problems, where data qubit errors may occur between extractions, and each measurement can be faulty. We introduce generalized quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources. This results in a Tanner graph with mixed variable nodes, enabling the design of belief propagation (BP) decoding algorithms that effectively handle phenomenological errors. Importantly, our BP decoders are applicable to general sparse quantum codes. Through simulations, we achieve an error threshold of more than 3% for quantum memory protected by rotated toric codes, using solely BP without post-processing. Our results indicate that d rounds of syndrome extraction are sufficient for a toric code of distance d. We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates. Additionally, we propose a method to construct effective redundant stabilizer checks for single-shot error correction. Our simulations show that BP decoding remains highly effective even with a high syndrome error rate.

关键词： Codes Decoding Noise Qubit Integrated circuit modeling Error analysis Measurement uncertainty Error correction Data mining Belief propagation data-syndrome codes phenomenological noise quantum memory single-shot correction error threshold

来源：评论

学校读者我要写书评

暂无评论

Unitary coined discrete-time quantum walks on directed multigraphs

引用

quantum information processing 2023年第6期22卷 1-26页

作者： Wing-Bocanegra, Allan Venegas-Andraca, Salvador E. Tecnol Monterrey Escuela Ingn & Ciencias Ave Eugenio Garza Sada 2501 Monterrey 64849 Mexico

Unitary coined discrete-time quantum walks (UCDTQW) constitute a universal model of computation, meaning that any computation done by a general purpose quantum computer can either be done using the UCDTQW framework. In the last decades, great progress has been made in this field by developing quantum walk-based algorithms that can outperform classical ones. However, current quantum computers work based on the quantum circuit model of computation, and the general mapping from one model to the other is still an open problem. In this work, we provide a matrix analysis of the unitary evolution operator of UCDTQW, which is composed at a time of a shift and a coin operators. We conceive the shift operator of the system as the unitary matrix form of the adjacency matrix associated with the graph on which the UCDTQW takes place, and provide a set of equations to transform the latter into the former and vice versa. However, this mapping modifies the structure of the original graph into a directed multigraph, by splitting single edges and arcs of the original graph into multiple arcs. Thus, the fact that any unitary operator has a quantum circuit representation means that any adjacency matrix that complies with the transformation equations will be automatically associated with a quantum circuit, and any quantum circuit acting on a bipartite system will be always associated with a directed multigraph. Finally, we extend the definition of the coin operator to a superposition of coins in such a way that each coin acts on different vertices of the directed multigraph on which the UCDTQW takes place, and provide a description of how this can be implemented in circuit form.

关键词： quantum walks quantum circuits Kraus operators Multigraphs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：