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

Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search 混合Grover：改进Grover算法用于非结构化数据库搜索的混合版本

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-28 DOI: 10.1109/TQE.2025.3555562

Romain Piron;Muhammad Idham Habibie;Claire Goursaud

引用次数: 0

Memory-Optimized Cubic Splines for High-Fidelity Quantum Operations 高保真量子运算的内存优化三次样条

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-28 DOI: 10.1109/TQE.2025.3574463

Jan Ole Ernst;Jan Snoeijs;Mitchell Peaks;Jochen Wolf

{"title":"Memory-Optimized Cubic Splines for High-Fidelity Quantum Operations","authors":"Jan Ole Ernst;Jan Snoeijs;Mitchell Peaks;Jochen Wolf","doi":"10.1109/TQE.2025.3574463","DOIUrl":"https://doi.org/10.1109/TQE.2025.3574463","url":null,"abstract":"Radio frequency pulses are preponderant for the control of quantum bits and the execution of operations in quantum computers. The ability to fine-tune key pulse parameters, such as time-dependent amplitude, phase, and frequency, is essential to achieve maximal gate fidelity and mitigate errors. As systems increase in scale, a larger proportion of the control electronic processing will move closer to the qubits, to enhance integration and minimize latency in operations requiring fast feedback. This will constrain the space available in the memory of the control electronics to load time-resolved pulse parameters at high sampling rates. Cubic spline interpolation is a powerful and commonly used technique that divides the pulse into segments of cubic polynomials. We show an optimized implementation of this strategy, using a two-stage curve-fitting process and additional symmetry operations to load a high-sampling pulse output on an field-programmable gate array. This results in a favorable accuracy-versus-memory-footprint tradeoff. By simulating single-qubit population transfer and atom transport on a neutral-atom device, we show that high fidelities can be achieved with low memory requirements. This is instrumental for scaling up the number of qubits and gate operations in environments where memory is a limited resource.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11016810","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144597798","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

Two-Dimensional Beam Selection by Multiarmed Bandit Algorithm Based on a Quantum Walk 基于量子行走的多臂Bandit算法的二维光束选择

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-26 DOI: 10.1109/TQE.2025.3555145

Maki Arai;Tomoki Yamagami;Takatomo Mihana;Ryoichi Horisaki;Mikio Hasegawa

引用次数: 0

Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits 减少量子纠错开销的通用旗共享综合征提取电路

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-23 DOI: 10.1109/TQE.2025.3572764

Pei-Hao Liou;Ching-Yi Lai

{"title":"Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits","authors":"Pei-Hao Liou;Ching-Yi Lai","doi":"10.1109/TQE.2025.3572764","DOIUrl":"https://doi.org/10.1109/TQE.2025.3572764","url":null,"abstract":"Given that quantum error correction processes are unreliable, an efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements while maintaining low circuit depth, to minimize the circuit area, roughly defined as the product of circuit depth and the number of physical qubits. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes. Versatile parallelization techniques are employed to minimize the required circuit area, thereby improving the error threshold and overall performance. Specifically, measurement outcomes across multiple rounds of syndrome extraction are integrated into a lookup table decoder, enabling parallelization of multiple stabilizer measurements with shared flag qubits. In addition, we introduce an adaptive technique to reduce the overhead from excessive syndrome extraction. We present flag-sharing and fully parallel schemes for the <inline-formula><tex-math>$[![17,1,5]!]$</tex-math></inline-formula>, <inline-formula><tex-math>$[![19,1,5]!]$</tex-math></inline-formula> Calderbank–Shor–Steane (CSS) codes and the <inline-formula><tex-math>$[![5,1,3]!]$</tex-math></inline-formula> non-CSS code, where the <inline-formula><tex-math>$[![5,1,3]!]$</tex-math></inline-formula> implementation achieves the minimum known circuit area. Numerical simulations have demonstrated improved pseudothresholds for these codes by up to an order of magnitude compared to previous schemes in the literature.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-24"},"PeriodicalIF":0.0,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011921","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144366999","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

Q-Gen: A Parameterized Quantum Circuit Generator Q-Gen：一种参数化量子电路发生器

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-20 DOI: 10.1109/TQE.2025.3572142

Yikai Mao;Shaswot Shresthamali;Masaaki Kondo

{"title":"Q-Gen: A Parameterized Quantum Circuit Generator","authors":"Yikai Mao;Shaswot Shresthamali;Masaaki Kondo","doi":"10.1109/TQE.2025.3572142","DOIUrl":"https://doi.org/10.1109/TQE.2025.3572142","url":null,"abstract":"Unlike most classical algorithms that take an input and give the solution directly as an output, quantum algorithms produce a quantum circuit that works as an indirect solution to computationally hard problems. In the full quantum computing workflow, most data processing remains in the classical domain except for running the quantum circuit in the quantum processor. This leaves massive opportunities for classical automation and optimization toward future utilization of quantum computing. We kick-start the first step in this direction by introducing Q-gen, a high-level parameterized quantum circuit generator incorporating 15 realistic quantum algorithms. Each customized generation function comes with algorithm-specific parameters beyond the number of qubits, providing a large generation volume with high circuit variability. To demonstrate the functionality of Q-gen, we organize the algorithms into five hierarchical systems and generate a quantum circuit dataset accompanied by their measurement histograms and state vectors. This dataset enables researchers to statistically analyze the structure, complexity, and performance of large-scale quantum circuits or quickly train novel machine learning models without worrying about the exponentially growing simulation time. Q-gen is an open-source and multipurpose project that serves as the entrance for users with a classical computer science background to dive into the world of quantum computing.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11008486","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144314762","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

Analysis of Parameterized Quantum Circuits: On the Connection Between Expressibility and Types of Quantum Gates 参数化量子电路的分析：论量子门的可表达性与类型的关系

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-19 DOI: 10.1109/TQE.2025.3571484

Yu Liu;Kazuya Kaneko;Kentaro Baba;Jumpei Koyama;Koichi Kimura;Naoyuki Takeda

{"title":"Analysis of Parameterized Quantum Circuits: On the Connection Between Expressibility and Types of Quantum Gates","authors":"Yu Liu;Kazuya Kaneko;Kentaro Baba;Jumpei Koyama;Koichi Kimura;Naoyuki Takeda","doi":"10.1109/TQE.2025.3571484","DOIUrl":"https://doi.org/10.1109/TQE.2025.3571484","url":null,"abstract":"Expressibility is a crucial factor of a parameterized quantum circuit (PQC). In the context of variational-quantum-algorithm-based quantum machine learning (QML), a QML model composed of a highly expressible PQC and a sufficient number of qubits is theoretically capable of approximating any arbitrary continuous function. While much research has explored the relationship between expressibility and learning performance, as well as the number of layers in PQCs, the connection between expressibility and PQC structure has received comparatively less attention. In this article, we analyze the connection between expressibility and the types of quantum gates within PQCs using a gradient boosting tree model and Shapley additive explanations values. Our analysis is performed on 1615 instances of PQC derived from 19 PQC topologies, each with 2–18 qubits and 1–5 layers. The findings of our analysis provide guidance for designing highly expressible PQCs, suggesting the integration of more X-rotation or Y-rotation gates while maintaining a careful balance with the number of <sc>cnot</small> gates . Furthermore, our evaluation offers an additional evidence of expressibility saturation, as observed by previous studies.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11006966","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308467","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

Emulation of Density Matrix Dynamics With Classical Analog Circuits 密度矩阵动力学的经典模拟电路仿真

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-19 DOI: 10.1109/TQE.2025.3552736

Anthony J. Cressman;Rahul Sarpeshkar

{"title":"Emulation of Density Matrix Dynamics With Classical Analog Circuits","authors":"Anthony J. Cressman;Rahul Sarpeshkar","doi":"10.1109/TQE.2025.3552736","DOIUrl":"https://doi.org/10.1109/TQE.2025.3552736","url":null,"abstract":"Analog circuits have emerged as a valuable quantum emulation and simulation platform. Specifically, they have been experimentally shown to excel in emulating coherent state vector dynamics and motifs of quantum circuits, such as the quantum Fourier transform, tensor product superpositions, two-level systems such as Josephson junctions, and nuclear magnetic resonance state dynamics, all on a very large scale integration chip at room temperature (Cressman et al., 2022; Sarpeshkar, 2019a, 2019b, 2019c; Sarpeshkar, 2020). However, the ability to model simple state vectors is insufficient for modeling open quantum systems, i.e., systems with environmental noise. Noisy quantum systems are essential in practical implementations and applications that exploit noise. The density matrix formalism enables us to model such states, including finite reservoir state systems, and all states that can be represented as state vectors. To our knowledge, no one has yet demonstrated the mapping of a density matrix system to classical analog circuit components. We review the procedure for emulating the dynamics of a finite state vector with four essential analog circuit components and extend this procedure to emulate density matrix dynamics. We then simulate these systems as analog circuits in the presence of noise. This protocol opens up exciting possibilities for further research and development in noisy quantum emulation and simulation using analog circuits for arbitrarily large or small systems.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10933553","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143839958","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

Optimized Distribution of Entanglement Graph States in Quantum Networks 量子网络中纠缠图态的优化分布

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-17 DOI: 10.1109/TQE.2025.3552006

Xiaojie Fan;Caitao Zhan;Himanshu Gupta;C. R. Ramakrishnan

{"title":"Optimized Distribution of Entanglement Graph States in Quantum Networks","authors":"Xiaojie Fan;Caitao Zhan;Himanshu Gupta;C. R. Ramakrishnan","doi":"10.1109/TQE.2025.3552006","DOIUrl":"https://doi.org/10.1109/TQE.2025.3552006","url":null,"abstract":"Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10930585","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848868","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

Three-Party Controlled Authentication Semiquantum Key Agreement Protocol for Online Joint Consultation 面向在线联合咨询的三方受控认证半量子密钥协议

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-12 DOI: 10.1109/TQE.2025.3568865

XiYuan Liang;YeFeng He;YiChi Zhang;JiaQiang Fan

{"title":"Three-Party Controlled Authentication Semiquantum Key Agreement Protocol for Online Joint Consultation","authors":"XiYuan Liang;YeFeng He;YiChi Zhang;JiaQiang Fan","doi":"10.1109/TQE.2025.3568865","DOIUrl":"https://doi.org/10.1109/TQE.2025.3568865","url":null,"abstract":"In Wise Information Technology of Medicine, to ensure both confidentiality and integrity of the data created during online joint consultations, and to solve the problem that ordinary users cannot afford expensive quantum devices and are vulnerable to man-in-the-middle attacks during communication, this article proposes a three-party controlled authentication semiquantum key agreement protocol, leveraging the measurement retransmission operation and the entanglement properties of cluster states. With the help of a trusted controller with full quantum capabilities, the identities of three semiquantum parties are authenticated, and a shared key is negotiated fairly for subsequent communication. Since the semiquantum participants only need to perform simple quantum state preparation, measurement, and reflection operations, the protocol reduces the requirements for participants’ capabilities and equipment. Moreover, the protocol prevents man-in-the-middle attacks by authenticating the identity of participants. The security evaluation demonstrates that the protocol is capable of effectively defending against both internal participant threats and external intrusions. Moreover, a comparison with existing semiquantum key agreement protocols reveals that this protocol offers certain advantages when its functionality and performance are comprehensively evaluated.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10999152","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144196682","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 Wavelength-Division Multiplexing and Multiple-Access Communication Systems and Networks: Advanced Applications 量子波分复用和多址通信系统和网络：高级应用

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-12 DOI: 10.1109/TQE.2025.3569338

Marzieh Bathaee;Mohammad Rezai;Jawad A. Salehi

{"title":"Quantum Wavelength-Division Multiplexing and Multiple-Access Communication Systems and Networks: Advanced Applications","authors":"Marzieh Bathaee;Mohammad Rezai;Jawad A. Salehi","doi":"10.1109/TQE.2025.3569338","DOIUrl":"https://doi.org/10.1109/TQE.2025.3569338","url":null,"abstract":"A cost-effective global quantum Internet may be developed using the existing communication infrastructure. This article examines the quantum version of three conventional wavelength-division-multiplexing and multiple-access (WDM) communication systems and networks. They are Lambdanet-based broadcast WDM networks, quantum routers based on a waveguide grating router, and fiber-to-the-quantum nodes that are fed by two opposing and extreme quantum light signals, namely the coherent (Glauber) and number (Fock) states. Using the coherent states, we identify the classical behavior of the quantum WDM (QWDM) networks. Furthermore, employing quantum single-photon sources and exclusive quantum results, such as quantum correlations occurring in the receivers's states, are studied in these WDM communication systems and networks. Finally, we provide secure-key rate estimation for Lambdanet- and waveguide grating router (WGR)-based quantum key distribution networks leveraging the developed QWDM. As compared to Lambdanet, WGR obtains a higher rate of secure keys.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-27"},"PeriodicalIF":0.0,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11002388","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144255697","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