4 Search Results

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce the computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina’s theorem (Rosina, M. Queen’s Papers on Pure and Applied Mathematics, 1968, No. 11, 369), we here show that the matrix completion is unique under certain conditions, identifying the subsetmore » of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum–stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi–Hubbard model.« less

The N-representability problem for reduced density matrices remains a fundamental challenge in electronic structure theory. Following our previous work that employs a unitary-evolution algorithm based on an adaptive derivative-assembled pseudo-Trotter variational quantum algorithm to probe pure-state N-representability of reduced density matrices [J. Chem. Theory Comput. 2024, 20, 9968], in this work we propose a practical framework for determining the ensemble N-representability of a p-body matrix. This is accomplished using a purification strategy that embeds an ensemble state into a pure state defined on an extended Hilbert space, such that the reduced density matrices of the purified state reproduce those ofmore » the original ensemble. By iteratively applying variational unitaries to an initial purified state, the proposed algorithm minimizes the Hilbert-Schmidt distance between its p-body reduced density matrix and a specified target p-body matrix, which serves as a measure of the N-representability of the target. This methodology facilitates both error correction of defective ensemble reduced density matrices and quantum-state reconstruction on a quantum computer, offering a route for density-matrix refinement. We validate the algorithm with numerical simulations on systems of two, three, and four electrons in both simple models as well as molecular systems at finite temperature, demonstrating its robustness.« less

The N-representability problem consists in determining whether, for a given p-body matrix, there exists at least one N-body density matrix from which the p-body matrix can be obtained by contraction, that is, if the given matrix is a p-body reduced density matrix (p-RDM). The knowledge of all necessary and sufficient conditions for a p-body matrix to be N-representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p-body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N-representability conditions grows exponentially with system size, andmore » hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions. The algorithm consists of applying to an initial N-body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p-body subsystem, represented by a p-RDM, to a target p-body matrix, potentially a p-RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p-body matrix is N-representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.« less

We introduce a generalization of the σ-SCF method to approximate noncollinear spin ground and excited single-reference electronic states by minimizing the Hamiltonian variance. The new method is based on the σ-SCF method, originally proposed by Ye et al. [J. Chem. Phys. 147, 214104 (2017)], and provides a prescription to determine ground and excited noncollinear spin states on an equal footing. Our implementation was carried out utilizing an initial simulated annealing stage followed by a mean-field iterative self-consistent approach to simplify the cumbersome search introduced by generalizing the spin degrees of freedom. The simulated annealing stage ensures a broad exploration ofmore » the Hilbert space spanned by the generalized spin single-reference states with random complex element-wise rotations of the generalized density matrix elements in the simulated annealing stage. The mean-field iterative self-consistent stage employs an effective Fockian derived from the variance, which is utilized to converge tightly to the solutions. This process helps us to easily find complex spin structures, avoiding manipulating the initial guess. As proof-of-concept tests, we present results for Hn (n = 3–7) planar rings and polyhedral clusters with geometrical spin frustration. We show that most of these systems have noncollinear spin excited states that can be interpreted in terms of geometric spin frustration. These states are not directly targeted by energy minimization methods, which are meant to converge to the ground state. This stresses the capability of the σ-SCF methodology to find approximate noncollinear spin structures as mean-field excited states.« less