Determining the ensemble N-representability of Reduced Density Matrices
- URL: http://arxiv.org/abs/2602.06167v1
- Date: Thu, 05 Feb 2026 20:11:03 GMT
- Title: Determining the ensemble N-representability of Reduced Density Matrices
- Authors: Ofelia B. Oña, Gustavo E. Massaccesi, Pablo Capuzzi, Luis Lain, Alicia Torre, Juan E. Peralta, Diego R. Alcoba, Gustavo E. Scuseria,
- Abstract summary: We propose a framework for determining the ensemble N-representability of a p-body matrix.<n>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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 consisting of embedding 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 of 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.
Related papers
- Controlled measurement, Hermitian conjugation and normalization in matrix-manipulation algorithms [46.13392585104221]
We introduce the concept of controlled measurement that solves the problem of small access probability to the desired state of ancilla.<n>Separate encoding of the real and imaginary parts of a complex matrix allows to include the Hermitian conjugation into the list of matrix manipulations.<n>We weaken the constraints on the absolute values of matrix elements unavoidably imposed by the normalization condition for a pure quantum state.
arXiv Detail & Related papers (2025-03-27T08:49:59Z) - Determining the N-representability of a reduced density matrix via unitary evolution and stochastic sampling [0.0]
This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions.<n>The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide if a given p-body matrix is N-representable.
arXiv Detail & Related papers (2025-03-21T16:52:22Z) - Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
arXiv Detail & Related papers (2025-03-19T07:01:38Z) - Projective purification of correlated reduced density matrices [0.0]
We present an algorithm capable of performing all of the following tasks in the least invasive manner.<n>We demonstrate the superiority of the present purification algorithm over previous ones in the context of the Fermi-Hubbard model.
arXiv Detail & Related papers (2024-12-18T07:33:51Z) - Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization [1.1999555634662633]
This work focuses on quantifying sampling errors during the measurement of matrix element in the projected Hamiltonian.<n>We propose two measurement strategies: the shifting technique and coefficient splitting.<n> Numerical experiments with electronic structures of small molecules demonstrate the effectiveness of these strategies.
arXiv Detail & Related papers (2024-09-04T08:06:06Z) - Finite-element assembly approach of optical quantum walk networks [39.58317527488534]
We present a finite-element approach for computing the aggregate scattering matrix of a network of linear coherent scatterers.
Unlike traditional finite-element methods in optics, this method does not directly solve Maxwell's equations.
arXiv Detail & Related papers (2024-05-14T18:04:25Z) - Vectorization of the density matrix and quantum simulation of the von
Neumann equation of time-dependent Hamiltonians [65.268245109828]
We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations.
We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix.
A quantum algorithm to simulate the dynamics of the density matrix is proposed.
arXiv Detail & Related papers (2023-06-14T23:08:51Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Efficient Quantum Analytic Nuclear Gradients with Double Factorization [0.0]
We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians.
We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically-simulated examples.
arXiv Detail & Related papers (2022-07-26T18:47:48Z) - Density Matrix Renormalization Group Algorithm For Mixed Quantum States [0.0]
We propose a positive matrix product ansatz for mixed quantum states which preserves positivity by construction.
This algorithm is applied for computing both the equilibrium states and the non-equilibrium steady states.
arXiv Detail & Related papers (2022-03-30T14:29:31Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.