On the Complexity of Pure-State Consistency of Local Density Matrices

• URL: http://arxiv.org/abs/2411.03096v1
• Date: Tue, 05 Nov 2024 13:43:21 GMT
• Title: On the Complexity of Pure-State Consistency of Local Density Matrices
• Authors: Jonas Kamminga, Dorian Rudolph,
• Abstract summary: We investigate the pure consistency of local density matrices ($mathsfPureCLDM$) and pure $N$-representability ($mathsfPure$-$N$-$mathsfRepresentability$) problems. We prove that both $mathsfPure$-$N$-$mathsfRepresentability$ and $mathsfPureCLDM$ are complete for this new class.
• Score: 0.0
• License:
• Abstract: In this work we investigate the computational complexity of the pure consistency of local density matrices ($\mathsf{PureCLDM}$) and pure $N$-representability ($\mathsf{Pure}$-$N$-$\mathsf{Representability}$) problems. In these problems the input is a set of reduced density matrices and the task is to determine whether there exists a global \emph{pure} state consistent with these reduced density matrices. While mixed $\mathsf{CLDM}$, i.e. where the global state can be mixed, was proven to be $\mathsf{QMA}$-complete by Broadbent and Grilo [JoC 2022], almost nothing was known about the complexity of the pure version. Before our work the best upper and lower bounds were $\mathsf{QMA}(2)$ and $\mathsf{QMA}$. Our contribution to the understanding of these problems is twofold. Firstly, we define a pure state analogue of the complexity class $\mathsf{QMA}^+$ of Aharanov and Regev [FOCS 2003], which we call $\mathsf{PureSuperQMA}$. We prove that both $\mathsf{Pure}$-$N$-$\mathsf{Representability}$ and $\mathsf{PureCLDM}$ are complete for this new class. Along the way we supplement Broadbent and Grilo by proving hardness for 2-qubit reduced density matrices and showing that mixed $N$-$\mathsf{Representability}$ is $\mathsf{QMA}$ complete. Secondly, we improve the upper bound on $\mathsf{PureCLDM}$. Using methods from algebraic geometry, we prove that $\mathsf{PureSuperQMA} \subseteq \mathsf{PSPACE}$. Our methods, and the $\mathsf{PSPACE}$ upper bound, are also valid for $\mathsf{PureCLDM}$ with exponential or even perfect precision, hence $\mathsf{precisePureCLDM}$ is not $\mathsf{preciseQMA}(2) = \mathsf{NEXP}$-complete, unless $\mathsf{PSPACE} = \mathsf{NEXP}$. We view this as evidence for a negative answer to the longstanding open question whether $\mathsf{PureCLDM}$ is $\mathsf{QMA}(2)$-complete.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Quantum Sabotage Complexity [0.7812210699650152]
  We show $mathsfQ(f_mathsfsab)$, the quantum query complexity of $f_mathsfsab$. We show that when $f$ is the Indexing function, $mathsfQ(f_mathsfsab)=Theta(sqrtmathsfsab)$, ruling out the possibility that $mathsfQ(f_mathsfsab)=Theta(sqrtmathsf
  arXiv  Detail & Related papers  (2024-08-22T17:57:58Z)
• Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulations [7.148312060227714]
  Linear representation learning is widely studied due to its conceptual simplicity and empirical utility in tasks such as compression, classification, and feature extraction. In this work we seek $mathbfw$ that forms a local reconstruction of $mathbfy$ by solving a regularized least squares regression problem. We prove that, for all levels of regularization and under a mild condition that the columns of $mathbfX$ have a unique Delaunay triangulation, the optimal coefficients' number of non-zero entries is upper bounded by $d+1$.
  arXiv  Detail & Related papers  (2024-05-01T19:56:52Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs [4.130591018565202]
  The Learning Errors With Errors ($mathsfLWE$) problem asks to find $mathbfs$ from an input of the form $(mathbfAmathbfs+mathbfe$) We do not focus on solving $mathsfLWE$ but on the task of sampling instances. Our main result is a quantum-time algorithm that samples well-distributed $mathsfLWE$ instances while provably not knowing the solution.
  arXiv  Detail & Related papers  (2024-01-08T10:55:41Z)
• SQ Lower Bounds for Learning Mixtures of Linear Classifiers [43.63696593768504]
  We show that known algorithms for this problem are essentially best possible, even for the special case of uniform mixtures. The key technical ingredient is a new construction of spherical designs that may be of independent interest.
  arXiv  Detail & Related papers  (2023-10-18T10:56:57Z)
• Cryptographic Hardness of Learning Halfspaces with Massart Noise [59.8587499110224]
  We study the complexity of PAC learning halfspaces in the presence of Massart noise. We show that no-time Massart halfspace learners can achieve error better than $Omega(eta)$, even if the optimal 0-1 error is small.
  arXiv  Detail & Related papers  (2022-07-28T17:50:53Z)
• Threshold Phenomena in Learning Halfspaces with Massart Noise [56.01192577666607]
  We study the problem of PAC learning halfspaces on $mathbbRd$ with Massart noise under Gaussian marginals. Our results qualitatively characterize the complexity of learning halfspaces in the Massart model.
  arXiv  Detail & Related papers  (2021-08-19T16:16:48Z)
• Linear Bandits on Uniformly Convex Sets [88.3673525964507]
  Linear bandit algorithms yield $tildemathcalO(nsqrtT)$ pseudo-regret bounds on compact convex action sets. Two types of structural assumptions lead to better pseudo-regret bounds.
  arXiv  Detail & Related papers  (2021-03-10T07:33:03Z)
• StoqMA meets distribution testing [0.0]
  We provide a novel connection between $mathsfStoqMA$ and distribution testing via reversible circuits. We show that both variants of $mathsfStoqMA$ that without any ancillary random bit and with perfect soundness are contained in $mathsfNP$. Our results make a step towards collapsing the hierarchy $mathsfMA subseteq mathsfStoqMA subseteq mathsfSBP$ [BBT06], in which all classes are contained in $
  arXiv  Detail & Related papers  (2020-11-11T12:30:42Z)
• The Average-Case Time Complexity of Certifying the Restricted Isometry Property [66.65353643599899]
  In compressed sensing, the restricted isometry property (RIP) on $M times N$ sensing matrices guarantees efficient reconstruction of sparse vectors. We investigate the exact average-case time complexity of certifying the RIP property for $Mtimes N$ matrices with i.i.d. $mathcalN(0,1/M)$ entries.
  arXiv  Detail & Related papers  (2020-05-22T16:55:01Z)

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.