IEEE Transactions on Quantum Engineering最新文献

筛选
英文 中文
2024 Index IEEE Transactions on Quantum Engineering Vol. 5
IEEE Transactions on Quantum Engineering Pub Date : 2025-01-28 DOI: 10.1109/TQE.2025.3535319
{"title":"2024 Index IEEE Transactions on Quantum Engineering Vol. 5","authors":"","doi":"10.1109/TQE.2025.3535319","DOIUrl":"https://doi.org/10.1109/TQE.2025.3535319","url":null,"abstract":"","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10856694","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106065","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
Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate
IEEE Transactions on Quantum Engineering Pub Date : 2025-01-17 DOI: 10.1109/TQE.2025.3530939
Ryutaroh Matsumoto
{"title":"Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate","authors":"Ryutaroh Matsumoto","doi":"10.1109/TQE.2025.3530939","DOIUrl":"https://doi.org/10.1109/TQE.2025.3530939","url":null,"abstract":"In some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the ramp quantum secret sharing schemes with the highest coding rate. This article proposes procedures to distribute some shares before a secret is given in those schemes. The new procedures enhance the applicability of the secret sharing schemes to wider scenarios as some participants can be unavailable when the dealer obtains the quantum secret. Then, it is proved that our new encoding procedures retain the correspondences between quantum secrets and quantum shares in the original schemes, which ensures that the highest coding rates of the original schemes are also retained.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10844313","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106173","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 Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement 超越超密集编码的量子双向协议:数据和纠缠的联合传输
IEEE Transactions on Quantum Engineering Pub Date : 2025-01-10 DOI: 10.1109/TQE.2025.3528238
Kristian S. Jensen;Lorenzo Valentini;René B. Christensen;Marco Chiani;Petar Popovski
{"title":"Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement","authors":"Kristian S. Jensen;Lorenzo Valentini;René B. Christensen;Marco Chiani;Petar Popovski","doi":"10.1109/TQE.2025.3528238","DOIUrl":"https://doi.org/10.1109/TQE.2025.3528238","url":null,"abstract":"In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyze this both in an ideal setting with no decoherence and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the NetSquid framework. We compare the simulation results with the theoretical values.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10836906","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184116","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
Benchmarking Quantum Circuit Transformation With QKNOB Circuits 利用 QKNOB 电路为量子电路转换建立基准
IEEE Transactions on Quantum Engineering Pub Date : 2025-01-08 DOI: 10.1109/TQE.2025.3527399
Sanjiang Li;Xiangzhen Zhou;Yuan Feng
{"title":"Benchmarking Quantum Circuit Transformation With QKNOB Circuits","authors":"Sanjiang Li;Xiangzhen Zhou;Yuan Feng","doi":"10.1109/TQE.2025.3527399","DOIUrl":"https://doi.org/10.1109/TQE.2025.3527399","url":null,"abstract":"Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit transformation (QCT) algorithms have been proposed. To enable faithful evaluation of state-of-the-art QCT algorithms, this article introduces qubit mapping benchmark with known near-optimality (QKNOB), a novel benchmark construction method for QCT. <monospace>QKNOB</monospace> circuits have built-in transformations with near-optimal (close to the theoretical optimum) <sc>swap</small> count and depth overhead. <monospace>QKNOB</monospace> provides general and unbiased evaluation of QCT algorithms. Using <monospace>QKNOB</monospace>, we demonstrate that <monospace>SABRE</monospace>, the default Qiskit compiler, consistently achieves the best performance on the 53-qubit IBM Q Rochester and Google Sycamore devices for both <sc>swap</small> count and depth objectives. Our results also reveal significant performance gaps relative to the near-optimal transformation costs of <monospace>QKNOB</monospace>. Our construction algorithm and benchmarks are open-source.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10833714","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184115","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
C3-VQA: Cryogenic Counter-Based Coprocessor for Variational Quantum Algorithms C3-VQA:变分量子算法的低温计数器协处理器
IEEE Transactions on Quantum Engineering Pub Date : 2024-12-23 DOI: 10.1109/TQE.2024.3521442
Yosuke Ueno;Satoshi Imamura;Yuna Tomida;Teruo Tanimoto;Masamitsu Tanaka;Yutaka Tabuchi;Koji Inoue;Hiroshi Nakamura
{"title":"C3-VQA: Cryogenic Counter-Based Coprocessor for Variational Quantum Algorithms","authors":"Yosuke Ueno;Satoshi Imamura;Yuna Tomida;Teruo Tanimoto;Masamitsu Tanaka;Yutaka Tabuchi;Koji Inoue;Hiroshi Nakamura","doi":"10.1109/TQE.2024.3521442","DOIUrl":"https://doi.org/10.1109/TQE.2024.3521442","url":null,"abstract":"Cryogenic quantum computers play a leading role in demonstrating quantum advantage. Given the severe constraints on the cooling capacity in cryogenic environments, thermal design is crucial for the scalability of these computers. The sources of heat dissipation include passive inflow via intertemperature wires and the power consumption of components located in the cryostat, such as wire amplifiers and quantum–classical interfaces. Thus, a critical challenge is to reduce the number of wires by reducing the required intertemperature bandwidth while maintaining minimal additional power consumption in the cryostat. One solution to address this challenge is near-data processing using ultralow-power computational logic within the cryostat. Based on the workload analysis and domain-specific system design focused on variational quantum algorithms (VQAs), we propose the cryogenic counter-based coprocessor for VQAs (C3-VQA) to enhance the design scalability of cryogenic quantum computers under the thermal constraint. The C3-VQA utilizes single-flux-quantum logic, which is an ultralow-power superconducting digital circuit that operates at the 4 K environment. The C3-VQA precomputes a part of the expectation value calculations for VQAs and buffers intermediate values using simple bit operation units and counters in the cryostat, thereby reducing the required intertemperature bandwidth with small additional power consumption. Consequently, the C3-VQA reduces the number of wires, leading to a reduction in the total heat dissipation in the cryostat. Our evaluation shows that the C3-VQA reduces the total heat dissipation at the 4 K stage by 30% and 81% under sequential-shot and parallel-shot execution scenarios, respectively. Furthermore, a case study in quantum chemistry shows that the C3-VQA reduces total heat dissipation by 87% with a 10 000-qubit system.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10812867","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142993763","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
RSFQ All-Digital Programmable Multitone Generator for Quantum Applications 用于量子应用的RSFQ全数字可编程多音发生器
IEEE Transactions on Quantum Engineering Pub Date : 2024-12-20 DOI: 10.1109/TQE.2024.3520805
João Barbosa;Jack C. Brennan;Alessandro Casaburi;M. D. Hutchings;Alex Kirichenko;Oleg Mukhanov;Martin Weides
{"title":"RSFQ All-Digital Programmable Multitone Generator for Quantum Applications","authors":"João Barbosa;Jack C. Brennan;Alessandro Casaburi;M. D. Hutchings;Alex Kirichenko;Oleg Mukhanov;Martin Weides","doi":"10.1109/TQE.2024.3520805","DOIUrl":"https://doi.org/10.1109/TQE.2024.3520805","url":null,"abstract":"One of the most important and topical challenges of quantum circuits is their scalability. Rapid single flux quantum (RSFQ) technology is at the forefront of replacing current standard CMOS-based control architectures for a number of applications, including quantum computing and quantum sensor arrays. By condensing the control and readout to single-flux-quantum-based on-chip devices that are directly connected to the quantum systems, it is possible to minimize the total system overhead, improving scalability and integration. In this article, we present a novel RSFQ device that generates multitone digital signals, based on complex pulse train sequences using a circular shift register (CSR) and a comb filter stage. We show that the frequency spectrum of the pulse trains is dependent on a preloaded pattern on the CSR, as well as on the delay line of the comb filter stage. By carefully selecting both the pattern and delay, the desired tones can be isolated and amplified as required. Finally, we propose architectures where this device can be implemented to control and read out arrays of quantum devices, such as qubits and single-photon detectors.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-11"},"PeriodicalIF":0.0,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10811769","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142975731","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
IEEE Transactions on Quantum Engineering Publication Information IEEE量子工程学报
IEEE Transactions on Quantum Engineering Pub Date : 2024-12-17 DOI: 10.1109/TQE.2023.3316596
{"title":"IEEE Transactions on Quantum Engineering Publication Information","authors":"","doi":"10.1109/TQE.2023.3316596","DOIUrl":"https://doi.org/10.1109/TQE.2023.3316596","url":null,"abstract":"","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10805482","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142844451","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
Novel Trade-offs in 5 nm FinFET SRAM Arrays at Extremely Low Temperatures 极低温下5nm FinFET SRAM阵列的新权衡
IEEE Transactions on Quantum Engineering Pub Date : 2024-12-05 DOI: 10.1109/TQE.2024.3512367
Shivendra Singh Parihar;Girish Pahwa;Baker Mohammad;Yogesh Singh Chauhan;Hussam Amrouch
{"title":"Novel Trade-offs in 5 nm FinFET SRAM Arrays at Extremely Low Temperatures","authors":"Shivendra Singh Parihar;Girish Pahwa;Baker Mohammad;Yogesh Singh Chauhan;Hussam Amrouch","doi":"10.1109/TQE.2024.3512367","DOIUrl":"https://doi.org/10.1109/TQE.2024.3512367","url":null,"abstract":"Complementary metal–oxide–semiconductor (CMOS)-based computing promises drastic improvement in performance at extremely low temperatures (e.g., 77 K, 10 K). The field of extremely low temperature CMOS-environment-based computing holds the promise of delivering remarkable enhancements in both performance and power consumption. Static random access memory (SRAM) plays a major role in determining the performance and efficiency of any processor due to its superior performance and density. This work aims to reveal how extremely low temperature operations profoundly impact the existing well-known tradeoffs in SRAM-based memory arrays. To accomplish this, first, we measure and model the 5 nm fin field-effect transistors characteristics over a wide temperature range from 300 K down to 10 K. Next, we develop a framework to perform simulations on the SRAM array by varying the number of rows and columns for examining the influence of leakage current (<inline-formula><tex-math>$I$</tex-math></inline-formula><sub>leak</sub>) and parasitic effects of bit line (BL) and word line (WL) on the size and performance of the SRAM array under extremely low temperatures. For a comprehensive analysis, we further investigated the maximum attainable array size, extending our study down to 10 K, utilizing three distinct cell types. With the help of SRAM array simulations, we reveal that the maximum array size at extremely low temperatures is limited by WL parasitics instead of <inline-formula><tex-math>$I$</tex-math></inline-formula><sub>leak</sub>, and the performance of the SRAM is governed by BL and WL parasitics. In addition, we elucidate the influence of transistor threshold voltage (<inline-formula><tex-math>$V$</tex-math></inline-formula><sub>TH</sub>) engineering on the optimization of the SRAM array at extremely low temperature environments.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10778409","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142975730","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
Dissipative Variational Quantum Algorithms for Gibbs State Preparation 吉布斯态制备的耗散变分量子算法
IEEE Transactions on Quantum Engineering Pub Date : 2024-12-04 DOI: 10.1109/TQE.2024.3511419
Yigal Ilin;Itai Arad
{"title":"Dissipative Variational Quantum Algorithms for Gibbs State Preparation","authors":"Yigal Ilin;Itai Arad","doi":"10.1109/TQE.2024.3511419","DOIUrl":"https://doi.org/10.1109/TQE.2024.3511419","url":null,"abstract":"In recent years, variational quantum algorithms have gained significant attention due to their adaptability and efficiency on near-term quantum hardware. They have shown potential in a variety of tasks, including linear algebra, search problems, Gibbs, and ground state preparation. Nevertheless, the presence of noise in current day quantum hardware severely limits their performance. In this work, we introduce dissipative variational quantum algorithms (D-VQAs) by incorporating dissipative operations, such as qubit RESET and stochastic gates, as an intrinsic part of a variational quantum circuit. We argue that such dissipative variational algorithms possess some natural resilience to dissipative noise. We demonstrate how such algorithms can prepare Gibbs states over a wide range of quantum many-body Hamiltonians and temperatures, while significantly reducing errors due to both coherent and noncoherent noise. An additional advantage of our approach is that no ancilla qubits are need. Our results highlight the potential of D-VQAs to enhance the robustness and accuracy of variational quantum computations on noisy intermediate-scale quantum (NISQ) devices.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10777530","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905740","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
TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning 流量感知最小成本量子通信网络规划
IEEE Transactions on Quantum Engineering Pub Date : 2024-11-28 DOI: 10.1109/TQE.2024.3509019
Ilora Maity;Junaid ur Rehman;Symeon Chatzinotas
{"title":"TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning","authors":"Ilora Maity;Junaid ur Rehman;Symeon Chatzinotas","doi":"10.1109/TQE.2024.3509019","DOIUrl":"https://doi.org/10.1109/TQE.2024.3509019","url":null,"abstract":"Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10771724","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859137","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信