Consistency of Local Density Matrices Is QMA-Complete

DOI10.1007/11830924_40zbMath1155.68399arXivquant-ph/0604166OpenAlexW2131575873MaRDI QIDQ3595381

Yi-Kai Liu

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0604166

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (16)

Multi-theorem designated-verifier NIZK for QMA ⋮ Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem ⋮ Testing Quantum Circuits and Detecting Insecure Encryption ⋮ The information theoretic interpretation of the length of a curve ⋮ Quantum simulation of quantum field theories as quantum chemistry ⋮ Entropy constraints for ground energy optimization ⋮ A variational principle for ground spaces ⋮ Quantum marginals from pure doubly excited states ⋮ The face lattice of the set of reduced density matrices and its coatoms ⋮ Recoupling coefficients and quantum entropies ⋮ Eigenvalue distributions of reduced density matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Recoverability from direct quantum correlations ⋮ Ground-state spaces of frustration-free Hamiltonians

This page was built for publication: Consistency of Local Density Matrices Is QMA-Complete