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

Reducing Maximum Subcircuits Depth in Quantum Circuit Cutting 减少量子电路切割中最大子电路深度

IF 4.6

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

Milad Eslaminia;Sébastien Le Beux

{"title":"Reducing Maximum Subcircuits Depth in Quantum Circuit Cutting","authors":"Milad Eslaminia;Sébastien Le Beux","doi":"10.1109/TQE.2026.3690593","DOIUrl":"https://doi.org/10.1109/TQE.2026.3690593","url":null,"abstract":"Noisy intermediate-scale quantum (NISQ) devices with limited qubit count and connectivity limit the scale of quantum circuits that can be executed. Circuit-cutting methods simulate larger quantum computers by decomposing large circuits into small subcircuits that can be executed on NISQ hardware. Existing circuit-cutting methods only consider the qubit count of the target hardware for finding the locations of cuts on the circuits. This can result in deeper subcircuits after mapping on the hardware. Fidelity decays exponentially with circuit depth and diminishes the quality of execution. We propose a circuit-cutting framework that reduces variance in the depth of subcircuits after mapping to the hardware. Our method formulates the initial circuit cutting as a multiobjective optimization problem based on an evolutionary search method with the number of cuts and the maximum depth of individual routed subcircuits as fitness objectives. This method is implemented as an extension to the existing Qiskit Circuit Cutting Addon, which allows for integration in existing flows. Our approach achieves reductions in routed subcircuit depth of up to 9.9% across benchmark circuits compared with baseline methods.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"3103209-3103209"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11506216","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148442802","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

Parallel Variational Quantum Algorithms With Gradient-Informed Restart to Speed Up Optimization in the Presence of Barren Plateaus 具有梯度通知重启的并行变分量子算法在荒芜高原存在下加速优化

IF 4.6

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

Daniel Mastropietro;Georgios Korpas;Vyacheslav Kungurtsev;Jakub Marecek

{"title":"Parallel Variational Quantum Algorithms With Gradient-Informed Restart to Speed Up Optimization in the Presence of Barren Plateaus","authors":"Daniel Mastropietro;Georgios Korpas;Vyacheslav Kungurtsev;Jakub Marecek","doi":"10.1109/TQE.2026.3663507","DOIUrl":"https://doi.org/10.1109/TQE.2026.3663507","url":null,"abstract":"Inspired by the Fleming–Viot stochastic process, we propose a parallel implementation with restart of variational quantum algorithms, with the aim of reducing the time spent by the algorithm in barren plateaus where the optimization direction is unclear. In the Fleming–Viot tradition, parallel searches are called particles. In the proposed approach, the search by a Fleming–Viot particle is stopped when it encounters a region where the gradient is too small or noisy, suggesting a barren plateau area. The stopped particle continues the search after being restarted at another location in the parameter space, potentially taking the exploration away from barren plateaus. We first analyze the behavior of the Fleming–Viot particles from a theoretical standpoint. We show that, when simulated-annealing optimization algorithms are used to drive the particle dynamics, the Fleming–Viot system is expected to find the global optimum faster than a single simulated-annealing instance. Furthermore, the relative efficiency increases proportionally to the percentage of barren plateaus in the domain. This result is corroborated by numerical experiments carried out on nonconvex 2-D synthetic problems, as well as on quantum approximated Max-Cut instances, both in a lower 2-D and a higher 16-D problem. The experiments show that our method tends to perform better than vanilla and parallel simulated annealing when large barren plateaus are present in the domain, especially in the higher dimensional problem where barrenness tends to be more important.","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=11389907","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480005","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

Resource-Efficient Emulation of Majorana Zero Mode Braiding on a Superconducting Trijunction 超导三结上马约拉纳零模编织的资源效率仿真

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-07-01 DOI: 10.1109/TQE.2026.3709156

Rahul Singh;Weixin Lu;Kaelyn Ferris;Javad Shabani

{"title":"Resource-Efficient Emulation of Majorana Zero Mode Braiding on a Superconducting Trijunction","authors":"Rahul Singh;Weixin Lu;Kaelyn Ferris;Javad Shabani","doi":"10.1109/TQE.2026.3709156","DOIUrl":"https://doi.org/10.1109/TQE.2026.3709156","url":null,"abstract":"Topological superconductivity could host quasi-particles that are key candidates for fault-tolerant quantum computation due to their immunity to noise as they obey non-Abelian exchange statistics. For example, in the case of Majorana zero modes (MZM), braiding enables two topologically protected quantum gates. While their direct manipulation in solid-state systems remains experimentally challenging, digital emulation of MZM behavior has provided insight as well as a deeper understanding of controlling these topological quantum systems. This emulation is typically accomplished by mapping the topological and trivial phases of a Majorana system to ferromagnetic and paramagnetic Hamiltonians of a spin-glass model. This approach usually relies on adiabatic evolution of superconducting Hamiltonians, which require circuits with very large depths. In this work, we present a resource-efficient method to emulate MZM braiding in a trijunction geometry using a quantum processor. We introduce direct braiding operators which simulate the evolution more efficiently, reducing the quantum gate overhead. We then further generalize this method to emulate braiding operations in extended trijunction architectures based on Kitaev chains.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"2101210-2101210"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11592781","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148747474","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 Communication Infrastructure Cost Optimization Using a Genetic Algorithm 基于遗传算法的量子通信基础设施成本优化

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-07-15 DOI: 10.1109/TQE.2026.3714062

Ange Joel Nounga Njanda;Edmar Egidio Souza;Raul C. Almeida;Anderson A. Tomkelski;Karcius D. R. Assis

{"title":"Quantum Communication Infrastructure Cost Optimization Using a Genetic Algorithm","authors":"Ange Joel Nounga Njanda;Edmar Egidio Souza;Raul C. Almeida;Anderson A. Tomkelski;Karcius D. R. Assis","doi":"10.1109/TQE.2026.3714062","DOIUrl":"https://doi.org/10.1109/TQE.2026.3714062","url":null,"abstract":"This article proposes an optimization model for the design of quantum communication infrastructures (QCI) with the aim of minimizing capital expenditure (CAPEX), focusing on the costs associated with the deployment of quantum links and trusted repeater nodes. The model is formulated using an integer linear programming (ILP) program that incorporates physical and operational constraints to ensure efficient resource allocation. The simulation results obtained using an ILP solver show that increasing wavelength availability leads to significant reductions in CAPEX while consistently producing solutions that satisfy all constraints. However, because ILP becomes computationally expensive for large-scale networks, we propose two genetic algorithms (<inline-formula><tex-math>$text{GA}_{1}$</tex-math></inline-formula> and <inline-formula><tex-math>$text{GA}_{2}$</tex-math></inline-formula>) designed to improve scalability. Both <inline-formula><tex-math>$text{GA}_{1}$</tex-math></inline-formula> and <inline-formula><tex-math>$text{GA}_{2}$</tex-math></inline-formula> offer competitive computation times compared with the ILP solver and provide near-optimal solutions compared with the ILP solution. Overall, this approach is effective for small, medium, and large-scale QCI deployments, offering a scalable and practical solution suitable for real-world implementation. For example, in the small network topology with nine nodes and nine requests, we observe a reduction of CAPEX up to 33% when the number of available wavelengths increases from 1 to 2, and we note that GAs in a large topology, such as NET-4 network, reduce CAPEX by 34.6% (<inline-formula><tex-math>$text{GA}_{1}$</tex-math></inline-formula>), and 21.1% (<inline-formula><tex-math>$text{GA}_{2}$</tex-math></inline-formula>) compared to the benchmarks.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"4101717-4101717"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11611615","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148747403","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 Annealing for Robust Principal Component Analysis 鲁棒主成分分析的量子退火

IF 4.6

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

Ian Tomeo;Panagiotis Markopoulos;Andreas Savakis

{"title":"Quantum Annealing for Robust Principal Component Analysis","authors":"Ian Tomeo;Panagiotis Markopoulos;Andreas Savakis","doi":"10.1109/TQE.2026.3661822","DOIUrl":"https://doi.org/10.1109/TQE.2026.3661822","url":null,"abstract":"Principal component analysis is commonly used for dimensionality reduction, feature extraction, denoising, and visualization. The most commonly used principal component analysis method is based upon optimization of the <inline-formula><tex-math>$L_{2}$</tex-math></inline-formula>-norm; however, the <inline-formula><tex-math>$L_{2}$</tex-math></inline-formula>-norm is known to exaggerate the contribution of errors and outliers. When optimizing over the <inline-formula><tex-math>$L_{1}$</tex-math></inline-formula>-norm, the components generated are known to exhibit robustness or resistance to outliers in the data. The <inline-formula><tex-math>$L_{1}$</tex-math></inline-formula>-norm components can be solved for with a binary optimization problem. Previously, L1-BF has been used to solve the binary optimization for multiple components simultaneously. In this article, we propose quantum annealing principal component analysis (QAPCA), a new method for finding principal components using quantum annealing hardware that will optimize over the <inline-formula><tex-math>$L_{1}$</tex-math></inline-formula>-norm. The conditions required for convergence of the annealing problem are discussed. The potential speedup when using quantum annealing is demonstrated through complexity analysis and experimental results. To showcase performance against classical principal component analysis technique experiments upon synthetic Gaussian data, a fault detection scenario and breast cancer diagnostic data are studied. We find that the reconstruction error when using QAPCA is comparable to that when using L1-BF.","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=11373215","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557959","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

Orthogonal Frequency-Division Multiplexing Continuous-Variable Terahertz QKD for Large-Scale Wireless Quantum Communication 面向大规模无线量子通信的正交频分复用连续变太赫兹QKD

IF 4.6

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

Mingqi Zhang;Kaveh Delfanazari

{"title":"Orthogonal Frequency-Division Multiplexing Continuous-Variable Terahertz QKD for Large-Scale Wireless Quantum Communication","authors":"Mingqi Zhang;Kaveh Delfanazari","doi":"10.1109/TQE.2026.3669050","DOIUrl":"https://doi.org/10.1109/TQE.2026.3669050","url":null,"abstract":"In this article, we introduce a continuous-variable quantum key distribution (CVQKD) protocol that combines orthogonal frequency-division multiplexing with terahertz (THz) carriers to deliver high-throughput and hardware-compatible quantum communication. By distributing quantum states across multiple subcarriers, our approach achieves a noticeable increase in spectral efficiency while mitigating dispersion and atmospheric losses that limit the performance of existing optical and microwave CVQKD systems. A full security analysis under collective Gaussian attacks is presented, incorporating realistic noise models for both terrestrial and intersatellite channels. In terrestrial free-space links, our simulations show secret key rates approaching 72 bits per channel use, with secure distances up to 4.5 m under strong humidity-induced absorption. For intersatellite links, where propagation losses are minimal, secure transmission is sustained over 100 km. A distinctive feature of our work is its direct link to practical hardware. We evaluate implementation using emerging on-chip coherent THz sources based on superconducting Josephson junctions. These compact voltage-tunable emitters provide wideband coherent radiation ideally matched to our protocol, enabling scalable chip-integrated quantum networks. By incorporating their measured characteristics into our models, we demonstrate secure communication up to 3 m in ambient conditions and ∼26 km under cryogenic or vacuum conditions. By uniting advanced protocol design, rigorous security modeling, and hardware-driven performance analysis, this work establishes THz CVQKD as a viable and scalable route to next-generation terrestrial and space-based quantum communication.","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=11417762","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147665172","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

Accelerating the Max-Cut Problems via Distributed Ising Machine Solvers 利用分布式Ising机器求解器加速最大割问题

IF 4.6

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

Xing-yu Wu;Yi-Xin Zhang;Chen-rui Fan;Chuan Wang

{"title":"Accelerating the Max-Cut Problems via Distributed Ising Machine Solvers","authors":"Xing-yu Wu;Yi-Xin Zhang;Chen-rui Fan;Chuan Wang","doi":"10.1109/TQE.2026.3666889","DOIUrl":"https://doi.org/10.1109/TQE.2026.3666889","url":null,"abstract":"The Ising machine, as a quantum-inspired computing system, can be used to efficiently solve combinatorial optimization problems. Ongoing studies have positioned it to potentially surpass the performance limitations of traditional computers. However, such Ising machines also suffer from scalability as the solution quality becomes suboptimal when the problem size increases. In this work, we propose an Ising-based framework that uses a distributed Ising algorithm to find the near-optimal solution for large-scale Max-Cut problems through parallel processing via graph segmentation and reassembly. We selected the coherent Ising machine as the hardware solver and successfully found the solution for a 2000-node instance utilizing 20 computational bits on the GSet standard dataset. In addition, we investigated the key factors influencing the system’s performance and discovered that setting the number of reorganizations to one results in higher accuracy. Building on this configuration, we utilized a 100-bit CIM hardware platform (CPQC-1) to solve instances with varying numbers of nodes. The experimental results agree well with the theoretical simulations, confirming the practical feasibility of our method. Moreover, compared to existing Ising-based solvers, our algorithm significantly reduces computational resource requirements while achieving superior performance on large-scale combinatorial optimization problems, highlighting its effectiveness on quantum-inspired hardware.","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=11407464","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147606236","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 Quantum Variational Approach to Phase-Only Pattern Synthesis 纯相位模式合成的量子变分方法

IF 4.6

IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-01-30 DOI: 10.1109/TQE.2026.3659730

Sigurd Huber;Michael Epping

{"title":"A Quantum Variational Approach to Phase-Only Pattern Synthesis","authors":"Sigurd Huber;Michael Epping","doi":"10.1109/TQE.2026.3659730","DOIUrl":"https://doi.org/10.1109/TQE.2026.3659730","url":null,"abstract":"Phase-only pattern synthesis is a long-standing and hard to solve problem in antenna engineering. Due to its nonlinear nature, this kind of optimization problem is classically approached with iterative algorithms, where the convergence time depends on the problem topology. Often these heuristic solution routines get stuck in local optima and yield suboptimal results. This article addresses phase-only pattern synthesis by using a variational quantum algorithm, the quantum approximate optimization algorithm. In this context, a mathematical approach is presented, which discretizes the optimization variables and allows representing the original nonlinear functional as a higher order polynomial. In contrast to other series expansion techniques it turns out that this polynomial has finite length without introducing any approximations. This makes phase-only patterns synthesis problems suitable to be solved on quantum computers with standard gate sets. The mathematical treatment of this optimization problem is complemented by a complexity analysis and a performance analysis. Finally, the challenges regarding future deployment of quantum approximate optimization for phase-only pattern synthesis are discussed.","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=11368738","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148481515","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

Emergent Bifurcations in Quantum Circuit Stability From Hidden Parameter Statistics 从隐参数统计分析量子电路稳定性中的突现分岔

IF 4.6

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

Pilsung Kang

{"title":"Emergent Bifurcations in Quantum Circuit Stability From Hidden Parameter Statistics","authors":"Pilsung Kang","doi":"10.1109/TQE.2026.3698350","DOIUrl":"https://doi.org/10.1109/TQE.2026.3698350","url":null,"abstract":"Circuit compression is a key requirement for near-term quantum computing, yet the factors that govern stability under gate removal are not fully understood. We study this problem via a large-scale numerical analysis of 300 structurally uniform circuits across 10, 12, and 14 qubits. Despite identical macroscopic resources, each ensemble separates into two stability classes under the compression settings considered here. We show that this discrete separation is not explained by structural descriptors alone, but is instead linked to the statistical properties of the gate rotation parameters. In particular, fragile circuits exhibit a consistent signature of statistical brittleness, characterized by reduced parameter variability and a lower prevalence of small-angle gates. We further identify a mechanism consistent with this behavior: paradoxical importance, where smaller angle gates can be disproportionately critical to circuit function, an effect most pronounced in fragile circuits. These results suggest simple parameter-statistics-based diagnostics that complement macroscopic resource metrics when assessing stability under compilation-based and pruning-based compression.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"2500608-2500608"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11539996","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480070","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

Impact of High-Brightness Entangled Photon Pairs on CHSH Inequality Experiment 高亮度纠缠光子对CHSH不等式实验的影响

IF 4.6

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

Jin-Woo Kim;Heonoh Kim;June Koo Kevin Rhee

{"title":"Impact of High-Brightness Entangled Photon Pairs on CHSH Inequality Experiment","authors":"Jin-Woo Kim;Heonoh Kim;June Koo Kevin Rhee","doi":"10.1109/TQE.2026.3678760","DOIUrl":"https://doi.org/10.1109/TQE.2026.3678760","url":null,"abstract":"Verifying the violation of Bell's inequality is one of the most representative methods to demonstrate that entangled photon pairs prepared in a quantum optics-based system exhibit quantum properties. While experiments on Bell inequality violations have been theoretically well-established and extensively conducted to implement various quantum information technologies in laboratory settings, mathematical modeling for systematically describing the distribution of high-brightness entangled photon pairs in high-loss environments remains an issue that requires further research. As the brightness of the entangled photon pairs increases, the influence of multiphoton effects becomes more significant, leading to a decrease in the CHSH value <inline-formula><tex-math>$S$</tex-math></inline-formula> and also a reduction in the standard deviation of the CHSH value <inline-formula><tex-math>$Delta S$</tex-math></inline-formula>. Therefore, a new analysis of the <inline-formula><tex-math>$(S-2)/Delta S$</tex-math></inline-formula> value is required to more precisely confirm the degree of CHSH inequality violation, including the reliability of <inline-formula><tex-math>$S$</tex-math></inline-formula>. In this article, we propose a mathematical model to predict the <inline-formula><tex-math>$(S-2)/Delta S$</tex-math></inline-formula> value as a function of the brightness of the entangled photon pair source, and we also suggest the need to optimize the brightness of this source. In addition, we provide experimental evidence supporting this model. The experiment confirms that when the mean photon number is <inline-formula><tex-math>$mu=0.026$</tex-math></inline-formula> in an entanglement distribution setup with a total loss of <inline-formula><tex-math>$-19.03$</tex-math></inline-formula> dB, the CHSH value drops to 2.69, while the <inline-formula><tex-math>$(S-2)/Delta S$</tex-math></inline-formula> value increases to 60.95.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-9"},"PeriodicalIF":4.6,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11457773","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148480072","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