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

Observing the Poisson Distribution of a Coherent Microwave Field With a Parametric Photon Detector 用参量光子探测器观察相干微波场的泊松分布

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

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}

引用次数: 0

Utilizing Quantum Annealing in Computed Tomography Image Reconstruction 量子退火在计算机断层扫描图像重建中的应用

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

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}

引用次数: 0

Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems 求解旅行商问题的两步量子搜索算法

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

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}

引用次数: 0

Modeling and Performance Evaluation of Hybrid Classical–Quantum Serverless Computing Platforms 经典-量子混合无服务器计算平台建模与性能评估

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

Claudio Cicconetti

{"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}

引用次数: 0

Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture 基于免下车架构的阱离子处理器的量子电路编译

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

Che-Ming Chang;Jie-Hong Roland Jiang;Dah-Wei Chiou;Ting Hsu;Guin-Dar Lin

引用次数: 0

Explicit Quantum Circuit for Simulating the Advection–Diffusion–Reaction Dynamics 模拟平流-扩散-反应动力学的显式量子电路

IEEE Transactions on Quantum Engineering Pub Date : 2025-02-21 DOI: 10.1109/TQE.2025.3544839

Claudio Sanavio;Enea Mauri;Sauro Succi

{"title":"Explicit Quantum Circuit for Simulating the Advection–Diffusion–Reaction Dynamics","authors":"Claudio Sanavio;Enea Mauri;Sauro Succi","doi":"10.1109/TQE.2025.3544839","DOIUrl":"https://doi.org/10.1109/TQE.2025.3544839","url":null,"abstract":"We assess the convergence of the Carleman linearization of advection–diffusion–reaction (ADR) equations with a logistic nonlinearity. It is shown that five Carleman iterates provide a satisfactory approximation of the original ADR across a broad range of parameters and strength of nonlinearity. To assess the feasibility of a quantum algorithm based on this linearization, we analyze the projection of the Carleman ADR matrix onto the tensor Pauli basis. It is found that the Carleman ADR matrix requires an exponential number of Pauli gates as a function of the number of qubits. This prevents the practical implementation of the Carleman approach to the quantum simulation of ADR problems on current hardware. We propose to address this limitation by resorting to block-encoding techniques for sparse matrix employing oracles. Such quantum ADR oracles are presented in explicit form and shown to turn the exponential complexity into a polynomial one. However, due to the low probability of successfully implementing the nonunitary Carleman operator, further research is needed to implement the multitimestep version of the present circuit.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10899872","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143706764","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

Qubit Rate Modulation-Based Time Synchronization Mechanism for Multinode Quantum Networks 基于量子比特率调制的多节点量子网络时间同步机制

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

Marc Jofre

引用次数: 0

Generating Shuttling Procedures for Constrained Silicon Quantum Dot Array 约束硅量子点阵列的穿梭生成程序

IEEE Transactions on Quantum Engineering Pub Date : 2025-02-14 DOI: 10.1109/TQE.2025.3542462

Naoto Sato;Tomonori Sekiguchi;Takeru Utsugi;Hiroyuki Mizuno

{"title":"Generating Shuttling Procedures for Constrained Silicon Quantum Dot Array","authors":"Naoto Sato;Tomonori Sekiguchi;Takeru Utsugi;Hiroyuki Mizuno","doi":"10.1109/TQE.2025.3542462","DOIUrl":"https://doi.org/10.1109/TQE.2025.3542462","url":null,"abstract":"In silicon quantum computers, a single electron is trapped in a microstructure called a quantum dot, and its spin is used as a qubit. For large-scale integration of qubits, we previously proposed an approach of sharing a control gate in the row or column of a 2-D quantum dot array. In our array, the shuttling of electrons is a useful technique to operate the target qubit independently and avoid crosstalk. However, since the shuttling is also conducted using shared control gates, the movement of qubits is complexly constrained. We, therefore, propose a formal model based on state transition systems to describe those constraints and operation procedures on the array. We also present an approach to generate operation procedures under the constraints. Utilizing this approach, we present a concrete method for our 16 × 8 quantum dot array. By implementing the proposed method as a quantum compiler, we confirmed that it is possible to generate operation procedures in a practical amount of time for arbitrary quantum circuits. We also demonstrated that crosstalk can be avoided by shuttling and that the fidelity in that case is higher than when crosstalk is not avoided.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-38"},"PeriodicalIF":0.0,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10890998","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621676","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 Machine Learning Kernel Training for Classification Tasks 分类任务的量子机器学习核训练基准测试

IEEE Transactions on Quantum Engineering Pub Date : 2025-02-13 DOI: 10.1109/TQE.2025.3541882

Diego Alvarez-Estevez

{"title":"Benchmarking Quantum Machine Learning Kernel Training for Classification Tasks","authors":"Diego Alvarez-Estevez","doi":"10.1109/TQE.2025.3541882","DOIUrl":"https://doi.org/10.1109/TQE.2025.3541882","url":null,"abstract":"Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10884820","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716524","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

Entanglement Routing in Quantum Networks: A Comprehensive Survey 量子网络中的纠缠路由：综述

IEEE Transactions on Quantum Engineering Pub Date : 2025-02-11 DOI: 10.1109/TQE.2025.3541123

Amar Abane;Michael Cubeddu;Van Sy Mai;Abdella Battou

引用次数: 0