通过块不变对称移位(BLISS)方法中的线性规划实现电子哈密顿 1 准则的全局最小化。

IF 5.7 1区 化学 Q2 CHEMISTRY, PHYSICAL Journal of Chemical Theory and Computation Pub Date : 2025-01-13 DOI:10.1021/acs.jctc.4c01390
Smik Patel, Aritra Sankar Brahmachari, Joshua T Cantin, Linjun Wang, Artur F Izmaylov
{"title":"通过块不变对称移位(BLISS)方法中的线性规划实现电子哈密顿 1 准则的全局最小化。","authors":"Smik Patel, Aritra Sankar Brahmachari, Joshua T Cantin, Linjun Wang, Artur F Izmaylov","doi":"10.1021/acs.jctc.4c01390","DOIUrl":null,"url":null,"abstract":"<p><p>The cost of encoding a system Hamiltonian in a digital quantum computer as a linear combination of unitaries (LCU) grows with the 1-norm of the LCU expansion. The Block Invariant Symmetry Shift (BLISS) technique reduces this 1-norm by modifying the Hamiltonian action on only the undesired electron-number subspaces. Previously, BLISS required a computationally expensive nonlinear optimization that was not guaranteed to find the global minimum. Here, we introduce various reformulations of this optimization as a linear programming problem, which guarantees optimality and significantly reduces the computational cost. We apply BLISS to industrially relevant homogeneous catalysts in active spaces of up to 76 orbitals, finding substantial reductions in both the spectral range of the modified Hamiltonian and the 1-norms of Pauli and fermionic LCUs. Our linear programming techniques for obtaining the BLISS operator enable more efficient Hamiltonian simulation and, by reducing the Hamiltonian's spectral range, offer opportunities for improved LCU groupings to further reduce the 1-norm.</p>","PeriodicalId":45,"journal":{"name":"Journal of Chemical Theory and Computation","volume":" ","pages":""},"PeriodicalIF":5.7000,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Global Minimization of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method.\",\"authors\":\"Smik Patel, Aritra Sankar Brahmachari, Joshua T Cantin, Linjun Wang, Artur F Izmaylov\",\"doi\":\"10.1021/acs.jctc.4c01390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>The cost of encoding a system Hamiltonian in a digital quantum computer as a linear combination of unitaries (LCU) grows with the 1-norm of the LCU expansion. The Block Invariant Symmetry Shift (BLISS) technique reduces this 1-norm by modifying the Hamiltonian action on only the undesired electron-number subspaces. Previously, BLISS required a computationally expensive nonlinear optimization that was not guaranteed to find the global minimum. Here, we introduce various reformulations of this optimization as a linear programming problem, which guarantees optimality and significantly reduces the computational cost. We apply BLISS to industrially relevant homogeneous catalysts in active spaces of up to 76 orbitals, finding substantial reductions in both the spectral range of the modified Hamiltonian and the 1-norms of Pauli and fermionic LCUs. Our linear programming techniques for obtaining the BLISS operator enable more efficient Hamiltonian simulation and, by reducing the Hamiltonian's spectral range, offer opportunities for improved LCU groupings to further reduce the 1-norm.</p>\",\"PeriodicalId\":45,\"journal\":{\"name\":\"Journal of Chemical Theory and Computation\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":5.7000,\"publicationDate\":\"2025-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Chemical Theory and Computation\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.1021/acs.jctc.4c01390\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, PHYSICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Theory and Computation","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.1021/acs.jctc.4c01390","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, PHYSICAL","Score":null,"Total":0}
引用次数: 0

摘要

在数字量子计算机中将系统哈密顿编码为单元线性组合(LCU)的成本会随着 LCU 扩展的 1-norm 而增加。块不变对称位移(BLISS)技术只对不需要的电子数子空间修改哈密顿作用,从而降低了1-norm。以前,BLISS 需要进行计算成本高昂的非线性优化,而且不能保证找到全局最小值。在这里,我们将这一优化过程改写为线性规划问题,既保证了最优性,又大大降低了计算成本。我们将 BLISS 应用于多达 76 个轨道的活性空间中与工业相关的均相催化剂,发现修正哈密顿的光谱范围以及保利和费米子 LCU 的 1-norms 均大幅减少。我们获得 BLISS 算子的线性编程技术能够更有效地模拟哈密顿,并通过缩小哈密顿的光谱范围,为改进 LCU 分组以进一步缩小 1-norm 提供了机会。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Global Minimization of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method.

The cost of encoding a system Hamiltonian in a digital quantum computer as a linear combination of unitaries (LCU) grows with the 1-norm of the LCU expansion. The Block Invariant Symmetry Shift (BLISS) technique reduces this 1-norm by modifying the Hamiltonian action on only the undesired electron-number subspaces. Previously, BLISS required a computationally expensive nonlinear optimization that was not guaranteed to find the global minimum. Here, we introduce various reformulations of this optimization as a linear programming problem, which guarantees optimality and significantly reduces the computational cost. We apply BLISS to industrially relevant homogeneous catalysts in active spaces of up to 76 orbitals, finding substantial reductions in both the spectral range of the modified Hamiltonian and the 1-norms of Pauli and fermionic LCUs. Our linear programming techniques for obtaining the BLISS operator enable more efficient Hamiltonian simulation and, by reducing the Hamiltonian's spectral range, offer opportunities for improved LCU groupings to further reduce the 1-norm.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Chemical Theory and Computation
Journal of Chemical Theory and Computation 化学-物理:原子、分子和化学物理
CiteScore
9.90
自引率
16.40%
发文量
568
审稿时长
1 months
期刊介绍: The Journal of Chemical Theory and Computation invites new and original contributions with the understanding that, if accepted, they will not be published elsewhere. Papers reporting new theories, methodology, and/or important applications in quantum electronic structure, molecular dynamics, and statistical mechanics are appropriate for submission to this Journal. Specific topics include advances in or applications of ab initio quantum mechanics, density functional theory, design and properties of new materials, surface science, Monte Carlo simulations, solvation models, QM/MM calculations, biomolecular structure prediction, and molecular dynamics in the broadest sense including gas-phase dynamics, ab initio dynamics, biomolecular dynamics, and protein folding. The Journal does not consider papers that are straightforward applications of known methods including DFT and molecular dynamics. The Journal favors submissions that include advances in theory or methodology with applications to compelling problems.
期刊最新文献
Directed Electrostatics Strategy Integrated as a Graph Neural Network Approach for Accelerated Cluster Structure Prediction. Multiscale Responsive Kinetic Modeling: Quantifying Biomolecular Reaction Flux under Varying Electrochemical Conditions. Assessing Nonadiabatic Dynamics Methods in Long Timescales. How the Piecewise-Linearity Requirement for the Density Affects Quantities in the Kohn-Sham System. Coil-Library-Derived Amino-Acid-Specific Side-Chain χ1 Dihedral Angle Potentials for AMBER-Type Protein Force Field.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1