Quantum Information Processing最新文献_第2页

Investigations of quantum maps on photonic polarization qubits 光子偏振量子比特上的量子映射研究

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-05-02 DOI: 10.1007/s11128-026-05192-3

Bibia Alif, Sajeev Damodarakurup, B. Swathy Krishna, Ram Soorat

{"title":"Investigations of quantum maps on photonic polarization qubits","authors":"Bibia Alif, Sajeev Damodarakurup, B. Swathy Krishna, Ram Soorat","doi":"10.1007/s11128-026-05192-3","DOIUrl":"10.1007/s11128-026-05192-3","url":null,"abstract":"<div><p>The challenges faced in quantum computing and communication protocols are mostly due to decoherence, which is the loss of superposition in qubits by interacting with decohering environments. Quantum process tomography offers a method to comprehend and reconstruct quantum processes or maps by obtaining a process matrix. Single photon polarization qubits are widely used in quantum computation and communication protocols and are vulnerable to decoherence from an optical channel with birefringence. We described a model of a single photon qubit in a decohering birefringent optical communication channel environment and numerically reconstructed the various output density matrices needed for quantum process tomography. Using such density matrices, we reconstructed the process matrix for various decoherence conditions from the optical quantum communication channel. We studied the evolution of various elements in the quantum process matrix with respect to varying degrees of decoherence in the quantum communication channel. We observed distinct variations in the process matrix elements with respect to various degrees of decoherence for specific decoherence conditions. This indicates the potential applications of such techniques for the characterization of decoherence from such qubit environment interactions.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 5","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147796826","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}

引用次数: 0

High-efficiency semi-quantum three-party identity authentication: a GHZ-like state and chaotic sequence-based scheme 高效半量子三方身份认证：类ghz状态和基于混沌序列的方案

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-29 DOI: 10.1007/s11128-026-05174-5

Ningning Xu, HaoCheng Kan, Peng Guo, Quanying Fan, Hongfeng Zhu

{"title":"High-efficiency semi-quantum three-party identity authentication: a GHZ-like state and chaotic sequence-based scheme","authors":"Ningning Xu, HaoCheng Kan, Peng Guo, Quanying Fan, Hongfeng Zhu","doi":"10.1007/s11128-026-05174-5","DOIUrl":"10.1007/s11128-026-05174-5","url":null,"abstract":"<div><p>In three-party communication scenarios, ensuring data security and integrity during transmission while addressing the issue that ordinary users cannot afford expensive quantum devices remains a critical challenge. To tackle this problem, this paper proposes a semi-quantum key agreement protocol based on GHZ-like states and chaotic sequences, wherein key agreement is only executed after the completion of identity authentication. The core innovation of this scheme lies in the implementation of mutual authentication among the three parties: the quantum server performs explicit authentication on the participants, while the participants themselves conduct implicit authentication for information transmission. Specifically, authentication can be achieved by comparing the information sent by the quantum server with that transmitted by another participant, which significantly enhances the security of interactive processes. Furthermore, chaotic sequences are incorporated into the key generation phase, which not only improves the security of the shared key but also reduces the consumption of quantum resources. Security analysis demonstrates that the proposed protocol can effectively resist typical attacks, including reflection attacks, intercept-resend attacks, and impersonation attacks. Finally, a comparative analysis of efficiency with other existing schemes is conducted, and the results show that the communication efficiency of the proposed protocol reaches up to 16.7%.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 5","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147797145","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}

引用次数: 0

Recurrence criteria for reducible homogeneous open quantum walks on the line and on the grid 可约齐次开放量子在行和网格上行走的递归准则

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-29 DOI: 10.1007/s11128-026-05180-7

Newton Loebens

{"title":"Recurrence criteria for reducible homogeneous open quantum walks on the line and on the grid","authors":"Newton Loebens","doi":"10.1007/s11128-026-05180-7","DOIUrl":"10.1007/s11128-026-05180-7","url":null,"abstract":"<div><p>In this paper, we study the recurrence of Open Quantum Walks induced by finite-dimensional coins on the line (<span>(mathbb {Z})</span>) and on the grid (<span>(mathbb {Z}^2)</span>). Two versions are considered: discrete-time open quantum walks (OQW) and continuous-time open quantum walks (CTOQW). We present three distinct recurrence criteria for OQWs on <span>(mathbb {Z})</span>, each adapted to different types of coins. The first criterion applies to coins whose auxiliary map has a unique invariant state, resulting in the first recurrence criterion for Lazy OQWs. The second applies to Lazy OQWs of dimension 2, where we provide a complete characterization of the recurrence for this low-dimensional case. The third one presents a general criterion for finite-dimensional coins in the non-lazy case, which generalizes several of the previously known results for OQWs on <span>(mathbb {Z})</span>. Also, we present a general recurrence criterion for OQWs on <span>(mathbb {Z}^2)</span> via the open quantum jump chain, obtained from a recurrence criterion for CTOQWs on <span>(mathbb {Z}^2)</span>.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 5","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05180-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147797146","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}

引用次数: 0

Subspace state transfer in coined quantum walks 虚拟量子行走中的子空间状态转移

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-27 DOI: 10.1007/s11128-026-05172-7

Yichi Xu, Hanmeng Zhan

引用次数: 0

Optimal quantum circuit design via unitary neural networks 基于酉神经网络的量子电路优化设计

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-27 DOI: 10.1007/s11128-026-05170-9

M. Zomorodi, H. Amini, M. Abbaszadeh, J. Sohrabi, V. Salari, P. Plawiak

引用次数: 0

Polar wiretap coding for practical quantum confidentiality 极地窃听编码实用量子保密性

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-27 DOI: 10.1007/s11128-026-05177-2

Piotr Zawadzki, Anna Zawadzka, Alicja Zawadzka

引用次数: 0

Noise-induced sector-resolved entropy dynamics of three qubit states under Ornstein–Uhlenbeck and random telegraph noise 在Ornstein-Uhlenbeck和随机电报噪声下，噪声诱导的三个量子位态的扇区分辨熵动力学

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-27 DOI: 10.1007/s11128-026-05176-3

Wajid Joyia, Asif Ilyas, Amaria Javed

{"title":"Noise-induced sector-resolved entropy dynamics of three qubit states under Ornstein–Uhlenbeck and random telegraph noise","authors":"Wajid Joyia, Asif Ilyas, Amaria Javed","doi":"10.1007/s11128-026-05176-3","DOIUrl":"10.1007/s11128-026-05176-3","url":null,"abstract":"<div><p>We investigate the dynamics of noise-induced sector resolved entropy (NISRE) and total entropy (decoherence) in multipartite qubit systems subjected to classical Ornstein–Uhlenbeck (OU) and Random Telegraph Noise (RTN). The analysis focuses on three qubit systems initially prepared in GHZ, W, and mixed states, considering independent, mixed, and common system environment coupling configurations. Under Gaussian OU noise, both quantities increase monotonically and approach stationary saturation values, consistent with effectively Markovian dynamics. In contrast, non-Gaussian RTN induces pronounced oscillations and partial revivals, reflecting non-Markovian memory effects and information backflow from the environment. A comparative analysis shows that GHZ states exhibit enhanced robustness against noise-induced degradation compared to W states, while mixed environment couplings provide an intermediate behavior between independent and common environments. To further analyze the difference between NISRE and total entropy, we introduce the quantity <span>(Delta (t) = S_q^N(t) - D(t))</span>, which captures the contribution of sector-wise entropy redistribution. We find that <span>(Delta (t))</span> remains positive for independent environments, negative for common environments, and exhibits a time-dependent sign change in mixed environments. This behavior reflects the interplay between correlated and uncorrelated noise components and highlights the role of environmental correlations in governing sector resolved information flow. Extending the analysis to four and five qubit systems, we observe that increasing the number of qubits accelerates coherence loss and suppresses non-Markovian revival amplitudes, indicating a weakening of memory effects in larger finite systems. Overall, our results show that sector resolved analysis provides additional insight into how environmental correlations influence entropy redistribution in multipartite open quantum systems.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 5","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147796635","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}

引用次数: 0

A new controlled bidirectional circular scheme for remote preparation in noisy environment 一种用于噪声环境下远程制备的双向可控循环新方案

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-27 DOI: 10.1007/s11128-026-05163-8

Yi-Ru Sun, Haibo Hong, Jun Shao, Yi-Xian Yang

引用次数: 0

On the convergence of Markov chain distribution within quantum walk circuit subspace 量子行走电路子空间中马尔可夫链分布的收敛性

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-27 DOI: 10.1007/s11128-026-05158-5

Aingeru Ramos, Jose A. Pascual, Javier Navaridas, Ivan Coluzza

{"title":"On the convergence of Markov chain distribution within quantum walk circuit subspace","authors":"Aingeru Ramos, Jose A. Pascual, Javier Navaridas, Ivan Coluzza","doi":"10.1007/s11128-026-05158-5","DOIUrl":"10.1007/s11128-026-05158-5","url":null,"abstract":"<div><p>Markov chain Monte Carlo (MCMC) methods are a family of algorithms designed to approximate probability distributions that are otherwise intractable to sample from directly. However, as the dimensionality and complexity of the target distribution increase, the convergence of these methods can slow considerably, demanding substantial computational resources. In this context, quantum computing emerges as a promising framework to address this limitation, with different quantum circuit constructions serving as quantum MCMC methods. In this work, we present a quantum circuit based on the discrete quantum walk (DQW) algorithm that implements the algorithmic steps of the Metropolis–Hastings method, encoding the target distribution in a position quantum register. The circuit incorporates auxiliary registers to compute and discretize the acceptance probability, and uses controlled operations to modulate the walker’s evolution accordingly. Simulation results show that the marginal probability distribution encoded in the position register converges asymptotically toward the discretized target distribution for both single and multimodal distributions. We further analyze the effect of circuit parameters on convergence behavior and approximation quality, refining the construction by enabling the evaluation of multiple candidate moves per iteration, therefore reducing the number of iterations required for convergence within our implementation. Finally, we provide a qualitative comparison of our approach with related quantum MCMC methods, namely Szegedy’s quantum walk and QAOA, and discuss structural differences as well as the potential incorporation of adaptive proposal techniques within the proposed circuit framework.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 5","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05158-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147796634","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}

引用次数: 0

Generalized quantum Hadamard test for machine learning 机器学习的广义量子Hadamard检验

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2026-04-21 DOI: 10.1007/s11128-026-05164-7

Vivek Mehta, Arghya Choudhury, Utpal Roy

引用次数: 0