Pedro M. Prado, Rafael Simões do Carmo, Lucas A. M. Rattighieri, Luiz Gustavo Esmenard Arruda, Giovanni S. Franco, Marcos César de Oliveira, Felipe F. Fanchini
{"title":"Portfolio optimization via FALQON variants: warm starting, XY mixing, and circuit depth reduction","authors":"Pedro M. Prado, Rafael Simões do Carmo, Lucas A. M. Rattighieri, Luiz Gustavo Esmenard Arruda, Giovanni S. Franco, Marcos César de Oliveira, Felipe F. Fanchini","doi":"10.1007/s11128-026-05291-1","DOIUrl":"10.1007/s11128-026-05291-1","url":null,"abstract":"<div><p>Discrete portfolio selection with cardinality constraints can be formulated as a quadratic unconstrained binary optimization (QUBO) problem. We investigate FALQON, TR-FALQON, and SO-FALQON combined with transverse-field, XY, and warm start mixers. Statevector simulations were performed for <span>(n=6)</span> assets over 25 random seeds and for a representative <span>(n=10)</span> instance. For <span>(n=6)</span>, the XY mixer achieved success probabilities above <span>(97%)</span>, whereas for <span>(n=10)</span>, the warm start mixer was the only approach to exceed the <span>(50%)</span> threshold. These results show that mixer design plays a central role in convergence and solution visibility.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05291-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614989","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}
{"title":"Hermitian hull of some GRS codes and new entanglement-assisted quantum MDS codes","authors":"Oisin Campion, Rodrigo San-José","doi":"10.1007/s11128-026-05297-9","DOIUrl":"10.1007/s11128-026-05297-9","url":null,"abstract":"<div><p>We study the Hermitian hull of a particular family of generalized Reed–Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas for the dimension of the hull, which determines the minimum number required of maximally entangled pairs for the associated entanglement-assisted quantum error-correcting codes. This flexible construction allows to obtain a wide range of entanglement-assisted quantum MDS codes, as well as new parameters.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05297-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148615027","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}
{"title":"Weakest precondition calculus and relative completeness of satisfaction-based quantum Hoare logic","authors":"Xin Sun, Xingchi Su, Xiaoning Bian, Huiwen Wu","doi":"10.1007/s11128-026-05296-w","DOIUrl":"10.1007/s11128-026-05296-w","url":null,"abstract":"<div><p>Quantum Hoare logic (QHL) is a formal verification tool specifically designed to ensure the correctness of quantum programs. There has been an ongoing challenge to achieve a relatively complete satisfaction-based QHL with a while loop since its inception in 2006. This paper presents a solution. We prove the relative completeness in two steps. First, we establish a semantics and proof system of Hoare triples with quantum programs and deterministic assertions. Then, utilizing the weakest precondition of deterministic assertion, we construct the weakest preterm calculus of probabilistic expressions. The relative completeness of QHL is then obtained as a consequence of the weakest preterm calculus.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05296-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148615050","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}
{"title":"A dynamic group multi-party signature scheme based on extended quantum teleportation","authors":"Xin-Yu Li, Dong-Huan Jiang, Hua-Kun Wang, Yu-Guang Yang, Guang-Bao Xu","doi":"10.1007/s11128-026-05290-2","DOIUrl":"10.1007/s11128-026-05290-2","url":null,"abstract":"<div><p>With the development of quantum computing, classical signature techniques are facing growing security challenges. In this paper, we propose a dynamic group multi-party quantum signature scheme based on extended quantum teleportation. Our scheme, which uses Greenberger–Horne–Zeilinger (GHZ) states to transmit information, allows for the addition or removal of participants at will. It realizes the dynamic management of group signature permissions and identity authentication by virtue of the state transmission of extended quantum teleportation. The signature process relies on the entanglement characteristics of GHZ states to accomplish the secure transmission and collaborative verification of information, and achieves a good balance between signature efficiency and security. Consequently, it is well suited for scenarios requiring collaborative authorization, such as decentralized systems and documents that require signatures from multiple departments. The security analysis demonstrates that the scheme is unforgeable, undeniable, and secure against interception-forgery attacks. We further validated the feasibility of our scheme through simulation experiments on Qiskit.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614566","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":"Polarization Bell state analysis using orbital angular momentum entanglement in linear optics","authors":"Zi-Long Yang, Shi-Wen He, Zheng Liu, Si-Tong Jin, Xiao-Ming Xiu, Lin-Cheng Wang, Chong Li","doi":"10.1007/s11128-026-05265-3","DOIUrl":"10.1007/s11128-026-05265-3","url":null,"abstract":"<div><p>Bell state analysis (BSA) is an essential operation for distinguishing Bell states in numerous quantum information processing (QIP) protocols. Here, we propose a linear optical scheme to distinguish four polarization Bell states by exploiting orbital angular momentum (OAM) degree of freedom (DOF) as a self-assisted resource. The linear-optics-based architecture circumvents the inherent limitations of nonlinear optical interactions, and the self-assisted entanglement eliminates the requirement for auxiliary photons—a major challenge in practical QIP implementations. This deterministic BSA scheme offers a promising route toward practical and high-performance QIP tasks in photonic systems.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614553","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}
Amit Devra, Léo Van Damme, Frederik vom Ende, Emanuel Malvetti, Steffen J. Glaser
{"title":"Theory and experimental demonstration of Wigner tomography of unknown unitary quantum gates","authors":"Amit Devra, Léo Van Damme, Frederik vom Ende, Emanuel Malvetti, Steffen J. Glaser","doi":"10.1007/s11128-026-05269-z","DOIUrl":"10.1007/s11128-026-05269-z","url":null,"abstract":"<div><p>We investigate the tomography of unknown unitary quantum processes within the framework of a finite-dimensional Wigner-type representation. This representation provides a rich visualization of quantum operators by depicting them as shapes assembled as a linear combination of spherical harmonics. These shapes can be experimentally tomographed using a scanning-based phase-space tomography approach. However, so far, this approach was limited to <i>known</i> target processes and only provided information about the controlled version of the process rather than the process itself. To overcome this limitation, we introduce a general protocol to extend Wigner tomography to <i>unknown</i> unitary processes. This new method enables experimental tomography by combining a set of experiments with classical post-processing algorithms introduced herein to reconstruct the unknown process. We also demonstrate the tomography approach experimentally on IBM quantum devices and present the specific calibration circuits required for quantifying undesired errors in the measurement outcomes of these demonstrations.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05269-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614554","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}
{"title":"((1,1-2v))-constacyclic codes over (mathbb {F}_qtimes (mathbb {F}_q+vmathbb {F}_q)) and their applications to QEC codes","authors":"Xiusheng Liu, Jie Liu","doi":"10.1007/s11128-026-05298-8","DOIUrl":"10.1007/s11128-026-05298-8","url":null,"abstract":"<div><p>Let <span>(mathcal {R}_q=mathbb {F}_qtimes (mathbb {F}_q+vmathbb {F}_q))</span> with <span>(v^2=v)</span> and <i>q</i> be an odd prime power. Firstly, we give two Gray maps from <span>(mathcal {R}_q^n)</span> to <span>(mathbb {F}_q^{3n})</span>. Next, we provide the structure of all <span>((1,1-2v))</span>-constacyclic codes and their dual codes with a length <i>n</i> over <span>(mathcal {R}_q)</span>. By means of these structures, we give also the structure of all Euclidean hulls and sums of <span>((1,1-2v))</span>-constacyclic codes of length <i>n</i> over <span>(mathcal {R}_q)</span>. Finally, using Steane’s construction and quantum construction <i>X</i> of the Euclidean dual, we provide two methods for constructing quantum error-correcting (QEC, for short) codes via the Euclidean sums and hulls of <span>((1,1-2v))</span>-constacyclic codes and linear codes of length <i>n</i> over <span>(mathcal {R}_q)</span>. To enrich the variety of available QEC codes, some new QEC codes are constructed to illustrate our results. \u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614594","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":"Construction of asymmetric quantum codes via two subsets","authors":"Guohui Wang, Yucheng Chen, Chunming Tang","doi":"10.1007/s11128-026-05303-0","DOIUrl":"10.1007/s11128-026-05303-0","url":null,"abstract":"<div><p>Asymmetric quantum error-correcting codes (AQECCs) are error correction schemes designed for asymmetric errors in quantum computing. Unlike traditional symmetric quantum error-correcting codes, AQECCs assume that the probabilities of qubits occurring in different types of errors (such as bit flipping and phase flipping) are different, thereby optimizing resource allocation and improving error correction efficiency. This paper explores the construction of optimal asymmetric quantum codes by utilizing generalized Reed-Solomon (GRS) codes. The construction approach focuses on selecting two appropriate subsets, either disjoint or intersecting, of finite fields, ensuring that the resulting MDS codes possess Euclidean hulls of arbitrary dimensions. From these MDS codes, we present a variety of new constructions for optimal asymmetric quantum codes, with flexible parameter configurations.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614595","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}
S. M. Pillay, I. J. David, I. Sinayskiy, F. Petruccione
{"title":"Optimising Trotter-Suzuki simulations of Markovian open quantum systems via classical search","authors":"S. M. Pillay, I. J. David, I. Sinayskiy, F. Petruccione","doi":"10.1007/s11128-026-05267-1","DOIUrl":"10.1007/s11128-026-05267-1","url":null,"abstract":"<div><p>Simulating an open quantum system on a digital quantum computer often involves the use of Trotter-Suzuki (TS) Product Formulas (PF) to approximate the system’s time evolution. Precise estimates for the required number of Trotter steps (and hence the overall gate count) can be crucial for minimising the computational cost of these methods. Building on established theoretical guarantees, we derive analytic bounds for the first- and second-order deterministic and randomised TS-PF, directly relating the number of Trotter steps to the model parameters, evolution time and precision. These bounds enable concrete resource estimation for each method. We then present a computationally efficient classical algorithm that uses diamond norm estimates of individual Liouvillian terms and a binary search to significantly reduce the Trotter steps required for a target precision. Our numerical results on two prototypical models—an XX-Spin Chain with boundary driving and local dephasing, and a Transverse Field Ising Model—show that the theoretical (analytic) bounds are often overly conservative, whereas the empirical (optimised) bounds yield a significantly smaller number of Trotter steps for the same precision. Among the methods investigated, the second-order randomised TS-PF typically achieves the lowest resource demands, especially for larger systems. These findings emphasise the significance of empirical bounding strategies in achieving more resource-efficient simulations of Markovian open quantum systems.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05267-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148613990","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}
{"title":"Coherence scaling in quantum communication protocols","authors":"Pedro Henrique Alvarez, Marcos César de Oliveira","doi":"10.1007/s11128-026-05279-x","DOIUrl":"10.1007/s11128-026-05279-x","url":null,"abstract":"<div><p>We investigate how quantum coherence scales and is redistributed in quantum communication protocols, using superdense coding and quantum teleportation as paradigmatic case studies. Employing the relative entropy of coherence as a stage-resolved, circuit-level resource measure, we show that multipartite resource states relevant to generalized superdense coding can enable scalable communication while exhibiting only logarithmic or even constant coherence growth, depending on their entanglement structure. In contrast, within the standard teleportation circuit and with coherence evaluated in the computational basis, teleportation displays a protocol-induced coherence contribution that grows linearly with the number of teleported qubits. Through a stage-resolved analysis, we separate coherence generated by the teleportation circuit from message-dependent contributions and identify, at the maximal-coherence pre-measurement stage, a two-bit coherence offset per teleported qubit for computational-basis incoherent inputs, with an additional term given by the input-message coherence in the general case. We further show explicitly that this extensive intermediate coherence generation is fully consistent with information-theoretic bounds, including the Holevo limit, and does not correspond to an increase in accessible classical information.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"25 8","pages":""},"PeriodicalIF":2.2,"publicationDate":"2026-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-026-05279-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148613999","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}