The complexity of translationally invariant problems beyond ground state energies
It is known that three fundamental questions regarding local Hamiltonians--approximating
the ground state energy (the Local Hamiltonian problem), simulating local measurements on …
the ground state energy (the Local Hamiltonian problem), simulating local measurements on …
Guest Column: The 7 faces of quantum NP
S Gharibian - ACM SIGACT News, 2024 - dl.acm.org
When it comes to NP, its natural definition, its wide applicability across scientific disciplines,
and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP …
and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP …
Quantum state testing beyond the polarizing regime and quantum triangular discrimination
Y Liu - arXiv preprint arXiv:2303.01952, 2023 - arxiv.org
The complexity class Quantum Statistical Zero-Knowledge ($\mathsf {QSZK} $) captures
computational difficulties of the time-bounded quantum state testing problem with respect to …
computational difficulties of the time-bounded quantum state testing problem with respect to …
Many-time physics in practice: characterising and controlling non-Markovian quantum stochastic processes
GAL White - arXiv preprint arXiv:2405.05416, 2024 - arxiv.org
Every year, substantial theoretical and experimental progress is made towards the
realisation of a genuinely new computational paradigm in the construction of a quantum …
realisation of a genuinely new computational paradigm in the construction of a quantum …
Complexity of geometrically local stoquastic Hamiltonians
The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of
Hamiltonian complexity that studies the computational complexity of problems in quantum …
Hamiltonian complexity that studies the computational complexity of problems in quantum …
StoqMA meets distribution testing
Y Liu - arXiv preprint arXiv:2011.05733, 2020 - arxiv.org
$\mathsf {StoqMA} $ captures the computational hardness of approximating the ground
energy of local Hamiltonians that do not suffer the so-called sign problem. We provide a …
energy of local Hamiltonians that do not suffer the so-called sign problem. We provide a …
On polynomially many queries to NP or QMA oracles
S Gharibian, D Rudolph - arXiv preprint arXiv:2111.02296, 2021 - arxiv.org
We study the complexity of problems solvable in deterministic polynomial time with access to
an NP or Quantum Merlin-Arthur (QMA)-oracle, such as $ P^{NP} $ and $ P^{QMA} …
an NP or Quantum Merlin-Arthur (QMA)-oracle, such as $ P^{NP} $ and $ P^{QMA} …