Quantum Information Processing最新文献_第7页

Cyclic codes over a semi-local ring and their applications to QEC and EAQEC codes

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-31 DOI: 10.1007/s11128-025-04666-0

Hui Li, Xiusheng Liu

引用次数: 0

Investigating and mitigating barren plateaus in variational quantum circuits: a survey

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-31 DOI: 10.1007/s11128-025-04665-1

Jack Cunningham, Jun Zhuang

{"title":"Investigating and mitigating barren plateaus in variational quantum circuits: a survey","authors":"Jack Cunningham, Jun Zhuang","doi":"10.1007/s11128-025-04665-1","DOIUrl":"10.1007/s11128-025-04665-1","url":null,"abstract":"<div><p>In recent years, variational quantum circuits (VQCs) have been widely explored to advance quantum circuits against classic models on various domains, such as quantum chemistry and quantum machine learning. Similar to classic machine-learning models, VQCs can be trained through various optimization approaches, such as gradient-based or gradient-free methods. However, when employing gradient-based methods, the gradient variance of VQCs may dramatically vanish as the number of qubits or layers increases. This issue, a.k.a. barren plateaus (BPs), seriously hinders the scaling of VQCs on large datasets. To mitigate the barren plateaus, extensive efforts have been devoted to tackling this issue through diverse strategies. In this survey, we conduct a systematic literature review of recent works from both investigation and mitigation perspectives. Furthermore, we propose a new taxonomy to categorize most existing mitigation strategies into five groups and introduce them in detail. Also, we compare the concurrent survey papers about BPs. Finally, we provide insightful discussion on future directions for BPs.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-025-04665-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109882","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

Continuous variable-based quantum communication in the ocean

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-30 DOI: 10.1007/s11128-025-04664-2

Ramniwas Meena, Subhashish Banerjee

{"title":"Continuous variable-based quantum communication in the ocean","authors":"Ramniwas Meena, Subhashish Banerjee","doi":"10.1007/s11128-025-04664-2","DOIUrl":"10.1007/s11128-025-04664-2","url":null,"abstract":"<div><p>Continuous variable-based quantum cryptography (CV-QKD) is an emerging field in quantum information science, offering unprecedented security for communication protocols by harnessing the principles of quantum mechanics. However, ocean environments pose unique challenges to quantum communication due to their distinct properties and characteristics. This work investigates the impact of turbulence on the transmission of Gaussian light beams used in a continuous variable-based quantum key distribution system for underwater quantum communication. The objective is to quantitatively analyze the induced losses and propose methodologies to mitigate their effects. To achieve this, we adopt the widely accepted ABCD matrix formalism, which provides a comprehensive framework for characterizing the propagation of optical beams through different media. Moreover, a numerical simulation framework is developed to assess the resulting losses and evaluate the performance of the proposed system. The implications of these numerical simulation frameworks for the design and optimization of quantum communication systems for oceanic environments are thoroughly discussed.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143110108","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

Bounds for disentropy of the Wigner function

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-30 DOI: 10.1007/s11128-024-04602-8

J. L. E. da Silva, D. C. Souza, R. V. Ramos

引用次数: 0

Dynamic quantum Cournot duopoly with externality cost functions and relative profit maximization

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-29 DOI: 10.1007/s11128-025-04662-4

Dandan Guo, Die Zhou, Chun Wang, Guanghui Yang, Hui Yang

{"title":"Dynamic quantum Cournot duopoly with externality cost functions and relative profit maximization","authors":"Dandan Guo, Die Zhou, Chun Wang, Guanghui Yang, Hui Yang","doi":"10.1007/s11128-025-04662-4","DOIUrl":"10.1007/s11128-025-04662-4","url":null,"abstract":"<div><p>This paper establishes a dynamic quantum Cournot game model incorporating an externality cost function, where participants aim to maximize relative profits and possess bounded rationality, updating their output for the next period using a gradient adjustment mechanism. Based on the established model, we analyze the existence and stability of quantum Nash equilibria and investigate the complex behavior of the system. The research results indicate that as the adjustment speed increases, the system’s stability decreases due to the emergence of Flip and Neimark–Sacker bifurcations. However, increasing the degree of quantum entanglement can delay the occurrence of bifurcation behavior. Furthermore, we find that when enterprises cannot control chaotic states by adjusting external cost parameters, they can transition the system from a chaotic to a stable state by altering product differentiation and quantum entanglement. Finally, numerical simulations validate the theoretical analysis and visually demonstrate complex dynamic characteristics, such as bifurcation diagrams, the maximum Lyapunov exponent, strange attractors, sensitivity to initial conditions, and chaos.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143110022","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

Novel quantum voting protocol for four-particle entangled states based on superdense coding

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-29 DOI: 10.1007/s11128-025-04663-3

Hao-Wen Zhang, Guang-Bao Xu, Dong-Huan Jiang

引用次数: 0

Optimizing qubit control pulses for state preparation

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-28 DOI: 10.1007/s11128-024-04613-5

Annika S. Wiening, Jörn Bergendahl, Vicente Leyton-Ortega, Peter Nalbach

引用次数: 0

Physical synthesis of quantum circuits using Q-learning

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-27 DOI: 10.1007/s11128-025-04648-2

Dengli Bu, Zhiyan Bin, Jing Sun

{"title":"Physical synthesis of quantum circuits using Q-learning","authors":"Dengli Bu, Zhiyan Bin, Jing Sun","doi":"10.1007/s11128-025-04648-2","DOIUrl":"10.1007/s11128-025-04648-2","url":null,"abstract":"<div><p>The present status of quantum computing is of the noisy intermediate-scale quantum (NISQ) era. In addition to the limited number of available qubits, NISQ devices generally possess two other physical constraints, quantum gate and interaction constraints. Those constraints should be satisfied in order for realizing a quantum circuit on an NISQ device. However, this often introduces extra CNOT gates into the circuit which harm the fidelity of the resulting circuit. Consequently, the number of extra CNOT gates needs to be reduced while compiling a quantum circuit onto an NISQ device. To this end, here, a solution that uses Q-learning (QL) is proposed by dividing physical synthesis of quantum circuits into qubit placement and routing. QL algorithms are designed for qubit placement and routing, respectively, by considering them as sequential decision-making problems. A physical synthesis method for quantum circuits is proposed by first using a QL algorithm to learn an optimally initial qubit mapping and then using another QL algorithm to learn an optimal routing scheme. A number of quantum circuits are compiled onto quantum architectures provided by IBM and grid architectures by using the proposed synthesis method. Compared to several methods for physical synthesis of quantum circuits, the proposed synthesis method can reduce the number of extra CNOT gates or the depth of the resulted physical quantum circuit in many cases. In a few cases, the QL algorithm designed for qubit placement can find an initial qubit mapping that makes all gates in a circuit being executed on a quantum architecture provided by IBM.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109715","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-memory-assisted entropic uncertainty and steered quantum coherence in double quantum dots system under thermal equilibrium and decoherence

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-27 DOI: 10.1007/s11128-025-04661-5

Yanliang Zhang, Guodong Kang, Qingping Zhou, Maofa Fang

{"title":"Quantum-memory-assisted entropic uncertainty and steered quantum coherence in double quantum dots system under thermal equilibrium and decoherence","authors":"Yanliang Zhang, Guodong Kang, Qingping Zhou, Maofa Fang","doi":"10.1007/s11128-025-04661-5","DOIUrl":"10.1007/s11128-025-04661-5","url":null,"abstract":"<div><p>In this paper, we have investigated the behavioral features of quantum-memory-assisted entropic uncertainty (QMA-EU), the lower bound of QMA-EU, and steered quantum coherence (SQC) in double quantum dots system hosting a single electron spin in the presence of external magnetic field and Rashba spin-orbit interaction (SOI) under thermal equilibrium and decoherence conditions, respectively. We find that although the nonlocality and nonclassicality quantified by QMA-EU and SQC deteriorates even disappears as thermal fluctuation dominates the system at higher temperature, the Rashba SOI and tunneling effects between the two quantum dots can be used effectively to enhance the thermal performance of quantumness, which is to enhance the system’s SQC and reduce QMA-EU. However, if the decoherence is taken into account, the Rashba SOI accelerates evolution oscillation frequency of QMA-EU and SQC and even makes the oscillation of them smooth. Furthermore, we reveal that the behavior of SQC with respect to the Rashba SOI and tunneling effects is not strictly opposite to that of QMA-EU.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109716","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 cryptanalysis of reduced-round E2 algorithm

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-01-25 DOI: 10.1007/s11128-025-04649-1

Ying Xu, Xiaoni Du, Meichun Jia, Xiangyu Wang, Jian Zou

{"title":"Quantum cryptanalysis of reduced-round E2 algorithm","authors":"Ying Xu, Xiaoni Du, Meichun Jia, Xiangyu Wang, Jian Zou","doi":"10.1007/s11128-025-04649-1","DOIUrl":"10.1007/s11128-025-04649-1","url":null,"abstract":"<div><p>E2 algorithm is one of the 15 candidate algorithms in the first round of AES collection. In this paper, taking E2-128 as an example, the quantum security analysis on E2 algorithm is proposed for the first time in quantum chosen-plaintext attack setting. First, a polynomial-time distinguisher on 4-round E2-128 is constructed with <span>(2^{12.1})</span> quantum queries by taking the properties of the internal round function into consideration. Then, by extending the distinguisher 2 rounds backward, a 6-round quantum key recovery attack is achieved with the help of Grover-meet-Simon algorithm, whose time complexities gain a factor of <span>(2^{76})</span>, where the subkey length that can be recovered is 152 bits with the occupation of 560 qubits. Furthermore, when attacking <span>(r>6)</span> rounds, <span>(152+(r-6)times 128)</span>-bit subkey needs to be guessed in time <span>(2^{76+(r-6)times 64})</span>, which is <span>(frac{1}{2^{52}})</span> of Grover’s quantum brute force search. Finally, we present a quantum attack against E2-128 with <span>({2^{88.1}})</span> quantum queries by taking initial transformation and terminal transformation into consideration. The result shows that the time complexity of the quantum attack is significantly reduced, and E2 algorithm is safe enough to resist quantum attack.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109544","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