Scaling the semidefinite program solver SDPB

Abstract

We present enhancements to SDPB, an open source, parallelized, arbitrary precision semidefinite program solver designed for the conformal bootstrap. The main enhancement is significantly improved performance and scalability using the Elemental library and MPI. The result is a new version of SDPB that runs on multiple nodes with hundreds of cores with excellent scaling, making it practical to solve larger problems. We demonstrate performance on a moderate-size problem in the 3d Ising CFT and a much larger problem in the $O(2)$ Model.

13 pages plus references, 2 figures

References in corpus (7)

• Solving M-theory with the Conformal Bootstrap
• Bootstrapping the long-range Ising model in three dimensions
• Bootstrapping Mixed Correlators in Three-Dimensional Cubic Theories
• Decoding a Three-Dimensional Conformal Manifold
• Monopole Operators in $U(1)$ Chern-Simons-Matter Theories
• Constraints on Flavored 2d CFT Partition Functions
• Scalar CFTs and Their Large N Limits

Cited by in corpus (16)

• Sharp Boundaries for the Swampland
• Dispersive CFT Sum Rules
• The Lorentzian inversion formula and the spectrum of the 3d O(2) CFT
• Rigorous bounds on irrelevant operators in the 3d Ising model CFT
• ${\mathbb{Z}}_N$ Symmetries, Anomalies, and the Modular Bootstrap
• Bootstrapping Mixed Correlators in Three-Dimensional Cubic Theories II
• Bootstrapping boundary-localized interactions II: Minimal models at the boundary
• Scrambling and decoding the charged quantum information
• Perturbative and Nonperturbative Studies of CFTs with MN Global Symmetry
• Bootstrapping traceless symmetric $O(N)$ scalars
• Exploring $SU(N)$ adjoint correlators in $3d$
• Bootstrapping Closed Hyperbolic Surfaces
• Bootstrap Bounds on Closed Hyperbolic Manifolds
• Conformal Bootstrap Deformations
• Conformal Bootstrap with Reinforcement Learning
• Multi-fixed point numerical conformal bootstrap: a case study with structured global symmetry