npj Quantum Information最新文献_第4页

Quantum ensemble learning with a programmable superconducting processor 可编程超导处理器的量子系综学习

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-21 DOI: 10.1038/s41534-025-01037-6

Jiachen Chen, Yaozu Wu, Zhen Yang, Shibo Xu, Xuan Ye, Daili Li, Ke Wang, Chuanyu Zhang, Feitong Jin, Xuhao Zhu, Yu Gao, Ziqi Tan, Zhengyi Cui, Aosai Zhang, Ning Wang, Yiren Zou, Tingting Li, Fanhao Shen, Jiarun Zhong, Zehang Bao, Zitian Zhu, Zixuan Song, Jinfeng Deng, Hang Dong, Pengfei Zhang, Wei Zhang, Hekang Li, Qiujiang Guo, Zhen Wang, Ying Li, Xiaoting Wang, Chao Song, H. Wang

{"title":"Quantum ensemble learning with a programmable superconducting processor","authors":"Jiachen Chen, Yaozu Wu, Zhen Yang, Shibo Xu, Xuan Ye, Daili Li, Ke Wang, Chuanyu Zhang, Feitong Jin, Xuhao Zhu, Yu Gao, Ziqi Tan, Zhengyi Cui, Aosai Zhang, Ning Wang, Yiren Zou, Tingting Li, Fanhao Shen, Jiarun Zhong, Zehang Bao, Zitian Zhu, Zixuan Song, Jinfeng Deng, Hang Dong, Pengfei Zhang, Wei Zhang, Hekang Li, Qiujiang Guo, Zhen Wang, Ying Li, Xiaoting Wang, Chao Song, H. Wang","doi":"10.1038/s41534-025-01037-6","DOIUrl":"https://doi.org/10.1038/s41534-025-01037-6","url":null,"abstract":"Quantum machine learning is among the most exciting potential applications of quantum computing. However, the vulnerability of quantum information to environmental noises and the consequent high cost for realizing fault tolerance has impeded the quantum models from learning complex datasets. Here, we introduce AdaBoost.Q, a quantum adaptation of the classical adaptive boosting (AdaBoost) algorithm designed to enhance learning capabilities of quantum classifiers. Based on the probabilistic nature of quantum measurement, the algorithm improves the prediction accuracy by refining the attention mechanism during the adaptive training and combination of quantum classifiers. We experimentally demonstrate the versatility of our approach on a programmable superconducting processor, where we observe notable performance enhancements across various quantum machine learning models, including quantum neural networks and quantum convolutional neural networks. With AdaBoost.Q, we achieve an accuracy above 86% for a ten-class classification task over 10,000 test samples, and an accuracy of 100% for a quantum feature recognition task over 1564 test samples. Our results demonstrate a foundational tool for advancing quantum machine learning towards practical applications, which has broad applicability to both the current noisy and the future fault-tolerant quantum devices.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"55 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144104821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Characterizing privacy in quantum machine learning 量子机器学习中的隐私特征

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-19 DOI: 10.1038/s41534-025-01022-z

Jamie Heredge, Niraj Kumar, Dylan Herman, Shouvanik Chakrabarti, Romina Yalovetzky, Shree Hari Sureshbabu, Changhao Li, Marco Pistoia

{"title":"Characterizing privacy in quantum machine learning","authors":"Jamie Heredge, Niraj Kumar, Dylan Herman, Shouvanik Chakrabarti, Romina Yalovetzky, Shree Hari Sureshbabu, Changhao Li, Marco Pistoia","doi":"10.1038/s41534-025-01022-z","DOIUrl":"https://doi.org/10.1038/s41534-025-01022-z","url":null,"abstract":"Ensuring data privacy in machine learning models is critical, especially in distributed settings where model gradients are shared among multiple parties for collaborative learning. Motivated by the increasing success of recovering input data from the gradients of classical models, this study investigates the analogous challenge for variational quantum circuits (VQC) as quantum machine learning models. We highlight the crucial role of the dynamical Lie algebra (DLA) in determining privacy vulnerabilities. While the DLA has been linked to the trainability and simulatability of VQC models, we establish its connection to privacy for the first time. We show that properties conducive to VQC trainability, such as a polynomial-sized DLA, also facilitate extracting detailed snapshots of the input, posing a weak privacy breach. We further investigate conditions for a strong privacy breach, where original input data can be recovered from snapshots by classical or quantum-assisted methods. We establish properties of the encoding map, such as classical simulatability, overlap with DLA basis, and its Fourier frequency characteristics that enable such a privacy breach of VQC models. Our framework thus guides the design of quantum machine learning models, balancing trainability and robust privacy protection.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"15 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144097466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Meta-learning assisted robust control of universal quantum gates with uncertainties 元学习辅助具有不确定性的通用量子门的鲁棒控制

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-19 DOI: 10.1038/s41534-025-01034-9

Shihui Zhang, Zibo Miao, Yu Pan, Sibo Tao, Yu Chen

引用次数: 0

Self-testing tilted strategies for maximal loophole-free nonlocality 最大无漏洞非局域性的自检验倾斜策略

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-19 DOI: 10.1038/s41534-025-01029-6

Nicolas Gigena, Ekta Panwar, Giovanni Scala, Mateus Araújo, Máté Farkas, Anubhav Chaturvedi

{"title":"Self-testing tilted strategies for maximal loophole-free nonlocality","authors":"Nicolas Gigena, Ekta Panwar, Giovanni Scala, Mateus Araújo, Máté Farkas, Anubhav Chaturvedi","doi":"10.1038/s41534-025-01029-6","DOIUrl":"https://doi.org/10.1038/s41534-025-01029-6","url":null,"abstract":"The degree of experimentally attainable nonlocality, as gauged by the loophole-free or effective violation of Bell inequalities, remains severely limited due to inefficient detectors. We address an experimentally motivated question: Which quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors? For any Bell inequality and any specification of detection efficiencies, the optimal strategies are those that maximally violate a tilted version of the Bell inequality in ideal conditions. In the simplest scenario, we demonstrate that the quantum strategies that maximally violate the doubly-tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. We utilize a Jordan’s lemma and Gröbner basis-based proof technique to analytically derive self-testing statements for the entire family of doubly-tilted CHSH inequalities and numerically demonstrate their robustness. These results enable us to reveal the insufficiency of even high levels of the Navascués–Pironio–Acín hierarchy to saturate the maximum quantum violation of these inequalities.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"135 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144097608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Machine learning message-passing for the scalable decoding of QLDPC codes QLDPC码可扩展解码的机器学习消息传递

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-17 DOI: 10.1038/s41534-025-01033-w

Arshpreet Singh Maan, Alexandru Paler

引用次数: 0

Trade-off between gradient measurement efficiency and expressivity in deep quantum neural networks 深度量子神经网络中梯度测量效率与表达性的权衡

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-17 DOI: 10.1038/s41534-025-01036-7

Koki Chinzei, Shinichiro Yamano, Quoc Hoan Tran, Yasuhiro Endo, Hirotaka Oshima

{"title":"Trade-off between gradient measurement efficiency and expressivity in deep quantum neural networks","authors":"Koki Chinzei, Shinichiro Yamano, Quoc Hoan Tran, Yasuhiro Endo, Hirotaka Oshima","doi":"10.1038/s41534-025-01036-7","DOIUrl":"https://doi.org/10.1038/s41534-025-01036-7","url":null,"abstract":"Quantum neural networks (QNNs) require an efficient training algorithm to achieve practical quantum advantages. A promising approach is gradient-based optimization, where gradients are estimated by quantum measurements. However, QNNs currently lack general quantum algorithms for efficiently measuring gradients, which limits their scalability. To elucidate the fundamental limits and potentials of efficient gradient estimation, we rigorously prove a trade-off between gradient measurement efficiency (the mean number of simultaneously measurable gradient components) and expressivity in deep QNNs. This trade-off indicates that more expressive QNNs require higher measurement costs per parameter for gradient estimation, while reducing QNN expressivity to suit a given task can increase gradient measurement efficiency. We further propose a general QNN ansatz called the stabilizer-logical product ansatz (SLPA), which achieves the trade-off upper bound by exploiting the symmetric structure of the quantum circuit. Numerical experiments show that the SLPA drastically reduces the sample complexity needed for training while maintaining accuracy and trainability compared to well-designed circuits based on the parameter-shift method.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"7 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144083202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum annealing for combinatorial optimization: a benchmarking study 组合优化的量子退火：基准研究

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-16 DOI: 10.1038/s41534-025-01020-1

Seongmin Kim, Sang-Woo Ahn, In-Saeng Suh, Alexander W. Dowling, Eungkyu Lee, Tengfei Luo

{"title":"Quantum annealing for combinatorial optimization: a benchmarking study","authors":"Seongmin Kim, Sang-Woo Ahn, In-Saeng Suh, Alexander W. Dowling, Eungkyu Lee, Tengfei Luo","doi":"10.1038/s41534-025-01020-1","DOIUrl":"https://doi.org/10.1038/s41534-025-01020-1","url":null,"abstract":"Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"18 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144066198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Discovery of entanglement generation by elastic collision to realise the original Einstein-Podolsky-Rosen thought experiment 发现弹性碰撞产生纠缠，实现最初的爱因斯坦-波多尔斯基-罗森思想实验

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-14 DOI: 10.1038/s41534-025-01028-7

Roman Schnabel

引用次数: 0

Low-overhead defect-adaptive surface code with bandage-like super-stabilizers 带有绷带式超稳定器的低开销缺陷自适应表面代码

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-12 DOI: 10.1038/s41534-025-01023-y

Zuolin Wei, Tan He, Yangsen Ye, Dachao Wu, Yiming Zhang, Youwei Zhao, Weiping Lin, He-Liang Huang, Xiaobo Zhu, Jian-Wei Pan

{"title":"Low-overhead defect-adaptive surface code with bandage-like super-stabilizers","authors":"Zuolin Wei, Tan He, Yangsen Ye, Dachao Wu, Yiming Zhang, Youwei Zhao, Weiping Lin, He-Liang Huang, Xiaobo Zhu, Jian-Wei Pan","doi":"10.1038/s41534-025-01023-y","DOIUrl":"https://doi.org/10.1038/s41534-025-01023-y","url":null,"abstract":"To make practical quantum algorithms work, large-scale quantum processors protected by error-correcting codes are required to resist noise and ensure reliable computational outcomes. However, a major challenge arises from defects in processor fabrication, as well as occasional losses or cosmic rays during the computing process, all of which can lead to qubit malfunctions and disrupt error-correcting codes’ normal operations. In this context, we introduce an automatic adapter to implement the surface code on defective lattices. Unlike previous approaches, this adapter leverages newly proposed bandage-like super-stabilizers to save more qubits when defects are clustered, thus enhancing the code distance and reducing super-stabilizer weight. For instance, in comparison with earlier methods, with a code size of 27 and a random defect rate of 2%, the disabled qubits decrease by 1/3, and the average preserved code distance increases by 63%. This demonstrates a significant reduction in overhead when handling defects using our approach, and this advantage amplifies with increasing processor size and defect rates. Our work presents a low-overhead, automated solution to the challenge of adapting the surface code to defects, an essential step towards scaling up the construction of large-scale quantum computers for practical applications.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"35 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143940438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Critical behavior of Fredenhagen-Marcu string order parameters at topological phase transitions with emergent higher-form symmetries 具有突现高形式对称性的拓扑相变中Fredenhagen-Marcu弦序参数的临界行为

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-05-09 DOI: 10.1038/s41534-025-01030-z

Wen-Tao Xu, Frank Pollmann, Michael Knap

引用次数: 0