• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    International Journal of Quantum Information

    International Journal of Quantum Information

    JournalISSN 0219-7499eISSN 1793-6918中科院 物理与天体物理 4区

    年发文量

    研究主题

    论文(1885)

    排序
    1Architectural Sensitivity of Variational Quantum Circuits for Nonlinear Time-Series Forecasting under NISQ Noise
    W. A. R. De Mel, W. M. S. Bandara

    Variational quantum circuits (VQCs) have been proposed as promising models for nonlinear learning tasks in the noisy intermediate-scale quantum (NISQ) era. This study presents a hybrid classical–quantum framework for nonlinear time-series forecasting that integrates causally-filtered hidden Markov regime detection with multiple VQC architectures. Four circuit architectures are defined as an explicit [Formula: see text] factorial design that isolates circuit depth from entanglement topology (shallow: depth 1/linear; ring: depth 1/ring; deep: depth 4/linear; heavy: depth 4/ring), each with reported qubit count, parameter count and gate count, and they are evaluated under an analytic depolarizing/readout noise model. Three nonlinear classical baselines (support-vector regression, gradient boosting and a multilayer perceptron) are compared alongside a linear autoregressive (AR) baseline, and the hidden Markov model (HMM) regime feature is fit only on training data and propagated causally into the test set to remove look-ahead leakage. Across 20 Monte Carlo replicates, we find that every VQC architecture is outperformed by every classical baseline, including plain linear AR (paired [Formula: see text]-tests, all [Formula: see text]; Cohen’s [Formula: see text] up to 4.8). Within the VQC family, circuit depth — not shallowness — is associated with better performance (deep/heavy [Formula: see text] shallow/ring), while entanglement topology alone has little independent effect once depth is controlled. An ablation removing the HMM-derived feature shows it contributes negligibly to forecast accuracy in this setting. Under this confound-controlled design, we find no evidence of a forecasting advantage for the tested VQC architectures over classical linear or nonlinear baselines, which we report as a cautionary result for claims of near-term quantum advantage in forecasting.

    2026
    引用
    AI阅读
    加入学术空间
    2Binary Correlation Measurements for Entanglement Detection
    Toru Ohira

    We search a simplest and minimal way to determine whether a given quantum system is entangled or separable. For this end, we propose binary correlation measurements in which restricted knowledge of only zero or nonzero correlations is available. We consider the concrete investigation on a pure state for two particles, each particle having two basis states (the 2 & times; 2 system). We show that, even with this limited information from the binary correlation measurements, we can still reach the known minimum of three measurements for entanglement detection. We next consider the comparable problem applied to the mixed density matrix. The mixed quantum case appears to require more detailed information, which we illustrate by studying the concrete example of the Werner density matrix.

    2026
    引用
    AI阅读
    加入学术空间
    3Noise-robust Entanglement Indicator for Two-Qubit Mixed States: Engineering Design for Real-Time Monitoring in Noisy Quantum Key Distribution
    Hanha Yan

    Real-time monitoring of weak entanglement in noisy fiber links is a practical bottleneck for entanglement-based quantum key distribution (QKD). Standard concurrence and negativity vanish with vanishing gradient near the separability boundary and are not optimized for hardware-level line-rate monitoring. We propose a closed-form, noise-robust entanglement indicator & Cscr;R for two-qubit mixed states, constructed by regularizing the Wootters concurrence with a determinant-based spectral penalty. & Cscr;R requires no iterative optimization, retains a nonvanishing gradient along typical QKD noise trajectories, and has an average computation time of 0.189 ms per state. Numerical simulations over 100,000 random states show strong linear correlation with negativity (Pearson 0.986) and entanglement of formation (0.968). Under 12 common LOCC channels relevant to QKD, & Cscr;R is nonincreasing in 100% of tested cases. A field-programmable gate array (FPGA) implementation achieves 210 ns latency, enabling real-time link health monitoring in metropolitan QKD networks.

    2026
    引用
    AI阅读
    加入学术空间
    4An Anonymous Electronic Payment Scheme Based on Controlled Quantum Teleportation
    Mengdie Li, Daicao Wan, Meng Jing,Dianjun Lu, Jin Yang

    With the in-depth development of the digital economy and the escalating demands for transaction security and quantum attack resistance in electronic payment scenarios, quantum signature is gradually emerging as a core research direction in the construction of electronic payment security systems. Addressing the requirements for anonymity and security in electronic payment scenarios, this paper proposes an electronic payment scheme based on controlled quantum teleportation. During the implementation of the scheme, the quantum entanglement characteristics of the four-particle entangled state, the core logic of controlled quantum teleportation, the privacy protection features of proxy blind signature technology, and the technical advantages of superdense coding are integrated to provide security guarantees for the payment process. Meanwhile, the proposed scheme builds a payment system relying on quantum key distribution protocols, forming a payment system with information-theoretic security attributes. This effectively overcomes the limitation that traditional UnionPay payment systems rely on computational complexity at the security level. In addition, the scheme satisfies nonrepudiation and unforgeability and possesses the capability to resist interception-resending attacks.

    2026
    引用
    AI阅读
    加入学术空间
    5Quantum Soft Covering with Relative Entropy Criterion
    Xingyi He,S. Sandeep Pradhan

    In this work, we propose a soft covering problem for fully quantum channels using relative entropy as a criterion for operator closeness. We establish covering lemmas by deriving one-shot bounds on the achievable rates in terms of smooth min-entropies. In the asymptotic regime, we show that the infimum of the rate, defined as the logarithm of the minimum rank of the encoded input state, is given by the minimal coherent information between the reference and output systems that yields the target output state. Furthermore, we present a one-shot quantum decoupling theorem that also employs a relative-entropy criterion. Due to the Pinsker inequality, our one-shot results based on the relative-entropy criterion are tighter than the corresponding results based on the trace norm considered in the literature. In addition, we establish achievable error exponents and second-order rates for quantum soft covering under both trace-distance and relative-entropy criteria.

    2026引用:1
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1885 篇论文

    高被引作者

    作者引用发文
    Andre Allan Methot69483
    Gilles Brassard69131
    Pasquale Calabrese49271
    John Cardy49271
    Matteo Paris280123
    Renato Renner21961
    Hsi-Sheng Goan19612
    Berthold-Georg (Berge) Englert10956
    Karol Życzkowski9214
    Ingemar Bengtsson8851

    高产作者

    作者引用发文
    Matteo Paris280123
    Stefano Olivares18120
    Alessia Allevi15518
    Maria Bondani15518
    Zhanjun Zhang27518
    Shaoming Fei10818
    XIA Yun-jie13915
    Yi-Min Liu15014
    Zhixi Wang5814
    Marco Genovese8313

    相关期刊

    Physical review. A, Atomic, molecular, and optical physics
    NPJ quantum information
    Quantum Science and Technology
    EPJ Quantum Technology
    arXiv: Quantum Physics
    arXiv: Quantum Gases
    Quanta
    PRX QUANTUM
    Quantum Studies: Mathematics and Foundations
    Quantum Reports