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

Extrapolating Pauli Checks for Expectation Value Estimation on Noisy Quantum Devices 噪声量子器件期望值估计的外推泡利检验

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-03-13 DOI: 10.1109/TQE.2026.3693166

Quinn Langfitt;Ji Liu;Benchen Huang;Alvin Gonzales;Kaitlin N. Smith;Nikos Hardavellas;Zain H. Saleem

{"title":"Extrapolating Pauli Checks for Expectation Value Estimation on Noisy Quantum Devices","authors":"Quinn Langfitt;Ji Liu;Benchen Huang;Alvin Gonzales;Kaitlin N. Smith;Nikos Hardavellas;Zain H. Saleem","doi":"10.1109/TQE.2026.3693166","DOIUrl":"https://doi.org/10.1109/TQE.2026.3693166","url":null,"abstract":"Pauli check sandwiching is an error detection scheme that protects quantum circuits by inserting pairs of parity checks and discarding runs that signal errors. However, each additional check introduces noise and exponentially increases sampling costs. To address these limitations, we propose Pauli check extrapolation (PCE), an error mitigation technique that obtains measured expectation values from circuits with different numbers of checks and, analogous to zero-noise extrapolation (ZNE), extrapolates to the “maximum check” limit—the theoretical number of checks required for unit fidelity. We test linear and exponential ansatzes, deriving the exponential form from the Markovian error model. Benchmarking PCE against ZNE on random Clifford circuits with simulated depolarizing noise shows PCE outperforming ZNE for larger circuits. On real IBM hardware, PCE achieves an accuracy of up to 99.2% (56.2% improvement over baseline), compared to ZNE’s 82% accuracy (29.1% improvement over baseline), for four-qubit circuits. To demonstrate a practical use case, we then apply PCE toward mitigating errors in classical shadow measurements. Our results show that PCE can achieve fidelities greater than the state-of-the-art robust shadow estimation, while significantly reducing the number of required samples by eliminating the need for a calibration procedure. We validate these findings on both fully connected topologies and simulated IBM hardware backends.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"3103409-3103409"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11517531","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442292","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

Parameter Analysis and Optimization of Layer Fidelity for Quantum Processor Benchmarking at Scale 大规模量子处理器基准测试的层保真度参数分析与优化

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-02-26 DOI: 10.1109/TQE.2026.3668098

Maria Jose Lozano Palacio;Hasan Nayfeh;Matthew Ware;David C. McKay

{"title":"Parameter Analysis and Optimization of Layer Fidelity for Quantum Processor Benchmarking at Scale","authors":"Maria Jose Lozano Palacio;Hasan Nayfeh;Matthew Ware;David C. McKay","doi":"10.1109/TQE.2026.3668098","DOIUrl":"https://doi.org/10.1109/TQE.2026.3668098","url":null,"abstract":"With the continued scaling of quantum processors, holistic benchmarks are essential for extensively evaluating device performance. Layer fidelity is a benchmark well-suited to assessing processor performance at scale. Key advantages of this benchmark include its natural alignment with randomized benchmarking (RB) procedures, crosstalk awareness, fast measurements over large numbers of qubits, high signal-to-noise ratio, and fine-grained information [Mckay et al. (2023)]. In this work, we extend the analysis of the original layer fidelity manuscript to optimize parameters of the benchmark and extract deeper insights of its application. We present a robust protocol for identifying optimal qubit chains of arbitrary length <inline-formula><tex-math>$N$</tex-math></inline-formula>, demonstrating that our method yields error per layered gate values <inline-formula><tex-math>$40%-70 %$</tex-math></inline-formula> lower than randomly selected chains for <inline-formula><tex-math>$N=100$</tex-math></inline-formula> qubits. We further establish layer fidelity as an effective performance monitoring tool, capturing both edge-localized and device-wide degradation by tracking optimal chains of length 50 and 100, and fixed chains of length 100. In addition, we refine error analysis by proposing parameter bounds on the number of randomizations and Clifford lengths used in direct RB fits, minimizing fit uncertainties. Finally, we use layer fidelity to analyze the impact of varying gate durations on layered two-qubit errors, showing that prolonged gate times leading to idling times significantly increase these quantities. These findings extend the applicability of the layer fidelity benchmark and provide practical guidelines for optimizing quantum processor evaluations.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-10"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11414205","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557958","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

A Low Noise Signal Read-Out Circuit for Integrated Quantum Diamond Magnetometers 集成量子金刚石磁力计的低噪声信号读出电路

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-02-23 DOI: 10.1109/TQE.2026.3667338

Zhenlin Zhang;Wenzhe Zhang;Enrui Zhang;Xi Qin

{"title":"A Low Noise Signal Read-Out Circuit for Integrated Quantum Diamond Magnetometers","authors":"Zhenlin Zhang;Wenzhe Zhang;Enrui Zhang;Xi Qin","doi":"10.1109/TQE.2026.3667338","DOIUrl":"https://doi.org/10.1109/TQE.2026.3667338","url":null,"abstract":"A customized low-noise signal read-out circuit, which is designed for the implementation of the integrated low power consumption quantum magnetometers based on nitrogen-vacancy centers in diamond, is reported in this article. As the circuit has a 3.7 pA/Hz1/2 low-input noise which is superior to the latest studies, the integrated quantum diamond magnetometer can achieve a subnanotesla magnetic sensitivity with a low laser power of 70 mW. The circuit is designed with a compact 9.6 × 3.7-cm printed-circuit board, and has been applied to implement the integrated quantum diamond magnetometer. The contributors of the signal noise have been analyzed in this article, and an optimized low noise amplifier circuit design has been obtained. The circuit is featured by the performance in low noise, and the experimental results prove that the circuit has a considerable advantage in signal read out for the magnetometer with a low laser power. This study has a bright future to be applied in the practical application that requires low noise signal read-out functions.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-11"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11408341","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557960","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

Grover Adaptive Search-Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs 基于Grover自适应搜索的混合弯曲分解混合整数线性规划

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-04-06 DOI: 10.1109/TQE.2026.3681202

Xiaodong Zheng;Ding Lin;Haoyong Chen

{"title":"Grover Adaptive Search-Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs","authors":"Xiaodong Zheng;Ding Lin;Haoyong Chen","doi":"10.1109/TQE.2026.3681202","DOIUrl":"https://doi.org/10.1109/TQE.2026.3681202","url":null,"abstract":"Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimization part, recent efforts have explored hybrid quantum-classical Benders decomposition frameworks, which delegate the discrete master problem to quantum solvers like annealers while solving the continuous subproblem classically. However, these approaches typically rely on penalty-based formulations that are heuristic in nature, offer no guarantee of recovering the exact master optimum, require delicate penalty tuning, and introduce slack-register overhead that inflates circuit size and distorts the problem's native structure. In this work, we propose a Grover adaptive search-based Benders decomposition (GAS-BD) algorithm that circumvents penalty terms by directly encoding Benders cuts into a novel quantum oracle. The designed oracle-based quantum solver searches for constraint-satisfying master solutions by leveraging Grover's potential quadratic speedup, while the subproblem loop is handled by a classical solver. Simulation results shows that GAS–BD matches the convergence of classical Benders and exhibits greater stability than penalty-based hybrid baselines, while remaining executable on current noisy intermediate-scale quantum (NISQ) hardware. These results demonstrate a practical and penalty-free path for embedding exact Benders logic into Grover-style quantum search.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-23"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11475201","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148479395","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

Robust Design Under Uncertainty in Quantum Error Mitigation 量子误差抑制中不确定性的鲁棒设计

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-04-03 DOI: 10.1109/TQE.2026.3680641

Maksym Prodius;Piotr Czarnik;Michael McKerns;Andrew T. Sornborger;Lukasz Cincio

{"title":"Robust Design Under Uncertainty in Quantum Error Mitigation","authors":"Maksym Prodius;Piotr Czarnik;Michael McKerns;Andrew T. Sornborger;Lukasz Cincio","doi":"10.1109/TQE.2026.3680641","DOIUrl":"https://doi.org/10.1109/TQE.2026.3680641","url":null,"abstract":"Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical postprocessing of quantum computation outcomes is a popular approach for error mitigation, which includes methods, such as zero noise extrapolation, virtual distillation, and learning-based error mitigation. However, these techniques have limitations due to the propagation of uncertainty resulting from the finite shot number of a quantum measurement. In this work, we introduce general and unbiased methods for quantifying the uncertainty and error of error-mitigated observables based on the strategic sampling of error mitigation outcomes. We then extend our approach to demonstrate the optimization of performance and robustness of error mitigation under uncertainty. To illustrate our methods, we apply them to zero noise extrapolation and Clifford date regression in the ground state of the XY model simulated using depolarizing and International Business Machines Corporation (IBM) Toronto noise models, respectively. In particular, we optimize the choice of noise levels and the allocation of shots for zero noise extrapolation and the distribution of the training circuits for Clifford data regression. While our methods are readily applicable to any postprocessing-based error mitigation approach, in practice they must not be prohibitively expensive—even though they perform optimizations of the error mitigation hyperparameters requiring sampling of a statistical distribution of error mitigation outcomes. By leveraging surrogate-based optimization, we show that our methods can efficiently perform optimal design for a zero noise extrapolation implementation. We then further demonstrate the transferability of learned zero noise extrapolation hyperparameters to other similar circuits.","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=11474741","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480623","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

Differential Phase Encoded Plug-and-Play Measurement-Device-Independent Quantum Key Distribution 差分相位编码即插即用测量设备无关量子密钥分配

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-02-16 DOI: 10.1109/TQE.2026.3665005

Nilesh Sharma;Shashank Kumar Ranu;Prabha Mandayam;Anil Prabhakar

{"title":"Differential Phase Encoded Plug-and-Play Measurement-Device-Independent Quantum Key Distribution","authors":"Nilesh Sharma;Shashank Kumar Ranu;Prabha Mandayam;Anil Prabhakar","doi":"10.1109/TQE.2026.3665005","DOIUrl":"https://doi.org/10.1109/TQE.2026.3665005","url":null,"abstract":"Measurement-device-independent quantum key distribution (MDI-QKD) enhances security by removing vulnerabilities associated with detector side channels. Real-world implementations ofMDI-QKD face practical challenges, such as channel asymmetry and physical imperfections, which degrade the visibility of Hong–Ou–Mandel interference, an essential factor in determining the secure key rate. In this work, we evaluate the performance of differential phase encoded (DPE) MDI-QKD under realistic, asymmetric conditions. We analyze the effects of polarization and pulsewidth mismatches caused by channel asymmetry and identify tolerable limits for secure key generation. We introduce a plug-and-play DPE-MDI-QKD architecture that mitigates polarization fluctuations using Faraday mirrors and also compensates for pulsewidth mismatches. Furthermore, we propose an improved sifting scheme that raises the sifting efficiency from <inline-formula><tex-math>$frac{4}{9}$</tex-math></inline-formula> to <inline-formula><tex-math>$frac{2}{3}$</tex-math></inline-formula>, improving the secure key generation rates by 50% and making it especially suitable for plug-and-play systems. These results offer practical insights into enhancing the robustness and efficiency of DPE-MDI-QKD, enabling more secure quantum communication over imperfect and asymmetric quantum channels.","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=11397104","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148481557","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

DAG-Aware Gate Fusion for Efficient State-Vector Quantum-Circuit Simulation 基于dag感知的门融合高效态向量量子电路仿真

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-06-22 DOI: 10.1109/TQE.2026.3705783

Shangshu Li;Zheng-An Wang;Heng Fan

{"title":"DAG-Aware Gate Fusion for Efficient State-Vector Quantum-Circuit Simulation","authors":"Shangshu Li;Zheng-An Wang;Heng Fan","doi":"10.1109/TQE.2026.3705783","DOIUrl":"https://doi.org/10.1109/TQE.2026.3705783","url":null,"abstract":"Classical simulation remains a practical foundation for developing and evaluating quantum circuits, and state-vector methods are still among the most important exact simulation techniques. In this setting, gate fusion is a widely used optimization that combines multiple gates into a larger operator to reduce repeated state-vector traversal and improve execution efficiency. However, existing fusion methods are often driven by local heuristics or linear gate order, which can miss larger legal fusion opportunities allowed by circuit dependencies. To address this issue, we propose a directed acyclic graph-aware gate fusion method that builds legal fused operators directly from the circuit dependence graph through topological expansion, a configurable fusion-size bound, and a nonblocking rule. Using the <italic>pyquafu state-vector simulator as the execution backend, the method delivers strong end-to-end performance on representative benchmarks and yields high compression ratios. The results also highlight that fusion quality alone is not sufficient: the realized speedup depends on how well the fused blocks match the execution characteristics of the simulator backend.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-10"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11573203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148925534","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 Error Correction for Second-Generation Quantum Repeaters 第二代量子中继器的量子纠错

IF 4.6

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

Dawei Jiao;Mahdi Bayanifar;Alexei Ashikhmin;Olav Tirkkonen

{"title":"Quantum Error Correction for Second-Generation Quantum Repeaters","authors":"Dawei Jiao;Mahdi Bayanifar;Alexei Ashikhmin;Olav Tirkkonen","doi":"10.1109/TQE.2025.3649561","DOIUrl":"https://doi.org/10.1109/TQE.2025.3649561","url":null,"abstract":"In this article, we consider second-generation (2G) quantum repeaters (QRs) for creating long-distance entanglement in quantum networks. Combining a distance-dependent depolarizing error model with the nonlocal Bell state purification procedure required by 2G QRs leads to an error model consisting of correlated and biased errors. To correct correlated errors, nonsymmetric Calderbank–Steane–Shor (CSS) codes with joint decoding between stations can be used. The dominating errors are biased, such that different repeater stations suffer from different types of errors. To mitigate this, different quantum codes can be used at the stations, optimized for the specific error model of the station. To comply with the 2G QR procedure, the codes used in neighboring stations must allow for the transversal implementation of nonlocal logical <sc>cnot gates across the two stations or, alternatively, nonlocal <sc>cz gates combined with logical Hadamard gates. We provide a complete characterization of pairs of CSS codes that allow <sc>cnot or <sc>cz transversality, and examine an explicit family of mirrored CSS codes allowing <sc>cz transversality. We verify Hadamard gate transversality using our framework and show the importance of the logical qubit mapping matrix. Also, we conclude that using different QECCs does not lead to universal computation with the Clifford + <inline-formula><tex-math>$T$</tex-math></inline-formula> gate set. Finally, we study the entanglement generation rate (EGR) in 2G QRs with limited quantum memory, minimizing the number of intermediate stations for a given fidelity and EGR. By simulation, we observe that nonsymmetric and mirrored structure QECCs outperform the conventional approach of using symmetric CSS codes at the repeater stations.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-17"},"PeriodicalIF":4.6,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11320840","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147361163","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

A Sparse-Event Simulation Engine to Model Coincidence-Based Ranging Architectures in Quantum Lidar 基于巧合的量子激光雷达测距系统稀疏事件仿真引擎

IF 4.6

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

Marco Passafiume;Raviraj Adve;Boniface Yogendran;Bhashyam Balaji

{"title":"A Sparse-Event Simulation Engine to Model Coincidence-Based Ranging Architectures in Quantum Lidar","authors":"Marco Passafiume;Raviraj Adve;Boniface Yogendran;Bhashyam Balaji","doi":"10.1109/TQE.2025.3649709","DOIUrl":"https://doi.org/10.1109/TQE.2025.3649709","url":null,"abstract":"Nonclassical radar and lidar systems have received substantial interest recently; however, although many experimental demonstrations have provided deep physical knowledge of such systems, there remains a lack of effective system models to obtain fundamental metrics such as range resolution as a function of system parameters. This work introduces a high-fidelity simulation platform to mimic a certain type of quantum radar, specifically a recently proposed one based on temporal coincidences that arise due to entanglement. Specifically, the system measures coincidences between events related to a reference source and those related to the backscattering of photons from targets. The large number of events—and their complex interaction with system components—makes a realistic simulation challenging. As an initial assessment, in this article, we develop a simulator to estimate the expected point spread function (PSF), and thereby the range resolution, considering various coincidence window time widths and system nonidealities. The estimate is based on the numerical computation of the correlation between the reference traces shifted along the time domain and traces of backscattered photons (along with noise photons). The simulated results are comparable to available experimental results, illustrating the fidelity of the simulation engine. A crucial result is that, unlike a classical radar, the PSF and range resolution depend upon the environmental noise and multiple system parameters, not just the transmitted waveform.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-21"},"PeriodicalIF":4.6,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11320830","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146026450","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

Black-Box Optimization of the Storage Location Assignment Problem in Logistics Centers Using an Annealing Algorithm 基于退火算法的物流中心仓位分配问题黑盒优化

IF 4.6

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

Hiromitsu Kigure;Takeshi Baba;Makoto Taniguchi;Hirotaka Kaji

{"title":"Black-Box Optimization of the Storage Location Assignment Problem in Logistics Centers Using an Annealing Algorithm","authors":"Hiromitsu Kigure;Takeshi Baba;Makoto Taniguchi;Hirotaka Kaji","doi":"10.1109/TQE.2025.3646010","DOIUrl":"https://doi.org/10.1109/TQE.2025.3646010","url":null,"abstract":"The manufacturing industry encounters numerous optimization problems, one of which is the optimization of storage location assignment (OSLA) problem in logistics. OSLA is a combinatorial optimization problem focused on improving the efficiency of picking operations in logistics centers. We explore quantum annealing (QA) as a potential solution to combinatorial optimization problems and investigate its applicability to the OSLA. The objective function for this optimization is the average travel distance of workers to their assigned destinations. However, this value is derived by solving the traveling salesman problem for multiple orders, which is itself a combinatorial optimization problem. Therefore, it cannot be analytically represented in a quadratic unconstrained binary optimization form. To address this limitation, we employed black-box optimization with annealing, which combines a surrogate model with an annealing algorithm, an approach that has recently gained attention in applied research involving QA. To evaluate the effectiveness of quantum computing, we compared results obtained using simulated annealing (SA) with those obtained using QA. In addition, to assess the optimization performance of our proposed method, we compared it with a genetic algorithm (GA) that did not utilize a surrogate model of the objective function. QA demonstrated a higher probability of finding the optimal solution (33.3% versus 26.7% with SA). However, the optimization performance of the GA surpassed that of the proposed method. Our analysis suggests that the relatively lower performance of our method was primarily attributable to the strong influence of constraints. The optimization performance can be improved by incorporating methods that consider the uncertainty of surrogate model predictions, such as the lower confidence bound.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-12"},"PeriodicalIF":4.6,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11304740","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145982299","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