Quantum Information Processing最新文献_第2页

A quantum moving target segmentation algorithm based on mean background modeling 基于平均背景建模的量子移动目标分割算法

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-11-04 DOI: 10.1007/s11128-024-04578-5

Lu Wang, Yuxiang Liu, Fanxu Meng, Zaichen Zhang, Xutao Yu

引用次数: 0

Syndrome decoding by quantum approximate optimization 通过量子近似优化实现同步解码

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-11-01 DOI: 10.1007/s11128-024-04568-7

Ching-Yi Lai, Kao-Yueh Kuo, Bo-Jyun Liao

{"title":"Syndrome decoding by quantum approximate optimization","authors":"Ching-Yi Lai, Kao-Yueh Kuo, Bo-Jyun Liao","doi":"10.1007/s11128-024-04568-7","DOIUrl":"10.1007/s11128-024-04568-7","url":null,"abstract":"<div><p>The syndrome decoding problem is known to be NP-complete. The goal of the decoder is to find an error of low weight that corresponds to a given syndrome obtained from a parity-check matrix. We use the quantum approximate optimization algorithm (QAOA) to address the syndrome decoding problem with elegantly designed reward Hamiltonians based on both generator and check matrices for classical and quantum codes. We evaluate the level-4 check-based QAOA decoding of the [7,4,3] Hamming code, as well as the level-4 generator-based QAOA decoding of the [[5,1,3]] quantum code. Remarkably, the simulation results demonstrate that the decoding performances match those of the maximum-likelihood decoding. Moreover, we explore the possibility of enhancing QAOA by introducing additional redundant clauses to a combinatorial optimization problem while keeping the number of qubits unchanged. Finally, we study QAOA decoding of degenerate quantum codes. Typically, conventional decoders aim to find a unique error of minimum weight that matches a given syndrome. However, our observations reveal that QAOA has the intriguing ability to identify degenerate errors of comparable weight, providing multiple potential solutions that match the given syndrome with comparable probabilities. This is illustrated through simulations of the generator-based QAOA decoding of the [[9,1,3]] Shor code on specific error syndromes.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 11","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142565921","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

The role of quantum resources in quantum energy teleportation 量子资源在量子能量远距离传输中的作用

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-30 DOI: 10.1007/s11128-024-04579-4

Hao Fan, Feng-Lin Wu, Lu Wang, Shu-Qian Liu, Si-Yuan Liu

引用次数: 0

Bayesian quantum phase estimation with fixed photon states 具有固定光子状态的贝叶斯量子相位估计

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-28 DOI: 10.1007/s11128-024-04576-7

Boyu Zhou, Saikat Guha, Christos N. Gagatsos

{"title":"Bayesian quantum phase estimation with fixed photon states","authors":"Boyu Zhou, Saikat Guha, Christos N. Gagatsos","doi":"10.1007/s11128-024-04576-7","DOIUrl":"10.1007/s11128-024-04576-7","url":null,"abstract":"<div><p>We consider a two-mode bosonic state with fixed photon number <span>(n in mathbb {N})</span>, whose upper and lower modes pick up a phase <span>(phi )</span> and <span>(-phi )</span>, respectively. We compute the optimal Fock coefficients of the input state, such that the mean square error (MSE) for estimating <span>(phi )</span> is minimized, while the minimum MSE is always attainable by a measurement. Our setting is Bayesian, i.e., we consider <span>(phi )</span> to be a random variable that follows a prior probability distribution function (PDF). Initially, we consider the flat prior PDF and we discuss the well-known fact that the MSE is not an informative tool for estimating a phase when the variance of the prior PDF is large. Therefore, we move on to study truncated versions of the flat prior in both single-shot and adaptive approaches. For our adaptive technique, we consider <span>(n=1)</span> and truncated prior PDFs. Each subsequent step utilizes as prior PDF the posterior probability of the previous step, and at the same time we update the optimal state and optimal measurement.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 11","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-024-04576-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142519044","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

Three-party quantum dialogue based on Grover’s algorithm with identity dual authentication 基于格罗弗算法的三方量子对话与身份双重认证

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-28 DOI: 10.1007/s11128-024-04570-z

Tian-Jiao Pan, Ri-Gui Zhou, Xiao-Xue Zhang

{"title":"Three-party quantum dialogue based on Grover’s algorithm with identity dual authentication","authors":"Tian-Jiao Pan, Ri-Gui Zhou, Xiao-Xue Zhang","doi":"10.1007/s11128-024-04570-z","DOIUrl":"10.1007/s11128-024-04570-z","url":null,"abstract":"<div><p>Based on the study of quantum dialogue and quantum identity authentication, this paper proposes an improved three-party quantum dialogue (3P-QD) with dual authentication of identity protocol based on quantum search algorithm (QSA) and bidirectional verification of user identity. The protocol utilizes two-particle states as quantum resources to achieve bidirectional transmission of information in the channel and uses the non-cloning theorem of quantum mechanics, which ensures that sequences of quantum bits can be reliably and securely guaranteed during transmission. The characteristics of the QSA in the two-qubit are applied to the target state search process of this 3P-QD protocol, which can accomplish the task of safely transferring two bits of information between the two communicating parties. In addition, in the communication, one of the fixed third party is not only a communicating party, but also acts as a controller for the other two parties. Meanwhile, in order to ensure the security and integrity of the communication, a bidirectional authentication step is added to the communication process, which well solves the problem of eavesdropping. Based on the above features, compared with the existing protocols, this protocol has better advantages.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 11","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142519045","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

Reducing the effect of noise on quantum gate design by linear filtering 通过线性滤波减少噪声对量子门设计的影响

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-26 DOI: 10.1007/s11128-024-04575-8

Kumar Gautam

引用次数: 0

A novel image classification framework based on variational quantum algorithms 基于变分量子算法的新型图像分类框架

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-23 DOI: 10.1007/s11128-024-04566-9

Yixiong Chen

{"title":"A novel image classification framework based on variational quantum algorithms","authors":"Yixiong Chen","doi":"10.1007/s11128-024-04566-9","DOIUrl":"10.1007/s11128-024-04566-9","url":null,"abstract":"<div><p>Image classification is a crucial task in machine learning with widespread practical applications. The existing classical framework for image classification typically utilizes a global pooling operation at the end of the network to reduce computational complexity and mitigate overfitting. However, this operation often results in a significant loss of information, which can affect the performance of classification models. To overcome this limitation, we introduce a novel image classification framework that leverages variational quantum algorithms (VQAs) hybrid approaches combining quantum and classical computing paradigms within quantum machine learning. The major advantage of our framework is the elimination of the need for the global pooling operation at the end of the network. In this way, our approach preserves more discriminative features and fine-grained details in the images, which enhances classification performance. Additionally, employing VQAs enables our framework to have fewer parameters than the classical framework, even in the absence of global pooling, which makes it more advantageous in preventing overfitting. We apply our method to different state-of-the-art image classification models and demonstrate the superiority of the proposed quantum architecture over its classical counterpart through a series of state vector simulation experiments on public datasets. Our experiments show that the proposed quantum framework achieves up to a 9.21% increase in accuracy and up to a 15.79% improvement in F1 score, compared to the classical framework. Additionally, we explore the impact of shot noise on our method through shot-based simulation and find that increasing the number of measurements does not always lead to better results. Selecting an appropriate number of measurements can yield optimal results, even surpassing those obtained from state vector simulation.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-024-04566-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142519085","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

Quantum search algorithm for binary constant weight codes 二进制恒权码的量子搜索算法

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-23 DOI: 10.1007/s11128-024-04573-w

Kein Yukiyoshi, Naoki Ishikawa

{"title":"Quantum search algorithm for binary constant weight codes","authors":"Kein Yukiyoshi, Naoki Ishikawa","doi":"10.1007/s11128-024-04573-w","DOIUrl":"10.1007/s11128-024-04573-w","url":null,"abstract":"<div><p>A binary constant weight code is a type of error-correcting code with a wide range of applications. The problem of finding a binary constant weight code has long been studied as a combinatorial optimization problem in coding theory. In this paper, we propose a quantum search algorithm for binary constant weight codes. Specifically, the search problem is formulated as a polynomial binary optimization problem and Grover adaptive search is used for providing the quadratic speedup. Focusing on the inherent structure of the problem, we derive an upper bound on the minimum of the objective function value and a lower bound on the exact number of solutions. By exploiting these two bounds, we successfully reduced the constant overhead of the algorithm, although the overall query complexity remains exponential due to the NP-complete nature of the problem. In our algebraic analysis, it was found that this proposed algorithm is capable of reducing the number of required qubits, thus enhancing the feasibility. Additionally, our simulations demonstrated that it reduces the average number of classical iterations by 63% as well as the average number of total Grover rotations by 31%. The proposed approach may be useful for other quantum search algorithms and optimization problems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-024-04573-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142519087","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

Locally distinguishing tripartite strongly nonlocal quantum states with entanglement resource 局部区分具有纠缠资源的三方强非局域量子态

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-23 DOI: 10.1007/s11128-024-04558-9

Xue-Jin Wei, Zi-Shuo Xie, Yong-Le Li, Zhi-Chao Zhang

{"title":"Locally distinguishing tripartite strongly nonlocal quantum states with entanglement resource","authors":"Xue-Jin Wei, Zi-Shuo Xie, Yong-Le Li, Zhi-Chao Zhang","doi":"10.1007/s11128-024-04558-9","DOIUrl":"10.1007/s11128-024-04558-9","url":null,"abstract":"<div><p>Recently, Yuan et al. (Phys Rev A 102:042228, 2020) construct a set of strongly nonlocal orthogonal product states in <span>(mathbb {C}^{d} otimes mathbb {C}^{d} otimes mathbb {C}^{d})</span>, where <span>(d ge 3)</span>. Then, it is interesting how much entanglement resource is sufficient to locally distinguish these states, and very little is known about entanglement-assisted distinguishing strongly nonlocal quantum states. In this paper, we first design one entanglement-assisted state discrimination protocols for strongly nonlocal orthogonal product states in <span>(mathbb {C}^{4} otimes mathbb {C}^{4} otimes mathbb {C}^{4})</span> quantum system. Then, in the same way, we give how much entanglement resource is sufficient to locally distinguish these strongly nonlocal orthogonal product states in <span>(mathbb {C}^{5} otimes mathbb {C}^{5} otimes mathbb {C}^{5})</span>, <span>(mathbb {C}^{6} otimes mathbb {C}^{6} otimes mathbb {C}^{6})</span> quantum systems. Finally, we propose a conjecture that less entanglement resource than quantum teleportation can be used to locally distinguish these strongly nonlocal quantum states in <span>(mathbb {C}^{d} otimes mathbb {C}^{d} otimes mathbb {C}^{d})</span>, where <span>(d ge 3)</span>. The above results can illustrate the important role of entanglement resource in locally distinguishing orthogonal quantum states and also reveal the phenomenon of less nonlocality with more entanglement.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142519086","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

Geometrical bounds on irreversibility under correlated noise channels 相关噪声信道下不可逆性的几何边界

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-10-23 DOI: 10.1007/s11128-024-04557-w

Jia-Kun Xu, Wen-Jie Yu, Wan-Li Yang, Jia-Bin You

{"title":"Geometrical bounds on irreversibility under correlated noise channels","authors":"Jia-Kun Xu, Wen-Jie Yu, Wan-Li Yang, Jia-Bin You","doi":"10.1007/s11128-024-04557-w","DOIUrl":"10.1007/s11128-024-04557-w","url":null,"abstract":"<div><p>Irreversible entropy production (IEP) plays an important role in the field of quantum thermodynamics. In the present work, we investigate the geometrical bounds of IEP in nonequilibrium thermodynamics by exemplifying a two-qubit system coupled to three noise channels, including amplitude damping channel, phase damping channel, and depolarizing channel, respectively. We find that the geometrical bounds of the IEP always shift in an identical way, namely, only the upper bound becomes tighter under phase damping channel and depolarizing channel, respectively, in the presence of correlation effect of the noise channel. However, both the lower bound and the upper bound turn to be tighter in the situation of amplitude damping channel in the presence of correlation effect of the noise channel. By harvesting the benefits of correlation effect of noise channel and the entanglement between two qubits, the values of the IEP, quantifying the degree of thermodynamic irreversibility, could be suppressed in a controllable manner. Our results are expected to deepen our understanding of the nature of irreversibility under ambient conditions.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142519084","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