Determining the ensemble N-representability of Reduced Density Matrices

Technical Summary: Determining the Ensemble N-Representability of Reduced Density Matrices

Problem Statement
The N-representability problem is a foundational challenge in electronic structure theory, concerning the necessary and sufficient conditions a $p$-body reduced density matrix ($p$-RDM) must satisfy to be derivable from an $N$-electron wave function or mixed (ensemble) state. While significant progress has been made regarding pure-state N-representability, determining the ensemble N-representability of a $p$-RDM remains a critical hurdle, particularly for applications involving thermal mixtures, open quantum systems, and statistical ensembles. Verifying whether a given $p$-RDM corresponds to a physical $N$-electron state is computationally intractable in the general case, belonging to the quantum Merlin-Arthur-complete complexity class. Existing approximate conditions are often insufficient for strongly correlated systems, and the complete set of necessary and sufficient conditions for $p$-RDMs (where $p > 1$) remains unknown.

Methodology
This work proposes a practical framework to determine the ensemble N-representability of a $p$-body matrix by extending a previously developed unitary-evolution algorithm (pure ADAPT-VQA) to the ensemble case. The core methodology relies on a purification strategy:

1. Purification Embedding: Following the Schrödinger-Hughston-Jozsa-Wootters theorem, an ensemble state $\rho$ defined on a Hilbert space $\mathcal{H}_s$ is embedded into a pure state $|\Psi_{sb}\rangle$ defined on an extended Hilbert space $\mathcal{H}_{sb} = \mathcal{H}_s \otimes \mathcal{H}_b$, where $\mathcal{H}_b$ is an auxiliary space. The purification is constructed such that $\rho = \text{Tr}_b(|\Psi_{sb}\rangle\langle\Psi_{sb}|)$, ensuring the reduced density matrices of the purified state reproduce those of the original ensemble.
2. Variational Unitary Evolution: The algorithm employs an adaptive derivative-assembled pseudo-Trotter (ADAPT) variational quantum algorithm (VQA). It iteratively applies variational unitaries to an initial purified state (constructed from an initial $N$-particle state $|\phi_0\rangle$ and its purification).
3. Operator Pool: The evolution is driven by an antihermitian excitation-deexcitation operator pool suitable for fermions, restricted to canonical ensemble constraints (no particle number changes in the system or auxiliary space). These operators are mapped to Pauli operators via the Jordan-Wigner transformation, making the algorithm suitable for quantum computer simulation.
4. Optimization Objective: The algorithm minimizes the Hilbert-Schmidt distance ($D$) between the $p$-RDM of the evolved purified state and a specified target $p$-RDM ($p\rho_{\text{target}}$).
   • If the algorithm converges to a distance $D_{\min} \approx 0$, the target is deemed ensemble N-representable.
   • If $D_{\min} > 0$, the magnitude of the distance serves as a quantitative measure of the degree of N-representability violation.
   • The evolved state provides the "closest" physical ensemble N-representable reduced state to the defective target.

Key Contributions

• Ensemble ADAPT-VQA Algorithm: The introduction of a hybrid framework that extends pure-state representability algorithms to ensemble states via purification. This allows the algorithm to distinguish whether a target matrix originates from a pure quantum state or an ensemble mixture.
• Error Correction and Refinement: The methodology offers a route for density-matrix refinement. It can correct defective ensemble reduced density matrices (those violating N-representability conditions) by evolving them toward the nearest physical state.
• Quantum State Reconstruction: The algorithm facilitates quantum-state reconstruction on quantum computers, enabling the recovery of a compatible wave function or purified state from a target RDM.
• Numerical Validation: The framework is validated through numerical simulations on both model systems and molecular systems at finite temperature, demonstrating its ability to handle 1-RDMs and 2-RDMs.

Results
The authors validated the algorithm using numerical simulations on a noiseless quantum simulator:

• Model Systems (Zero Temperature): Tests were conducted on 4-electron systems with 3 and 4 orbitals.
  • For 1-RDMs, the algorithm successfully distinguished between pure and ensemble N-representable states. In cases where Klyachko's pure N-representability conditions (generalized Pauli conditions) were violated (mixed states), the pure ADAPT-VQA failed to converge to zero distance, while the ensemble ADAPT-VQA converged to $D_{\min} \approx 0$.
  • For 2-RDMs, where complete pure N-representability conditions are unknown, the algorithm correctly identified ensemble N-representability for all constructed targets. It further demonstrated the ability to detect if an ensemble 2-RDM could contract to a pure 1-RDM.
  • Noise Robustness: By introducing random noise to target matrices, the study showed that $D_{\min}$ scales with the noise strength ($\epsilon$), confirming the algorithm's utility in quantifying the severity of N-representability violations.
• Molecular Systems (Finite Temperature): The algorithm was applied to $H_2$ and linear $H_3$ molecules at finite temperatures. Target matrices were constructed from canonical ensemble thermal states and perturbed with noise.
  • The results indicated that the converged distance $D_{\min}$ is more sensitive to the added noise ($\epsilon$) than to the intrinsic correlation characteristics of the underlying noiseless state.
  • As noise increased, $D_{\min}$ increased significantly (e.g., reaching $\sim 10^1$ for 2-RDMs with $\epsilon=0.1$), demonstrating the algorithm's capacity to detect and quantify representability defects in realistic molecular scenarios.

Significance
The paper claims that this work provides a practical and robust framework for addressing the ensemble N-representability problem, a challenge that has historically been computationally intractable. By leveraging purification and variational quantum algorithms, the proposed method offers a dual capability: it can classify the nature of a given RDM (pure vs. ensemble) and correct defective matrices to enforce physical constraints. This is significant for improving the accuracy of quantum chemical calculations, particularly for strongly correlated electron systems and finite-temperature applications. The authors emphasize that the algorithm is compatible with quantum hardware, offering a pathway for density-matrix refinement and quantum-state reconstruction in future quantum simulations.