{"title":"SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems","authors":"Wenjie Sun, Zhigang Wang, Jiaqi Hu, Lianhui Yu, Geng Chen, Liyuan Wang, Hailing Liu, Xiaoyu Li","doi":"10.1007/s11128-026-05345-4","DOIUrl":"10.1007/s11128-026-05345-4","url":null,"abstract":"<div><p>Planar face-flux optimization produces compact higher-order unconstrained binary optimization (HUBO) models, but direct Local Quantum Annealing (LQA) inherits polynomially suppressed gradients from products of edge variables. We introduce SymLQA, a topology-aware classical reformulation and solver pipeline for this problem class. A rotation system and half-edge traversal extract the bounded faces of an embedded planar graph. Their boundary products define classical face-flux variables, converting an edge-spin HUBO with face fields and face-flux interactions into a sparse one- and two-body Ising objective without auxiliary variables. For connected open planar embeddings, a GF(2) reconstruction maps every dual assignment back to edge spins with identical objective value, so the primal and dual minima coincide. We evaluate SymLQA against momentum-based native LQA, gauged LQA, and simulated annealing on independently generated certified frustrated-loop instances. SymLQA reaches the known ground state in all tested runs on regular grids up to <span>(32times 32)</span> and on irregular planar grids, while the baseline success probabilities decrease rapidly with size. At <span>(12times 12)</span>, its batch TTS99 is 0.137 s, compared with 22.35 s for native LQA and 8.85 s for primal simulated annealing. It also maintains unit success probability across four independently sampled coupling regimes. The topology implementation satisfies Euler’s identity on every tested embedding and extracts irregular faces of order up to 16.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149133049","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":"Quantum algorithms for computing maximal quantum f-divergence and Kubo–Ando means","authors":"Trung Hoa Dinh, Nhat A. Nghiem","doi":"10.1007/s11128-026-05309-8","DOIUrl":"10.1007/s11128-026-05309-8","url":null,"abstract":"<div><p>The development of quantum computation has resulted in many quantum algorithms for a wide array of tasks. Recently, there is a growing interest in using quantum computing techniques to estimate or compute quantum information-theoretic quantities such as Rényi entropy, von Neumann entropy, and matrix means. Motivated by these results, we present quantum algorithms for computing the maximal quantum <i>f</i>-divergences and the operator-theoretic matrix Kubo–Ando means. These two classes contain Rényi entropies and matrix means as special cases, which illustrates the generality of our framework. \u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149133050","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":"Quantum private query with identity authentication for multi-type users","authors":"Jia Hao, Yu-Guang Yang, Guang-Bao Xu, Dong-Huan Jiang, Shang Gao, Yi-Hua Zhou, Wei-Min Shi","doi":"10.1007/s11128-026-05352-5","DOIUrl":"10.1007/s11128-026-05352-5","url":null,"abstract":"<div><p>Quantum private query (QPQ) is a pivotal quantum solution for symmetric private information retrieval, allowing one to query a database privately. However, existing QPQ protocols address only one type of user, such as classical users, users capable of making single-qubit measurements, or users capable of preparing single-qubit states. In practice, users exhibit varying quantum capabilities within quantum networks; thus, devising a QPQ protocol that limits users to a single type of quantum capability is impractical. To address this issue, this paper first proposes three authenticated QPQ (AQPQ) protocols, each tailored to one user type. By integrating these three AQPQ protocols, we then construct a flexible and hybrid AQPQ framework for multi-type users. It simultaneously supports at least three user types to achieve QPQ. Furthermore, all proposed protocols support mutual identity authentication and resist both internal and external attacks.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149133048","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":"Finite-resolution entanglement depth of W states: exact trace distance to the mixed k-producible hierarchy","authors":"Wenlong Sun, Xinying Shao, Yuanfeng Jin","doi":"10.1007/s11128-026-05353-4","DOIUrl":"10.1007/s11128-026-05353-4","url":null,"abstract":"<div><p>Entanglement depth is conventionally defined by exact membership in the mixed <span>(k)</span>-producible hierarchy. At finite resolution, the corresponding metric question is which lower-depth mixed states remain compatible with a target within a prescribed trace-distance tolerance. For the <span>(N)</span>-qubit <span>(W)</span> state, we determine the exact trace distance from <span>(rho _W)</span> to each set of mixed <span>(k)</span>-producible states. We first reduce the pure-state optimization to the product overlap of a generalized <span>(W)</span> state. A local-exchange argument then shows that the maximal-block partition is optimal among all admissible block partitions. Finally, a convex-twirling construction converts the pure-overlap optimum into the exact distance to the full mixed hierarchy. The result separates two metric scales: The nearest pure lower-depth comparator lies at distance <span>(sqrt{1-G})</span>, whereas the nearest mixed lower-depth state lies at distance <span>(1-G)</span>, where <span>(G)</span> is the optimal squared product overlap. In the high-resolution regime, <span>(w_varepsilon (rho _W)=lceil (1-varepsilon )Nrceil )</span> for <span>(0le varepsilon le 1/2)</span>. For arbitrary nonuniform generalized <span>(W)</span> targets, we also obtain the exact best pure <span>(k)</span>-producible overlap and two-sided trace-distance bounds, thereby isolating the role of permutation symmetry in the exact mixed-state law. Here <span>(w_varepsilon )</span> is a compatibility threshold, not a new entanglement monotone. Thus, <span>(W)</span> states provide an exactly solvable reference case for finite-resolution multipartite entanglement depth.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149133047","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":"Gate teleportation using noisy gates","authors":"Imama Tul Birrah Khan, Muhammad Faryad","doi":"10.1007/s11128-026-05342-7","DOIUrl":"10.1007/s11128-026-05342-7","url":null,"abstract":"<div><p>We investigate the performance of a gate teleportation protocol in the presence of realistic noise by considering bit-flip, phase-flip, depolarizing, and amplitude-damping channels acting on each qubit after every gate operation. The teleportation fidelity is evaluated as a function of the noise parameter for different input-state configurations. Our results demonstrate a systematic degradation of fidelity with increasing noise strength, with the magnitude of the degradation depending on both the noise model and the input state. The bit-flip and phase-flip channels exhibit pronounced state-dependent behavior, whereas depolarizing noise leads to comparatively similar fidelity degradation for the considered states. Amplitude damping produces a distinct decrease in fidelity associated with energy dissipation during the teleportation process. These results provide a comparative assessment of the noise sensitivity, robustness, and relative state-dependent degradation of gate teleportation relevant to noisy intermediate-scale quantum devices. \u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149035046","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":"Measurement-device-independent quantum secure direct communication based on decoy states and polarization–spatial hyperentanglement","authors":"Huayao Zhang, Rigui Zhou","doi":"10.1007/s11128-026-05340-9","DOIUrl":"10.1007/s11128-026-05340-9","url":null,"abstract":"<div><p>Quantum secure direct communication (QSDC) can directly transmit confidential messages without pre-distributing secret keys. In practical applications, non-ideal light sources naturally contain multiphoton components, which can enable photon number splitting and quantum storage attacks and therefore hinder secure deployment. Existing measurement-device-independent (MDI) QSDC protocols are mostly developed under idealized source assumptions and do not explicitly certify the confidential contribution of practical single-pair emissions. This paper proposes an MDI-QSDC protocol based on active three-intensity decoy states and polarization–spatial hyperentanglement. The protocol directly bounds the accepted two-single-pair contribution from complete two-round statistics, assigns no positive confidential contribution to uncertified multipair events, and uses private Pauli masking together with a stochastic pre-transmission encoder under the stated collective attack model. Polarization–spatial hyperentangled encoding provides a four-bit alphabet for each exact label HBSA event, while the MDI architecture removes the need to trust the measurement device. Under the declared architecture-aware benchmark, the proposed protocol exhibits a higher secrecy rate lower bound than three reconstructed decoy-state QSDC references in the low-loss regime. This numerical advantage is conditional on the stated source, HBSA module, memory, asymptotic decoy state, and collective Pauli assumptions and is not claimed as a universal fourfold improvement.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149034819","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}
Chengsi Mao, Pavel Mosharev, Yao Wang, Man-Hong Yung
{"title":"A reduction scheme for general-order Ising-like Hamiltonians in quantum heuristic solvers","authors":"Chengsi Mao, Pavel Mosharev, Yao Wang, Man-Hong Yung","doi":"10.1007/s11128-026-05339-2","DOIUrl":"10.1007/s11128-026-05339-2","url":null,"abstract":"<div><p>Ising models are widely used to formulate optimization problems but are notoriously difficult to solve because of combinatorial explosion. In view of this, Hamiltonian reduction is a useful preprocessing technique for reducing the effective problem size before applying heuristic solvers. However, existing reduction techniques mainly target second-order Ising models, whereas many pseudo-Boolean formulations naturally contain higher-order interactions. In this work, we generalize the concept of non-separable groups to arbitrary-order Ising-like models and develop a Hamiltonian reduction framework that iteratively detects and merges constrained spin groups into single variables. We benchmark the method on synthetic hypergraphs and higher-order network datasets and evaluate its integration with downstream order-reduction and solver workflows. Our results establish a foundation for Hamiltonian reduction in higher-order Ising-like optimization problems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148987105","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":"Extremal Magic States from Symmetric Lattices","authors":"Misaki Ohta, Kazuki Sakurai","doi":"10.1007/s11128-026-05337-4","DOIUrl":"10.1007/s11128-026-05337-4","url":null,"abstract":"<div><p>Magic, a key quantum resource beyond entanglement, remains poorly understood in terms of its structure and classification. In this paper, we demonstrate a striking connection between high-dimensional symmetric lattices and quantum magic states. By mapping vectors from the <span>(E_8)</span>, <span>(BW_{16})</span>, and <span>(E_6)</span> lattices into Hilbert space, we construct and classify stabiliser and maximal magic states for two-qubit, three-qubit and one-qutrit systems. In particular, this geometric approach gives closed-form lattice representatives of maximal magic states and motivates a conjecture for the number of three-qubit maximal states. In the three-qubit case, we further classify the extremal magic states according to their entanglement structure. We also show that the 45 one-qutrit maximal magic states selected by the second shell of <span>(E_6)</span> split into two Clifford orbits. Our findings suggest that deep algebraic and geometric symmetries underlie the structure of extremal magic states.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148986833","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":"Verifiable dynamic quantum secure multi-party multiplication protocol based on homomorphic encryption","authors":"Fulin Li, Rongpei Li, Yixin Sun, Shixin Zhu","doi":"10.1007/s11128-026-05347-2","DOIUrl":"10.1007/s11128-026-05347-2","url":null,"abstract":"<div><p>In quantum cryptography, quantum secure multi-party computation plays a significant role. This paper proposes a dynamic quantum secure multi-party multiplication protocol with verifiable result integrity, based on homomorphic encryption. Utilizing the multiplicative homomorphic property of the RSA algorithm, this protocol enables participants to verify the integrity of the final computation result—detecting any error, whether intentional or unintentional, that affects correctness. In particular, the verification mechanism is designed to detect deceptive behavior by revoked participants during dynamic updates, a scenario in which participants have a clear incentive to cheat. Security analysis demonstrates that, compared to existing multiplication protocols, our protocol can resist a series of typical external and internal attacks. Particularly, it can resist dishonest revocation attacks while enabling dynamic participant updates. In summary, our protocol offers enhanced practicality, meaningful security guarantees, and relatively low computational costs.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148986836","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":"Embedding-aware noise modeling of quantum annealing","authors":"Seon-Geun Jeong, Dinh Cong Mai, Dae-Il Noh, Quoc-Viet Pham, Won-Joo Hwang","doi":"10.1007/s11128-026-05293-z","DOIUrl":"10.1007/s11128-026-05293-z","url":null,"abstract":"<div><p>Quantum annealing provides a practical realization of adiabatic quantum computation and has emerged as a promising approach for solving large-scale combinatorial optimization problems. However, current devices remain constrained by sparse hardware connectivity, which requires embedding logical variables into chains of physical qubits. This embedding overhead limits scalability and reduces reliability as longer chains are more prone to noise-induced errors. In this work, we develop an embedding-aware baseline noise framework that connects chain-length growth to accumulated integrated-control-error variance, chain break probability (CBP), chain break fraction (CBF), and chain-strength scaling. We distinguish a moment-level uncorrelated ICE baseline, which yields a linear variance law, from a Gaussian closure that gives a closed-form erfc approximation for CBP. Experiments on the D-Wave Advantage2 Zephyr processor show that the calibrated baseline model captures the dominant growth trend of CBF with embedding size. However, the empirical critical chain-strength exponent ranges from <span>(alpha =0.805)</span> to <span>(alpha =1.006)</span> across chain-break tolerance thresholds, with 95% bootstrap confidence intervals consistently excluding the independent-noise prediction <span>(alpha =0.5)</span>; a direct fit of a correlated-variance extension recovers <span>(gamma approx 1.8)</span>, consistent with the asymptotic relation <span>(gamma =2alpha )</span>. These results indicate that real-hardware variance accumulation deviates from the independent-noise reference and is consistent with a correlated component. The proposed framework offers quantitative guidance for embedding-aware chain-strength tuning and motivates more general noise models incorporating correlated and non-Gaussian hardware effects.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05293-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148986259","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}