Computing ground state properties with early fault-tolerant quantum computers
Significant effort in applied quantum computing has been devoted to the problem of ground
state energy estimation for molecules and materials. Yet, for many applications of practical …
state energy estimation for molecules and materials. Yet, for many applications of practical …
Entanglement in highly symmetric multipartite quantum states
A construction of genuinely entangled multipartite quantum states based on the group theory
is presented. Analyzed states resemble the Dicke states, whereas the interactions occur only …
is presented. Analyzed states resemble the Dicke states, whereas the interactions occur only …
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization
Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen intense study towards …
Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen intense study towards …
Computational complexity of the ground state energy density problem
We study the complexity of finding the ground state energy density of a local Hamiltonian on
a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a …
a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a …
Hamiltonian complexity in the thermodynamic limit
D Aharonov, S Irani - Proceedings of the 54th Annual ACM SIGACT …, 2022 - dl.acm.org
Despite immense progress in quantum Hamiltonian complexity in the past decade, little is
known about the computational complexity of quantum physics at the thermodynamic limit. In …
known about the computational complexity of quantum physics at the thermodynamic limit. In …
Gibbs Sampling gives Quantum Advantage at Constant Temperatures with O (1)-Local Hamiltonians
Sampling from Gibbs states--states corresponding to system in thermal equilibrium--has
recently been shown to be a task for which quantum computers are expected to achieve …
recently been shown to be a task for which quantum computers are expected to achieve …
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 …
The complexity of approximating critical points of quantum phase transitions
Phase diagrams chart material properties with respect to one or more external or internal
parameters such as pressure or magnetisation; as such, they play a fundamental role in …
parameters such as pressure or magnetisation; as such, they play a fundamental role in …
Hardness of approximation for ground state problems
S Gharibian, C Hecht - arxiv preprint arxiv:2411.04874, 2024 - arxiv.org
After nearly two decades of research, the question of a quantum PCP theorem for quantum
Constraint Satisfaction Problems (CSPs) remains wide open. As a result, proving QMA …
Constraint Satisfaction Problems (CSPs) remains wide open. As a result, proving QMA …
Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement
S Gharibian, D Rudolph - arxiv preprint arxiv:2206.05243, 2022 - arxiv.org
Savitch's theorem states that NPSPACE computations can be simulated in PSPACE. We
initiate the study of a quantum analogue of NPSPACE, denoted Streaming-QCMASPACE …
initiate the study of a quantum analogue of NPSPACE, denoted Streaming-QCMASPACE …