The following pages link to Sevag Gharibian (Q666669):
Displaying 27 items.
- The minimum feasible tileset problem (Q666670) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- Hardness of Approximation for Quantum Problems (Q2843264) (← links)
- Approximation Algorithms for QMA-Complete Problems (Q3143301) (← links)
- (Q3172441) (← links)
- (Q3400488) (← links)
- Ground State Connectivity of Local Hamiltonians (Q3448820) (← links)
- Quantum Hamiltonian Complexity (Q3451340) (← links)
- Revealing Quantum Entanglement via Locally Noneffective Operations (Q3616549) (← links)
- (Q4637976) (← links)
- CHARACTERIZING QUANTUMNESS VIA ENTANGLEMENT CREATION (Q4904828) (← links)
- (Q5005139) (← links)
- (Q5005160) (← links)
- (Q5368761) (← links)
- Lower Bounds for Arithmetic Circuits via the Hankel Matrix (Q5874291) (← links)
- (Q5874389) (← links)
- (Q5875485) (← links)
- Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture (Q6083456) (← links)
- (Q6126315) (← links)
- All non-classical correlations can be activated into distillable entanglement (Q6224295) (← links)
- On efficiently solvable cases of Quantum k-SAT (Q6295771) (← links)
- Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement (Q6610319) (← links)
- The complexity of translationally invariant problems beyond ground state energies (Q6615166) (← links)
- Improved hardness results for the guided local Hamiltonian problem (Q6638029) (← links)
- The optimal depth of variational quantum algorithms is QCMA-hard to approximate (Q6640372) (← links)
