PyTorchKR Papers

업데이트된 논문

총 4편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:2607.21186v2quant-ph

On the effects of emulated quantum layers on CNN performance and explainability for OCT and dementia imaging

Hybrid quantum-classical convolutional neural networks have been proposed as an alternative to classical deep learning models. However, executing network components on quantum hardware imposes fundamental limitations, such as gradient estimation through repeated measurements, and increasing the number of qubits can lead to trainability problems such as barren plateaus. Moreover, the reported success of these hybrid networks has been linked to quantum architectures that can be efficiently simulated on classical computers. We investigate whether small, classically simulated quantum circuits can serve as useful components within larger models, as a substitute for purely classical layers. We present a systematic comparison between a Hybrid Quantum-inspired CNN (HQiCNN) and standard CNN architectures, where the models differ only in a single intermediate layer: an emulated quantum circuit in the HQiCNN and classical counterparts in the CNN. The models are evaluated on two medical imaging datasets while varying training set size, learning rate, batch size, circuit entanglement and observable se. Under a strict parameter budget, the HQiCNN outperforms the classical baselines. When the classical layer is given more parameters, overall performance becomes comparable, with the HQiCNN showing improvements only in the intermediate-data regime. Removing entanglement yields comparable performance and richer observable sets yield no performance improvement. Finally, we introduce two SHAP-based metrics for comparing model explanations, $|$SHAP$|$IoU and EMD$_{\mathrm{pos}}$. They show that all architectures attend to anatomically plausible regions, and that the spatial attention agreement between them increases with training set size. These results indicate that, under specific data regimes, quantum-inspired hybrid models are a competitive alternative to classical CNNs for medical image classification.

arXiv:2606.24808v2quant-ph

Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution

Quantum low-density parity-check codes promise low-overhead error correction, but high-performing constructions remain hard to find. Here we introduce structured concept evolution, in which a large language model (LLM) evolves construction programs and their internal search strategies by modifying the finite group, protograph shapes or entry-assignment rule. We search for codes with fewer than $600$ data qubits and check weight at most $12$, optimizing $kd^2/n$ or the circuit-level logical error rate. Our method improves on published lifted-product benchmarks in selected parameter regimes, with exactly certified distances for the leading results. Circuit-level optimization typically yields lower logical error rates than $kd^2/n$ optimization, often despite smaller code distances. With the same evolution framework and step budget, the best LLM outperforms all random-mutation and hill-climbing runs on both objectives. Our results point to LLM-driven program search as an approach to designing general quantum LDPC codes.

arXiv:2607.09737v2physics.chem-ph

Q-Score: 분자 도킹을 위한 양자 네이티브 스코어링 함수

Q-Score: A Quantum-Native Scoring Function for Molecular Docking

분자 도킹은 소분자가 단백질에 결합하는 방식을 예측하며, 신약 개발의 핵심 병목 단계이다. 고전적인 스코어링 함수는 경험적 쌍별 접촉을 합산하는 방식으로, 결합 특이성을 결정하는 궤도 전하 이동과 같은 양자역학적 효과를 반영하지 못한다. 본 연구에서는 Q-Score를 제안한다. Q-Score는 GNN으로 예측된 궤도 전자 공여-수용 에너지를 가중 그래프로 인코딩하고, Digitized-Counterdiabatic QAOA를 통해 최대 가중치 정점 클리크 문제를 풀어 결합을 스코어링한다. 각 상호작용 앵커는 하나의 큐비트에 대응되며, 호환성 제약 조건은 에지로 표현된다. 11개의 단백질 타겟에 대해 DC-QAOA는 10큐비트에서 8개의 타겟에서 정확한 최적해를 복원한다. AI 생성 분자 1,000개에 대해 Q-Score는 Spearman rho 0.05로 고전적 스코어링과 직교하며, rho 0.90으로 궤도 품질에 의해 주도되고, 분자량 바이어스가 없으며, 무작위 대비 두 배의 비율로 강한 궤도 상호작용을 농축시킨다. DC-QAOA는 52%의 정확률과 함께 평균 근사 비율 0.94를 달성한다. IBM Eagle에서 1,000개의 회로 실행을 통해 NISQ 하드웨어상 6큐비트 문제의 해결 가능성이 확인되었다.

arXiv:2607.09906v2quant-ph

금융 스트레스의 국면별 탐지를 위한 깊이 효율적 양자 위상 데이터 분석

Depth-Efficient Quantum Topological Data Analysis for Regime-Specific Detection of Financial Stress

We present, to our knowledge, the first adaptation of Pauli Correlation Encoding (PCE) to quantum topological data analysis, reformulating Betti number estimation as a depth-efficient variational optimization over a compressed qubit register. From a Takens embedding and Vietoris-Rips filtration of S&P 500 returns, we extract combinatorial Laplacians and recast null-space counting as a continuous-PCE Rayleigh-quotient minimization with variational deflation, encoding $n_k$ simplex indices into $O(n_k^{1/\kappa})$ qubits with shallow, ancilla-free circuits. Because the resulting loss is rational rather than bilinear in the correlators, the barren-plateau bound of Sciorilli et al. does not transfer; empirically the gradient variance decays only polynomially, with no exponential barren plateau, over $n=4$-$12$ qubits. The classical stage matches ripser on all 190 sliding windows (2003-2010). On the real market Laplacians ($\beta_1=1$-$22$), PCE-VQE recovers no null vector from a random start, but warm-starting from a classical null-space surrogate recovers $\beta_1$ exactly on all seven windows tested ($n_k \le 259$), placing the obstacle in the optimization landscape rather than the encoding. Chronologically split classification gives in-regime ROC AUC 0.818, but out-of-distribution evaluation on the 2020 COVID shock and 2022 rate cycle (AUC 0.009, 0.515) shows the calibration does not generalize across crisis regimes.