Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Large-scale semidefinite programming from quantum chemistry

真 山下, Makoto Yamashita, 光浩 福田, Mituhiro Fukuda, 克樹 藤澤, Katsuki Fujisawa, 政和 小島, Masakazu Kojima, 和秀 中田, Kazuhide Nakata, 真秀 中田, Maho Nakata

Published Jul 1, 2006• 0 citations
OpenAlex

Related papers

Semidefinite programming from optimization to quantum chemistry

光浩 福田, Mituhiro Fukuda

•Jul 1, 2009•0 citations

Large-scale semidefinite programs in electronic structure calculation

Mituhiro Fukuda, Bastiaan J. Braams, Maho Nakata +4 more

Mathematical Programming•Sep 18, 2006•70 citations

Finite Quantum Tomography and Semidefinite Programming

M. Mirzaee, M. Rezaee, M. A. Jafarizadeh

arXiv:0707.3868•International Journal of Theoretical Physics•Dec 7, 2006•5 citations

Large-Scale Semidefinite Programming for Many-Electron Quantum Mechanics

David A. Mazziotti

The energy of a many-electron quantum system can be approximated by a constrained optimization of the two-electron reduced density matrix (2-RDM) that is solvable in polynomial time by semidefinite programming (SDP). Here we develop a SDP method for computing strongly correlated 2-RDMs that is 10-20 times faster than previous methods [D. A. Mazziotti, Phys. Rev. Lett. 93, 213001 (2004)]. We illustrate with (i) the dissociation of N(2) and (ii) the metal-to-insulator transition of H(50). For H(50) the SDP problem has 9.4×10(6) variables. This advance also expands the feasibility of large-scale applications in quantum information, control, statistics, and economics.

Physical Review Letters•Feb 23, 2011•153 citations

Approximation Algorithms, Quantum Information and Semidefinite Optimization

Nikhil Bansal, Ronald de Wolf, Monique Laurent

•Jul 1, 2015•0 citations

Reformulation in mathematical programming: An application to quantum chemistry

Leo Liberti, Carlile Lavor, Nelson Maculan +1 more

Discrete Applied Mathematics•Oct 25, 2007•14 citations
The energy of a many-electron quantum system can be approximated by a constrained optimization of the two-electron reduced density matrix (2-RDM) that is solvable in polynomial time by semidefinite programming (SDP). Here we develop a SDP method for computing strongly correlated 2-RDMs that is 10-20 times faster than previous methods [D. A. Mazziotti, Phys. Rev. Lett. 93, 213001 (2004)]. We illustrate with (i) the dissociation of N(2) and (ii) the metal-to-insulator transition of H(50). For H(50) the SDP problem has 9.4×10(6) variables. This advance also expands the feasibility of large-scale applications in quantum information, control, statistics, and economics.