Quantum Information Processing最新文献

Fast generation of GHZ state by designing the evolution operators with Rydberg superatom 通过设计具有雷德贝格超原子的演化算子快速生成 GHZ 状态

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2024-11-18 DOI: 10.1007/s11128-024-04587-4

J. P. Wang, L. P. Yang, Y. Q. Ji, Y. L. Liu, L. Dong, X. M. Xiu

引用次数: 0

Using an (A^*)-based framework for decomposing combinatorial optimization problems to employ NISQ computers 使用基于（A^*）的组合优化问题分解框架来使用NISQ计算机

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-27 DOI: 10.1007/s11128-023-04115-w

Simon Garhofer, Oliver Bringmann

{"title":"Using an (A^*)-based framework for decomposing combinatorial optimization problems to employ NISQ computers","authors":"Simon Garhofer, Oliver Bringmann","doi":"10.1007/s11128-023-04115-w","DOIUrl":"10.1007/s11128-023-04115-w","url":null,"abstract":"<div><p>Combinatorial optimization problems such as the traveling salesperson problem are ubiquitous in practical applications and notoriously difficult to solve optimally. Hence, many current endeavors focus on producing approximate solutions. The use of quantum computers could accelerate the generation of those approximate solutions or yield more exact approximations in comparable time. However, quantum computers are presently very limited in size and fidelity. In this work, we aim to address the issue of limited problem size by developing a scheme that decomposes a combinatorial optimization problem instance into arbitrarily small subinstances that can be solved on a quantum machine. This process utilizes <i>A</i>* as a foundation. Additionally, we present heuristics that reduce the runtime of the algorithm effectively, albeit at the cost of optimality. In experiments, we find that the heavy dependence of our approach on the choice of the heuristics used allows for a modifiable framework that can be adapted case by case instead of a concrete procedure.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"22 10","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-023-04115-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41083645","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

Optimal control theory techniques for nitrogen vacancy ensembles in single crystal diamond 单晶金刚石氮空位系综的最优控制理论技术

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-27 DOI: 10.1007/s11128-023-04106-x

Madelaine S. Z. Liddy, Troy Borneman, Peter Sprenger, David Cory

引用次数: 0

Authenticable quantum multi-secret sharing scheme based on monotone span program 基于单调跨度程序的可验证量子多秘密共享方案

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-08 DOI: 10.1007/s11128-023-04084-0

Lele Li, Zhaowei Han, Feiting Guan

引用次数: 0

Quantifying unknown entanglement by neural networks 用神经网络量化未知纠缠

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-08 DOI: 10.1007/s11128-023-04068-0

Xiaodie Lin, Zhenyu Chen, Zhaohui Wei

{"title":"Quantifying unknown entanglement by neural networks","authors":"Xiaodie Lin, Zhenyu Chen, Zhaohui Wei","doi":"10.1007/s11128-023-04068-0","DOIUrl":"10.1007/s11128-023-04068-0","url":null,"abstract":"<div><p>Quantum entanglement plays a crucial role in quantum information processing tasks and quantum mechanics; hence, quantifying unknown entanglement is a fundamental task. However, this is also challenging, as entanglement cannot be measured by any observables directly. In this paper, we train neural networks to quantify unknown entanglement, where the input features for neural networks are the outcome statistics data produced by measuring target quantum states with local or even single-qubit Pauli observables, and the training labels are well-chosen quantities. For bipartite quantum states, this quantity is coherent information, which is a lower bound for many popular entanglement measures, like the entanglement of distillation. For multipartite quantum states, we choose this quantity as the geometric measure of entanglement. It turns out that the neural networks we train have very good performance in quantifying unknown quantum entanglement and can beat previous approaches like semi-device-independent protocols for this problem easily in both precision and application range. We also observe an interesting phenomenon that on quantum states with stronger quantum nonlocality, the neural networks tend to have better performance, though we do not provide them any knowledge on quantum nonlocality.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"22 9","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-023-04068-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45940355","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}

引用次数: 1

Multipartite concurrence of W-class states based on sub-partite quantum systems 基于子部分量子系统的W类态的多部分并发

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-08 DOI: 10.1007/s11128-023-04090-2

Wei Chen, Yanmin Yang, Shao-Ming Fei, Zhu-Jun Zheng, Yan-Ling Wang

引用次数: 0

Research on quantum dialogue protocol based on the HHL algorithm 基于HHL算法的量子对话协议研究

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-08 DOI: 10.1007/s11128-023-04048-4

Xiaolong Yang, Dongfen Li, Jie Zhou, Yuqiao Tan, Yundan Zheng, Xiaofang Liu

引用次数: 0

The hyperentanglement-based quantum secure direct communication protocol with single-photon measurement 基于超凝聚的单光子测量量子安全直接通信协议

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-05 DOI: 10.1007/s11128-023-04097-9

Yu-Xiang Xiao, Lan Zhou, Wei Zhong, Ming-Ming Du, Yu-Bo Sheng

引用次数: 0

Mirrors–light–atoms entanglement in ring optomechanical cavity 镜-光-原子在环形光学机械腔中的纠缠

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-05 DOI: 10.1007/s11128-023-04082-2

Oumayma El Bir, Morad El Baz

引用次数: 0

Quantum key recovery attacks on tweakable Even–Mansour ciphers 量子密钥恢复攻击可调整的Even-Mansour密码

IF 2.5 3区物理与天体物理

Quantum Information Processing Pub Date : 2023-09-04 DOI: 10.1007/s11128-023-04098-8

Ping Zhang, Yiyuan Luo

{"title":"Quantum key recovery attacks on tweakable Even–Mansour ciphers","authors":"Ping Zhang, Yiyuan Luo","doi":"10.1007/s11128-023-04098-8","DOIUrl":"10.1007/s11128-023-04098-8","url":null,"abstract":"<div><p>As tweakable block ciphers from public permutations, tweakable Even–Mansour ciphers are widely used in disk sector encryption and data storage encryption. With the rapid improvement of computing power, especially the development of quantum computing technology and quantum computers, the quantum security of tweakable Even–Mansour ciphers should be concerned and studied. This paper focuses on the security of tweakable Even–Mansour ciphers in the quantum setting. For one-round tweakable Even–Mansour cipher, we give its quantum circuit, present a quantum key recovery attack in polynomial time by Simon’s algorithm and show the concrete resource estimation. For two-round tweakable Even–Mansour cipher, we present a better quantum key recovery attack by BHT-meets-Simon algorithm than that by Grover-meets-Simon algorithm from a new perspective of variable tweaks and show the concrete resource estimation. Finally, we generalize to <i>r</i>-round tweakable Even–Mansour cipher and present a quantum key recovery attack by combining Grover’s algorithm and Simon’s algorithm. Our work is of great importance. We use BHT-meets-Simon algorithm to achieve better quantum key recovery attacks than Grover-meets-Simon algorithm for the first time.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"22 9","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41550993","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