IEEE Transactions on Quantum Engineering最新文献_第6页

Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems 约束组合优化问题的后处理变量调度量子算法

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-13 DOI: 10.1109/TQE.2024.3376721

Tatsuhiko Shirai;Nozomu Togawa

{"title":"Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems","authors":"Tatsuhiko Shirai;Nozomu Togawa","doi":"10.1109/TQE.2024.3376721","DOIUrl":"https://doi.org/10.1109/TQE.2024.3376721","url":null,"abstract":"In this article, we propose a postprocessing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-based quantum device. Variational methods are used to find an optimal schedule function that leads to high-quality solutions in a short amount of time. Postprocessing techniques convert the output solutions of the quantum devices to satisfy the constraints of the COPs. The pVSQA combines the variational methods and the postprocessing technique. We obtain a sufficient condition for constrained COPs to apply the pVSQA based on a greedy postprocessing algorithm. We apply the proposed method to two constrained NP-hard COPs: the graph partitioning problem and the quadratic knapsack problem. The pVSQA on a simulator shows that a small number of variational parameters is sufficient to achieve a (near-) optimal performance within a predetermined operation time. Then, building upon the simulator results, we implement the pVSQA on a quantum annealer and a gate-based quantum device. The experimental results demonstrate the effectiveness of our proposed method.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10472069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140546499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reliable Quantum Communications Based on Asymmetry in Distillation and Coding 基于蒸馏和编码不对称的可靠量子通信

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-10 DOI: 10.1109/TQE.2024.3399609

Lorenzo Valentini;René Bødker Christensen;Petar Popovski;Marco Chiani

{"title":"Reliable Quantum Communications Based on Asymmetry in Distillation and Coding","authors":"Lorenzo Valentini;René Bødker Christensen;Petar Popovski;Marco Chiani","doi":"10.1109/TQE.2024.3399609","DOIUrl":"https://doi.org/10.1109/TQE.2024.3399609","url":null,"abstract":"The reliable provision of entangled qubits is an essential precondition in a variety of schemes for distributed quantum computing. This is challenged by multiple nuisances, such as errors during the transmission over quantum links, but also due to degradation of the entanglement over time due to decoherence. The latter can be seen as a constraint on the latency of the quantum protocol, which brings the problem of quantum protocol design into the context of latency–reliability constraints. We address the problem through hybrid schemes that combine: indirect transmission based on teleportation and distillation, and direct transmission, based on quantum error correction (QEC). The intuition is that, at present, the quantum hardware offers low fidelity, which demands distillation; on the other hand, low latency can be obtained by QEC techniques. It is shown that, in the proposed framework, the distillation protocol gives rise to asymmetries that can be exploited by asymmetric quantum error correcting code, which sets the basis for unique hybrid distillation and coding design. Our results show that ad hoc asymmetric codes give, compared with conventional QEC, a performance boost and codeword size reduction both in a single-link and in a quantum network scenario.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10528897","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141181950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Testing and Debugging Quantum Circuits 测试和调试量子电路

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-08 DOI: 10.1109/TQE.2024.3374879

Sara Ayman Metwalli;Rodney Van Meter

{"title":"Testing and Debugging Quantum Circuits","authors":"Sara Ayman Metwalli;Rodney Van Meter","doi":"10.1109/TQE.2024.3374879","DOIUrl":"https://doi.org/10.1109/TQE.2024.3374879","url":null,"abstract":"This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For amplitude–permutation circuits, we propose techniques to correct amplitude–permutations mimicking classical operations. In phase-modulation circuits, our proposed strategy targets the precise calibration of phase alterations essential for quantum computations. The most complex amplitude–redistribution circuits demand advanced methods to adjust probability amplitudes. This research bridges a vital gap in current methodologies and lays the groundwork for future advancements in quantum circuit debugging. Our contributions are twofold: we present a comprehensive unit testing tool (Cirquo) and debugging approaches tailored to the unique demands of quantum computing, and we provide empirical evidence of its effectiveness in optimizing quantum circuit performance. This work is a crucial step toward realizing robust quantum computing systems and their applications in various domains.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10463159","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140550145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture 在云/边缘架构中分配资源的变分量子算法

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-08 DOI: 10.1109/TQE.2024.3398410

Carlo Mastroianni;Francesco Plastina;Jacopo Settino;Andrea Vinci

{"title":"Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture","authors":"Carlo Mastroianni;Francesco Plastina;Jacopo Settino;Andrea Vinci","doi":"10.1109/TQE.2024.3398410","DOIUrl":"https://doi.org/10.1109/TQE.2024.3398410","url":null,"abstract":"Modern cloud/edge architectures need to orchestrate multiple layers of heterogeneous computing nodes, including pervasive sensors/actuators, distributed edge/fog nodes, centralized data centers, and quantum devices. The optimal assignment and scheduling of computation on the different nodes is a very difficult problem, with NP-hard complexity. In this article, we explore the possibility of solving this problem with variational quantum algorithms, which can become a viable alternative to classical algorithms in the near future. In particular, we compare the performance, in terms of success probability, of two algorithms, i.e., quantum approximate optimization algorithm and variational quantum eigensolver (VQE). The simulation experiments, performed for a set of simple problems, show that the VQE algorithm ensures better performance when it is equipped with appropriate circuit \u0000<italic>ansatzes</i>\u0000 that are able to restrict the search space. Moreover, experiments executed on real quantum hardware show that the execution time, when increasing the size of the problem, grows much more slowly than the trend obtained with classical computation, which is known to be exponential.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522849","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum Fuzzy Inference Engine for Particle Accelerator Control 用于粒子加速器控制的量子模糊推理引擎

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-07 DOI: 10.1109/TQE.2024.3374251

Giovanni Acampora;Michele Grossi;Michael Schenk;Roberto Schiattarella

{"title":"Quantum Fuzzy Inference Engine for Particle Accelerator Control","authors":"Giovanni Acampora;Michele Grossi;Michael Schenk;Roberto Schiattarella","doi":"10.1109/TQE.2024.3374251","DOIUrl":"https://doi.org/10.1109/TQE.2024.3374251","url":null,"abstract":"Recently, quantum computing has been proven as an ideal theory for the design of fuzzy inference engines, thanks to its capability to efficiently solve the rule explosion problem. In this scenario, a quantum fuzzy inference engine (QFIE) was proposed as a quantum algorithm able to generate an exponential computational advantage over conventional fuzzy inference engines. However, there are no practical demonstrations that the QFIE can be used to efficiently manage complex systems. This article bridges this gap by using, for the very first time, the QFIE to control critical systems such as those related to particle accelerator facilities at the European Organization for Nuclear Research (CERN). As demonstrated by a series of experiments performed at the T4 target station of the CERN Super Proton Synchrotron fixed-target physics beamline and at the Advanced Proton Driven Plasma Wakefield Acceleration Experiment, the QFIE is able to efficiently control such an environment, paving the way for the use of fuzzy-enabled quantum computers in real-world applications.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10462538","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140633581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Application of Quantum Recurrent Neural Network in Low-Resource Language Text Classification 量子递归神经网络在低资源语言文本分类中的应用

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-06 DOI: 10.1109/TQE.2024.3373903

Wenbin Yu;Lei Yin;Chengjun Zhang;Yadang Chen;Alex X. Liu

{"title":"Application of Quantum Recurrent Neural Network in Low-Resource Language Text Classification","authors":"Wenbin Yu;Lei Yin;Chengjun Zhang;Yadang Chen;Alex X. Liu","doi":"10.1109/TQE.2024.3373903","DOIUrl":"https://doi.org/10.1109/TQE.2024.3373903","url":null,"abstract":"Text sentiment analysis is an important task in natural language processing and has always been a hot research topic. However, in low-resource regions such as South Asia, where languages like Bengali are widely used, the research interest is relatively low compared to high-resource regions due to limited computational resources, flexible word order, and high inflectional nature of the language. With the development of quantum technology, quantum machine learning models leverage the superposition property of qubits to enhance model expressiveness and achieve faster computation compared to classical systems. To promote the development of quantum machine learning in low-resource language domains, we propose a quantum–classical hybrid architecture. This architecture utilizes a pretrained multilingual bidirectional encoder representations from transformer (BERT) model to obtain vector representations of words and combines the proposed batch upload quantum recurrent neural network (BUQRNN) and parameter nonshared batch upload quantum recurrent neural network (PN-BUQRNN) as feature extraction models for sentiment analysis in Bengali. Our numerical results demonstrate that the proposed BUQRNN structure achieves a maximum accuracy improvement of 0.993% in Bengali text classification tasks while reducing average model complexity by 12%. The PN-BUQRNN structure surpasses the BUQRNN structure once again and outperforms classical architectures in certain tasks.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10461108","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140619647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Understanding Logical-Shift Error Propagation in Quanvolutional Neural Networks 理解广义卷积神经网络中的逻辑移位误差传播

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-05 DOI: 10.1109/TQE.2024.3372880

Marzio Vallero;Emanuele Dri;Edoardo Giusto;Bartolomeo Montrucchio;Paolo Rech

{"title":"Understanding Logical-Shift Error Propagation in Quanvolutional Neural Networks","authors":"Marzio Vallero;Emanuele Dri;Edoardo Giusto;Bartolomeo Montrucchio;Paolo Rech","doi":"10.1109/TQE.2024.3372880","DOIUrl":"https://doi.org/10.1109/TQE.2024.3372880","url":null,"abstract":"Quanvolutional neural networks (QNNs) have been successful in image classification, exploiting inherent quantum capabilities to improve performance of traditional convolution. Unfortunately, the qubit's reliability can be a significant issue for QNNs inference, since its logical state can be altered by both intrinsic noise and by the interaction with natural radiation. In this article, we aim at investigating the propagation of logical-shift errors (i.e., the unexpected modification of the qubit state) in QNNs. We propose a bottom–up evaluation reporting data from 13 322 547 200 logical-shift injections. We characterize the error propagation in the quantum circuit implementing a single convolution and then in various designs of the same QNN, varying the dataset and the network depth. We track the logical-shift error propagation through the qubits, channels, and subgrids, identifying the faults that are more likely to cause misclassifications. We found that up to 10% of the injections in the quanvolutional layer cause misclassification and even logical-shifts of small magnitude can be sufficient to disturb the network functionality. Our detailed analysis shows that corruptions in the qubits' state that alter their probability amplitude are more critical than the ones altering their phase, that some object classes are more likely than others to be corrupted, that the criticality of subgrids depends on the dataset, and that the control qubits, once corrupted, are more likely to modify the QNN output than the target qubits.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10458381","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140546351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Stable Hash Function Based on Parity-Dependent Quantum Walks With Memory (August 2023) 基于内存奇偶校验量子漫步的稳定哈希函数（2023 年 8 月）

IEEE Transactions on Quantum Engineering Pub Date : 2024-02-21 DOI: 10.1109/TQE.2024.3368073

Qing Zhou;Xueming Tang;Songfeng Lu;Hao Yang

引用次数: 0

A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity 基于量子态保真度的量子-经典协同训练架构

IEEE Transactions on Quantum Engineering Pub Date : 2024-02-19 DOI: 10.1109/TQE.2024.3367234

Ryan L'Abbate;Anthony D'Onofrio;Samuel Stein;Samuel Yen-Chi Chen;Ang Li;Pin-Yu Chen;Juntao Chen;Ying Mao

{"title":"A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity","authors":"Ryan L'Abbate;Anthony D'Onofrio;Samuel Stein;Samuel Yen-Chi Chen;Ang Li;Pin-Yu Chen;Juntao Chen;Ying Mao","doi":"10.1109/TQE.2024.3367234","DOIUrl":"https://doi.org/10.1109/TQE.2024.3367234","url":null,"abstract":"Recent advancements have highlighted the limitations of current quantum systems, particularly the restricted number of qubits available on near-term quantum devices. This constraint greatly inhibits the range of applications that can leverage quantum computers. Moreover, as the available qubits increase, the computational complexity grows exponentially, posing additional challenges. Consequently, there is an urgent need to use qubits efficiently and mitigate both present limitations and future complexities. To address this, existing quantum applications attempt to integrate classical and quantum systems in a hybrid framework. In this article, we concentrate on quantum deep learning and introduce a collaborative classical-quantum architecture called co-TenQu. The classical component employs a tensor network for compression and feature extraction, enabling higher dimensional data to be encoded onto logical quantum circuits with limited qubits. On the quantum side, we propose a quantum-state-fidelity-based evaluation function to iteratively train the network through a feedback loop between the two sides. co-TenQu has been implemented and evaluated with both simulators and the IBM-Q platform. Compared to state-of-the-art approaches, co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. In addition, it outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10439653","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140328892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the Bipartite Entanglement Capacity of Quantum Networks 论量子网络的双向纠缠能力

IEEE Transactions on Quantum Engineering Pub Date : 2024-02-16 DOI: 10.1109/TQE.2024.3366696

Gayane Vardoyan;Emily van Milligen;Saikat Guha;Stephanie Wehner;Don Towsley

{"title":"On the Bipartite Entanglement Capacity of Quantum Networks","authors":"Gayane Vardoyan;Emily van Milligen;Saikat Guha;Stephanie Wehner;Don Towsley","doi":"10.1109/TQE.2024.3366696","DOIUrl":"https://doi.org/10.1109/TQE.2024.3366696","url":null,"abstract":"We consider the problem of multipath entanglement distribution to a pair of nodes in a quantum network consisting of devices with nondeterministic entanglement swapping capabilities. Multipath entanglement distribution enables a network to establish end-to-end entangled links across any number of available paths with preestablished link-level entanglement. Probabilistic entanglement swapping, on the other hand, limits the amount of entanglement that is shared between the nodes; this is especially the case when, due to practical constraints, swaps must be performed in temporal proximity to each other. Limiting our focus to the case where only bipartite entanglement is generated across the network, we cast the problem as an instance of generalized flow maximization between two quantum end nodes wishing to communicate. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem for networks with arbitrary topology. We then compute the overall network capacity, defined as the maximum number of Einstein–Podolsky–Rosen (EPR) states distributed to users per time unit, by solving the flow problem for all possible network states generated by probabilistic entangled link presence and absence, and subsequently by averaging over all network state capacities. The MIQCP can also be applied to networks with multiplexed links. While our approach for computing the overall network capacity has the undesirable property that the total number of states grows exponentially with link multiplexing capability, it nevertheless yields an exact solution that serves as an upper bound comparison basis for the throughput performance of more easily implementable yet nonoptimal entanglement routing algorithms.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10438882","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140309965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0