Entanglement Complexity in Many-body Systems from Positivity Scaling Laws

• URL: http://arxiv.org/abs/2509.02944v1
• Date: Wed, 03 Sep 2025 02:18:50 GMT
• Title: Entanglement Complexity in Many-body Systems from Positivity Scaling Laws
• Authors: Anna O. Schouten, David A. Mazziotti,
• Abstract summary: We introduce a framework based on $p$-particle positivity conditions from reduced density matrix (RDM) theory.<n>These conditions form a hierarchy of constraints for an RDM to correspond to a valid $N$-particle quantum system.<n>We prove a general complexity if a quantum system with level-$p$ positivity independent of its size, then its entanglement complexity scales positively with order $p$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Area laws describe how entanglement entropy scales and thus provide important necessary conditions for efficient quantum many-body simulation, but they do not, by themselves, yield a direct measure of computational complexity. Here we introduce a complementary framework based on $p$-particle positivity conditions from reduced density matrix (RDM) theory. These conditions form a hierarchy of $N$-representability constraints for an RDM to correspond to a valid $N$-particle quantum system, becoming exact when the Hamiltonian can be expressed as a convex combination of positive semidefinite $p$-particle operators. We prove a general complexity bound: if a quantum system is solvable with level-$p$ positivity independent of its size, then its entanglement complexity scales polynomially with order $p$. This theorem connects structural constraints on RDMs with computational tractability and provides a rigorous framework for certifying when many-body methods including RDM methods can efficiently simulate correlated quantum matter and materials.

Related papers

• Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors [40.72140849821964]
  We consider the massive Thirring and Gross-Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$.<n>We prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$.<n>Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models.
  arXiv  Detail & Related papers  (2026-02-25T19:00:01Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding Framework [0.0]
  This work combines Density Matrix Embedding Theory (DMET) with Sample-based Quantum Diagonalization (SQD) to compute ground-state energies of a set of natural ligand-like molecules.<n>The resulting embedded Hamiltonians are solved on IBM's Eagle R3 superconducting quantum hardware.<n>Results demonstrate that sample-based quantum methods, when integrated with a robust embedding framework, can reliably extend quantum computation towards simulation of chemically relevant molecular systems.
  arXiv  Detail & Related papers  (2025-11-27T06:50:52Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Quantum Simulation of Non-unitary Dynamics via Contour-based Matrix Decomposition [6.538464633253838]
  We introduce contour-based matrix decomposition (CBMD), a framework for scalable simulation of non-unitary dynamics.<n>CBMD generalizes Cauchy's residue theorem to matrix-valued functions and directly decomposes a non-Hermitian function into a linear combination of Hermitian ones.
  arXiv  Detail & Related papers  (2025-11-13T12:52:52Z)
• Spectral Small-Incremental-Entangling: Breaking Quasi-Polynomial Complexity Barriers in Long-Range Interacting Systems [2.911917667184046]
  We introduce the concept of Spectral-Entangling strength, which captures the structural entangling power of an operator.<n>We establish a spectral SIE theorem: a universal speed limit for R'enyi entanglement growth at $alpha ge 1/2$.<n>Our results extend the SIE theorem to the spectral domain and establish a unified framework that unveils the detailed and universal structure underlying quantum complexity.
  arXiv  Detail & Related papers  (2025-09-15T14:56:40Z)
• Explicit Formulas for Estimating Trace of Reduced Density Matrix Powers via Single-Circuit Measurement Probabilities [10.43657724071918]
  We propose a universal framework to simultaneously estimate the traces of the $2$nd to the $n$th powers of a reduced density matrix.<n>We develop two algorithms: a purely quantum method and a hybrid quantum-classical approach combining Newton-Girard iteration.<n>We explore various applications including the estimation of nonlinear functions and the representation of entanglement measures.
  arXiv  Detail & Related papers  (2025-07-23T01:41:39Z)
• Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions [0.6144680854063939]
  We propose an explicit, oracle-free quantum framework for numerically simulating general linear partial differential equations (PDEs)<n>Our approach begins with a general finite-difference discretization and applies the Schrodingerisation technique to transform the resulting system into one that admits unitary quantum evolution.
  arXiv  Detail & Related papers  (2025-06-25T14:23:38Z)
• Distributed quantum algorithm for divergence estimation and beyond [16.651306526783564]
  We propose a distributed quantum algorithm framework to compute $rm Tr(f(A)g(B))$ within an additive error $varepsilon$.<n>This framework holds broad applicability across a range of distributed quantum computing tasks.
  arXiv  Detail & Related papers  (2025-03-12T14:28:22Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies.<n>We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency.<n>We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Entanglement-induced exponential advantage in amplitude estimation via state matrixization [11.282486674587236]
  Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing.<n>We introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms.<n>We reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding.
  arXiv  Detail & Related papers  (2024-08-25T04:35:53Z)
• Attribute Fusion-based Evidential Classifier on Quantum Circuits [22.096543893284995]
  Dempster-Shafer Theory (DST) as an effective and robust framework for handling uncertain information is applied in decision-making and pattern classification. People attempt to address the issue by taking advantage of its consistency with quantum computing to implement DST operations on quantum circuits and realize speedup. In this paper, we find that Boolean algebra as an essential mathematical tool bridges the definition of DST and quantum computing.
  arXiv  Detail & Related papers  (2024-01-02T15:01:20Z)
• The Complexity of Being Entangled [0.0]
  Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost.
  arXiv  Detail & Related papers  (2023-11-07T19:00:02Z)
• Efficiency of neural-network state representations of one-dimensional quantum spin systems [0.0]
  We study the Boltzmann machine (RBM) state representation of one-dimensional (1D) quantum spin systems. We define a class of long-rangefastdecay (LRFD) RBM states with quantifiable upper bounds on truncation errors. We conjecture that the ground states of a wide range of quantum systems may be exactly represented by LRFD RBMs or a variant of them.
  arXiv  Detail & Related papers  (2023-02-01T01:44:03Z)
• The complexity of a quantum system and the accuracy of its description [0.0]
  The complexity of the quantum state of a multiparticle system is connected by a relation similar to the coordinate-momentum uncertainty relation. The coefficient in this relation is equal to the maximum number of qubits whose dynamics can be adequately described by quantum theory.
  arXiv  Detail & Related papers  (2021-05-06T09:16:40Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)

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.