Quantum Information Processing最新文献_第4页

Understanding the thermodynamics of computation: a pedagogical overview 理解计算热力学：教学概述

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04918-z

Pritam Chattopadhyay, Goutam Paul

引用次数: 0

A communication-efficient quantum threshold secret sharing scheme 一种通信高效的量子阈值秘密共享方案

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04921-4

Lijie Rui, Zhihui Li, Zhaowei Han, Na Zhou

{"title":"A communication-efficient quantum threshold secret sharing scheme","authors":"Lijie Rui, Zhihui Li, Zhaowei Han, Na Zhou","doi":"10.1007/s11128-025-04921-4","DOIUrl":"10.1007/s11128-025-04921-4","url":null,"abstract":"<div><p>Among quantum secret sharing schemes, communication-efficient quantum secret sharing scheme is an important research issue. Aiming at the quantum threshold secret sharing scheme based on multi-particle entangled states, this paper proposes a new secret share distribution method and constructs a communication-efficient quantum secret sharing scheme. In this paper, we first point out that a unitary operation can be defined by an invertible matrix over a finite field. Based on the secret share distribution method and the unitary operation mentioned above, we give a complete description of our scheme. Then, we systematically analyze the communication cost and communication efficiency of our scheme. The analysis shows that our scheme is a practical and communication-efficient quantum threshold secret sharing scheme. Notably, we creatively use the particles from the mutually unbiased basis to prepare the entangled detection states and decoy particles, which enhances the security of our scheme. Finally, we prove that our scheme is secure under the intercept-and-resend attack, entangle-and-measure attack, collusion attack, and Trojan horse attack.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110483","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

Effects of magnetic field on quantum correlations dynamics in the anisotropic two-qubit Heisenberg model 磁场对各向异性双量子位海森堡模型中量子相关动力学的影响

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04915-2

Hakimeh Jaghouri

{"title":"Effects of magnetic field on quantum correlations dynamics in the anisotropic two-qubit Heisenberg model","authors":"Hakimeh Jaghouri","doi":"10.1007/s11128-025-04915-2","DOIUrl":"10.1007/s11128-025-04915-2","url":null,"abstract":"<div><p>We investigate the dynamics of a two-qubit XYZ Heisenberg model that incorporates Dzyaloshinskii–Moriya (DM) interaction, taking into account both homogeneous and inhomogeneous magnetic fields applied along the <span>( z )</span>-axis. Our study involves analyzing the evolution of entanglement, quantum correlations, and coherence by using measures such as concurrence, local quantum uncertainty, and coherence to address intrinsic decoherence effects. Our results indicate that when the system starts in a pure separable state, it can evolve into correlated states. Notably, the presence of a magnetic field can enhance the preservation of quantum correlations compared to scenarios without a field. In contrast, for systems that begin in entangled or mixed states, we observe a significant decay in quantum correlations and coherence when a magnetic field is present. Moreover, we demonstrate that the DM interaction parameter plays a crucial role in controlling and optimizing the stability and oscillation amplitude of these quantum properties. These findings contribute to a deeper understanding of spin-based quantum information transfer and can guide the design of efficient quantum devices.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110543","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

Quantum decision theory—minimax approach 量子决策理论-极小极大方法

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04924-1

Andrzej Łuczak

引用次数: 0

An optimized exact multi-target search algorithm 一个优化的精确多目标搜索算法

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04932-1

Shijin Zhong, Yingnan Zhao, Guangzhen Dai, Daohua Wu

{"title":"An optimized exact multi-target search algorithm","authors":"Shijin Zhong, Yingnan Zhao, Guangzhen Dai, Daohua Wu","doi":"10.1007/s11128-025-04932-1","DOIUrl":"10.1007/s11128-025-04932-1","url":null,"abstract":"<div><p>Grover’s search algorithm has attracted great attention due to its quadratic speedup over classical algorithms in unsorted database search problems. However, Grover’s algorithm is inefficient in multi-target search problems, except in the case of 1/4 of the data in the database satisfying the search conditions. Long presented a modified Grover’s algorithm by introducing a phase-matching condition, which can search for the target state with zero theoretical failure rate. In this work, we present an optimized exact multi-target search algorithm based on the modified Grover’s algorithm, by transforming the canonical diffusion operator to a more efficient diffusion operator, which can solve the multi-target search problem with a 100<span>(%)</span> success rate while requiring fewer gate counts and shallower circuit depth. After that, the optimized multi-target algorithm for four different items, including two-qubit with two targets, five-qubit with two targets, six-qubit with three targets, and eight-qubit with four targets, are implemented on two quantum computing frameworks MindQuantum and IBM Quantum, respectively. The experimental results show that, compared with Grover’s algorithm and the modified Grover’s algorithm, the proposed algorithm can reduce the quantum gate count by at least 21.1<span>(%)</span> and the depth of the quantum circuit by at least 11.7<span>(%)</span> and maintain a 100<span>(%)</span> success probability.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110546","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

Efficient and scalable designs for ternary quantum reversible multiplexer and demultiplexer systems 高效和可扩展的三元量子可逆多路复用和解路复用系统设计

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04927-y

Asma Taheri Monfared, Andrea Bombarda, Angelo Gargantini, Majid Haghparast

{"title":"Efficient and scalable designs for ternary quantum reversible multiplexer and demultiplexer systems","authors":"Asma Taheri Monfared, Andrea Bombarda, Angelo Gargantini, Majid Haghparast","doi":"10.1007/s11128-025-04927-y","DOIUrl":"10.1007/s11128-025-04927-y","url":null,"abstract":"<div><p>In recent years, ternary reversible logic has become a promising paradigm for advancing low-power, high-performance quantum digital systems that preserve information and are energy efficient. This paper focuses on two primary objectives: first, the efficient realization of ternary reversible <span>(3 times 1)</span> multiplexers and <span>(1 times 3)</span> demultiplexers using quantum gates, specifically 1-qutrit Shift and 3-qutrit Controlled Feynman gates, and second, the design of generalized <span>(n times 1)</span> multiplexers and <span>(1 times n)</span> demultiplexers. The proposed <span>(9 times 1)</span> multiplexer we propose in this study has demonstrated notable improvements in terms of quantum cost (20%), depth (18%), number of constant inputs (60%), and garbage outputs (30%), while the proposed <span>(1 times 9)</span> demultiplexer shows a 20% reduction in quantum cost, a 18% reduction in depth, a 33% reduction in constant inputs, and a 50% reduction in garbage outputs, compared to the most efficient existing designs. These optimizations represent an important step forward in the development of more efficient ternary and quantum reversible logic circuits, advancing the scalability of quantum systems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-025-04927-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110440","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

A quantum game model for dual channels under channel cooperation and service 渠道合作与服务下的双渠道量子博弈模型

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04926-z

Jiayu Shen, Lian Shi, Kai Zhu

引用次数: 0

Quantum (t, n) threshold signature based on shift-code operation and Lagrange unitary operation 基于移位码运算和拉格朗日酉运算的量子（t, n）阈值签名

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04919-y

Yaodong Zhang, Feng Liu, Keshun Yang, Ning Liu, Lijian Zhang

{"title":"Quantum (t, n) threshold signature based on shift-code operation and Lagrange unitary operation","authors":"Yaodong Zhang, Feng Liu, Keshun Yang, Ning Liu, Lijian Zhang","doi":"10.1007/s11128-025-04919-y","DOIUrl":"10.1007/s11128-025-04919-y","url":null,"abstract":"<div><p>Digital signatures are an important class of cryptographic primitives mainly used to verify the integrity and origin of data. In this paper, we propose an efficient and secure quantum (<i>t</i>, <i>n</i>) threshold signature protocol using shift-code operation and Lagrange unitary operation. In the protocol, the signature group encodes the calculated result to the unbiased particle by the shift-code operation. It applies the random numbers, private keys, and secret shares of the signature members to the signature information and decoy particle by the Lagrange unitary operation. On the one hand, it prevents all the participants from embedding private information directly into the transmitted particles, which reduces the risk of information disclosure and improves the security of the protocol. On the other hand, the arbitrator can use the angle value <span>(theta _c)</span> to verify whether the number of participants meets the threshold requirement. Finally, with the help of the arbitrator, the verifier verifies that the number of signing members meets the threshold requirements and that the data is complete and correct. The security analysis shows that the protocol is able to withstand intercept-resend attacks, forgery attacks, and two types of collusion attacks. The performance analysis shows that the protocol can be easily extended due to the low number of transmitted particles and higher computational efficiency. Finally, the correctness of the protocol is verified by simulation experiments.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110437","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

Hyper-transport and superdiffusion in a non-interacting two-particle quantum walk with dynamic disorder 具有动态无序的非相互作用双粒子量子行走中的超输运和超扩散

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04928-x

Larissa F. Gonçalves, Igor E. G. de Oliveira, Rodrigo Caitano, Luan M. T. de Moraes, Pedro Hugo de Figueirêdo, José Ferraz

引用次数: 0

Nonlinear hybrid chaos and quantum state vectors: a new color image crypt framework 非线性混合混沌和量子态向量：一种新的彩色图像隐窝框架

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04929-w

Sujarani Rajendran

{"title":"Nonlinear hybrid chaos and quantum state vectors: a new color image crypt framework","authors":"Sujarani Rajendran","doi":"10.1007/s11128-025-04929-w","DOIUrl":"10.1007/s11128-025-04929-w","url":null,"abstract":"<div><p>This study integrates the distinct advantages of chaos theory and quantum image cryptography, leveraging properties such as determinism, ergodicity, superposition, and sensitivity to initial conditions to enhance parallelism, robustness, and computational efficiency. We introduce a novel hybrid chaotic system termed the Three-Dimensional Cos-Sine-Tangent (3D-CST) map for generating highly unpredictable chaotic sequences. These sequences serve as the foundation for a quantum-based encryption framework designed to strengthen security. The encryption process begins by producing key sequences through the proposed 3D-CST map, which are then employed in the stages of confusion and diffusion. In the confusion stage, the individual RGB channels of the input image are independently scrambled. The resulting permuted channels are transformed into quantum state vectors, which are subsequently diffused using the derived chaotic sequences. This method offers a new perspective on integrating quantum mechanisms with chaos-based image encryption. Extensive simulations and comparative evaluations, including statistical and correlation analyses, demonstrate that the proposed quantum-chaotic cryptographic scheme achieves strong encryption performance and operational efficiency.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110545","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