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

SPARQ: Efficient Entanglement Distribution and Routing in Space–Air–Ground Quantum Networks SPARQ：空地量子网络中的高效纠缠分发和路由选择

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

Mohamed Shaban;Muhammad Ismail;Walid Saad

{"title":"SPARQ: Efficient Entanglement Distribution and Routing in Space–Air–Ground Quantum Networks","authors":"Mohamed Shaban;Muhammad Ismail;Walid Saad","doi":"10.1109/TQE.2024.3464572","DOIUrl":"https://doi.org/10.1109/TQE.2024.3464572","url":null,"abstract":"In this article, a space–air–ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. The node mobility in SPARQ poses significant challenges to entanglement routing. Existing quantum routing algorithms focus on stationary ground nodes and utilize link distance as an optimality metric, which is unrealistic for dynamic systems, like SPARQ. Moreover, in contrast to the prior art that assumes homogeneous nodes, SPARQ encompasses heterogeneous nodes with different functionalities further complicates the entanglement distribution. To solve the entanglement routing problem, a deep reinforcement learning (RL) framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ to account for the network dynamics. Subsequently, an entanglement distribution policy, third-party entanglement distribution (TPED), is proposed to establish entanglement between communication parties. A realistic quantum network simulator is designed for performance evaluation. Simulation results show that the TPED policy improves entanglement fidelity by 3% and reduces memory consumption by 50% compared with benchmark. The results also show that the proposed DQN algorithm improves the number of resolved teleportation requests by 39% compared with shortest path baseline and the entanglement fidelity by 2% compared with an RL algorithm that is based on long short-term memory. It also improved entanglement fidelity by 6% and 9% compared with state-of-the-art benchmarks. Moreover, the entanglement fidelity is improved by 15% compared with DQN trained on a snapshot of SPARQ. Additionally, SPARQ enhances the average entanglement fidelity by 23.5% compared with existing networks spanning only space and ground layers.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-20"},"PeriodicalIF":0.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10684482","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142450981","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

Hierarchical Quantum Architecture Search for Variational Quantum Algorithms 变分量子算法的分层量子架构搜索

IEEE Transactions on Quantum Engineering Pub Date : 2024-09-04 DOI: 10.1109/TQE.2024.3454640

Tong Zhao;Bo Chen;Guanting Wu;Liang Zeng

{"title":"Hierarchical Quantum Architecture Search for Variational Quantum Algorithms","authors":"Tong Zhao;Bo Chen;Guanting Wu;Liang Zeng","doi":"10.1109/TQE.2024.3454640","DOIUrl":"https://doi.org/10.1109/TQE.2024.3454640","url":null,"abstract":"Designing efficient variational quantum algorithms (VQAs) is crucial for transforming the theoretical advantages of quantum algorithms into practical applications. In this context, quantum architecture search (QAS) has been introduced to automate the search and design of VQAs. However, current mainstream QAS algorithms typically perform both global and local searches simultaneously, which can result in high search space complexity and optimization challenges. In this paper, we propose a hierarchical quantum architecture search framework based on a two-stage search structure. In the first stage, global exploration of the overall quantum circuit structure is performed, while in the second stage, local optimization of quantum gate selection is carried out. We provide a numerical analysis of the theoretical advantages of the proposed framework in reducing the search space. To evaluate practical performance, we conduct experiments on quantum chemistry tasks with different algorithm combinations integrated into the framework. The results demonstrate the effectiveness of the hierarchical search structure in automating quantum circuit design.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518178","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 Speedup of the Dispersion and Codebook Design Problems 分散和码本设计问题的量子加速

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

Kein Yukiyoshi;Taku Mikuriya;Hyeon Seok Rou;Giuseppe Thadeu Freitas de Abreu;Naoki Ishikawa

{"title":"Quantum Speedup of the Dispersion and Codebook Design Problems","authors":"Kein Yukiyoshi;Taku Mikuriya;Hyeon Seok Rou;Giuseppe Thadeu Freitas de Abreu;Naoki Ishikawa","doi":"10.1109/TQE.2024.3450852","DOIUrl":"https://doi.org/10.1109/TQE.2024.3450852","url":null,"abstract":"In this article, we propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in coding theory and wireless communications applications involving optimal codebook design. In turn, GAS is a quantum exhaustive search algorithm that can be used to implement full-fledged maximum-likelihood optimal solutions. In conventional naive formulations, however, it is typical to rely on a binary vector spaces, resulting in search space sizes prohibitive even for GAS. To circumvent this challenge, we instead formulate the search of optimal dispersion problem over Dicke states, an equal superposition of binary vectors with equal Hamming weights, which significantly reduces the search space leading to a simplification of the quantum circuit via the elimination of penalty terms. In addition, we propose a method to replace distance coefficients with their ranks, contributing to the reduction of the number of qubits. Our analysis demonstrates that as a result of the proposed techniques, a reduction in query complexity compared to the conventional GAS using the Hadamard transform is achieved, enhancing the feasibility of the quantum-based solution of the dispersion problem.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654547","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324300","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

Improving Probabilistic Error Cancellation in the Presence of Nonstationary Noise 改进非稳态噪声下的概率误差消除

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

Samudra Dasgupta;Travis S. Humble

引用次数: 0

Quantum Circuit for Imputation of Missing Data 计算缺失数据的量子电路

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

Claudio Sanavio;Simone Tibaldi;Edoardo Tignone;Elisa Ercolessi

引用次数: 0

Simulation of Charge Stability Diagrams for Automated Tuning Solutions (SimCATS) 自动调整解决方案的电荷稳定性图模拟 (SimCATS)

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

Fabian Hader;Sarah Fleitmann;Jan Vogelbruch;Lotte Geck;Stefan van Waasen

引用次数: 0

Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms 利用量子-经典混合算法解决非本地组合优化问题

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

Jonathan Wurtz;Stefan H. Sack;Sheng-Tao Wang

{"title":"Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms","authors":"Jonathan Wurtz;Stefan H. Sack;Sheng-Tao Wang","doi":"10.1109/TQE.2024.3443660","DOIUrl":"https://doi.org/10.1109/TQE.2024.3443660","url":null,"abstract":"Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quantum circuits, adiabatic protocols, and quantum annealing. These solutions typically have several challenges: 1) there is little to no performance gain over classical methods; 2) not all constraints and objectives may be efficiently encoded in the quantum ansatz; and 3) the solution domain of the objective function may not be the same as the bit strings of measurement outcomes. This work presents “nonnative hybrid algorithms”: a framework to overcome these challenges by integrating quantum and classical resources with a hybrid approach. By designing nonnative quantum variational anosatzes that inherit some but not all problem structure, measurement outcomes from the quantum computer can act as a resource to be used by classical routines to indirectly compute optimal solutions, partially overcoming the challenges of contemporary quantum optimization approaches. These methods are demonstrated using a publicly available neutral-atom quantum computer on two simple problems of Max \u0000<inline-formula><tex-math>$k$</tex-math></inline-formula>\u0000-Cut and maximum independent set. We find improvements in solution quality when comparing the hybrid algorithm to its “no quantum” version, a demonstration of a “comparative advantage.”","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10636813","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447172","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

Multidisk Clutch Optimization Using Quantum Annealing 利用量子退火优化多磁盘离合器

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

John D. Malcolm;Alexander Roth;Mladjan Radic;Pablo Martín-Ramiro;Jon Oillarburu;Borja Aizpurua;Román Orús;Samuel Mugel

引用次数: 0

Fault-Tolerant One-Way Noiseless Amplification for Microwave Bosonic Quantum Information Processing 用于微波波色子量子信息处理的容错单向无噪声放大技术

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

Hany Khalifa;Riku Jäntti;Gheorghe Sorin Paraoanu

{"title":"Fault-Tolerant One-Way Noiseless Amplification for Microwave Bosonic Quantum Information Processing","authors":"Hany Khalifa;Riku Jäntti;Gheorghe Sorin Paraoanu","doi":"10.1109/TQE.2024.3440192","DOIUrl":"https://doi.org/10.1109/TQE.2024.3440192","url":null,"abstract":"Microwave quantum information networks require reliable transmission of single-photon propagating modes over lossy channels. In this article, we propose a microwave noiseless linear amplifier (NLA) suitable to circumvent the losses incurred by a flying photon undergoing an amplitude damping channel (ADC). The proposed model is constructed by engineering a simple 1-D four-node cluster state. Contrary to conventional NLAs based on quantum scissors (QS), single-photon amplification is realized without the need for photon number resolving detectors. Entanglement between nodes comprising the device's cluster is achieved by means of a controlled phase gate. Furthermore, photon measurements are implemented by quantum nondemolition detectors, which are currently available as a part of the circuit quantum electrodynamics toolbox. We analyze the performance of our device practically by considering detection inefficiency and dark count probability. We further examine the potential usage of our device in low-power quantum sensing applications and remote secret key generation (SKG). Specifically, we demonstrate the device's ability to prepare loss-free resources offline, and its capacity to overcome the repeaterless bound of SKG. We compare the performance of our device against a QS-NLA for the aforementioned applications, and highlight explicitly the operating conditions under which our device can outperform a QS-NLA. The proposed device is also suitable for applications in the optical domain.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10629178","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142143741","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

Noise Robustness of Quantum Relaxation for Combinatorial Optimization 组合优化量子松弛的噪声鲁棒性

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

Kentaro Tamura;Yohichi Suzuki;Rudy Raymond;Hiroshi C. Watanabe;Yuki Sato;Ruho Kondo;Michihiko Sugawara;Naoki Yamamoto

{"title":"Noise Robustness of Quantum Relaxation for Combinatorial Optimization","authors":"Kentaro Tamura;Yohichi Suzuki;Rudy Raymond;Hiroshi C. Watanabe;Yuki Sato;Ruho Kondo;Michihiko Sugawara;Naoki Yamamoto","doi":"10.1109/TQE.2024.3439135","DOIUrl":"https://doi.org/10.1109/TQE.2024.3439135","url":null,"abstract":"Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple variables per qubit using quantum random-access code (QRAC). Reducing the number of qubits will alleviate physical noise (typically, decoherence), and as a result, the quality of the binary solution of QRAO may be robust against noise, which is, however, unknown. In this article, we numerically demonstrate that the mean approximation ratio of the (3, 1)-QRAC Hamiltonian, i.e., the Hamiltonian utilizing the encoding of three bits into one qubit by QRAC, is less affected by noise compared with the conventional Ising Hamiltonian used in the quantum annealer and the quantum approximate optimization algorithm. Based on this observation, we discuss a plausible mechanism behind the robustness of QRAO under depolarizing noise. Finally, we assess the number of shots required to estimate the values of binary variables correctly under depolarizing noise and show that the (3, 1)-QRAC Hamiltonian requires less shots to achieve the same accuracy compared with the Ising Hamiltonian.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10623712","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142117786","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