Quantum Information Processing最新文献

{"title":"Construction of self-orthogonal quasi-cyclic codes and their application to quantum error-correcting codes","authors":"Mengying Gao,&nbsp;Yuhua Sun,&nbsp;Tongjiang Yan,&nbsp;Chun’e Zhao","doi":"10.1007/s11128-026-05295-x","DOIUrl":"10.1007/s11128-026-05295-x","url":null,"abstract":"<div><p>In this paper, necessary and sufficient conditions for the self-orthogonality of <i>t</i>-generator quasi-cyclic (QC) codes are established with respect to the Euclidean, Hermitian, and symplectic inner products, respectively. In particular, by investigating the dual structure of a new family of 2-generator QC codes, we derive necessary and sufficient conditions for such codes to be dual-containing under the three aforementioned inner products. In terms of construction, this new family of 2-generator QC codes admits a more general form than several classes of codes in the existing literature. Furthermore, our results on the necessary and sufficient conditions for the self-orthogonality and dual-containing properties of such codes also extend those in related literature. Based on the derived self-orthogonality and dual-containing criteria, we further construct various quantum stabilizer codes and quantum synchronizable codes with favorable parameters.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695261","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 channel capacity analysis of a dissipative three-mode system","authors":"Urjjarani Patel,&nbsp;Chennupati Rakesh Prasanna,&nbsp;Aneesh Sreevallabh Chivukula,&nbsp;K. V. S. Shiv Chaitanya","doi":"10.1007/s11128-026-05305-y","DOIUrl":"10.1007/s11128-026-05305-y","url":null,"abstract":"<div><p>We investigate the information transmission capabilities of a dissipative three-mode bosonic quantum system by analyzing its associated quantum channel. The study focuses on the evaluation of coherent information and entanglement-assisted classical capacity under both pure and mixed input states. The system dynamics are modeled using a Lindblad master equation, allowing us to capture the effects of environmental decoherence and dissipation. For pure states, the two capacity measures exhibit close agreement, while for mixed states a clear separation emerges due to the contribution of input entropy. The results further reveal a nontrivial dependence on evolution time and Hilbert space dimension, highlighting the competing roles of coherent interactions and noise. These findings provide insight into the fundamental limits of information transmission in realistic open quantum systems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695260","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":"Design of quantum-inspired photonic filters and wdm multiplexers using tunneling-based optimization frameworks","authors":"Subhankar Bhattacharjee,&nbsp;Arup Kumar Ghosh,&nbsp;Mahua Rakshit","doi":"10.1007/s11128-026-05302-1","DOIUrl":"10.1007/s11128-026-05302-1","url":null,"abstract":"<div><p>In this research paper, a quantum-inspired design and optimization technique for extremely efficient photonic wavelength division multiplexers (WDMs) and bandpass filters (BPFs) developed for advanced integrated photonic communication platforms is presented. Tunneling-inspired resonance and evanescent coupling effects in nanoscale photonic structures that are essential to advanced photonic circuits are not sufficiently captured by classical electromagnetic models when the device dimensions approach closer to the nanoscale. In order to overcome this constraint, we propose a tunneling-based model using quantum-inspired analogies that provides for precise control of resonance, phase coherence, and energy transfer by interpreting evanescent field coupling as a quantum-inspired tunneling analogy over potential barriers. An enhanced iterative random grouping with adaptive differential evolution (IRRG-ADE) algorithm, designed to tackle large-scale, non-separable photonic design domains with quantum-inspired constraints, is implemented to tackle the resulting multi-objective optimization problem. The numerical simulations demonstrate significant advantages over classical electromagnetic systems, with an insertion loss of 0.45 dB, crosstalk suppression of 29.1 dB, and a passband flatness of 0.96. The proposed structure provides a scalable approach for creating spectrally stable, CMOS-compatible wavelength-selective components for next-generation advanced photonic communication and integrated photonic platforms by combining quantum tunneling analogies via computational photonic optimization. <i>The proposed framework is quantum-inspired in the sense that it utilizes mathematical analogies between optical wave propagation and quantum tunneling phenomena for photonic structure optimization. The presented devices remain classical passive dielectric photonic structures and do not directly manipulate quantum states, entanglement, or single-photon dynamics.</i></p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695262","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":"Efficient protocol to estimate the Quantum Fisher Information Matrix for commuting-block circuits","authors":"Rafael Gómez-Lurbe","doi":"10.1007/s11128-026-05304-z","DOIUrl":"10.1007/s11128-026-05304-z","url":null,"abstract":"<div><p>The Quantum Fisher Information Matrix (QFIM) quantifies how sensitive parameterized quantum states are to changes in their parameters. Recently, it has been used to improve variational quantum algorithm optimization through geometry-aware techniques. However, estimating the QFIM—particularly its off-block-diagonal elements—requires substantial resources. To address this, we introduce a novel protocol that efficiently computes these elements for <i>commuting-block</i> variational circuits. Our approach reduces the number of quantum state preparations from <span>(O(m^2))</span> to <span>(O(L^2))</span>, where <i>m</i> is the number of parameters and <i>L</i> the number of circuit layers. This also lowers classical measurement and post-processing requirements, improving computational efficiency.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05304-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695259","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":"Toward a benchmark for quantum computers based on an iterated post-selective protocol","authors":"Adrian Ortega,&nbsp;Orsolya Kálmán,&nbsp;Tamás Kiss","doi":"10.1007/s11128-026-05294-y","DOIUrl":"10.1007/s11128-026-05294-y","url":null,"abstract":"<div><p>Applying post-selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task of matching an unknown quantum state to a reference state. We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers. In particular, we implement this scheme on freely available IBM superconducting quantum computers. By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, which is easy to calculate classically, we define a benchmark metric. Additionally, the standard deviation of the experimental results from their average serves as a secondary benchmark metric, characterizing fluctuations in the given device. A peculiar feature of the considered protocol is that there is a phase parameter of the initially prepared state, on which the resulting conditional probability should not depend. A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695355","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 Walk Dictionary Learning for Classical Image Representation: A Hybrid Framework","authors":"Luis José Mantilla Santa Cruz,&nbsp;Luis F. Faina,&nbsp;João Henrique de Souza Pereira","doi":"10.1007/s11128-026-05307-w","DOIUrl":"10.1007/s11128-026-05307-w","url":null,"abstract":"<div><p>Quantum computing offers novel paradigms for data representation and signal processing, yet traditional Quantum Image Representation (QIP) models often face significant challenges regarding qubit resources and state preparation complexity. This paper introduces a hybrid quantum-classical framework that utilizes Discrete-Time Quantum Walks (DTQW) as a generative mechanism for construction of classical dictionary learning. The core contribution of this work lies in the spectral and informational characterization of the quantum-generated basis. A comparative analysis against industry-standard benchmarks, including the Discrete Cosine Transform (DCT) and Haar Wavelet Transform (WAV), reveals that the DTQW basis operates in a high-entropy representational regime, achieving a maximum normalized Shannon entropy (<span>(H/H_{max} approx 1.0)</span>). This property facilitates a delocalized or “holographic” distribution of signal energy across the entire coefficient spectrum. Furthermore, we show that applying unitary quantum operator to the position register enables visually interpretable image transformations through a computationally efficient coefficient reuse mechanism. This research shifts the focus from traditional compression-centric imaging toward a robustness-centric quantum-assisted paradigm, offering promising applications in secure communication and resilient image representation.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05307-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695356","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":"Randomness efficient algorithms for estimating average gate fidelity via k-wise classical and quantum independence","authors":"Aditya Nema,&nbsp;Pranab Sen","doi":"10.1007/s11128-026-05300-3","DOIUrl":"10.1007/s11128-026-05300-3","url":null,"abstract":"<div><p>We present three new algorithms for efficient in-place estimation of average fidelity of a <i>d</i>-dimensional quantum logic gate, without using ancilla qubits. The main advantage of our algorithms is the much smaller usage of truly random bits compared to what was known so far. Reducing the requirement of classical seed randomness increases the reliability of estimation, as high-quality random bits are an expensive computational resource and commonly used sources of random bits are either pseudorandom or have a non-trivial bias. We use cutting edge tools from classical and quantum derandomisation theory, viz. <i>k</i>-wise independent generators and <i>k</i>-fold quantum tensor product expanders in order to obtain our new randomness efficient algorithms. Our algorithms are suitable for NISQ and early fault-tolerant quantum computers where one wants to reduce the number of control pulses that can potentially be used, in order to minimise the complexity of the control circuitry and also due to coherence time limitations.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695357","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":"Preparing general mixed quantum states on quantum computers","authors":"Lucas Friedrich,&nbsp;Douglas F. Pinto,&nbsp;Diego S. Starke,&nbsp;Jonas Maziero","doi":"10.1007/s11128-026-05299-7","DOIUrl":"10.1007/s11128-026-05299-7","url":null,"abstract":"<div><p>The preparation of quantum states is a fundamental subroutine for a broad class of quantum information protocols and is critical for both quantum communication and quantum computation. Building upon the quantum algorithms introduced in previous works [M. B. Pozzobom and J. Maziero, Quantum Inf. Process. 18, 142 (2019)] and [E. R. Gårding et al., Entropy 23, 797 (2021)], the authors of [F. Shahbeigi, M. Karimi and V. Karimipour, Phys. Scr. 97, 025101 (2022)] demonstrated the capability to prepare mixed two-qubit X-real states on quantum computers by extending the methodology originally devised for mixed two-qubit Bell-diagonal states. In this article, we delve into an overlooked pattern within these quantum circuits, allowing us to present a modular algorithm for the preparation of general <i>d</i>-dimensional mixed quantum states using quantum information processors. Our general algorithm has a modular structure, encompassing eigenvalue encoding, entropy injection, and eigenvector preparation. To validate our algorithm, we conduct tests on quantum computers utilizing both X- and non-X-states for two mixed-state qubits, two-ququart Bell-diagonal states, as well as arbitrary random density matrices spanning one, two, and three qubits.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05299-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148695354","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":"Low overhead circuit cutting with operator backpropagation","authors":"Debarthi Pal,&nbsp;Ritajit Majumdar","doi":"10.1007/s11128-026-05287-x","DOIUrl":"10.1007/s11128-026-05287-x","url":null,"abstract":"<div><p>Current quantum computers suffer from noise due to lack of error correction. Several techniques to mitigate the effect of noise have been studied, in particular to extract the expectation value of observables. One such technique, circuit cutting, partitions large circuits into smaller, less noisy subcircuits, but the exponential increase in the number of circuit executions limits its scalability. Another method, operator backpropagation (OBP), reduces circuit depth by classically simulating parts of it, yet often escalates the number of circuit executions by some factor due to additional non-commuting terms in the updated observable. This study introduces an optimized approach for lowering the effect of noise in quantum circuits using OBP combined with circuit cutting. We demonstrate that the strategic use of OBP with circuit cutting can mitigate execution overhead. By employing simulated annealing, our proposed method identifies the optimal backpropagation parameter for specific circuits and observables, maximizing the reduction in resources in cutting. Results show a <span>(3times )</span> and <span>(10times )</span> decrease in resource requirements for Variational Quantum Eigensolver and Hamiltonian simulation circuits, respectively, while maintaining or even enhancing accuracy. This approach also yields similar savings for other circuits from the Benchpress database and various observable weights, providing an efficient method to lower circuit cutting overhead without compromising performance.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614990","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":"Characterizing n-chain-locality of correlation tensors based on linear networks","authors":"Yajing Fan,&nbsp;Zhihua Guo,&nbsp;Huaixin Cao,&nbsp;Ying Yang","doi":"10.1007/s11128-026-05276-0","DOIUrl":"10.1007/s11128-026-05276-0","url":null,"abstract":"<div><p>A linear network (LN), also called a chain network, consists of <span>(n+1)</span> nodes (parties) labeled by <span>(A_1,ldots ,A_{n+1})</span> together with <i>n</i> sources labeled by <span>(S_1,ldots ,S_n)</span>. To explore the correlation of the LN, each party <span>(A_i)</span> performs <span>(m_i)</span> measurements labeled by <span>(x_iin [m_i])</span> on its system and gets <span>(o_i)</span> outcomes denoted by <span>(a_iin [o_i])</span>. The probabilities <span>(P(mathbf{{a}}|mathbf{{x}})=P(a_1,ldots ,a_{n+1}|x_1,ldots ,x_{n+1}))</span> form a tensor <span>(mathbf{{P}}=llbracket P(mathbf{{a}}|mathbf{{x}})rrbracket )</span>, called an <span>(n+1)</span>-partite correlation tensor (CT) over the index set <span>(Delta _{n+1}.)</span> Particularly, when each party performs just one fixed measurement (also called without input setting), the resulted CT is said to be an <span>(n+1)</span>-probability tensor (PT). In this work, we aim to characterize <i>n</i>-chain-locality of <span>(n+1)</span>-CTs based on an LN. By introducing D-<i>n</i>-chain-locality (resp. C-<i>n</i>-chain-locality) of an <span>(n+1)</span>-CT in light of the existence of a discrete (resp. continuous) <i>n</i>-chain-local hidden variable model, we prove that an <span>(n+1)</span>-CT <span>(mathbf{{P}})</span> is D-<i>n</i>-chain-local if and only if it can be realized physically by <i>n</i> shared separable states and a set of local POVMs. Importantly, we also prove that C-<i>n</i>-chain-locality and D-<i>n</i>-chain-locality of an <span>(n+1)</span>-CT are the same, so that we can call them <i>n</i>-chain-locality. The corresponding conclusions are obtained for <span>(n+1)</span>-PTs, and the relationships between D-<i>n</i>-chain-local (resp. C-<i>n</i>-chain-local) CTs and D-<i>n</i>-chain-local (resp. C-<i>n</i>-chain-local) PTs are established. Lastly, we prove that the set consisting of all <i>n</i>-chain-local CTs over <span>(Delta _{n+1})</span> forms a nonconvex compact subset in the Hilbert space of all real tensors over <span>(Delta _{n+1}.)</span></p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614991","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}