{"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}
{"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}
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}
{"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}
{"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}
Jiaming Wang;Kirill Petrovnin;Pertti J. Hakonen;Gheorghe Sorin Paraoanu
{"title":"Observing the Poisson Distribution of a Coherent Microwave Field With a Parametric Photon Detector","authors":"Jiaming Wang;Kirill Petrovnin;Pertti J. Hakonen;Gheorghe Sorin Paraoanu","doi":"10.1109/TQE.2025.3549485","DOIUrl":"https://doi.org/10.1109/TQE.2025.3549485","url":null,"abstract":"Single-photon detectors are essential for implementing optical quantum technologies, such as quantum key distribution, and for enhancing optical imaging systems such as lidar, while also playing a crucial role in studying the statistical properties of light. In this work, we show how the underlying photon statistics can be revealed by using a threshold detector, implemented as a Josephson parametric amplifier operating near a first-order phase transition. We describe the detection protocol, which utilizes a series of pumping pulses followed by the observation of activated switching events. The acquired data are analyzed using two binomial tests, and the results are compared to a theoretical model that takes into account the photon statistics of the microwave field, with additional validation provided by computer simulations. We show that these tests provide conclusive evidence for the Poissonian statistics in the case of a coherent state, in agreement with the experimental data. In addition, this method enables us to distinguish between different statistics of the incoming probe field. Our approach is broadly applicable to standard non-photon-number-resolving detectors, offering a practical pathway to characterize photon statistics in quantum microwave and optical systems.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10919223","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848798","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}
Kilian Dremel;Dimitri Prjamkov;Markus Firsching;Mareike Weule;Thomas Lang;Anastasia Papadaki;Stefan Kasperl;Martin Blaimer;Theobald O. J. Fuchs
{"title":"Utilizing Quantum Annealing in Computed Tomography Image Reconstruction","authors":"Kilian Dremel;Dimitri Prjamkov;Markus Firsching;Mareike Weule;Thomas Lang;Anastasia Papadaki;Stefan Kasperl;Martin Blaimer;Theobald O. J. Fuchs","doi":"10.1109/TQE.2025.3549305","DOIUrl":"https://doi.org/10.1109/TQE.2025.3549305","url":null,"abstract":"One of the primary difficulties in computed tomography (CT) is reconstructing cross-sectional images from measured projections of a physical object. There exist several classical methods for this task of generating a digital representation of the object, including filtered backprojection or simultaneous algebraic reconstruction technique. Our research aims to explore the potential of quantum computing in the field of industrial X-ray transmission tomography. Specifically, this work focuses on the application of a method similar to that proposed by Nau et al. (2023) on real CT data to demonstrate the feasibility of quadratic-unconstrained-binary-optimization-based tomographic reconstruction. Starting with simulated phantoms, results with simulated annealing as well as real annealing hardware are shown, leading to the application on measured cone-beam CT data. The results demonstrate that tomographic reconstruction using quantum annealing is feasible for both simulated and real-world applications. Yet, current limitations—involving the maximum processable size and bit depth of voxel values of the images, both correlated with the number of densely connected qubits within the annealing hardware—imply the need of future research to further improve the results. This approach, despite its early stage, has the potential to enable more sophisticated reconstructions, providing an alternative to traditional classical methods.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10918785","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143809029","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}
Rei Sato;Cui Gordon;Kazuhiro Saito;Hideyuki Kawashima;Tetsuro Nikuni;Shohei Watabe
{"title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","authors":"Rei Sato;Cui Gordon;Kazuhiro Saito;Hideyuki Kawashima;Tetsuro Nikuni;Shohei Watabe","doi":"10.1109/TQE.2025.3548706","DOIUrl":"https://doi.org/10.1109/TQE.2025.3548706","url":null,"abstract":"Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the problem's constraints—is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solutions, creating a significant hurdle in designing quantum circuits for large-scale TSPs. To address this issue, we propose a two-step quantum search (TSQS) algorithm that employs two sets of operators. In the first step, all the feasible solutions are amplified into their equal superposition state. In the second step, the optimal solution state is amplified from this superposition state. The TSQS algorithm demonstrates greater efficiency compared to conventional search algorithms that employ a single oracle operator for finding a solution within the encoded space. Encoded in the higher order unconstrained binary optimization representation, our approach significantly reduces the qubit requirements. This enables efficient initial state preparation through a unified circuit design, offering a quadratic speedup in solving the TSP without prior knowledge of feasible solutions.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10915727","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143777948","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":"Modeling and Performance Evaluation of Hybrid Classical–Quantum Serverless Computing Platforms","authors":"Claudio Cicconetti","doi":"10.1109/TQE.2025.3567322","DOIUrl":"https://doi.org/10.1109/TQE.2025.3567322","url":null,"abstract":"While quantum computing technologies are evolving toward achieving full maturity, hybrid algorithms, such as variational quantum computing, are already emerging as valid candidates to solve practical problems in fields, such as chemistry and operations research. This situation calls for a tighter and better integration of classical and quantum computing infrastructures to improve efficiency and users' quality of service. Inspired by recent developments in cloud technologies, serverless computing has recently been considered a promising solution for this purpose by both industry and research. In this work, we define a system model for a hybrid classical–quantum serverless system, with an associated open-source numerical simulator that can be driven by production traces and stochastic workload models. We therefore describe how we produced a public dataset using IBM Qiskit in a local and remote infrastructure, with a sample application on optimization. The simulation results show initial insights on some distinguishing features of the platform simulated, measured in terms of user and system metrics, for jobs with heterogeneous problem sizes and priorities. We also report a few lessons we learned from developing the application with IBM Qiskit serverless and running it on IBM Quantum backends.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10989577","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144179118","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}
Che-Ming Chang;Jie-Hong Roland Jiang;Dah-Wei Chiou;Ting Hsu;Guin-Dar Lin
{"title":"Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture","authors":"Che-Ming Chang;Jie-Hong Roland Jiang;Dah-Wei Chiou;Ting Hsu;Guin-Dar Lin","doi":"10.1109/TQE.2025.3548423","DOIUrl":"https://doi.org/10.1109/TQE.2025.3548423","url":null,"abstract":"Trapped-ion technologies stand out as leading contenders in the pursuit of quantum computing, due to their capacity for highly entangled qubits. Among many proposed trapped-ion architectures, the “drive-through” architecture has drawn increasing attention, notably for its remarkable ability to minimize heat generation, which is crucial for low-temperature operation and thermal noise reduction, thus reliable quantum computation. We present the first compilation system tailored for the drive-through architecture to achieve high-fidelity computation for intended quantum programs. Our approach accommodates the unique features of the new architecture that utilize transport gates to facilitate direct entanglement between static qubits and communication qubits. We optimize the qubit placement that changes over time for each trap, considering the cost of qubit swapping. Our method strategically balances the gate and swap distances, significantly improving the overall fidelity across various benchmarks.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10915697","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143896233","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}