Quantum Information Processing最新文献

{"title":"Enhanced communication enabled by coherent control of channels","authors":"Neeraj Subesh,&nbsp;Rajameenakshi Subramanian,&nbsp;Rajiuddin Sk,&nbsp;Prasanta K. Panigrahi","doi":"10.1007/s11128-026-05117-0","DOIUrl":"10.1007/s11128-026-05117-0","url":null,"abstract":"<div><p>One of the key challenges in building a robust quantum network is the efficient distribution of entanglement and mitigating the detrimental effects of noise, which limit the information transmission rate of quantum channels. In this work, we address these challenges by utilizing the superposition of trajectories and indefinite causal orders. We demonstrate that the effects of amplitude damping can be mitigated using a bit-flip channel, while phase damping can be countered with phase-flip noise. Additionally, depolarizing noise can be suppressed using a bit-phase flip channel. Our results show that at lower noise levels, a coherent superposition of channels is more effective, whereas at higher noise levels, a quantum switch implementing indefinite causal order provides better performance. We compute the quantum capacity of channels in both indefinite causal order and coherent superposition scenarios, revealing that coherent control over quantum channels and indefinite causal order can significantly enhance channel capacity compared to a single application of the channel.\u0000\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147441304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Open QBench: A benchmarking framework for evaluating quantum computing platforms","authors":"Konrad Wojciechowski,&nbsp;Krzysztof Kurowski,&nbsp;Mateusz Slysz,&nbsp;Tomasz Pecyna","doi":"10.1007/s11128-026-05115-2","DOIUrl":"10.1007/s11128-026-05115-2","url":null,"abstract":"<div><p>The diverse landscape of quantum computing modalities and software frameworks poses significant challenges for evaluating performance across a range of computational tasks and applications. Benchmarking procedures for quantum computers are often intricate and difficult to reproduce for end-users, quantum algorithm developers, and quantum resource providers. This challenge is compounded by the emergence of analog, non-universal approaches to quantum information processing, including quantum annealers, boson samplers, and quantum simulators. Recent advances in quantum computing technology underscore the increasing need for well-defined, comprehensive, and standardized methods for performance benchmarking. This paper introduces an open and modular software framework to enhance the reproducibility and execution of quantum benchmarking experiments. The core utility of the framework lies in enabling seamless, standardized execution of benchmarks across diverse quantum computing modalities—including gate-based, photonic, and annealing QPUs—at various levels of the quantum-classical stack. As a practical demonstration of current capabilities, we present a novel methodology to deploy an application-driven benchmarking suite. To the best of our knowledge, no other benchmarking framework attempts to cover all three described modalities across different benchmarking levels. While some approaches enable such comparisons at a certain level, these analyses often do not provide a complete picture and must be complemented with additional and hardware specific metrics. Our framework, based on a curated set of representative problems for different user communities, is executed at both the circuit level and the hybrid classical-quantum level to provide a comprehensive assessment of quantum system performance. Finally, we propose an approach for analyzing performance results using multiple-criteria decision analysis (MCDA), which allows us to incorporate different performance metrics into a unified decision-making process that supports more transparent and interpretable benchmarking results.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147440921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Binary integer programming for optimizing ebit cost in distributed quantum circuits with fixed module allocation","authors":"Hyunho Cha,&nbsp;Jungwoo Lee","doi":"10.1007/s11128-026-05112-5","DOIUrl":"10.1007/s11128-026-05112-5","url":null,"abstract":"<div><p>Modular and networked quantum architectures can scale beyond the qubit count of a single device, but executing a circuit across modules requires implementing non-local two-qubit gates using shared entanglement (ebits) and classical communication, making ebit cost a central resource in distributed execution. The resulting distributed quantum circuit (DQC) problem is combinatorial, motivating prior heuristic approaches such as hypergraph partitioning. In this work, we decouple module allocation from distribution. For a fixed module allocation (i.e., assignment of each qubit to a specific quantum processing unit), we formulate the remaining distribution layer as an exact binary integer programming (BIP). This yields solver optimal distributions for the fixed allocation subproblem and can be used as a post-processing step on top of any existing allocation method. We derive compact BIP formulations for four or more modules and a tighter specialization for three modules. Across a diverse benchmark suite, BIP post-processing reduces ebit cost by up to 20% for random circuits and by more than an order of magnitude for some arithmetic circuits. While the method incurs offline classical overhead, it is amortized when circuits are executed repeatedly.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05112-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147441184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Schrödinger’s bug: a survey on quantum software debugging","authors":"Evandro Rosa,&nbsp;Rafael Santiago","doi":"10.1007/s11128-026-05114-3","DOIUrl":"10.1007/s11128-026-05114-3","url":null,"abstract":"<div><p>Quantum computing offers the potential for exponential speed-ups for classically intractable problems, yet quantum programming is still susceptible to bugs. Classical debugging methods are often inadequate, as quantum mechanical principles make state inspection disruptive and classical simulation has exponential time complexity. This survey explores the landscape of quantum assertions as a key technique for identifying and locating bugs in quantum programs. We classify these techniques into two primary categories based on their evaluation stage: classical runtime and quantum runtime assertions. For each category, we analyze the strengths, limitations, time complexity, and applicability of current methods. Our findings show that scalable quantum debugging remains an open problem—a challenge that will persist even with the advent of fault-tolerant hardware. Finally, this work highlights key challenges and proposes future directions for the development of novel quantum debugging techniques.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05114-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147362852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Modified resource measures for quantum resource theory","authors":"Zhe Ji,&nbsp;Lei Li,&nbsp;Jun-Ru Wu,&nbsp;Ming Li","doi":"10.1007/s11128-026-05116-1","DOIUrl":"10.1007/s11128-026-05116-1","url":null,"abstract":"<div><p>Quantum resource theories (QRTs) provide a versatile framework for quantifying and manipulating quantum resources, with widespread applications in quantum communication, computation, and information processing. While the <span>(epsilon )</span>-<i>D</i> version of resource measures has been previously studied, its applicability has been largely restricted to addressing experimental imperfections. To tackle broader challenges such as adversarial interference and probabilistic noise, this paper introduces three novel approaches: the <span>(delta )</span>-<span>(mathcal {T})</span> version and two weighted integral versions. These measures extend the robustness framework of QRTs, enabling a more comprehensive evaluation of quantum resource resilience under realistic conditions. We rigorously analyze their theoretical properties, including non-negativity, monotonicity, convexity, asymptotic continuity, and monogamy, demonstrating their robustness and versatility. As applications to resource dilution protocols, we establish these measures as fundamental lower bounds for resource costs, showcasing their practical relevance in the design of resilient quantum protocols. This work provides fresh insights into resource quantification within QRTs and offers strong theoretical support for secure and reliable quantum communication and computation protocols.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hermitian dual-containing constacyclic BCH codes of new length and related quantum codes","authors":"Xueting Wang,&nbsp;Junling Zhou","doi":"10.1007/s11128-026-05118-z","DOIUrl":"10.1007/s11128-026-05118-z","url":null,"abstract":"<div><p>Constacyclic BCH codes, as a generalization of BCH codes, have been widely used in the construction of quantum codes. In this paper, we mainly study narrow-sense Hermitian dual-containing constacyclic BCH codes over <span>(mathbb {F}_{q^2})</span> of new length <span>(n=frac{q^{2m}-1}{a(q+1)})</span>, where <i>q</i> is a prime power, <span>(m ge 3)</span> is an odd integer and <span>(a ne 1)</span> is a divisor of <span>(q-1)</span>, as well as of length <span>(n=frac{2(q^m+1)}{q+1})</span>, where <i>q</i> is an odd prime power and <span>(m ge 3)</span> is odd. Firstly, we present some necessary and sufficient conditions for these constacyclic BCH codes to be Hermitian dual-containing. Secondly, the explicit dimensions of these constacyclic BCH codes are completely determined. Furthermore, some quantum codes with new parameters are constructed by these Hermitian dual-containing constacyclic BCH codes.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Practical high-dimensional spatial-path GHZ state preparation protocol with practical SPDC sources and non-ideal photon detectors","authors":"Yu-Hao Wang,&nbsp;Meng-Dong Zhu,&nbsp;Xing-Fu Wang,&nbsp;Wei Zhong,&nbsp;Ming-Ming Du,&nbsp;Lan Zhou,&nbsp;Yu-Bo Sheng","doi":"10.1007/s11128-026-05108-1","DOIUrl":"10.1007/s11128-026-05108-1","url":null,"abstract":"<div><p>High-dimensional multipartite entanglement plays a central role in high-capacity anti-noise quantum communication and quantum computation fields. In the paper, we propose a practical preparation protocol for four-photon three-dimensional spatial-path GHZ state with spontaneous parametric down-conversion (SPDC) sources and non-ideal photon detectors. Our preparation protocol is highly feasible under current experimental conditions. The SPDC source and the non-ideal photon detectors would introduce disturbed items into the output quantum state and reduce the fidelity of the target three-dimensional spatial-path GHZ state to about 0.09. By adopting the quantum non-demolition detection on two of the four output modes, one can eliminate most of the disturbed items and increase the fidelity to about 3/7. Our protocol can provide a theoretical guidance for the experimental preparation of the high-dimensional spatial-path GHZ state and has application potential in future quantum communication and computation field.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Control of vertex probability via edge-weight modulation in continuous-time quantum walks","authors":"Rafael Vieira,&nbsp;Edgard P. M. Amorim","doi":"10.1007/s11128-026-05111-6","DOIUrl":"10.1007/s11128-026-05111-6","url":null,"abstract":"<div><p>Continuous-time quantum walks (CTQWs) provide a versatile framework for exploring quantum transport on graphs. In this work, we investigate how the introduction of edge-weight modulation at a single vertex can suppress its occupation probability. We show that when the edges connected to the root vertex are enhanced by a factor <i>J</i>, the probability of detecting the walker at this vertex decays as <span>(1/J^2)</span>, provided the initial state has no components on the vertex itself or its nearest neighbors. We derive the full eigenvalue and eigenvector structure of this system, revealing that the suppression arises from the decoupling of two symmetric line subgraphs and the destructive interference of higher-order contributions. The analysis is extended to tree graphs, where we demonstrate the same scaling behavior and identify the role of local graph geometry in controlling vertex probabilities. These results suggest edge-weight modulation as a mechanism for manipulating transport pathways in CTQWs, with potential applications in quantum information transfer and state engineering, and may serve as a probe of decoherence effects in open quantum systems.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05111-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Construction and analysis of a tripartite scheme for deterministically sharing an arbitrary single-qubit operation via five-qubit entangled state","authors":"Hao Yuan,&nbsp;Jin-Hua Yu,&nbsp;Zhan-Jun Zhang","doi":"10.1007/s11128-026-05110-7","DOIUrl":"10.1007/s11128-026-05110-7","url":null,"abstract":"<div><p>On the basis of the five-qubit entangled state introduced by Briegel and Raussendorf (Phys. Rev. Lett. 86: 910, 2001), we propose a tripartite scheme for remotely sharing an arbitrary single-qubit operation. Unlike some existing quantum operation schemes, this scheme is distinguished by an arbitrary rather than a restricted shared operation; a deterministic rather than a probabilistic chance of final success; local rather than nonlocal necessary operations; and a relatively high intrinsic efficiency. Additionally, the essential operation functions, the physical mechanisms, and the security of the scheme are analyzed and confirmed comprehensively. Furthermore, the impact of phase-damping noise on our scheme is analyzed via fidelity. Investigation shows that the proposed scheme is fully realizable with currently available experimental technologies.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum key-recovery attacks on FBC algorithm","authors":"Yan-Ying Zhu,&nbsp;Bin-Bin Cai,&nbsp;Fei Gao,&nbsp;Song Lin","doi":"10.1007/s11128-026-05098-0","DOIUrl":"10.1007/s11128-026-05098-0","url":null,"abstract":"<div><p>With the advancement of quantum computing, symmetric cryptography faces new challenges from quantum attacks. These attacks are typically classified into two models: Q1 (classical queries) and Q2 (quantum superposition queries). In this context, we present a comprehensive security analysis of the FBC algorithm considering quantum adversaries with different query capabilities. In the Q2 model, we first design 4-round polynomial-time quantum distinguishers for FBC-F and FBC-KF structures, and then perform <span>(r(r&gt;6))</span>-round quantum key-recovery attacks. Our attacks require <span>(O(2^{(2n(r-6)+3n)/2}))</span> quantum queries, reducing the time complexity by a factor of <span>(2^{4.5n})</span> compared with quantum brute-force search, where <i>n</i> denotes the subkey length. Moreover, we give a new 6-round polynomial-time quantum distinguisher for FBC-FK structure. Based on this, we construct an <span>(r(r&gt;6))</span>-round quantum key-recovery attack with complexity <span>(O(2^{n(r-6)}))</span>. Considering an adversary with classical queries and quantum computing capabilities, we demonstrate low-data quantum key-recovery attacks on FBC-KF/FK structures in the Q1 model. These attacks require only a constant number of plaintext-ciphertext pairs, then use the Grover algorithm to search the intermediate states, thereby recovering all keys in <span>(O(2^{n/2}))</span> time.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}