Quantum Information Processing最新文献

ANN-enhanced detection of multipartite entanglement in a three-qubit NMR quantum processor

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-03-01 DOI: 10.1007/s11128-025-04696-8

Vaishali Gulati, Shivanshu Siyanwal, Arvind, Kavita Dorai

{"title":"ANN-enhanced detection of multipartite entanglement in a three-qubit NMR quantum processor","authors":"Vaishali Gulati, Shivanshu Siyanwal,  Arvind, Kavita Dorai","doi":"10.1007/s11128-025-04696-8","DOIUrl":"10.1007/s11128-025-04696-8","url":null,"abstract":"<div>We use an artificial neural network (ANN) model to identify the entanglement class of an experimentally generated three-qubit pure state drawn from one of the six inequivalent classes under stochastic local operations and classical communication (SLOCC). The ANN model is also able to detect the presence of genuinely multipartite entanglement (GME) in the state. We apply data science techniques to reduce the dimensionality of the problem, which corresponds to a reduction in the number of required density matrix elements to be computed. The ANN model is first trained on a simulated dataset containing randomly generated states and is later tested and validated on noisy experimental three-qubit states cast in the canonical form and generated on a nuclear magnetic resonance (NMR) quantum processor. We benchmark the ANN model via support vector machines (SVMs) and K-nearest neighbor (KNN) algorithms and compare the results of our ANN-based entanglement classification with existing three-qubit SLOCC entanglement classification schemes such as 3-tangle and correlation tensors. Our results demonstrate that the ANN model can perform GME detection and SLOCC class identification with high accuracy, using a priori knowledge of only a few density matrix elements as inputs. Since the ANN model works well with a reduced input dataset, it is an attractive method for entanglement classification in real-life situations with limited experimental data sets.</div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143527655","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

Applications of disentropy in the analysis of randomness generated by quantum random number generators

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-28 DOI: 10.1007/s11128-025-04694-w

S. T. de Oliveira, J. S. de Andrade, G. L. de Oliveira, R. V. Ramos

引用次数: 0

Quantum coherence and weak values based on rank-1 POVMs

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-28 DOI: 10.1007/s11128-025-04685-x

Ouyang Yu, Zhengli Chen, Fangguo Ren, Feier Han

引用次数: 0

Average and maximal coherence based on the modified generalized Wigner–Yanase–Dyson skew information

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-27 DOI: 10.1007/s11128-025-04691-z

Yajing Fan, Lulu Li

{"title":"Average and maximal coherence based on the modified generalized Wigner–Yanase–Dyson skew information","authors":"Yajing Fan, Lulu Li","doi":"10.1007/s11128-025-04691-z","DOIUrl":"10.1007/s11128-025-04691-z","url":null,"abstract":"<div>Coherence is a fundamental feature of quantum mechanics and plays a crucial role in quantum information. In recent years, the quantification of coherence has aroused great interest, and various coherence quantifiers have appeared. We evaluate average coherence of a quantum state based on the modified generalized Wigner–Yanase–Dyson skew information with respect to all orthonormal bases as well as with respect to arbitrary mutually unbiased bases, and demonstrate their equivalence. We further evaluate average variance and average modified generalized variance, and establish several trade-off relations between them and linear entropy, the Brukner–Zeilinger invariant information and average coherence based on the Hilbert–Schmidt norm. In addition, we introduce two kinds of maximal coherence of a quantum state based on the modified generalized Wigner–Yanase–Dyson skew information and metric-adjusted skew information, respectively. Both of them extend the existing maximal coherence based on the Wigner–Yanase skew information and Wigner–Yanase–Dyson skew information. At the same time, it is verified numerically that the maximal coherence is almost equivalent to the average coherence in high-dimensional systems.</div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143496871","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

Multi-qubit hierarchical quantum state sharing with authentication

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-25 DOI: 10.1007/s11128-025-04686-w

Tianai Zhou, Xiu-Bo Chen, Gang Xu, Ying Guo, Zongpeng Li

引用次数: 0

On ((theta , Theta ))-cyclic codes and their applications in constructing QECCs

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-25 DOI: 10.1007/s11128-025-04684-y

Awadhesh Kumar Shukla, Sachin Pathak, Om Prakash Pandey, Vipul Mishra, Ashish Kumar Upadhyay

{"title":"On ((theta , Theta ))-cyclic codes and their applications in constructing QECCs","authors":"Awadhesh Kumar Shukla, Sachin Pathak, Om Prakash Pandey, Vipul Mishra, Ashish Kumar Upadhyay","doi":"10.1007/s11128-025-04684-y","DOIUrl":"10.1007/s11128-025-04684-y","url":null,"abstract":"<div>Let ({mathbb {F}}_q) be a finite field, where q is an odd prime power. Let (R={mathbb {F}}_q+u{mathbb {F}}_q+v{mathbb {F}}_q+uv{mathbb {F}}_q) with (u^2=u,v^2=v,uv=vu). In this paper, we study the algebraic structure of ((theta , Theta ))-cyclic codes of block length (r, s) over ({mathbb {F}}_qR.) Specifically, we analyze the structure of these codes as left (R[x:Theta ])-submodules of ({mathfrak {R}}_{r,s} = frac{{mathbb {F}}_q[x:theta ]}{langle x^r-1rangle } times frac{R[x:Theta ]}{langle x^s-1rangle }). Our investigation involves determining generator polynomials and minimal generating sets for this family of codes. Further, we discuss the algebraic structure of separable codes. A relationship between the generator polynomials of ((theta , Theta ))-cyclic codes over ({mathbb {F}}_qR) and their duals is established. Moreover, we calculate the generator polynomials of the dual of ((theta , Theta ))-cyclic codes. As an application of our study, we provide a construction of quantum error-correcting codes (QECCs) from ((theta , Theta ))-cyclic codes of block length (r, s) over ({mathbb {F}}_qR). We support our theoretical results with illustrative examples.</div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143481142","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

Unitary orbit optimization of quantum f-divergence

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-25 DOI: 10.1007/s11128-025-04688-8

Haojian Li, Xiaojing Yan

引用次数: 0

Exponential speedup of quantum algorithms for the pathfinding problem

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-24 DOI: 10.1007/s11128-025-04689-7

Jianqiang Li

引用次数: 0

Arbitrary (d~(ge 2))-level ((t,n)) threshold quantum secret reconstruction scheme using symmetric entanglements

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-02-24 DOI: 10.1007/s11128-025-04679-9

Suchandan Ghosh, Avishek Adhikari

{"title":"Arbitrary (d~(ge 2))-level ((t,n)) threshold quantum secret reconstruction scheme using symmetric entanglements","authors":"Suchandan Ghosh, Avishek Adhikari","doi":"10.1007/s11128-025-04679-9","DOIUrl":"10.1007/s11128-025-04679-9","url":null,"abstract":"<div>Secret Sharing schemes are very much well-developed in classical cryptography. This paper introduces a novel Secret Sharing scheme that leverages entanglement for secure communication. While our protocol initially focuses on a single reconstructor, it offers the flexibility to dynamically change the reconstructor without compromising the reconstruction security of the shared secret. Traditional Secret Sharing schemes often require secure channels for transmitting secret shares to the reconstructor, which can be costly and complex. In contrast, our proposed protocol eliminates the need for secure channels, significantly reducing implementation overhead. Our proposed scheme introduces a secret reconstruction method for (d ge 2), expanding upon previous works that primarily focused on (d > 2.) Our work provides a unified framework that bridges the gap between the cases (d = 2) and (d > 2.) We carefully analyze the conditions under which each case achieves its highest level of security, utilizing newly developed concepts, termed Perfectly Symmetric, Almost Symmetric, and queryless or Vacuously Symmetric entanglements. By eliminating the need for Quantum Fourier Transform and Inverse Quantum Fourier Transform, which were commonly used in previous schemes, we simplify the proposed protocol and potentially improve its efficiency. We thoroughly analyze the correctness and security of our proposed scheme, ensuring its reliability and resistance to certain quantum attacks. Finally, we propose a detailed comparison with the previous works.</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":"143475296","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 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

引用次数: 0