Srushti Patil, Shreya Banerjee, Prasanta K. Panigrahi
{"title":"NISQ-friendly measurement-based quantum clustering algorithms","authors":"Srushti Patil, Shreya Banerjee, Prasanta K. Panigrahi","doi":"10.1007/s11128-024-04553-0","DOIUrl":"10.1007/s11128-024-04553-0","url":null,"abstract":"<div><p>Two novel measurement-based, quantum clustering algorithms are proposed based on quantum parallelism and entanglement. The first algorithm follows a divisive approach. The second algorithm is based on unsharp measurements, where we construct an effect operator with a Gaussian probability distribution to cluster similar data points. A major advantage of both algorithms is that they are simplistic in nature, easy to implement, and well suited for noisy intermediate scale quantum computers. We have successfully applied the first algorithm on a concentric circle data set, where the classical clustering approach fails, as well as on the Churritz data set of 130 cities, where we show that the algorithm succeeds with very low quantum resources. We applied the second algorithm on the labeled Wisconsin breast cancer dataset, and found that it is able to classify the dataset with high accuracy using only <i>O</i>(<i>log</i>(<i>D</i>)) qubits and polynomial measurements, where <i>D</i> is the maximal distance within any two points in the dataset. We also show that this algorithm works better with an assumed measurement error in the quantum system, making it extremely well suited for NISQ devices.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142410753","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}
{"title":"(n, m, p)-type quantum network configuration and its nonlocality","authors":"Zan-Jia Li, Ying-Qiu He, Dong Ding, Ming-Xing Yu, Ting Gao, Feng-Li Yan","doi":"10.1007/s11128-024-04541-4","DOIUrl":"10.1007/s11128-024-04541-4","url":null,"abstract":"<div><p>A quantum network that shares entangled sources among distant nodes enables us to distribute entanglement along the network by suitable measurements. Network nonlocality means that it does not admit a network model involving local variables emitted from independent sources. In this work, we construct an (<i>n</i>, <i>m</i>, <i>p</i>)-type quantum network configuration and then derive the corresponding <i>n</i>-local correlation inequalities based on the assumption of independent sources. As a more general quantum network configuration, it can cover most of the existing network models, such as the typical chain network, star network and ring network, and provides both centerless and asymmetric network topologies, involving cyclic and acyclic configurations. We demonstrate the non-<i>n</i>-locality of the present network by calculating the violation of the <i>n</i>-local inequality with bipartite entangled sources and Pauli measurements. This allows us to simplify the analysis of various network configurations using a general network parameterized by <i>n</i>, <i>m</i> and <i>p</i>.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142410737","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}
Zahraa A. Ali, Tayseer S. Atia, Ahmed Y. Yousuf, Ahmed J. Khahdim
{"title":"A comprehensive review of quantum image encryption methods: design characteristics, cryptographic properties, and AI integration","authors":"Zahraa A. Ali, Tayseer S. Atia, Ahmed Y. Yousuf, Ahmed J. Khahdim","doi":"10.1007/s11128-024-04563-y","DOIUrl":"10.1007/s11128-024-04563-y","url":null,"abstract":"<div><p>Quantum image encryption is an innovative security method that exploits the principles of quantum physics to protect and transmit image data. By utilizing the unique properties of quantum mechanics such as superposition, non-cloning, and entanglement, this approach establishes a robust framework for safeguarding sensitive visual information. This review paper comprehensively examines the fundamental concepts of quantum image encryption and its significant impact on enhancing image transmission security. We explore how quantum technology has revolutionized security measures, offering novel solutions for the secure transmission of sensitive data, particularly images. Through rigorous analysis, we illuminate various methods of quantum encryption, including key generation, the confusion and diffusion principles, and the integration of artificial intelligence, especially optimization algorithms, in securing data. Furthermore, we discuss the challenges and future trends that researchers in this field may encounter. Our work provides valuable insights and guidance for those looking to build upon our research, contributing to a deeper understanding of quantum image encryption and laying the groundwork for further advancements in this area.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142410400","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}
{"title":"Partially coherent multi-photon added and multi-photon subtracted quantum states","authors":"Sakshi Rao, Bhaskar Kanseri","doi":"10.1007/s11128-024-04556-x","DOIUrl":"10.1007/s11128-024-04556-x","url":null,"abstract":"<div><p>In free-space communication, partially coherent fields are more resistant to atmospheric turbulence, resulting in reduced beam loss and less scintillation at the detector. In this article, we used the Glauber–Sudarshan P function analogy to study the nonclassical properties of the m-photon-subtracted (or added) squeezed vacuum state generated from a partially coherent Gaussian Schell model pump. Utilizing a novel formulation, we examine the Wigner distribution function and decoherence of the Wigner distribution function of these partially coherent multi-photon-subtracted (or added) states in the amplitude decay model. Further, the nonclassicality and non-Gaussianity of these states, along with the purity of the photon-added two-mode squeezed vacuum state, is analyzed. Our findings show that by optimizing the squeezing parameter and pump parameters, the partially coherent pump can produce multi-photon-subtracted (or added) squeezed vacuum states with partially coherent properties while preserving the nonclassicality and non-Gaussianity in these states. We expect these results to be useful for long-distance quantum communication, quantum metrology and quantum sensing.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142410438","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}
{"title":"Fat shattering, joint measurability, and PAC learnability of POVM hypothesis classes","authors":"Abram Magner, Arun Padakandla","doi":"10.1007/s11128-024-04555-y","DOIUrl":"10.1007/s11128-024-04555-y","url":null,"abstract":"<div><p>We characterize learnability for quantum measurement classes by establishing matching necessary and sufficient conditions for their probably approximately correct (PAC) learnability, along with corresponding sample complexity bounds, in the setting where the learner is given access only to prepared quantum states. We first show that the empirical risk minimization (ERM) rule proposed in previous work is not universal, nor does uniform convergence of the empirical risk characterize learnability. Moreover, we show that VC dimension generalization bounds in previous work are in many cases infinite, even for measurement classes defined on a finite-dimensional Hilbert space and even for learnable classes. To surmount the failure of the standard ERM to satisfy uniform convergence, we define a new learning rule—<i>denoised empirical risk minimization</i>. We show this to be a universal learning rule for both classical probabilistically observed concept classes and quantum measurement classes, and the condition for it to satisfy uniform convergence is finite fat shattering dimension of the class. The fat shattering dimension of a hypothesis class is a measure of complexity that intervenes in sample complexity bounds for regression in classical learning theory. We give sample complexity upper and lower bounds for learnability in terms of finite fat shattering dimension and approximate finite partitionability into approximately jointly measurable subsets. We link fat shattering dimension with partitionability into approximately jointly measurable subsets, leading to our matching conditions. We also show that every measurement class defined on a finite-dimensional Hilbert space is PAC learnable. We illustrate our results on several example POVM classes.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142410402","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}
{"title":"Superadiabatic scheme for fast implement quantum phase gates and prepare cluster states","authors":"Y. Liu, W. Li, J. P. Wang, Y. Q. Ji","doi":"10.1007/s11128-024-04554-z","DOIUrl":"10.1007/s11128-024-04554-z","url":null,"abstract":"<div><p>In this paper, we propose an effective scheme for rapidly implementing <span>(pi )</span> phase gate in a two-distant-atom–cavity system by combining superadiabatic scheme and quantum Zeno dynamics to construct shortcuts to adiabatic passage. As a typical application of the fast phase gates, a creation of <i>N</i>-atom cluster states is put forward. The influence of various decoherence processes such as atomic spontaneous emission and cavity decay on the fidelity is discussed. Numerical simulations show that the scheme is robust against decoherence caused by atomic spontaneous emission and cavity decay. In this work, superadiabatic shortcuts are used to prepare cluster states for the first time, which is faster than the traditional adiabatic passage technique.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142409879","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}
{"title":"Quantum uncertainty equalities and inequalities for unitary operators","authors":"Ao-Xiang Liu, Ma-Cheng Yang, Cong-Feng Qiao","doi":"10.1007/s11128-024-04544-1","DOIUrl":"10.1007/s11128-024-04544-1","url":null,"abstract":"<div><p>We explore the uncertainty relation for unitary operators in a new way and find two uncertainty equalities for unitary operators, which are minimized by any pure states. Additionally, we derive two sets of uncertainty inequalities that unveil hierarchical structures within the realm of unitary operator uncertainty. Furthermore, we examine and compare our method for unitary uncertainty relations to other prevailing formulations. We provide explicit examples for better understanding and clarity. Results show that the hierarchical unitary uncertainty relations establish strong bounds. Moreover, we investigate the higher-dimensional limit of the unitary uncertainty equalities.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142409849","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}
{"title":"Correction to: Quantum error-correcting codes from the quantum construction X","authors":"Peng Hu, Xiusheng Liu","doi":"10.1007/s11128-024-04542-3","DOIUrl":"10.1007/s11128-024-04542-3","url":null,"abstract":"","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142409636","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}
{"title":"A practical convertible quantum signature scheme with public verifiability into universal quantum designated verifier signature using self-certified public keys","authors":"Sunil Prajapat, Akanksha Dhiman, Sandeep Kumar, Pankaj Kumar","doi":"10.1007/s11128-024-04543-2","DOIUrl":"10.1007/s11128-024-04543-2","url":null,"abstract":"<div><p>Efficient digital signatures ensure the integrity, authenticity and non-repudiation of the data. A quantum signature scheme with a public verifier is one of the schemes that use the verifier publicly for verification and use the conversion of the quantum signature with the public verifier into a designated verifier via the aid of a semi-trusted party for designing the keys for the users. The proposed scheme provides a secure quantum signature, which is beneficial in addressing the issues relating to the privacy of online bidding, electronic voting and electronic payment. Moreover, the public-key cryptosystem makes it easier to implement and secure against quantum attacks as compared to the other quantum signature schemes.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142409308","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}
James Fitzjohn, George Wilson, Domenico Vicinanza, Adrian Winckles
{"title":"An optimization of traditional CPU emulation techniques for execution on a quantum computer","authors":"James Fitzjohn, George Wilson, Domenico Vicinanza, Adrian Winckles","doi":"10.1007/s11128-024-04524-5","DOIUrl":"10.1007/s11128-024-04524-5","url":null,"abstract":"<div><p>The use and adoption of quantum computers by the wider computing community is diminished by the need to adopt new programming techniques. These techniques involve moving from a high-level language where the programmer can define and manipulate objects, to a quantum model where the programmer defines and configures the circuits at a gate level. Previous work by the authors aimed to ease this transition through the use of a software development kit (Qx86 SDK) that emulates a traditional CPU for execution on a quantum computer, but only delivered a raw capability. The current work now presents a number of new methods that extends and improves the SDK's capability. These methods include optimizing traditional logic gate emulation, multiple gate simplification methods, reducing the number of required qubits and alternative optimized techniques for many CPU instructions. A quantum machine code mapping method is described that enhances the emulation of a traditional/quantum hybrid CPU prototype. While still orders of magnitude slower than the performance of a traditional CPU in terms of arithmetic, logic and bitwise operations, execution speed is shown to be markedly improved (in some cases by more than 1,000%) and without introducing any unrealistic requirements (that is, all execution can be performed utilizing less than 32 qubits). The usefulness of the SDK has now been enhanced as a reference guide, where the programmer/researcher can contrast traditional methods versus multiple quantum methods of execution.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-024-04524-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142415113","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}