EPJ Quantum Technology最新文献

{"title":"Quantum-secured device-independent global positioning system","authors":"Chon-Fai Kam,&nbsp;En-Jui Kuo","doi":"10.1140/epjqt/s40507-026-00470-6","DOIUrl":"10.1140/epjqt/s40507-026-00470-6","url":null,"abstract":"<div><p>We propose a device-independent quantum GPS protocol that employs multipartite Bell nonlocality to self-test a <span>([[5,1,3]])</span> five-qubit entangled state distributed to four satellites and one ground station, providing robust security against cyberattacks. Leveraging quantum rigidity, the protocol removes reliance on device assumptions, thereby bolstering GPS resilience. In the NISQ era, we compare superconducting (98.4% fidelity, 216 ns gate time) and trapped-ion (99.8% fidelity, 483 μs gate time) platforms for five-qubit code generation, and analyze photonic distribution over 20,200 km with <span>(0.1text{ dB}/text{km})</span> attenuation, underscoring the necessity of LEO constellations or quantum repeaters for a scalable quantum GPS protocol.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-026-00470-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147340531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Encrypted network traffic analysis using quantum machine learning","authors":"Gokul Sunil Sodar,&nbsp;Akshay Murthy,&nbsp;Annapurna Jonnalagadda,&nbsp;Aswani Kumar Cherukuri","doi":"10.1140/epjqt/s40507-025-00459-7","DOIUrl":"10.1140/epjqt/s40507-025-00459-7","url":null,"abstract":"<div><p>There is an exponential growth in the encrypted network traffic due to the increased privacy concerns and secure communication needs. This growth has made traditional content- based based traffic analysis techniques ineffective to determine whether traffic is benign or malicious. As a result, security researchers have adopted the practice of examining HTTP header files to analyze encrypted network traffic. This involves inspecting IP addresses, packet sizes, and other metadata. However, these conventional methods face significant limitations in capturing complex temporal dependencies, adapting to evolving threats, and performing, under data sparsity or noise especially in the context of encrypted traffic where visibility is inherently restricted. Traditionally, machine learning and deep learning methods have been successfully used to classify packets as normal or an attack. With the ability to handle high-dimensional and complex nature of this metadata, Quantum Machine Learning (QML) offers a novel paradigm to potentially uncover more intricate patterns that are intractable for classical models. In this paper, we examine the usage of two quantum machine learning models: Quantum Support Vector Machine (QSVM) and Quantum K-Nearest Neighbors (QKNN). We have proposed hybrid quantum machine learning methods, wherein the data is encoded using quantum encodings and then classified using canonical machine learning models. We experimented with different quantum encodings such as angle and amplitude encoding. Our study was conducted on encrypted traffic classification datasets provided by the Canadian Institute of Cybersecurity. Our findings show that the proposed quantum and hybrid quantum models achieve performance comparable to the canonical machine learning models. Notably, the hybrid KNN and SVM models, when paired with amplitude encoding, demonstrated performance on par with or superior to their purely canonical counterparts. We hope that these results would be of interest not only just the researchers and academicians and also practitioners in Cybersecurity industry.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-025-00459-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147340533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Mapping the quantum computing landscape: growth, collaboration, and thematic convergence","authors":"Daniel Conde-Torres,&nbsp;Alejandro Seco-González,&nbsp;Ángel Piñeiro,&nbsp;Rebeca Garcia-Fandiño","doi":"10.1140/epjqt/s40507-026-00464-4","DOIUrl":"10.1140/epjqt/s40507-026-00464-4","url":null,"abstract":"<div><p>Quantum computing has rapidly emerged as one of the fastest-growing research domains, driven by both technological breakthroughs and the promise of computational advantages over classical systems. This study presents a comprehensive bibliometric analysis of the global quantum computing literature from 1980 to 2025, comprising 31,662 publications indexed in Scopus and accumulating over 800,000 citations. Using advanced bibliometric techniques—including co-authorship mapping, keyword co-occurrence networks, co-citation analysis, and centrality measures—we characterize publication trends, institutional contributions, collaborative structures, and thematic evolution across the field. The results reveal exponential growth in output since 2015, led primarily by the United States, China, and Europe, with key institutions such as MIT, the Chinese Academy of Sciences, CNRS, and the University of Waterloo at the forefront. The intellectual structure exhibits a dual-core configuration, with foundational algorithmic work (e.g. Shor, Grover, Nielsen &amp; Chuang) tightly connected to emerging NISQ-era applications such as quantum machine learning, cryptography, and hybrid algorithms. Keyword analysis reveals the progressive expansion from core quantum algorithms toward increasingly diverse applied domains in healthcare, finance, chemistry, energy, and climate modeling. Public funding bodies (e.g. NSFC, NSF, European Commission, DOE, DoD, MoST) and private-sector investment from major technology firms are jointly driving this translational acceleration. Together, these findings provide an integrated quantitative map of the field’s evolution, offering valuable insight for future scientific policy, international collaboration, and strategic funding initiatives.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-026-00464-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145983212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum long short-term memory for drug discovery","authors":"Liang Zhang,&nbsp;Yin Xu,&nbsp;Mohan Wu,&nbsp;Liang Wang,&nbsp;Hua Xu","doi":"10.1140/epjqt/s40507-026-00467-1","DOIUrl":"10.1140/epjqt/s40507-026-00467-1","url":null,"abstract":"<div><p>Quantum computing combined with machine learning (ML) is a highly promising research area, with numerous studies demonstrating that quantum machine learning (QML) is expected to solve scientific problems more effectively than classical ML. In this work, we present Quantum Long Short-Term Memory (QLSTM), a QML architecture, and demonstrate its effectiveness in drug discovery. We evaluate QLSTM on five benchmark datasets (BBBP, BACE, SIDER, BCAP37, T-47D), and observe consistent performance gains over classical LSTM, with ROC-AUC improvements ranging from 3% to over 6%. Furthermore, QLSTM exhibits improved predictive accuracy as the number of qubits increases, and faster convergence than classical LSTM under the same training conditions. Notably, QLSTM maintains strong robustness against quantum computer noise, outperforming noise-free classical LSTM in certain settings. These findings highlight the potential of QLSTM as a scalable and noise-resilient model for scientific applications, particularly as quantum hardware continues to advance in qubit capacity and fidelity.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-026-00467-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147338719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Exponential separation criteria for quantum iterative power algorithms","authors":"András Czégel,&nbsp;Boglárka G.-Tóth","doi":"10.1140/epjqt/s40507-026-00466-2","DOIUrl":"10.1140/epjqt/s40507-026-00466-2","url":null,"abstract":"<div><p>In the vast field of Quantum Optimization, Quantum Iterative Power Algorithms (QIPA) has been introduced recently with a promise of exponential speedup over an already established and well-known method, the variational Quantum Imaginary Time Evolution (varQITE) algorithm. Since the convergence and error of varQITE are known, the promise of QIPA also implied certain collapses in the complexity hierarchy — such as NP ⊆ BQP, as we show in our study. However the original article of QIPA explicitly states the algorithm does not cause any collapses. In this study we prove that these collapses indeed do not occur, and with that, prove that the promised exponential separation is practically unachievable. We do so by introducing criteria for the exponential separation between QIPA₂ that uses a double exponential function and varQITE, and then showing how these criteria require certain properties in problem instances. After that we introduce a preprocessing step that enforces problems to satisfy these criteria, and then we show that the algorithmic error blows up exponentially for these instances, as there is an inverse polynomial term between speedup and the error. Despite the theoretical results, we also show that practically relevant polynomial enhancement is still possible, and show experimental results on a small problem instance, where we used our preprocessing step to achieve the improvement.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-026-00466-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147338083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Testing time order and Leggett-Garg inequalities with noninvasive measurements on public quantum computers","authors":"Tomasz Rybotycki,&nbsp;Tomasz Białecki,&nbsp;Josep Batle,&nbsp;Bartłomiej Zglinicki,&nbsp;Adam Szereszewski,&nbsp;Wolfgang Belzig,&nbsp;Adam Bednorz","doi":"10.1140/epjqt/s40507-025-00457-9","DOIUrl":"10.1140/epjqt/s40507-025-00457-9","url":null,"abstract":"<div><p>We demonstrate the first violation of the Leggett-Garg inequality and time-order noninvariance on public quantum computers using genuine noninvasive measurements. By gathering sufficiently large statistics, we have been able to violate Leggett-Garg inequality and time-order invariance. The detailed analysis of the data on 10 qubit sets from 5 devices available on IBM Quantum and one on IonQ reveals violations beyond 5 standard deviations in almost all cases. We implemented our protocols using fractional gates, newly available on the IBM Heron devices, allowing us to benchmark them in application to weak measurements. The noninvasiveness is supported by a qualitative and quantitative agreement with the model of weak disturbance. Moreover, our data expose statistically significant deviations from theoretical predictions that exceed declared device error rates, establishing weak measurement protocols as a sensitive benchmark for quantum hardware. These advances transform public quantum computers into practical testbeds for probing foundational questions of realism and temporal order with unprecedented accessibility and precision.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-025-00457-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145982600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An analysis of demonstration materials in quantum physics education","authors":"Bart Folkers,&nbsp;Carolien Castenmiller,&nbsp;Alexander Brinkman,&nbsp;Kirsten Stadermann","doi":"10.1140/epjqt/s40507-025-00460-0","DOIUrl":"10.1140/epjqt/s40507-025-00460-0","url":null,"abstract":"<div><p>The development and study of demonstration materials (DM) in quantum physics (QP) education has gained increasing attention in research, leading to a diverse range of approaches. In this scoping review, we examine 302 scientific publications on DM for QP education, categorising them by DM type and QP topics. We analyse the progression of research output from 2000 to 2023, highlighting different strategies in digital and haptic DM, as well as pedagogical considerations and gaps. We also performed an evaluation of the research field, assessing educational goals and challenges, methodological approaches, implementation strategies, and the reported effectiveness of DM.</p><p>Our analysis reveals a growing, yet uneven, distribution of DM across QP topics, an increased emphasis on quantum technology applications, and varying quality in studies on learning outcomes. While some DM are well established, others remain underexplored, particularly: DM that connect QP topics to a wide range of real world contexts, integrating multiple DM types and representations, and adapting materials for different audiences. We conclude by highlighting the critical need for “educational readiness” of DM. To advance QP education, future research must therefore focus on the effective integration of DM into practice, supported by comprehensive reporting on design principles, functionality, and implementation.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-025-00460-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145982601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum secure multiparty multiplication based on d-level single particles","authors":"Xiu-Li Song,&nbsp;Jie Yan,&nbsp;You-Sheng Zhou,&nbsp;Tao Wu","doi":"10.1140/epjqt/s40507-025-00356-z","DOIUrl":"10.1140/epjqt/s40507-025-00356-z","url":null,"abstract":"<div><p>The quantum secure multiparty multiplication (QSMM) protocol aims to leverage the advantages of quantum computing to ensure data privacy and security in multiparty computation, preventing information from being leaked and protecting privacy against malicious attacks. However, current QSMM protocols suffer from high resource consumption and computation complexity in particle preparation and participant computation stages. In view of this, a QSMM protocol based on single particles is proposed in this paper. The proposed protocol utilizes high-dimensional single particles as information carriers, and the optimized quantum multiplication circuit is employed to embed the participants’ secret message and perform the multiplication. All participants collaboratively generate a blind matrix, and each column product of the blind matrix acts as the participant’s private key for the blinding of the secret value. Unlike other protocols that use decoy particles for eavesdropping detection, the proposed protocol leverages the properties of mutually unbiased basis particles to ensure its security, while reducing quantum resource consumption and the quantum capabilities required from the participants. Security analysis demonstrates that the proposed protocol can effectively resist attacks from external eavesdroppers and internal participants, and performance analysis shows that the proposed protocol achieves superior execution efficiency compared to other similar protocols.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-025-00356-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147342886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Enhancement of optomagnonic coupling and microwave-optical conversion via magnetic anisotropy","authors":"Hong Xie,&nbsp;Le-Wei He,&nbsp;Xiang Lin,&nbsp;Xiu-Min Lin","doi":"10.1140/epjqt/s40507-025-00458-8","DOIUrl":"10.1140/epjqt/s40507-025-00458-8","url":null,"abstract":"<div><p>Efficient microwave-optical frequency conversion is critical for building long-distance quantum networks. Magnons in ferromagnets offer a promising mediator for this conversion, owing to their ability to couple to both microwave and optical fields. However, the magnon-mediated microwave-optical conversion efficiency is severely limited by the inherently weak optomagnonic coupling. Here, we propose a scheme to enhance the optomagnonic coupling by utilizing the intrinsic magnetic anisotropy in a yttrium iron garnet (YIG) thin film. The presence of magnetic anisotropy establishes a squeezed vacuum for the magnonic ground state, which enhances the effective optomagnonic coupling strength by a factor of <span>(cosh (r))</span>, where r is the squeezing parameter. This results in a significant boost of the corresponding cooperativities and, consequently, the microwave-to-optical conversion efficiency by several orders of magnitude for large squeezing. Our approach harnesses magnon squeezing as an intrinsic resource to strengthen optomagnonic interactions, creating opportunities for high-efficiency microwave-optical conversion.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"13 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-025-00458-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147342882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Error correction for distributed quantum computing","authors":"Daowen Qiu,&nbsp;Ligang Xiao,&nbsp;Le Luo,&nbsp;Paulo Mateus","doi":"10.1140/epjqt/s40507-025-00455-x","DOIUrl":"10.1140/epjqt/s40507-025-00455-x","url":null,"abstract":"<div><p>In distributed quantum computing, the final solution of a problem is usually achieved by catenating these partial solutions resulted from different computing nodes, but intolerable errors likely yield in this catenation process. In this paper, we propose a universal error correction scheme to reduce errors and obtain effective solutions. Then, we apply this error correction scheme to designing a distributed phase estimation algorithm that presents a basic tool for studying distributed Shor’s algorithm and distributed discrete logarithm algorithm as well as other distributed quantum algorithms. Our method may provide a universal strategy of error correction for a kind of distributed quantum computing.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":"12 1","pages":""},"PeriodicalIF":5.6,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1140/epjqt/s40507-025-00455-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145887091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}