IEEE Transactions on Quantum Engineering最新文献

{"title":"Variational Quantum Eigensolver: A Comparative Analysis of Classical and Quantum Optimizer Methods","authors":"Duc-Truyen Le;Vu-Linh Nguyen;Ha C. Nguyen;Hung Q. Nguyen;Van-Duy Nguyen","doi":"10.1109/TQE.2026.3708537","DOIUrl":"https://doi.org/10.1109/TQE.2026.3708537","url":null,"abstract":"In this study, we investigated the variational quantum eigensolver application for the Ising model as a testbed model, in which we thoroughly delved into several optimizers, both classical and quantum, and analyzed the extent to which each of these methods would offer a benefit. We then investigated a new combinatorial optimization scheme, termed quantum natural-simultaneous perturbation stochastic approximation (QN-SPSA)+parameter-shift rule (PSR), in which the Fubini-study metric is approximated within the quantum natural gradient framework, with its inner gradient estimated by the simultaneous perturbation stochastic approximation (SPSA), while the outer gradient of the cost function is evaluated exactly by the PSR. The QN-SPSA+PSR method integrates the QN-SPSA computational efficiency with the precise gradient computation of the PSR, improving the stability of QN-SPSA-based and convergence speed per parameter update while maintaining low computational consumption. Our results provide a potential performance improvement in the Variational Quantum Algorithms’ optimization subroutine, even in quantum machine learning’s optimization section, and enhance viable paths toward efficient quantum simulations on noisy intermediate-scale quantum computing (NISQ) devices. In addition, we also conducted a detailed study of quantum circuit ansatz structures in order to find the one that would work the best with the Ising model and NISQ, in which we utilized the properties of the investigated model.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"3104115-3104115"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11592680","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148747114","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}

{"title":"A Novel n+/i-Well Dot Ge1−xSnx-on-Si Single-Photon Avalanche Photodiode for High-Fill-Factor Room-Temperature Quantum Applications","authors":"Harshvardhan Kumar;Advaita Sinha;P. Susthitha Menon;Jyoti Tater","doi":"10.1109/TQE.2026.3696722","DOIUrl":"https://doi.org/10.1109/TQE.2026.3696722","url":null,"abstract":"We propose a novel design of <inline-formula><tex-math>${{mathrm{Ge}}_{1 - x}}{{mathrm{Sn}}_x}$</tex-math></inline-formula>-on-Si single-photon avalanche photodiodes (SPADs) that aim to enhance the fill factor (FF) and minimize noise at room temperature. The device consists of a <inline-formula><tex-math>${{n}^ + }/i$</tex-math></inline-formula>-well dot structure designed to eliminate the need for guard rings and multidot or array configurations typically used to enhance the active area. This study considers three distinct concentrations of Sn (4%, 6%, and 8%) in the GeSn active layer and investigates their effect on performance metrics. The impact of the threading dislocation density in defective GeSn on the dark count rate (DCR) is also examined. The results show that a high Sn concentration has a notable impact on dark current. However, the DCR, single-photon detection efficiency (SPDE), and noise-equivalent power exhibit less sensitivity to variations in Sn concentration. All devices exhibit exceptionally low dark currents (<75>95%), yielding a significant SPDE (>82.2%). Furthermore, the minimal DCR value (<0.0095>−0.5</sup>) and high detectivity at <italic>λ</i> = 1.55 <italic>μ</i>m and <inline-formula><tex-math>${{V}_{text{EX}}}$</tex-math></inline-formula> = 5 V. The GeSn-on-Si SPADs here address the challenges faced by current Ge-on-Si, SiGe, InGaAs/AlGaAsSb, and InGaAs/InP SPADs regarding low operating temperatures, showcasing their promise for quantum photonics and communication applications at room temperature (<italic>T</i> = 300 K).","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"4101311-4101311"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11535163","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442540","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}

{"title":"ZAP: Zoned Architecture and Performant Compiler for Field-Programmable Atom Array","authors":"Chen Huang;Xi Zhao;Hongze Xu;Wei-feng Zhuang;Meng-Jun Hu;Dong E. Liu;Jingbo Wang","doi":"10.1109/TQE.2026.3696707","DOIUrl":"https://doi.org/10.1109/TQE.2026.3696707","url":null,"abstract":"The scalability of neutral-atom quantum computing is increasingly limited by a compiler–architecture challenge: logical circuits must be mapped onto dynamically reconfigurable atom arrays while controlling crosstalk, transport overhead, and hardware constraints. To address this problem, we present Zoned Architecture and Performant (ZAP), a co-designed zoned architecture and deterministic compiler for field-programmable atom arrays. ZAP partitions the array into storage and entanglement zones and combines hardware-aware as-soon-as-possible (ASAP)-separate scheduling, look-ahead placement, and conflict-aware routing in a single-pass compilation flow, thereby avoiding the repeated global search used in prior approaches. Evaluated on structured quantum benchmarks and random three-regular circuits, ZAP consistently delivers multiorder-of-magnitude compilation speedups while maintaining competitive or superior execution quality. Relative to ZAC and PowerMove, ZAP typically reduces compilation time from tens of seconds to below 0.1 s and achieves speedups exceeding 1000×; relative to Enola, the speedup exceeds 10 000× on the evaluated suite. ZAP's fidelity gains are most pronounced on structured workloads with irregular connectivity and nonuniform qubit reuse, where its scheduling and placement decisions more effectively suppress crosstalk and limit transport-related loss, while on random circuits it remains competitive and preserves the same scalability advantage. These results show that hardware-structured, noniterative compilation provides a practical path toward fast, scalable, and noise-aware neutral-atom quantum computing.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"3103619-3103619"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11535023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442713","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}

{"title":"Multilevel Gate Set Optimization of Quantum Circuits for Partial Differential Equations","authors":"Tamiya Onodera;Yuki Sato;Toshinari Itoko;Naoki Yamamoto","doi":"10.1109/TQE.2026.3706630","DOIUrl":"https://doi.org/10.1109/TQE.2026.3706630","url":null,"abstract":"Solving partial differential equations (PDEs), which is pervasive in science and engineering, is emerging as a promising application area for quantum computing because it can be reduced to Hamiltonian simulation. Unlike quantum chemistry, Pauli-term expansion is not useful for a PDE Hamiltonian, since it ends up with an exponential number of Pauli terms. Recently, it has been shown that, by diagonalizing tensor products of ladder operators, such a Hamiltonian can be mapped into a scalable circuit with a polynomial number of multicontrolled gates. When optimized by an industry-grade circuit compiler, the resulting circuit is realized with a quadratic number of <sc>cx</small> gates with respect to the number of qubits. To further optimize PDE circuits, we propose multilevel gate set optimization (MGSO), an approach for identifying effective decomposition methods for high-level gates. In MGSO, we define multiple levels of gate sets, from higher to lower. At each level, we optimize the circuit and then lower it using decomposition methods carefully selected based on circuit structure to maximize optimization opportunities at subsequent levels. Applying MGSO to optimize the PDE circuits, we achieved a quadratic reduction in the number of <sc>cx</small> gates with a linear increase in the number of qubits.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-17"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11575109","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148626342","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}

{"title":"Detection Error Probability Analysis Over Atmospheric Quantum Channels With Pointing Errors: A Physically Admissible Bounded Transmissivity Framework","authors":"Yazan H. Al-Badarneh;Osamah S. Badarneh;Mustafa K. Alshawaqfeh;Mazen O. Hasna;Tamer M. Khattab;Sami Muhaidat;Omar Alhussein;Khalid A. Qaraqe","doi":"10.1109/TQE.2026.3707428","DOIUrl":"https://doi.org/10.1109/TQE.2026.3707428","url":null,"abstract":"We develop an exact error probability framework for quantum free space optics (FSO) communication over atmospheric channels with turbulence and pointing errors under a physically admissible bounded transmissivity model. The proposed framework is grounded in the fundamental physical observation that, in a quantum optical channel, the random channel quantity is the transmissivity itself, namely, the fraction of transmitted photons collected at the receiver, and must therefore take values only in the physically admissible interval [0,1]. This constraint is generally violated when classical turbulence models are interpreted directly as transmissivity models in quantum settings. Accordingly, we model the turbulence-induced transmissivity as a Beta distributed random variable over (0,1), which has recently been shown to provide accurate fitting under different turbulence conditions while preserving physical admissibility. We then integrate deterministic atmospheric loss and pointing errors into a unified equivalent transmissivity model and derive exact expressions for its probability density function and moment generating function. Building upon this statistical characterization, we derive novel exact average error probability expressions for binary modulation under both quantum and classical receivers. Finally, we verify the analysis using Monte Carlo simulations, quantify the impact of turbulence and pointing errors, and demonstrate the performance advantage of quantum optimal detection in photon-limited quantum FSO channels.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-12"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11578279","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148626621","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}

{"title":"Quantum Repeater Chains via Cavity–Magnon for Scalable Quantum Networks","authors":"Mughees Ahmed Khan;Syed Shahmir;Muhammad Talha Rahim;Saif Al-Kuwari;Tasawar Abbas","doi":"10.1109/TQE.2026.3702762","DOIUrl":"https://doi.org/10.1109/TQE.2026.3702762","url":null,"abstract":"Scalable quantum networks require quantum repeaters to overcome major challenges, such as photon loss and decoherence, in long-distance quantum communication. In this article, we present a cavity–magnon quantum repeater architecture that exploits the frequency tunability and hybrid integration capabilities of magnonic platforms to enable efficient entanglement swapping across multihop networks. The coherence budget is explicitly incorporated via the dissipation and dephasing terms in our noise model, which sets the effective entanglement-storage window available for multihop swapping. Through comprehensive numerical simulations with realistic experimental parameters, we analyze system performance across diverse deployment scenarios and network scales, examining both short-range and long-distance implementations. We identify critical factors influencing performance and scalability, demonstrating that cavity–magnon systems represent a viable and promising quantum repeater platform with significant integration advantages over existing quantum memory technologies.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"4101412-4101412"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11558534","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480476","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}

{"title":"Quantum-Assisted Optimization and Security for Trustworthy AI-Driven Healthcare","authors":"Hafiz Muhammad Waseem;Gregory Epiphaniou;Carsten Maple","doi":"10.1109/TQE.2026.3677420","DOIUrl":"https://doi.org/10.1109/TQE.2026.3677420","url":null,"abstract":"Digital health increasingly relies on artificial intelligence for clinical decision-making, patient management, and distributed learning, yet two persistent challenges remain: the computational complexity of optimization tasks, such as operating-room scheduling and genomic feature selection, and the need for robust security in federated and Internet-of-Medical-Things (IoMT) systems that are vulnerable to poisoning and spoofing attacks. Existing approaches often address these issues separately and struggle with scalability, interpretability, and resilience to advanced adversaries. This article introduces a Hybrid Quantum-Classical Architecture (HQCA) that integrates the Quantum Approximate Optimization Algorithm (QAOA) for constrained healthcare decision-making with Quantum Digital Signatures (QDS) for secure authentication. The layered framework combines classical preprocessing with NISQ-era quantum modules and is validated under calibrated IBM Eagle-class noise models. We evaluate four representative tasks, including operating-room scheduling, genomic feature selection, federated-learning integrity, and IoMT firmware authentication, using short-depth QAOA <inline-formula><tex-math>$( {p leq 3} )$</tex-math></inline-formula> and SWAP-test-based QDS verification. HQCA reduces operating-room makespan by approximately 7.5% and halves overtime compared to classical baselines, while maintaining over 99.5% scheduling feasibility. In genomic analysis, it improves classification performance while selecting 32% less features. For security, it reduces successful poisoning in federated learning from 20.7% to 3.8%, and no spoofing events were observed in 30 trials for IoMT telemetry, with practical verification latency. These findings indicate that a unified hybrid stack can improve decision quality while providing information-theoretic authenticity guarantees with operationally feasible verification latency, demonstrating a practical pathway toward secure and efficient digital health as quantum hardware matures.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-25"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11455974","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480691","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}

{"title":"Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits","authors":"Shu Kanno;Ikko Hamamura;Rudy Raymond;Qi Gao;Naoki Yamamoto","doi":"10.1109/TQE.2026.3671723","DOIUrl":"https://doi.org/10.1109/TQE.2026.3671723","url":null,"abstract":"Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement and feedback processes. The main idea is to generate the probability distribution defining a target randomized algorithm on a quantum computer, instead of a classical computer, which enables us to implement a variety of static circuits on a single dynamic circuit with many measurements. We applied the proposed method to the task of random Pauli measurement for one qubit on an IBM superconducting device, showing that a 14 000-fold acceleration of executing time was observed compared with a conventional method using static circuits. In addition, for the problem of estimating expectation values of 28- and 40-qubit hydrogen chain models, we successfully applied the proposed method to realize the classical shadow with 10 million random circuits, which is the largest demonstration of classical shadow. This work significantly simplifies the execution of randomized algorithms on real quantum hardware.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-13"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11425010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148481512","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}

{"title":"Satellite Microwave Detection via Cavity-Coupled Rydberg Atomic Receiver","authors":"Mingwei Lei;Meng Shi","doi":"10.1109/TQE.2026.3690617","DOIUrl":"https://doi.org/10.1109/TQE.2026.3690617","url":null,"abstract":"Due to the small interaction region between Rydberg atoms and the microwave (MW) field, it is difficult to detect weak satellite signals using free-space-coupled atomic receivers. In this work, we introduce a cavity-coupled Rydberg atomic receiver to enhance the MW field and combine it with a passive antenna to detect C-band satellite signals. Using MW-atom enhanced coupling, the minimum detectable power of incident MW is reduced to −128 dBm, and the corresponding sensitivity sensing by atoms is estimated as 21 nV/cm/Hz^1/2 at a frequency of 3.80 GHz. Furthermore, we also show the effectiveness of this scheme by capturing the beacon signal from a geostationary satellite, without the need for low-noise amplifiers often used in conventional detection. Besides, modulated satellite signals are received with a signal-to-noise ratio of 8 dB with a measurement bandwidth of 10 Hz. Our results demonstrate an advancement in facilitating satellite communications using cavity-coupled Rydberg-atom receivers.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-6"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11508155","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148171750","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}

{"title":"Robust Quantum Walk Search on Complete Multipartite Graph With Multiple Marked Vertices","authors":"Ningxiang Chen;Meng Li;Xiaoming Sun","doi":"10.1109/TQE.2026.3679863","DOIUrl":"https://doi.org/10.1109/TQE.2026.3679863","url":null,"abstract":"Quantum walks are a potent technique for building quantum algorithms. This article examines the quantum walk search algorithm on complete multipartite graphs with multiple marked vertices, which has not been explored before. We employ the coined quantum walk model and achieve quadratic speedup with a constant probability of finding a marked vertex in two specific cases of complete multipartite graphs. Furthermore, we investigate the robust quantum walk of two cases and demonstrate that even with an unknown number of marked vertices, it is still possible to achieve a quadratic speedup compared to classical algorithms and the success probability oscillates within a small range close to 1. To establish this conclusion, we employ approximation and reduction methods to conduct theoretical analysis and proofs, and provide an intuitive demonstration through numerical simulations. This work addresses the overcooking problem in quantum walk search algorithms on some complete multipartite graphs and may offer insights for robust quantum search on broader graph structures. Finally, we design a circuit for the algorithm that future researchers can use to conduct experiments.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-14"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11466472","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148479308","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}