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

Quantum Information Processing最新文献

筛选
英文 中文
Enhanced high-dimensional teleportation in correlated amplitude damping noise by weak measurement and environment-assisted measurement 通过弱测量和环境辅助测量增强相关振幅阻尼噪声的高维隐形传态
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-01-06 DOI: 10.1007/s11128-024-04640-2
Xing Xiao, Tian-Xiang Lu, Yan-Ling Li
{"title":"Enhanced high-dimensional teleportation in correlated amplitude damping noise by weak measurement and environment-assisted measurement","authors":"Xing Xiao,&nbsp;Tian-Xiang Lu,&nbsp;Yan-Ling Li","doi":"10.1007/s11128-024-04640-2","DOIUrl":"10.1007/s11128-024-04640-2","url":null,"abstract":"<div><p>High-dimensional teleportation provides various benefits in quantum networks and repeaters, but all these advantages rely on the high-quality distribution of high-dimensional entanglement over a noisy channel. It is essential to consider correlation effects when two entangled qutrits travel sequentially through the same channel. In this paper, we present two strategies for enhancing qutrit teleportation in correlated amplitude damping (CAD) noise by weak measurement (WM) and environment-assisted measurement (EAM). The fidelity of both approaches has been dramatically improved due to the probabilistic nature of WM and EAM. We have observed that the correlation effects of CAD noise result in an increase in the probability of success. A comparison has demonstrated that the EAM scheme usually outperforms the WM scheme in regard to fidelity. Our research expands the capabilities of WM and EAM as quantum techniques to combat CAD noise in qutrit teleportation, facilitating the development of advanced quantum technologies in high-dimensional systems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938864","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
Universal topological quantum computing via double-braiding in SU(2) Witten–Chern–Simons theory 基于SU(2) witten - chen - simons理论的双编织通用拓扑量子计算
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-01-06 DOI: 10.1007/s11128-024-04633-1
Adrian L. Kaufmann, Shawn X. Cui
{"title":"Universal topological quantum computing via double-braiding in SU(2) Witten–Chern–Simons theory","authors":"Adrian L. Kaufmann,&nbsp;Shawn X. Cui","doi":"10.1007/s11128-024-04633-1","DOIUrl":"10.1007/s11128-024-04633-1","url":null,"abstract":"<div><p>We study the problem of universality in the anyon model described by the <i>SU</i>(2) Witten–Chern–Simons theory at level <i>k</i>. A classic theorem of Freedman–Larsen–Wang states that for <span>(k ge 3, k ne 4)</span>, braiding of the anyons of topological charge 1/2 is universal for topological quantum computing. For the case of one qubit, we prove a stronger result that double-braiding of such anyons alone is already universal.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925764","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
Analytic formulas for quantum discord of special families of N-qubit states n -量子位态特殊族的量子不谐解析公式
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-01-06 DOI: 10.1007/s11128-024-04625-1
Jianming Zhou, Xiaoli Hu, Honglian Zhang, Naihuan Jing
{"title":"Analytic formulas for quantum discord of special families of N-qubit states","authors":"Jianming Zhou,&nbsp;Xiaoli Hu,&nbsp;Honglian Zhang,&nbsp;Naihuan Jing","doi":"10.1007/s11128-024-04625-1","DOIUrl":"10.1007/s11128-024-04625-1","url":null,"abstract":"<div><p>Quantum discord, a key indicator of nonclassical correlations in bipartite systems, has been recently extended to multipartite scenarios [Phys. Rev. Lett. 2020, 124:110401]. We present exact analytic formulas for the quantum discord of special families of N-qubit states, including generalized class of GHZ states. Our formulations span 2, 3, 4<i>n</i>, <span>(4n+1)</span>, <span>(4n+2)</span>, and <span>(4n+3)</span>-qubit configurations where <span>(nin 1, 2, ldots )</span>, which refine the assessment of quantum correlations and provide an analytical tool in quantum computation. Moreover, we uncover a “discord freezing” in even-qubit systems under phase flip decoherence which provides a means for preserving quantum coherence in environmental perturbations.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925765","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
Asymmetric bidirectional controlled assisted cloning 非对称双向控制辅助克隆
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-01-03 DOI: 10.1007/s11128-024-04634-0
Nueraminaimu Maihemuti, Jiayin Peng, Yimamujiang Aisan, Jiangang Tang
{"title":"Asymmetric bidirectional controlled assisted cloning","authors":"Nueraminaimu Maihemuti,&nbsp;Jiayin Peng,&nbsp;Yimamujiang Aisan,&nbsp;Jiangang Tang","doi":"10.1007/s11128-024-04634-0","DOIUrl":"10.1007/s11128-024-04634-0","url":null,"abstract":"<div><p>We first construct a seven-qubit maximally entangled state by using Hadamard gates and controlled-NOT gates, and its method is enlightening for generating other quantum entanglements. Then, using this entangled state as a quantum channel, we propose a bidirectional scheme for cloning an unknown two- and single-qubit states with help of the state preparer and the permission of the controller. The first stage of this scheme requires teleportation, where Alice transmits an unknown two-qubit state to Bob; at the same time, Bob conveys an unknown single-qubit state to Alice under the concession of the controller. In the second stage, based on the results of the preparer’s two- and single-qubit measurements, Alice is able to clone an original unknown two-particle state and its orthogonal complementary state; meanwhile, Bob can also clone an original unknown single-particle state and its orthogonal complementary state. By replacing the above unknown two-qubit state with an arbitrary unknown two-qubit state, we obtain a more general asymmetric controlled scheme for bidirectional assisted cloning. Furthermore, by replacing the above quantum channel with a seven-qubit non-maximally entangled state and replacing the Bell-state measurement in the aforementioned schemes with a generalized Bell-state measurement, we provide two extension schemes of the above two schemes. At last, by analyzing the measurement ways and adding the number of preparers and controllers, we obtain several evolutionary ideas for the proposed scheme, which not only displays the synchronization and flexibility of multi-party assisted cloning, but also provides multiple application scenarios for quantum communication.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925725","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
Atom graph, partial Boolean algebra and quantum contextuality 原子图，部分布尔代数和量子上下文
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2025-01-02 DOI: 10.1007/s11128-024-04632-2
Songyi Liu, Yongjun Wang, Baoshan Wang, Jian Yan, Heng Zhou
{"title":"Atom graph, partial Boolean algebra and quantum contextuality","authors":"Songyi Liu,&nbsp;Yongjun Wang,&nbsp;Baoshan Wang,&nbsp;Jian Yan,&nbsp;Heng Zhou","doi":"10.1007/s11128-024-04632-2","DOIUrl":"10.1007/s11128-024-04632-2","url":null,"abstract":"<div><p>Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving that (i) the partial Boolean algebras for quantum systems are determined by their atom graphs; (ii) the states on atom graphs can be extended uniquely to the partial Boolean algebras, and (iii) each exclusivity graph is an induced graph of an atom graph. (i) and (ii) show that the finite dimensional quantum systems are uniquely determined by their atom graphs. which proves the reasonability of graphs as the models of quantum experiments. (iii) establishes a connection between atom graphs and exclusivity graphs, and introduces a method to express the exclusivity experiments more precisely. We also present a general and parametric description for Kochen–Specker theorem based on graphs, which gives a type of non-contextuality inequality for KS contextuality.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142913048","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
Quantum key recovery under plaintext-checking attacks on post-quantum cryptosystems 后量子密码系统明文检查攻击下的量子密钥恢复
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2024-12-30 DOI: 10.1007/s11128-024-04629-x
Yaru Wang, Haodong Jiang, Zhi Ma
{"title":"Quantum key recovery under plaintext-checking attacks on post-quantum cryptosystems","authors":"Yaru Wang,&nbsp;Haodong Jiang,&nbsp;Zhi Ma","doi":"10.1007/s11128-024-04629-x","DOIUrl":"10.1007/s11128-024-04629-x","url":null,"abstract":"<div><p>Coping with the potential security threats arising from quantum computing, American National Institute of Standards and Technology (NIST) recently launched a post-quantum cryptography (PQC) standardization project with the goal to standardize new next-generation public-key cryptosystems. In particular, many NIST-PQC cryptosystems follow the same meta-cryptosystem. At EUROCRYPT 2019, Băetu et al. analyzed the security of meta-cryptosystem under key reuse by mounting a classical key recovery under plaintext-checking attacks (KR-PCA) and a quantum key recovery under chosen-ciphertext attacks (KR-CCA). Their results showed that quantum KR-CCA is much more efficient than classical KR-PCA. But, KR-PCA is more threatening than KR-CCA since KR-PCA just needs plaintext-checking oracle that tells whether a given ciphertext correctly decrypts to a given plaintext, while KR-CCA requires a full decryption oracle. This paper proposes a quantum KR-PCA algorithm and shows that quantum KR-PCA still outperforms classical KR-PCA. In detail, firstly, we transform the noise learning problem (the core to implement KR-PCA) into an ordered search problem. Based on the quantum algorithm for solving the ordered search problem, we solve the noise learning problems using quantum algorithms. Then, based on this quantum algorithm, we develop a quantum KR-PCA for meta-cryptosystem under key reuse, where the number of the oracle queries is about one third of the one required by classical KR-PCA. In addition, we also show that such an improvement cannot be further significantly improved for quantum adversaries. Finally, applying to 8 concrete NIST-PQC cryptosystems, we show that our quantum KR-PCA will save at least half of the running times and the oracle queries.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889949","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
Spectral purity of telecom photon pairs from on-chip LNOI waveguides: comparison between analytical and numerical calculations 片上LNOI波导中电信光子对的光谱纯度：解析计算和数值计算的比较
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2024-12-30 DOI: 10.1007/s11128-024-04628-y
Vikash Kumar Yadav, Vivek Venkataraman, Joyee Ghosh
{"title":"Spectral purity of telecom photon pairs from on-chip LNOI waveguides: comparison between analytical and numerical calculations","authors":"Vikash Kumar Yadav,&nbsp;Vivek Venkataraman,&nbsp;Joyee Ghosh","doi":"10.1007/s11128-024-04628-y","DOIUrl":"10.1007/s11128-024-04628-y","url":null,"abstract":"<div><p>The spectral correlation information of photon pairs generated from a quantum light source, based on nonlinear optical processes, is beneficial in determining the potential application of such sources. Here we outline an explicit procedure to perform the Schmidt decomposition in order to compute the spectral correlation between photon pairs generated in a spontaneous parametric down-conversion (SPDC) process. Hermite-Gaussian (HG) functions are used as the basis to decompose the biphoton state and simple analytical formulae for the Schmidt mode coefficients (eigenvalues) are derived. The accuracy of our analytical formulation is verified against two separate sets of published results. We also present an experimentally feasible lithium niobate on insulator (LNOI) ridge waveguide to generate spectrally pure telecom (1560 nm) photons (purity <span>(sim )</span> 90<span>(%)</span> without filtering) by utilizing degenerate type-II SPDC. Further, the waveguide can be used in either the Sagnac or single-pass configuration with post-selection to generate polarization entanglement along with spectral purity simultaneously. The comparison between our analytical expression of Schmidt decomposition and the exact numerical solution is carried out by extensively studying the effect of pump bandwidth and waveguide length on Schmidt number and spectral purity. The results highlight that, in general, the analytical formula slightly overestimates the purity, but the two methods converge if the contribution of side lobes arising from the phase-matching function is minimized. Finally, we study the effect of scattering losses (resulting from the fabrication imperfections) on the spectral purity of the biphoton state. Our proposed on-chip source can have applications in quantum communication, photonic quantum computing, quantum information processing, and quantum metrology.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889948","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
Limitation on the capacity of arbitrary bipartite pure entangled states for the unambiguous transmission of classical information 经典信息无二义传输中任意二部纯纠缠态容量的限制
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2024-12-27 DOI: 10.1007/s11128-024-04626-0
Lvjun Li
{"title":"Limitation on the capacity of arbitrary bipartite pure entangled states for the unambiguous transmission of classical information","authors":"Lvjun Li","doi":"10.1007/s11128-024-04626-0","DOIUrl":"10.1007/s11128-024-04626-0","url":null,"abstract":"<div><p>The capacity of quantum states to send information is a fundamental and intriguing issue in quantum communication theory. This study explores a scenario where Alice intends to transmit <i>n</i> bits of classical information to Bob by sending <i>m</i> qudits, using an arbitrary bipartite pure entangled state with <i>E</i> qudits as the shared resource. We employ the unambiguous discrimination strategy in decoding and establish an upper bound on the success probability, which extends the findings of a previous study (Li in Phys Rev A 85:052304, 2012).</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-024-04626-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889566","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
High-efficiency reconciliation for continuous-variable quantum key distribution using MGC-LDPC codes 基于MGC-LDPC码的连续变量量子密钥分配高效对调
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2024-12-27 DOI: 10.1007/s11128-024-04623-3
Siyu Jia, Han Hai, Xue-Qin Jiang, Shahid Mumtaz, Evangelos K. Markakis, Peng Huang
{"title":"High-efficiency reconciliation for continuous-variable quantum key distribution using MGC-LDPC codes","authors":"Siyu Jia,&nbsp;Han Hai,&nbsp;Xue-Qin Jiang,&nbsp;Shahid Mumtaz,&nbsp;Evangelos K. Markakis,&nbsp;Peng Huang","doi":"10.1007/s11128-024-04623-3","DOIUrl":"10.1007/s11128-024-04623-3","url":null,"abstract":"<div><p>Increasing the reconciliation efficiency and decreasing the frame error rate (FER) during the reconciliation for continuous-variable quantum key distribution (CV-QKD) can improve the secret key rate of CV-QKD. In this paper, we introduce matryoshka globally coupled low-density parity-check (MGC-LDPC) codes with high error correction performance into CV-QKD to increase the reconciliation efficiency. To decrease the FER, we propose an optimization method for MGC-LDPC codes during the reconciliation, thus improving the secret key rate of CV-QKD. Simulation experiments show that the reconciliation efficiency of CV-QKD can be improved to 98.39% by using the optimized MGC-LDPC codes, and the secure transmission distance can be extended to 190 km.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889565","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
Optimal-order Trotter–Suzuki decomposition for quantum simulation on noisy quantum computers 噪声量子计算机上量子模拟的最优阶Trotter-Suzuki分解
IF 2.2 3区 物理与天体物理
Quantum Information Processing Pub Date : 2024-12-27 DOI: 10.1007/s11128-024-04627-z
A. A. Avtandilyan, W. V. Pogosov
{"title":"Optimal-order Trotter–Suzuki decomposition for quantum simulation on noisy quantum computers","authors":"A. A. Avtandilyan,&nbsp;W. V. Pogosov","doi":"10.1007/s11128-024-04627-z","DOIUrl":"10.1007/s11128-024-04627-z","url":null,"abstract":"<div><p>The potential of employing higher orders of the Trotter–Suzuki decomposition of the evolution operator for more effective simulations of quantum systems on a noisy quantum computer is explored. By examining the transverse-field Ising model and the XY model, it is demonstrated that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous. This form of Trotterization yields a global minimum of the overall simulation error, comprising both the mathematical error of Trotterization and the physical error arising from gate execution. \u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889645","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学术官方微信