3 papers
quant-ph2025
On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
Sabee Grewal, Dorian Rudolph
We prove several new results concerning the pure quantum polynomial hierarchy (pureQPH). First, we show that QMA(2) is contained in pureQSigma2, that is, two unentangled existentia…
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{…