Showing 2024Show all
2 papers · 1 filter
quant-ph2024
On the Complexity of Pure-State Consistency of Local Density Matrices
Jonas Kamminga, Dorian Rudolph
In this work we investigate the computational complexity of the pure consistency of local density matrices (PureCLDM) and pure N-representability (Pure-N-Representability; analog o…
quant-ph2024
Towards a universal gateset for
Dorian Rudolph
is with perfect completeness, i.e., the prover must accept with a probability of exactly in the YES-case. Whether and $\mathsf{…