惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园 - 三生石上(FineUI控件)
月光博客
月光博客
S
SegmentFault 最新的问题
有赞技术团队
有赞技术团队
Stack Overflow Blog
Stack Overflow Blog
Engineering at Meta
Engineering at Meta
T
The Blog of Author Tim Ferriss
The GitHub Blog
The GitHub Blog
小众软件
小众软件
Hugging Face - Blog
Hugging Face - Blog
IT之家
IT之家
宝玉的分享
宝玉的分享
A
About on SuperTechFans
Vercel News
Vercel News
P
Proofpoint News Feed
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 【当耐特】
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
V
Visual Studio Blog
Jina AI
Jina AI
Y
Y Combinator Blog
T
Tailwind CSS Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Last Week in AI
Last Week in AI

cs.DS updates on arXiv.org

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications A computational phase transition for learning-to-sample from Ising models Covering vertices by sequential stars Fermi-Dirac machines as quantizations of neurons A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation A Tight Bound on Localization of Electrical Flows Optimal Dimension-Free Sampling for Regularized Classification Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs Beyond the Half-Approximation: Fair and Efficient Online Class Matching Efficient Uniform Sampling of Surjections via their Profiles Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking Learning-Augmented Online Scheduling with Parsimonious Preemption Entropy Equivalence Testing Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees The Secretary Problem with a Stochastic Precursor Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification Block-Sphere Vector Quantization An Approximation Algorithm for Graph Label Selection Iterative Chow Filtering for Learning with Distribution Shift Complexity of Non-Log-Concave Sampling in Fisher Information Stochastic Matching via Local Sparsification Finite Sample Bounds for Learning with Score Matching What is Learnable in Valiant's Theory of the Learnable? Provable Quantization with Randomized Hadamard Transform Min-Max Optimization Requires Exponentially Many Queries Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm A proximal gradient algorithm for composite log-concave sampling
Accuracy and resource advantages of quantum eigenvalue es...
Alexey Uvarov, Artur F. Izmaylov · 2025-11-27 · via cs.DS updates on arXiv.org

In electronic structure calculations, the transcorrelated method consists in transforming the Hamiltonian so as to remove the Coulomb cusp in its eigenfunctions. As a result, the wavefunction can be described more accurately without increasing the size of the basis set. However, the transcorrelated Hamiltonian is non-Hermitian and non-normal, which makes many common quantum algorithms inapplicable. Recently, a quantum eigenvalue estimation algorithm (QEVE) was proposed for non-Hermitian Hamiltonians with real spectra [FOCS 65, 1051 (2024)]. Although the asymptotic scaling of this algorithm with the desired accuracy is shown to be optimal, the constant factor in its complexity scaling has not been analyzed. Here we investigate the cost of QEVE applied to transcorrelated electronic Hamiltonians of second-row atoms and compare it to the cost of applying standard qubitization to non-transcorrelated Hamiltonians. We find that, with the xTC approximation, the T gate count of QEVE in the minimal STO-6G basis is between those of standard qubitization in the cc-pVTZ and cc-pVQZ bases. The accuracy of the transcorrelated energy differs between systems: for Li and Be, it is more accurate than the cc-pVQZ energy, while for larger atoms, the error gradually increases, exceeding the cc-pVDZ level for O, F, and Ne.