{"title":"A simple model of quantum walk with a gap in distribution","authors":"Takuya Machida","doi":"10.1007/s11128-025-04898-0","DOIUrl":"10.1007/s11128-025-04898-0","url":null,"abstract":"<div><p>Quantum walks are quantum counterparts of random walks, and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space, and it is observed at a location with a probability. The finding probabilities have been investigated, and some interesting things have been analytically discovered. They are, for instance, ballistic behavior, localization, or a gap. We study a 1-dimensional quantum walk in this paper. Although the walker launches off at a location under a localized initial state, some numerical experiments show that the quantum walker does not seem to distribute around the launching location, which suggests that the probability distribution holds a gap around the launching location. To prove the gap analytically, we derive a long-time limit distribution, from which one can tell more details about the finding probability.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144891528","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}
Wei-Min Shi, Qing-Tian Zhuang, Yi-Hua Zhou, Yu-Guang Yang
{"title":"Quantum federated learning through ancilla-driven quantum computation","authors":"Wei-Min Shi, Qing-Tian Zhuang, Yi-Hua Zhou, Yu-Guang Yang","doi":"10.1007/s11128-025-04887-3","DOIUrl":"10.1007/s11128-025-04887-3","url":null,"abstract":"<div><p>In the current noisy intermediate-scale quantum era, the limited quantum capabilities of client devices have prompted some quantum federated learning (QFL) schemes to delegate model training tasks to the server with substantial quantum computing resources. While these approaches mitigate the constraints of insufficient quantum resources on the client side, they also introduce challenges such as the requirement for the quantum server to prepare highly entangled brickwork states, clients to prepare quantum initial states, and potential security risks related to the leakage of model parameters and output information. To address these issues, a novel QFL scheme based on ancilla-driven quantum computation is proposed. In this scheme, the quantum server is responsible for preparing qubits and executing non-parameterized entangling gates in the model, while the client performs the parameterized rotation gates, which contains private information by manipulating and measuring a single ancilla qubit sent from the server. Security analysis demonstrates that this scheme can effectively protect the privacy of the client's data, model parameters, and model outputs. Finally, the effectiveness of the proposed scheme is validated through binary classification experiments on the MNIST handwritten digit dataset using the Qiskit platform.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144888058","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}
Thae-Gyong Han, Nam-Chol Kim, Myong-Chol Ko, Ju-Song Ryom, Su-Ryon Ri
{"title":"Weighted quantum genetic algorithm for one-dimensional bin packing problem","authors":"Thae-Gyong Han, Nam-Chol Kim, Myong-Chol Ko, Ju-Song Ryom, Su-Ryon Ri","doi":"10.1007/s11128-025-04893-5","DOIUrl":"10.1007/s11128-025-04893-5","url":null,"abstract":"<div><p>Genetic algorithms (GA) are one of the efficient methods for various NP-hard combinatorial optimization problems. And previous research has also proposed hybrid genetic algorithms (HGA) that combine first-fit decreasing (FFD) approximate solutions with GAs. However, as the advantages of quantum genetic algorithm (QGA) over GA have been demonstrated, several researchers have attempted to solve optimization problems using QGA. In this paper, we have proposed a new quantum approach to solve a bin packing problem (BPP), a typical NP-hard problem, using a weighted quantum genetic algorithm (WQGA), and experimentally verify that the BP problem based on a WQGA is superior to optimization method based on GA and HGA. Numerical experiments are designed to prove the efficiency of the WQGA. Our results show that the WQGA is superior to GA and HGA.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144881008","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 universal quantum certainty relation for arbitrary number of observables","authors":"Ao-Xiang Liu, Ma-Cheng Yang, Cong-Feng Qiao","doi":"10.1007/s11128-025-04901-8","DOIUrl":"10.1007/s11128-025-04901-8","url":null,"abstract":"<div><p>We derive by lattice theory a universal quantum certainty relation for arbitrary <i>M</i> observables in <i>N</i>-dimensional system, which provides a state-independent maximum lower bound on the direct sum of the probability vectors in terms of majorization relation. While the utmost lower bound coincides with <span>((1/N,ldots ,1/N))</span> for any two observables with orthogonal bases, the majorization certainty relation for <span>(Mgeqslant 3)</span> is shown to be nontrivial. The universal majorization bounds for three mutually complementary observables and a more general set of observables in dimension-2 are achieved. It is found that one cannot prepare a quantum state with probability vectors of incompatible observables spreading out arbitrarily. Moreover, we also explore the connections between quantum uncertainty and quantum coherence, and obtain a complementary relation for the quantum coherence as well, which characterizes a trade-off relation of quantum coherence with different bases and is illustrated by an explicit example.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144881009","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":"The Euclidean hulls of matrix product codes and their applications to EAQEC codes","authors":"Jie Liu, Peng Hu, Xiusheng Liu","doi":"10.1007/s11128-025-04899-z","DOIUrl":"10.1007/s11128-025-04899-z","url":null,"abstract":"<div><p>In this paper, we exhibit an effective method for constructing entanglement-assisted quantum error-correcting (EAQEC) codes via Euclidean hulls of matrix product codes with <span>(t_1)</span>-partitioned Euclidean orthogonal property as the defining matrices over the finite fields. By this method, we obtain numerous new EAQEC codes, all of them have higher rate than current EAQEC codes available. Moreover, the dimensions, minimum distances and the number <i>c</i> of pre-shared maximally entangled states of our EAQEC codes are easily calculated and very flexible.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144868823","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":"Enhancing multi-hop remote implementation of partially unknown operations under the noisy environment","authors":"Fangru Li, Songya Ma, Yu Lu","doi":"10.1007/s11128-025-04891-7","DOIUrl":"10.1007/s11128-025-04891-7","url":null,"abstract":"<div><p>Quantum multi-hop network plays a crucial role in expanding the communication distance, improving network flexibility and boosting reliability. In view of the practical requirements of quantum remote control, we put forward two deterministic multi-hop protocols for implementing single-qudit operations belonging to the restrict sets. One uses generalized Bell states as the entanglement resource, and the other takes generalized GHZ-Bell states as the quantum channel. With the assistance of the intermediate nodes, the sender can execute the partially unknown operation on the distant receiver’s state. It should be emphasized that the recovery operation is derived from a general expression that explicitly indicates the dependence on the measurement outcomes. Furthermore, we explore the impact of amplitude-damping noise and enhance the fidelities by means of environment-assisted measurement.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144868824","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 new general quantum state verification protocol by the classical shadow method","authors":"Xiaodi Li","doi":"10.1007/s11128-025-04889-1","DOIUrl":"10.1007/s11128-025-04889-1","url":null,"abstract":"<div><p>Verifying whether a quantum device produces a specific quantum state is a fundamental task in many applications of modern quantum technologies. In the conventional framework of quantum state verification, designing an optimal or efficient protocol for each type of state typically requires intricate, state-specific customization. Recently, Huang et al. (in: 2024 IEEE 65th annual symposium on foundations of computer science (FOCS), 2024) introduced a novel approach known as the shadow overlap protocol, which leverages classical shadows to efficiently verify multiple classes of quantum states simultaneously. In this work, we propose a new verification protocol that integrates key ideas from both the conventional framework and the shadow overlap protocol. To this end, we first reformulate the shadow overlap protocol using the formalism of hypothesis testing, which also underpins the conventional approach, and analyze the similarities and differences between the two. Our framework extends the capabilities of the shadow overlap protocol while addressing some of its limitations, yielding improved sample complexity and a more natural treatment of structured quantum states. We demonstrate the effectiveness of our protocol through applications to GHZ states and stabilizer states.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144868822","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":"Applications of order six cyclotomy to construct CSS quantum codes and quantum synchronizable codes","authors":"Pramod Kumar Kewat, Varsha Tiwari","doi":"10.1007/s11128-025-04883-7","DOIUrl":"10.1007/s11128-025-04883-7","url":null,"abstract":"<div><p>In this article, we introduce the sixth-order cyclotomy over <span>(mathbb {Z}_{2m},m)</span> is a prime and develop dual-containing cyclic codes, along with their augmented codes, resulting in optimal cyclic codes. By utilizing these cyclic codes, we design quantum synchronizable codes (QSCs) and Calderbank–Shor–Steane (CSS) quantum codes. Additionally, we derive some new CSS quantum codes and also demonstrate that the obtained QSCs exhibit maximum tolerance to alignment errors.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144868704","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":"Exploring cooperation and defection in multi-agent systems via Ising model Hamiltonian","authors":"Debarshi Choudhury, S. Balakrishnan","doi":"10.1007/s11128-025-04885-5","DOIUrl":"10.1007/s11128-025-04885-5","url":null,"abstract":"<div><p>In this work, we model multi-agent decision-making scenarios by combining elements of game theory and statistical mechanics. This is done by utilizing the Ising model. We analyse three distinct cases which involves different interaction setups between players and an external arbiter. Our results show that as punishment increases, the system undergoes sharp phase transitions in magnetization. This transition reflects shifts from defection to cooperation. In case 1, where player A interacts with both the arbiter and player B, cooperation increases smoothly as punishment rises. In case 2, where player B interacts with both the arbiter and player A, a critical transition is observed at high punishment, especially when the sucker’s payoff and temptation are significant. In case 3, where both players are influenced by the arbiter but do not directly interact, cooperation only emerges at high punishment values. These findings provide insight into the role of external influence and punishment in promoting cooperative behaviour in large-scale systems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144869074","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":"Semi-quantum key agreement protocol based on four-particle entangled χ-state and experiment verification on IBM qiskit","authors":"Jin-Huan Li, She-Xiang Jiang, Wen-Wen Hu","doi":"10.1007/s11128-025-04888-2","DOIUrl":"10.1007/s11128-025-04888-2","url":null,"abstract":"<div><p>By using a four-particle entangled χ<b>-</b>state, this paper proposes a three-party semi-quantum key agreement protocol. It allows one quantum participant and two classical participants to negotiate the final key equally. The three parties encrypt the key using two round hash functions, which make the proposed protocol more secure. In the process of joint measurement, this paper uses IBM Qiskit to calculate the error rate by comparing the measurement results with the four-particle entangled χ<b>-</b>state. Security analyses show that the presented protocol can resist participants’ attacks and some common external attacks. In the process of the intercept-resend attack, this paper uses simulation to detail the operation of eavesdroppers and the method for detecting eavesdropping. Efficiency analysis shows that the proposed three-party SQKA protocol has higher qubit efficiency than the existing SQKA protocol. Besides, this paper extends the proposed three-party SQKA protocol into the multi-party SQKA protocol and compares it with other multi-party SQKA protocols. The results show that when the number of participants exceeds 6, the qubit efficiency of the presented protocol is higher than other protocols.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 9","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144868705","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}