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

Journal of Chemical Theory and Computation

Improved Speed and Scaling in Orbital Space Variational Monte Carlo

Iliya Sabzevari, Sandeep Sharma

Published Nov 12, 2018• 42 citations
Publisher

Abstract

In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that, by appropriately screening the one- and two-electron integrals of the Hamiltonian, one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the cost of obtaining a constant error per electron scales as the second power of the system size O ( N 2 ), down from the fourth power O ( N 4 ). Using numerical results, we demonstrate that the practical scaling obtained is, in fact, O ( N 1.5 ) for a chain of hydrogen atoms. Second, we show that, by using the adaptive stochastic gradient descent algorithm called AMSGrad, one can optimize the wave function energies robustly and efficiently. Remarkably, AMSGrad is almost as inexpensive as the simple stochastic gradient descent but delivers a convergence rate that is comparable to that of the Stochastic Reconfiguration algorithm, which is significantly more expensive and has a worse scaling with the system size. Third, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. Unlike the first two improvements, CTMC does come at an overhead that the local energy must be calculated at every Monte Carlo step. However, this overhead is mitigated to a large extent because of the reduced scaling algorithm, which ensures that the asymptotic cost of calculating the local energy is equal to that of updating the walker. The resulting algorithm allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wave function containing ∼2 × 10 5 variational parameters with an accuracy of 1 mE h /particle at a cost of just 25 CPU h, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wave functions, represents a highly effective method for calculating the electronic structure of model and ab initio systems.

DOI
10.1021/acs.jctc.8b00780

Related papers

Faster and lower scaling orbital-space Variational Monte Carlo

Iliya Sabzevari, Sandeep Sharma

In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that by appropriately screening the one- and two-electron integrals of the Hamiltonian one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the resulting algorithm scales as the second power of the system size $O(N^2)$, down from the fourth power $O(N^4)$. Using numerical results, we demonstrate that the practical scaling obtained is in fact $O(N^{1.5})$ for a chain of Hydrogen atoms, and $O(N^{1.2})$ for the Hubbard model. Second, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. CTMC is usually prohibitively expensive because of the need to calculate a large number of intermediates. Here, we take advantage of the fact that these intermediates are already calculated during the evaluation of the local energy and consequently, just by storing them one can use the CTCM algorithm with virtually no overhead. Third, we show that by using the adaptive stochastic gradient descent algorithm called AMSGrad one can optimize the wavefunction energies robustly and efficiently. The combination of these three improvements allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wavefunction containing $\sim 2\times 10^5$ variational parameters with an accuracy of 1 $mE_h$/particle at a cost of just 25 CPU hours, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wavefunctions, represents a highly effective method for calculating the electronic structure of model and \emph{ab initio} systems.

arXiv:1807.10633•Jul 27, 2018•2 citations

Vandermonde Wave Function Ansatz for Improved Variational Monte Carlo

Alberto Acevedo, Michael J. Curry, Shantanu H. Joshi +2 more

Solutions to the Schrodinger equation can be used to predict the electronic structure of molecules and materials and therefore infer their complex physical and chemical properties. Variational Quantum Monte Carlo (VMC) is a technique that can be used to solve the weak form of the Schrodinger equation. Applying VMC to systems with N electrons involves evaluating the determinant of an N by N matrix. The evaluation of this determinant scales as O(N3) and is the main computational cost in the VMC process. In this work, we investigate an alternative VMC technique based on the Vandermonde determinant. The Vandermonde determinant is a product of pairwise differences and so evaluating it scales as O(N2). Therefore, this approach reduces the computational cost by a factor of N. The Vandermonde determinant was implemented in PyTorch and the performance was assessed in approximating the ground state energy of various quantum systems against existing techniques. The performance is evaluated in a variety of systems, starting with the one-dimensional particle in a box, and then considering more complicated atomic systems with multiple particles. The Vandermonde determinant was also implemented in PauliNet, a deep-learning architecture for VMC. The new method is shown to be computationally efficient, and results in a speed-up as large as 5X. In these cases, the new ansatz obtains a reasonable approximation for wavefunctions of atomic systems, but does not reach the accuracy of the Hartree-Fock method that relies on the Slater determinant. It is observed that while the use of neural networks in VMC can result in highly accurate solutions, further work is necessary to determine an appropriate balance between computational time and accuracy.

IEEE/ACM Workshop on Deep Learning on Supercomputers (DLS)•Nov 1, 2020•9 citations

Efficient local energy evaluation for multi-Slater wave functions in orbital space quantum Monte Carlo

Ankit Mahajan, Sandeep Sharma

We present an algorithm for calculating the local energy of a multi-Slater wave function in orbital space quantum Monte Carlo (QMC). Recent developments in selected configuration interaction methods have led to increased interest in using multi-Slater trial wave functions in various QMC methods. For an ab initio Hamiltonian, our algorithm has a cost scaling of O(n5 + nc), as opposed to the O(n4nc) scaling of existing orbital space algorithms, where n is the system size and nc is the number of configurations in the wave function. We present our method using variational Monte Carlo calculations with the Jastrow multi-Slater wave function, although the formalism should be applicable for auxiliary field QMC. We apply it to polyacetylene and demonstrate the possibility of using a much larger number of configurations than possible using existing methods.

arXiv:2008.06477•The Journal of Chemical Physics•Nov 18, 2020•22 citations

Variational Monte Carlo for Ab Initio Electronic Structure and Quantum Chemistry with Neural Quantum States, Natural-Gradient Optimization, and Selective State-Space Models

Devanik Debnath

TitleVariational Monte Carlo for Ab Initio Electronic Structure with Neural Quantum States and Selective State-Space Models Overview This repository provides a research implementation of Variational Monte Carlo (VMC) for ab initio electronic-structure calculations using Neural Quantum States (NQS). The work focuses on stable natural-gradient optimization, physically motivated wavefunction constraints, and the exploration of alternative architectural inductive biases for modeling electronic correlation. The project is released as an exploratory research artifact. All results, limitations, and open questions are stated explicitly. The work is motivated by a central question in modern neural quantum chemistry:can alternative sequence-based architectures reduce the quadratic scaling bottleneck of electron–electron interaction modeling while preserving physical fidelity? Scientific Scope The framework targets: Atomic systems (H through Ne) Small molecules (e.g., H₂, LiH, H₂O) Exploratory extensions, including: Periodic boundary conditions Excited-state considerations Berry-phase estimation Entanglement diagnostics Time-dependent VMC via McLachlan’s variational principle At present, numerical validation is limited to a single-electron benchmark (Hydrogen) and is explicitly presented as a sanity check of the physics engine and optimization loop, not as evidence of improved expressivity for correlated fermions. Core Methodology The implementation follows the standard Variational Monte Carlo formalism, in which a parameterized wavefunctionψ is optimized by minimizing the energy expectation value Optimization is performed using Stochastic Reconfiguration (SR), a natural-gradient method that accounts for the geometry of the variational manifold and significantly improves stability compared to first-order optimizers. Key numerical features include: Log-domain arithmetic for wavefunction evaluation Stable determinant computation using slogdet Hutchinson trace estimation for Laplacian evaluation Explicit enforcement of Kato cusp conditions via analytic Jastrow factors Multi-determinant antisymmetric ansatz to satisfy fermionic exchange symmetry SSM-Backflow Hypothesis The primary research contribution explored in this repository is the SSM-Backflow hypothesis. Most contemporary NQS models (e.g., FermiNet, PauliNet) model electron–electron interactions using explicit quadratic aggregation, leading to O(Ne2)O(N_e^2)O(Ne2) computational complexity. This work investigates an alternative inductive bias: For each electron, neighboring electrons are sorted by inter-electron distance The resulting sequence is processed using a selective state-space model (SSM) inspired by Mamba architectures Correlation information is accumulated sequentially through a learned recurrence Aggregated messages are used to parameterize backflow transformations or orbital functions This approach yields a theoretical complexity of O(Nelog⁡Ne)O(N_e \log N_e)O(NelogNe) per layer (dominated by sorting) and is motivated by the physical observation that electronic correlation typically decays approximately exponentially with distance. Importantly, this is treated strictly as a hypothesis. The manuscript explicitly notes that: SSMs are not permutation-invariant by construction Sequential ordering may introduce inductive biases misaligned with fermionic symmetry Empirical validation on multi-electron systems is required before drawing conclusions Results and Current Validation Status At present, the repository reports results for atomic hydrogen (Ne = 1): Exact energy: −0.500000 Ha Achieved energy: −0.5001 Ha Error: 0.12 mHa (well below chemical accuracy) Local-energy variance: 0.0454 Optimizer: Stochastic Reconfiguration Convergence: ~100 optimization steps Because hydrogen has no electron–electron correlation, this result is interpreted solely as a sanity check of: Hamiltonian implementation Local-energy estimator Natural-gradient optimization loop Numerical stability mechanisms The manuscript clearly states that multi-electron benchmarks (e.g., He, Li, or H₂) are required to meaningfully evaluate the SSM-Backflow hypothesis and are planned for future versions. Stability and Diagnostics The implementation includes multiple practical safeguards designed to stabilize VMC optimization: Dynamic energy-based divergence detection Variance-based walker reset mechanisms Controlled respawning of walkers near nuclear centers In addition, an exploratory commutator-based diagnostic (informally termed the “Noether Inverse”) is included as a monitoring signal during training. This quantity is explicitly not claimed to represent a new conserved symmetry and is treated purely as an empirical observation requiring further theoretical and numerical investigation. Intended Use and Limitations This repository is released as: A research implementation A transparent record of an ongoing investigation A foundation for future validation and benchmarking It is not presented as a production-ready electronic-structure solver, nor as evidence of state-of-the-art performance. All limitations are explicitly documented in the manuscript. Licensing and Reuse The work is shared to encourage: Reproducibility Methodological discussion Extension and validation by the community If you use or build upon this work, please cite the Zenodo DOI associated with this release.

•Feb 17, 2026•0 citations

A novel method for optimizing quantum Monte Carlo wave functions

Hongxin Huang, Zexing Cao

We propose an algorithm for optimizing quantum Monte Carlo wave functions. An improved steepest-descent technique is used, with step size automatically adjustable to obtain a procedure that converges superlinearly. We also propose a novel trial function, which has both correct electron–electron cusp conditions and correct electron–nucleus cusp conditions. To test the optimization procedure and the optimized trial function, the ground states for CH4 and H2O molecules were investigated using variational Monte Carlo (VMC) and fixed-node quantum Monte Carlo (FNQMC) calculations. For CH4 and H2O, the VMC recovered 73.3% and 57.9% of the correlation energy, respectively, and the FNQMC recovered 99.3% and 92.8%, respectively. The optimization procedure is three to five times faster than conventional usual steepest-descent procedures. The trial functions optimized are more accurate than prior trial functions of similar complexity.

The Journal of Chemical Physics•Jan 1, 1996•26 citations

Optimizing large parameter sets in variational quantum Monte Carlo

Eric Neuscamman, Cyrus J. Umrigar, Garnet Kin‐Lic Chan

We present a technique for optimizing hundreds of thousands of variational parameters in variational quantum Monte Carlo. By introducing iterative Krylov subspace solvers and by multiplying by the Hamiltonian and overlap matrices as they are sampled, we remove the need to construct and store these matrices and thus bypass the most expensive steps of the stochastic reconfiguration and linear method optimization techniques. We demonstrate the effectiveness of this approach by using stochastic reconfiguration to optimize a correlator product state wave function with a Pfaffian reference for four example systems. In two examples on the two dimensional Fermionic Hubbard model, we study 16 and 64 site lattices, recovering energies accurate to 1$%$ in the smaller lattice and predicting particle-hole phase separation in the larger. In two examples involving an ab initio Hamiltonian, we investigate the potential energy curve of a symmetrically dissociated $4\ifmmode\times\else\texttimes\fi{}4$ hydrogen lattice as well as the singlet-triplet gap in free base porphin. In the hydrogen system we recover 98$%$ or more of the correlation energy at all geometries, while for porphin we compute the gap in a 24 orbital active space to within 0.02 eV of the exact result. The number of variational parameters in these examples ranges from $4\ifmmode\times\else\texttimes\fi{}{10}^{3}$ to $5\ifmmode\times\else\texttimes\fi{}{10}^{5}$.

arXiv:1108.0900•Physical Review B•Jan 5, 2012•125 citations
In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that, by appropriately screening the one- and two-electron integrals of the Hamiltonian, one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the cost of obtaining a constant error per electron scales as the second power of the system size O ( N 2 ), down from the fourth power O ( N 4 ). Using numerical results, we demonstrate that the practical scaling obtained is, in fact, O ( N 1.5 ) for a chain of hydrogen atoms. Second, we show that, by using the adaptive stochastic gradient descent algorithm called AMSGrad, one can optimize the wave function energies robustly and efficiently. Remarkably, AMSGrad is almost as inexpensive as the simple stochastic gradient descent but delivers a convergence rate that is comparable to that of the Stochastic Reconfiguration algorithm, which is significantly more expensive and has a worse scaling with the system size. Third, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. Unlike the first two improvements, CTMC does come at an overhead that the local energy must be calculated at every Monte Carlo step. However, this overhead is mitigated to a large extent because of the reduced scaling algorithm, which ensures that the asymptotic cost of calculating the local energy is equal to that of updating the walker. The resulting algorithm allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wave function containing ∼2 × 10 5 variational parameters with an accuracy of 1 mE h /particle at a cost of just 25 CPU h, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wave functions, represents a highly effective method for calculating the electronic structure of model and ab initio systems.
In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that by appropriately screening the one- and two-electron integrals of the Hamiltonian one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the resulting algorithm scales as the second power of the system size O(N2)O(N^2)O(N2), down from the fourth power O(N4)O(N^4)O(N4). Using numerical results, we demonstrate that the practical scaling obtained is in fact O(N1.5)O(N^{1.5})O(N1.5) for a chain of Hydrogen atoms, and O(N1.2)O(N^{1.2})O(N1.2) for the Hubbard model. Second, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. CTMC is usually prohibitively expensive because of the need to calculate a large number of intermediates. Here, we take advantage of the fact that these intermediates are already calculated during the evaluation of the local energy and consequently, just by storing them one can use the CTCM algorithm with virtually no overhead. Third, we show that by using the adaptive stochastic gradient descent algorithm called AMSGrad one can optimize the wavefunction energies robustly and efficiently. The combination of these three improvements allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wavefunction containing ∼2×105\sim 2\times 10^5∼2×105 variational parameters with an accuracy of 1 mEhmE_hmEh​/particle at a cost of just 25 CPU hours, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wavefunctions, represents a highly effective method for calculating the electronic structure of model and \emph{ab initio} systems.
Solutions to the Schrodinger equation can be used to predict the electronic structure of molecules and materials and therefore infer their complex physical and chemical properties. Variational Quantum Monte Carlo (VMC) is a technique that can be used to solve the weak form of the Schrodinger equation. Applying VMC to systems with N electrons involves evaluating the determinant of an N by N matrix. The evaluation of this determinant scales as O(N3) and is the main computational cost in the VMC process. In this work, we investigate an alternative VMC technique based on the Vandermonde determinant. The Vandermonde determinant is a product of pairwise differences and so evaluating it scales as O(N2). Therefore, this approach reduces the computational cost by a factor of N. The Vandermonde determinant was implemented in PyTorch and the performance was assessed in approximating the ground state energy of various quantum systems against existing techniques. The performance is evaluated in a variety of systems, starting with the one-dimensional particle in a box, and then considering more complicated atomic systems with multiple particles. The Vandermonde determinant was also implemented in PauliNet, a deep-learning architecture for VMC. The new method is shown to be computationally efficient, and results in a speed-up as large as 5X. In these cases, the new ansatz obtains a reasonable approximation for wavefunctions of atomic systems, but does not reach the accuracy of the Hartree-Fock method that relies on the Slater determinant. It is observed that while the use of neural networks in VMC can result in highly accurate solutions, further work is necessary to determine an appropriate balance between computational time and accuracy.
We present an algorithm for calculating the local energy of a multi-Slater wave function in orbital space quantum Monte Carlo (QMC). Recent developments in selected configuration interaction methods have led to increased interest in using multi-Slater trial wave functions in various QMC methods. For an ab initio Hamiltonian, our algorithm has a cost scaling of O(n5 + nc), as opposed to the O(n4nc) scaling of existing orbital space algorithms, where n is the system size and nc is the number of configurations in the wave function. We present our method using variational Monte Carlo calculations with the Jastrow multi-Slater wave function, although the formalism should be applicable for auxiliary field QMC. We apply it to polyacetylene and demonstrate the possibility of using a much larger number of configurations than possible using existing methods.
TitleVariational Monte Carlo for Ab Initio Electronic Structure with Neural Quantum States and Selective State-Space Models Overview This repository provides a research implementation of Variational Monte Carlo (VMC) for ab initio electronic-structure calculations using Neural Quantum States (NQS). The work focuses on stable natural-gradient optimization, physically motivated wavefunction constraints, and the exploration of alternative architectural inductive biases for modeling electronic correlation. The project is released as an exploratory research artifact. All results, limitations, and open questions are stated explicitly. The work is motivated by a central question in modern neural quantum chemistry:can alternative sequence-based architectures reduce the quadratic scaling bottleneck of electron–electron interaction modeling while preserving physical fidelity? Scientific Scope The framework targets: Atomic systems (H through Ne) Small molecules (e.g., H₂, LiH, H₂O) Exploratory extensions, including: Periodic boundary conditions Excited-state considerations Berry-phase estimation Entanglement diagnostics Time-dependent VMC via McLachlan’s variational principle At present, numerical validation is limited to a single-electron benchmark (Hydrogen) and is explicitly presented as a sanity check of the physics engine and optimization loop, not as evidence of improved expressivity for correlated fermions. Core Methodology The implementation follows the standard Variational Monte Carlo formalism, in which a parameterized wavefunctionψ is optimized by minimizing the energy expectation value Optimization is performed using Stochastic Reconfiguration (SR), a natural-gradient method that accounts for the geometry of the variational manifold and significantly improves stability compared to first-order optimizers. Key numerical features include: Log-domain arithmetic for wavefunction evaluation Stable determinant computation using slogdet Hutchinson trace estimation for Laplacian evaluation Explicit enforcement of Kato cusp conditions via analytic Jastrow factors Multi-determinant antisymmetric ansatz to satisfy fermionic exchange symmetry SSM-Backflow Hypothesis The primary research contribution explored in this repository is the SSM-Backflow hypothesis. Most contemporary NQS models (e.g., FermiNet, PauliNet) model electron–electron interactions using explicit quadratic aggregation, leading to O(Ne2)O(N_e^2)O(Ne2) computational complexity. This work investigates an alternative inductive bias: For each electron, neighboring electrons are sorted by inter-electron distance The resulting sequence is processed using a selective state-space model (SSM) inspired by Mamba architectures Correlation information is accumulated sequentially through a learned recurrence Aggregated messages are used to parameterize backflow transformations or orbital functions This approach yields a theoretical complexity of O(Nelog⁡Ne)O(N_e \log N_e)O(NelogNe) per layer (dominated by sorting) and is motivated by the physical observation that electronic correlation typically decays approximately exponentially with distance. Importantly, this is treated strictly as a hypothesis. The manuscript explicitly notes that: SSMs are not permutation-invariant by construction Sequential ordering may introduce inductive biases misaligned with fermionic symmetry Empirical validation on multi-electron systems is required before drawing conclusions Results and Current Validation Status At present, the repository reports results for atomic hydrogen (Ne = 1): Exact energy: −0.500000 Ha Achieved energy: −0.5001 Ha Error: 0.12 mHa (well below chemical accuracy) Local-energy variance: 0.0454 Optimizer: Stochastic Reconfiguration Convergence: ~100 optimization steps Because hydrogen has no electron–electron correlation, this result is interpreted solely as a sanity check of: Hamiltonian implementation Local-energy estimator Natural-gradient optimization loop Numerical stability mechanisms The manuscript clearly states that multi-electron benchmarks (e.g., He, Li, or H₂) are required to meaningfully evaluate the SSM-Backflow hypothesis and are planned for future versions. Stability and Diagnostics The implementation includes multiple practical safeguards designed to stabilize VMC optimization: Dynamic energy-based divergence detection Variance-based walker reset mechanisms Controlled respawning of walkers near nuclear centers In addition, an exploratory commutator-based diagnostic (informally termed the “Noether Inverse”) is included as a monitoring signal during training. This quantity is explicitly not claimed to represent a new conserved symmetry and is treated purely as an empirical observation requiring further theoretical and numerical investigation. Intended Use and Limitations This repository is released as: A research implementation A transparent record of an ongoing investigation A foundation for future validation and benchmarking It is not presented as a production-ready electronic-structure solver, nor as evidence of state-of-the-art performance. All limitations are explicitly documented in the manuscript. Licensing and Reuse The work is shared to encourage: Reproducibility Methodological discussion Extension and validation by the community If you use or build upon this work, please cite the Zenodo DOI associated with this release.
We propose an algorithm for optimizing quantum Monte Carlo wave functions. An improved steepest-descent technique is used, with step size automatically adjustable to obtain a procedure that converges superlinearly. We also propose a novel trial function, which has both correct electron–electron cusp conditions and correct electron–nucleus cusp conditions. To test the optimization procedure and the optimized trial function, the ground states for CH4 and H2O molecules were investigated using variational Monte Carlo (VMC) and fixed-node quantum Monte Carlo (FNQMC) calculations. For CH4 and H2O, the VMC recovered 73.3% and 57.9% of the correlation energy, respectively, and the FNQMC recovered 99.3% and 92.8%, respectively. The optimization procedure is three to five times faster than conventional usual steepest-descent procedures. The trial functions optimized are more accurate than prior trial functions of similar complexity.
We present a technique for optimizing hundreds of thousands of variational parameters in variational quantum Monte Carlo. By introducing iterative Krylov subspace solvers and by multiplying by the Hamiltonian and overlap matrices as they are sampled, we remove the need to construct and store these matrices and thus bypass the most expensive steps of the stochastic reconfiguration and linear method optimization techniques. We demonstrate the effectiveness of this approach by using stochastic reconfiguration to optimize a correlator product state wave function with a Pfaffian reference for four example systems. In two examples on the two dimensional Fermionic Hubbard model, we study 16 and 64 site lattices, recovering energies accurate to 1% in the smaller lattice and predicting particle-hole phase separation in the larger. In two examples involving an ab initio Hamiltonian, we investigate the potential energy curve of a symmetrically dissociated $4\ifmmode\times\else\texttimes\fi{}4$ hydrogen lattice as well as the singlet-triplet gap in free base porphin. In the hydrogen system we recover 98% or more of the correlation energy at all geometries, while for porphin we compute the gap in a 24 orbital active space to within 0.02 eV of the exact result. The number of variational parameters in these examples ranges from $4\ifmmode\times\else\texttimes\fi{}{10}^{3}$ to $5\ifmmode\times\else\texttimes\fi{}{10}^{5}$.