Quantum Information Processing最新文献_第3页

Measurement-free reconstruction circuit of quantum secrets in quantum secret sharing 量子秘密共享中量子秘密的无测量重构电路

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-29 DOI: 10.1007/s11128-025-04943-y

Shogo Chiwaki, Ryutaroh Matsumoto

引用次数: 0

Deterministic controlled-phase gates on remote transmon qutrits with input–output theory 基于输入-输出理论的远程收发器确定性控相门

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-27 DOI: 10.1007/s11128-025-04911-6

Ming Hua, Jie Li, Hai-Rui Wei, Ming-Jie Tao

{"title":"Deterministic controlled-phase gates on remote transmon qutrits with input–output theory","authors":"Ming Hua, Jie Li, Hai-Rui Wei, Ming-Jie Tao","doi":"10.1007/s11128-025-04911-6","DOIUrl":"10.1007/s11128-025-04911-6","url":null,"abstract":"<div><p>Crosstalk can degrade the fidelity of quantum operations in highly integrated quantum chips. To mitigate crosstalk and enable large-scale quantum computing (QC) with superconducting qubits (SQs), we adopt a distributed QC architecture. Using input–output theory, we propose a deterministic scheme for implementing a high-fidelity, high-efficiency controlled-phase gate between two remote superconducting transmon qutrits assisted by a flying microwave photon. Furthermore, this gate can be readily extended to a multi-target-qubit controlled-phase gate. In the scheme, a transmon qubit coupled to a double-sided superconducting transmission line resonator serves as the microwave photon emitter, and only one microwave photon is needed to run through the circuit from start to finish without being emitted and absorbed by a qubit–resonator system. To verify the feasibility of the schemes, we calculate the average fidelities and average efficiencies of the controlled-phase gate and the two-target-qubit controlled-phase gate using feasible parameters and found that both exceeded <span>(99.9%)</span>.\u0000</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145145404","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

A tutorial on applying quantum multiple-valued decision diagrams to circuit simulation 量子多值决策图在电路仿真中的应用教程

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-25 DOI: 10.1007/s11128-025-04917-0

Asimakis Kydros, Konstantinos Prousalis, Nikos Konofaos

引用次数: 0

Design and implementation of a fuzzy MISO system with quantum computing analogies 具有量子计算类比的模糊MISO系统的设计与实现

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-25 DOI: 10.1007/s11128-025-04937-w

Maxim Bobyr

引用次数: 0

Dynamic quantum secret sharing based on graph states with agent management in pre-measurement and post-measurement phases 基于图态的动态量子秘密共享，并在测量前和测量后阶段进行代理管理

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-24 DOI: 10.1007/s11128-025-04910-7

Jason Lin, Li-Yu Hsieh

{"title":"Dynamic quantum secret sharing based on graph states with agent management in pre-measurement and post-measurement phases","authors":"Jason Lin, Li-Yu Hsieh","doi":"10.1007/s11128-025-04910-7","DOIUrl":"10.1007/s11128-025-04910-7","url":null,"abstract":"<div><p>This paper proposes an advanced dynamic quantum secret sharing (DQSS) protocol that leverages the graphical properties of graph states. Unlike most existing DQSS protocols, the proposed scheme supports the dynamic addition and revocation of agents both before and after measurements are performed. In the pre-measurement phase, the dealer can adjust agent participation through graphical operations without requiring any action from the agents. In the post-measurement phase, two approaches are introduced to address different security requirements. In the first approach, agents’ shadow keys are hidden from the dealer, which enhances security but requires agent cooperation and incurs additional cost. In the second approach, the shadow keys are revealed to the dealer, which simplifies revocation without additional cost. Moreover, the proposed protocol requires only single-qubit measurements from agents. In terms of security, it resists collusion and attacks by dishonest revoked agents, and it relies solely on one-way quantum channels, thereby eliminating the need for additional devices to prevent Trojan horse attacks.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145144968","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

System design and realisation towards optimising secure key bits in free space QKD 自由空间QKD中安全密钥位优化的系统设计与实现

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04922-3

Pooja Chandravanshi, Jayanth Ramakrishnan, Tanya Sharma, Ayan Biswas, Ravindra P. Singh

{"title":"System design and realisation towards optimising secure key bits in free space QKD","authors":"Pooja Chandravanshi, Jayanth Ramakrishnan, Tanya Sharma, Ayan Biswas, Ravindra P. Singh","doi":"10.1007/s11128-025-04922-3","DOIUrl":"10.1007/s11128-025-04922-3","url":null,"abstract":"<div><p>Quantum Key Distribution (QKD) is rapidly transitioning from cutting-edge laboratory research to real-world deployment in established communication networks. Although QKD promises future-proof security, practical challenges still exist due to imperfections in physical devices. Many protocols offer strong security guarantees, but their implementation can be complex and difficult. To bridge this gap, we present a practical and systematic framework for implementing QKD, focused on the BB84 protocol but designed with broader applicability in mind. The article includes key concepts for device calibration, synchronisation, optical alignment, and key post-processing. We outline a simple algorithm for key sifting that is easily implementable in hardware. Our results highlight the importance of selecting the temporal window to optimise both the key rate and the quantum bit error rate (QBER). In addition, we show that random sampling of the sifted key bits for error estimation yields more reliable results than sequential sampling. We also integrate the Entrapped Pulse Coincidence Detection (EPCD) protocol to boost key generation rates, further enhancing performance. Although our work focuses on BB84, the techniques and practices outlined are general enough to support a wide range of QKD protocols. This makes our framework a valuable tool for both research and real-world deployment of secure quantum communication 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":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110484","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

Superposition of red- and blue-sideband processes in interacting qubits: effects of residual detuning 相互作用量子比特中红蓝边带过程的叠加：残差失谐的影响

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04933-0

Joseph Akeyo Omolo, Onyango Stephen Okeyo, Christopher Mayero

{"title":"Superposition of red- and blue-sideband processes in interacting qubits: effects of residual detuning","authors":"Joseph Akeyo Omolo, Onyango Stephen Okeyo, Christopher Mayero","doi":"10.1007/s11128-025-04933-0","DOIUrl":"10.1007/s11128-025-04933-0","url":null,"abstract":"<div><p>We study a full model of interaction of a pair of two-level atoms initially in atomic spin superposition states. The exact general dynamics is a superposition of energy-conserving red-sideband (co-rotating) and blue-sideband (counter-rotating) qubit state transition processes. Three important dynamical properties arise: First, the full model of atom–atom interaction has an internal non-vanishing <i>residual detuning</i> parameter which characterizes the coupling regimes and determines the nature of the dynamics even at resonance; second, the collective spin population inversion describing the exchange of spin excitations in the blue-sideband transitions undergoes normal periodic Rabi oscillations with peaks at <span>(pm 1)</span> in the strong coupling regime, but develops fast oscillations of progressively diminishing amplitudes in the weak coupling regime, eventually vanishing at extremely weak coupling; third, at resonance, the individual atom spin population inversions undergo a beat phenomenon of periodic amplitude-modulated oscillations with maximum peaks <span>(pm 1)</span> and time period determined by the difference of blue- and red-sideband Rabi frequencies. In off-resonance interactions at intermediate coupling, the beat phenomenon persists over the entire range of the atom–atom frequency of detuning parameter. The periodicity of the beat phenomenon may be interpreted as quantum collapses and revivals of the envelope of amplitude-modulated oscillations. Our analysis establishes significant dynamical differences between two alternative full Hamiltonian models: One model generates entangled Bell states, while the other generates entangled Mølmer–Sørensen states, thereby realizing distinct Bell and Mølmer–Sørensen quantum gates.\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":"145110436","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

Improved quantum circuits for elliptic curve discrete logarithm problems on Ed25519 Ed25519上椭圆曲线离散对数问题的改进量子电路

IF 2.2 3区物理与天体物理

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

Yan Huang, Fangguo Zhang, Zhi Hu, Zijian Zhou, Longjiang Qu

{"title":"Improved quantum circuits for elliptic curve discrete logarithm problems on Ed25519","authors":"Yan Huang, Fangguo Zhang, Zhi Hu, Zijian Zhou, Longjiang Qu","doi":"10.1007/s11128-025-04916-1","DOIUrl":"10.1007/s11128-025-04916-1","url":null,"abstract":"<div><p>It is well known that Shor’s algorithm can solve elliptic curve discrete logarithmic problems (ECDLP) in polynomial time on a quantum computer. The optimization of its quantum resources has been a hot issue. In this paper, we optimize quantum resources by utilizing the advantages of Ed25519. By leveraging the special finite field structure of Ed25519 and integer multiplication via the convolution theorem, we achieve significant reductions in quantum resource requirements for modular multiplication: 97% in T-count, 60% in T-depth, and 16% in qubit usage compared with the state-of-the-art result proposed by Häner et al. Then, we have designed reversible point addition operations and incorporated parallelization techniques on Ed25519 to further improve the quantum resources required for solving ECDLP. By incorporating these optimization strategies, we achieve significant improvements across all key metrics: a 75% reduction in T-count, 87% reduction in T-depth, and 12% reduction in qubit requirements compared with the state-of-the-art quantum resources for solving 256-bit ECDLP proposed by Häner et al. Furthermore, in Appendix A, we consider prime fields specified in the ECC standard by NIST; the corresponding modular multiplication demonstrates significant improvements in quantum gate count, circuit depth, and qubit requirements.\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":"145110473","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

Invariant distributions of 1-dimensional homogeneous quantum Markov chains: procedure and examples 一维齐次量子马尔可夫链的不变量分布：程序和例子

IF 2.2 3区物理与天体物理

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

C. F. Lardizabal

引用次数: 0

Edge-based quantum approximate optimization algorithm for MAX-CUT problem 基于边缘的量子近似优化算法求解MAX-CUT问题

IF 2.2 3区物理与天体物理

Quantum Information Processing Pub Date : 2025-09-23 DOI: 10.1007/s11128-025-04925-0

Youngjin Seo, Jun Heo

{"title":"Edge-based quantum approximate optimization algorithm for MAX-CUT problem","authors":"Youngjin Seo, Jun Heo","doi":"10.1007/s11128-025-04925-0","DOIUrl":"10.1007/s11128-025-04925-0","url":null,"abstract":"<div><p>Quantum computing has emerged as a promising paradigm to tackle computationally intensive problems that classical computers struggle with. In this study, we explore the application of the Edge-based quantum approximate optimization algorithm (QAOA) to the MAX-CUT problem, a well-known combinatorial optimization challenge. MAX-CUT aims to partition the vertices of a graph into two subsets such that the number of edges between the subsets is maximized. We define the edge-based MAX-CUT problem and propose a method for applying QAOA specifically tailored to this formulation. We conduct simulations using IBM’s Qiskit framework, examining both vertex-based and edge-based QAOA implementations across various graph structures. Our results highlight the comparative performance of these approaches in terms of solution quality and computational efficiency. Specifically, we analyze the impact of different graph sizes and edge densities on the complexity and CNOT gate counts of the proposed algorithms. This analysis provides insights into leveraging quantum computing for combinatorial optimization tasks, particularly focusing on the implications for practical applications and future research directions.</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-04925-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110439","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