Sevag Gharibian

Orcid: 0000-0002-9992-3379

Affiliations:
  • University of Paderborn, Department of Computer Science, Germany
  • Virginia Commonwealth University, Department of Computer Science, Richmond, VA, USA
  • University of California, Berkeley, Simons Institute for the Theory of Computing, CA, USA
  • University of Waterloo, Institute for Quantum Computing, ON, Canada


According to our database1, Sevag Gharibian authored at least 38 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Quantum k-SAT Related Hypergraph Problems.
CoRR, June, 2025

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem.
Electron. Colloquium Comput. Complex., 2025

Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box Simulation.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
Hardness of approximation for ground state problems.
CoRR, 2024

Beating Grover search for low-energy estimation and state preparation.
CoRR, 2024

Quantum 2-SAT on low dimensional systems is QMA<sub>1</sub>-complete: Direct embeddings and black-box simulation.
CoRR, 2024

Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Guest Column: The 7 faces of quantum NP.
SIGACT News, December, 2023

The 7 faces of quantum NP.
CoRR, 2023

The Complexity of Translationally Invariant Problems Beyond Ground State Energies.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Improved Hardness Results for the Guided Local Hamiltonian Problem.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate.
CoRR, 2022

Improved Hardness Results for the Guided Local Hamiltonian Problem.
CoRR, 2022

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

On Polynomially Many Queries to NP or QMA Oracles.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261).
Dagstuhl Reports, 2021

2020
Towards Quantum One-Time Memories from Stateless Hardware.
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

Oracle Complexity Classes and Local Measurements on Physical Hamiltonians.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.
Proceedings of the Approximation, 2019

2018
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

On Efficiently Solvable Cases of Quantum k-SAT.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
The Complexity of Simulating Local Measurements on Quantum Systems.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

2016
The complexity of estimating local physical quantities.
CoRR, 2016

A Linear Time Algorithm for Quantum 2-SAT.
Proceedings of the 31st Conference on Computational Complexity, 2016

2015
Tensor network non-zero testing.
Quantum Inf. Comput., 2015

Quantum Hamiltonian Complexity.
Found. Trends Theor. Comput. Sci., 2015

Ground State Connectivity of Local Hamiltonians.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Gate-efficient discrete simulations of continuous-time quantum query algorithms.
Quantum Inf. Comput., 2014

Quantum Hamiltonian Complexity.
CoRR, 2014

2013
QMA variants with polynomially many provers.
Quantum Inf. Comput., 2013

2012
Hardness of Approximation for Quantum Problems.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Approximation Algorithms for QMA-Complete Problems.
Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2010
Strong NP-hardness of the quantum separability problem.
Quantum Inf. Comput., 2010

2009
On global effects caused by locally noneffective unitary operations.
Quantum Inf. Comput., 2009

Revealing Quantum Entanglement via Locally Noneffective Operations.
Proceedings of the Quantum Interaction, Third International Symposium, 2009


  Loading...