发布求助
文献互助 智能选刊 最新文献

Quantum Information Processing最新文献

筛选
英文 中文
New EAQEC codes from LCP of codes over finite non-chain rings
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-24 DOI: 10.1007/s11128-025-04687-9
Peng Hu, Xiusheng Liu
{"title":"New EAQEC codes from LCP of codes over finite non-chain rings","authors":"Peng Hu,&nbsp;Xiusheng Liu","doi":"10.1007/s11128-025-04687-9","DOIUrl":"10.1007/s11128-025-04687-9","url":null,"abstract":"<div><p>In this paper, we first study the linear complementary pair (abbreviated to LCP) of codes over finite non-chain rings <span>(R_{u,v,q}={mathbb {F}}_q+u{mathbb {F}}_q+ v{mathbb {F}}_q+uv{mathbb {F}}_q)</span> with <span>(u^2=u,v^2=v)</span>. Then we provide a method of constructing entanglement-assisted quantum error-correcting (abbreviated to EAQEC) codes from an LCP of codes of length <i>n</i> over <span>(R_{u,v,q})</span> using CSS. To enrich the variety of available EAQEC codes, some new EAQEC codes are given in the sense that their parameters are different from all the previous constructions.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143475167","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
Teleportation of unknown qubit via Star-type tripartite states
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-24 DOI: 10.1007/s11128-025-04680-2
Anushree Bhattacharjee, Abhijit Mandal, Sovik Roy
{"title":"Teleportation of unknown qubit via Star-type tripartite states","authors":"Anushree Bhattacharjee,&nbsp;Abhijit Mandal,&nbsp;Sovik Roy","doi":"10.1007/s11128-025-04680-2","DOIUrl":"10.1007/s11128-025-04680-2","url":null,"abstract":"<div><p>Eylee Jung <i>et.al</i>[1] had conjectured that <span>(P_{max}=frac{1}{2})</span> is a necessary and sufficient condition for the perfect two-party teleportation, and consequently, the Groverian measure of entanglement for the entanglement resource must be <span>(frac{1}{sqrt{2}})</span>. It is also known that prototype <i>W</i> state is not useful for standard teleportation. Agrawal and Pati[2] have successfully executed perfect (standard) teleportation with non-prototype <i>W</i> state. Aligned with the protocol mentioned in[2], we have considered here <i>Star</i> type tripartite states and have shown that perfect teleportation is suitable with such states. Moreover, we have taken the linear superposition of non-prototype <i>W</i> state and its spin-flipped version and shown that it belongs to <i>Star</i> class. Also, standard teleportation is possible with these states. It is observed that genuine tripartite entanglement is not necessary requirement for a state to be used as a channel for successful standard teleportation. We have also shown that these <i>Star</i> class states are <span>(P_{max}=frac{1}{4})</span> states and their Groverian entanglement is <span>(frac{sqrt{3}}{2})</span>, thus concluding that Jung conjecture is not a necessary condition.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143475168","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
Underwater continuous-variable quantum key distribution with faster-than-Nyquist scheme
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-20 DOI: 10.1007/s11128-025-04676-y
Xiaodong Wu, Duan Huang
{"title":"Underwater continuous-variable quantum key distribution with faster-than-Nyquist scheme","authors":"Xiaodong Wu,&nbsp;Duan Huang","doi":"10.1007/s11128-025-04676-y","DOIUrl":"10.1007/s11128-025-04676-y","url":null,"abstract":"<div><p>The transmission rate of traditional underwater discrete modulation continuous variable quantum key distribution (CV-QKD) scheme is limited by Nyquist criterion. Considering the limitation of Nyquist criterion and the large attenuation coefficient of the seawater channel, it is a challenge to enhance the secret key rate of the traditional underwater discrete modulation CV-QKD without relying on physical hardware. To solve this problem, we propose an underwater discrete modulation CV-QKD with faster-than-Nyquist (FTN) scheme; namely, a FTN signal generator is employed to make the discrete modulated signals obtain FTN rate at the sender’s side. Then an equalizer and a decoder are used to restore the sampled symbols to the original information by taking four typical seawater channels into account. The simulation results show that compared to the traditional Nyquist transmission scheme, the proposed protocol can effectively improve the secret key rate and underwater secure distance no matter what type of water is considered. These results indicate that the proposed scheme can break the constraints of Nyquist criterion, thus achieving a more efficient underwater discrete modulation CV-QKD scheme. Furthermore, we also consider the finite-size effect, which provides more practical results than those achieved in the asymptotic limit.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-025-04676-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143446625","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
Counterfactual controlled quantum dialogue protocol
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-20 DOI: 10.1007/s11128-025-04683-z
Rui-Chen Huang, Yu-Guang Yang, Guang-Bao Xu, Dong-Huan Jiang, Yi-Hua Zhou, Wei-Min Shi, Dan Li
{"title":"Counterfactual controlled quantum dialogue protocol","authors":"Rui-Chen Huang,&nbsp;Yu-Guang Yang,&nbsp;Guang-Bao Xu,&nbsp;Dong-Huan Jiang,&nbsp;Yi-Hua Zhou,&nbsp;Wei-Min Shi,&nbsp;Dan Li","doi":"10.1007/s11128-025-04683-z","DOIUrl":"10.1007/s11128-025-04683-z","url":null,"abstract":"<div><p>Quantum dialogue (QD) is a two-way quantum secure direct communication. Traditional QD protocols rely on transmitting photons through a quantum channel, which can introduce vulnerabilities. This paper presents a counterfactual controlled QD protocol based on entanglement swapping. By employing counterfactual quantum entanglement generation, the protocol facilitates controlled QD without requiring physical particle transfer or prior entanglement between remote participants. This approach significantly enhances the security of QD methods, providing robust resistance against all possible channel-based attacks and ensuring theoretical security.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-025-04683-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143446624","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
A (t, n) threshold quantum secret sharing with authentication based on single photons
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-18 DOI: 10.1007/s11128-025-04672-2
Jie Zhang, Jie Zhang, Sujuan Qin, Zhengping Jin
{"title":"A (t, n) threshold quantum secret sharing with authentication based on single photons","authors":"Jie Zhang,&nbsp;Jie Zhang,&nbsp;Sujuan Qin,&nbsp;Zhengping Jin","doi":"10.1007/s11128-025-04672-2","DOIUrl":"10.1007/s11128-025-04672-2","url":null,"abstract":"<div><p>Secret sharing has become a important cryptographic primitive and been widely used. And quantum secret sharing is a quantum approach to achieve secret sharing. The (<i>t</i>, <i>n</i>) threshold quantum secret sharing requires only t participants out of n to cooperate to recover the secret, which is more flexible than the (<i>n</i>, <i>n</i>) scheme. However, most (<i>t</i>, <i>n</i>) threshold schemes basically involve quantum entanglement, and the preparation of entangled states as well as entanglement swapping are relatively complex. In this paper, we propose a (<i>t</i>, <i>n</i>) threshold quantum secret sharing scheme with authentication by using the Lagrange interpolation polynomial based on single photons. Unlike other (<i>t</i>, <i>n</i>) threshold schemes, it does not involve entangled states or entanglement swapping. And the distributor authenticate the participants without revealing the full identity key. In addition, secret sharing is based on Lagrange interpolation polynomial implementation, allowing any t participants to recover the secret. Analysis shows that the scheme can resist external eavesdroppers and dishonest participants. Compared with other schemes, this scheme has the following advantages: (1) it is easy to implement; (2) the (<i>t</i>, <i>n</i>) threshold scheme increases the flexibility of the scheme; (3) the identity key can be reused. \u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143431086","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
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-18 DOI: 10.1007/s11128-025-04675-z
Moises Ponce, Rebekah Herrman, Phillip C. Lotshaw, Sarah Powers, George Siopsis, Travis Humble, James Ostrowski
{"title":"Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms","authors":"Moises Ponce,&nbsp;Rebekah Herrman,&nbsp;Phillip C. Lotshaw,&nbsp;Sarah Powers,&nbsp;George Siopsis,&nbsp;Travis Humble,&nbsp;James Ostrowski","doi":"10.1007/s11128-025-04675-z","DOIUrl":"10.1007/s11128-025-04675-z","url":null,"abstract":"<div><p>The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly <i>k</i>-regular graphs, as <i>k</i>-regular graphs on <i>n</i> vertices can be decomposed into a graph with at most <span>(frac{nk}{k+1})</span> vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. While this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143431057","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
Twin-field quantum key distribution based on particle swarm optimization algorithm
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-17 DOI: 10.1007/s11128-025-04681-1
Chang Liu, Yue Li, Haoyang Wang, Kaiyi Shi, ZhongQi Sun, Jiaao Li, Yujia Zhang, Duo Ma, Haiqiang Ma
{"title":"Twin-field quantum key distribution based on particle swarm optimization algorithm","authors":"Chang Liu,&nbsp;Yue Li,&nbsp;Haoyang Wang,&nbsp;Kaiyi Shi,&nbsp;ZhongQi Sun,&nbsp;Jiaao Li,&nbsp;Yujia Zhang,&nbsp;Duo Ma,&nbsp;Haiqiang Ma","doi":"10.1007/s11128-025-04681-1","DOIUrl":"10.1007/s11128-025-04681-1","url":null,"abstract":"<div><p>In the application of quantum key distribution, besides security being a necessary consideration, real-time performance is also very critical. Exhaustive traversal or local search algorithm has been commonly utilized in previous applications; however, these algorithms cannot satisfy the low latency requirement well. Therefore, in order to achieve efficient quantum key distribution parameter optimization and selection, the particle swarm optimization algorithm applied to twin-field quantum key distribution is proposed and compared with the results of the exhaustive traversal algorithm in this paper. The results show that particle swarm optimization algorithm can optimize the parameters to 15 decimal places; the algorithm performs well in terms of accuracy and robustness, and the parameter optimization accuracy is more than 99.5%. Meanwhile, the minimum running time is 5.68 s when guaranteeing the above values in terms of the accuracy of the optimization results.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143423174","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
Propagation of initial uncertainties to Arthurs–Kelly inequality
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-15 DOI: 10.1007/s11128-025-04678-w
Mi-Ra Hwang, Eylee Jung, DaeKil Park
{"title":"Propagation of initial uncertainties to Arthurs–Kelly inequality","authors":"Mi-Ra Hwang,&nbsp;Eylee Jung,&nbsp;DaeKil Park","doi":"10.1007/s11128-025-04678-w","DOIUrl":"10.1007/s11128-025-04678-w","url":null,"abstract":"<div><p>The generalized version of the Arthurs–Kelly inequality is derived when the initial state is a tripartite separable state. When each initial substate obeys the minimal uncertainty, the generalized version reduces to the well-known inequality, i.e., twice of the Heisenberg uncertainty. If the initial probe state is entangled, it is shown that the generalized version of the Arthurs–Kelly inequality can be violated. We show the violation explicitly by introducing a special example.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143423410","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
New constructions of approximately symmetric informationally complete positive operator-valued measures by character sums over Galois rings
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-14 DOI: 10.1007/s11128-025-04656-2
Gang Wang, You Gao, Mingyue Xie, Minyao Niu
{"title":"New constructions of approximately symmetric informationally complete positive operator-valued measures by character sums over Galois rings","authors":"Gang Wang,&nbsp;You Gao,&nbsp;Mingyue Xie,&nbsp;Minyao Niu","doi":"10.1007/s11128-025-04656-2","DOIUrl":"10.1007/s11128-025-04656-2","url":null,"abstract":"<div><p>In quantum information theory, symmetric informationally complete positive operator-valued measures (SIC-POVMs) are related to quantum state tomography, quantum cryptography and foundational studies. It is difficult to construct SIC-POVMs and remains unknown whether SIC-POVMs exist for infinitely dimension. Therefore, researchers have proposed the solution to construct approximately symmetric informationally complete positive operator-valued measures (ASIC-POVMs). This paper proposes a construction of ASIC-POVMs using character sums over Galois rings. The dimension of this ASIC-POVMs is <span>(q-1)</span>, where <i>q</i> is a prime power. Also, our constructions include partial results about ASIC-POVMs constructed by X. Cao et al (X. Cao, J. Mi and S. Xu: Two constructions of approximately symmetric informationally complete positive operator-valued measures. J. Math. Phys., 58(6), 062201 (2017)).</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143404195","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 novel design of high contrast ratio quantum C2NOT (Toffoli) gate based on photonic crystals
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-02-14 DOI: 10.1007/s11128-025-04673-1
Hadi Toozandehjani, Saeed Khosroabadi, Monireh Houshmand
{"title":"A novel design of high contrast ratio quantum C2NOT (Toffoli) gate based on photonic crystals","authors":"Hadi Toozandehjani,&nbsp;Saeed Khosroabadi,&nbsp;Monireh Houshmand","doi":"10.1007/s11128-025-04673-1","DOIUrl":"10.1007/s11128-025-04673-1","url":null,"abstract":"<div><p>In this paper, a novel C<sup>2</sup>NOT optical gate by using a hexagonal two-dimensional photonic crystal lattice has been introduced and analyzed. The presented structure consists of five waveguides with three inputs and three outputs. The input and output are connected by six ring resonators. By creating defects in the structure and removing the rod, ring resonators and waveguides have been created. The design was analyzed using both the finite difference time domain (FDTD) and the plane wave expansion (PWE) method. The PWE method was employed to determine the photonic band gap of the structure, while the FDTD method was used to analyze the behavior of electromagnetic fields within the photonic crystal lattice. The main advantage of this design is the high contrast ratio (contrast ratio of 13.1 dB in switching mode) and low footprint. Also, other advantages include the use of silicon with a refractive index of 3.46 in the background air, as well as increasing the maximum output power in the case of equal to one and reducing the minimum output power in the case of equal to zero presentation and design in the form of a hexagonal lattice, the use of linear materials and the use of linear defects, low delay and reduction of footprint compared to previous designs and the ability to be used in integrated circuits.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143404200","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信