Revealing Quantum Entanglement via Locally Noneffective Operations. - Dagmar Bruß; Sevag Gharibian; Hermann Kampermann (QI, 2009)

On global effects caused by locally noneffective unitary operations. - Sevag Gharibian; Hermann Kampermann; Dagmar Bruß (Quantum Inf. Comput., 2009)

Strong NP-hardness of the quantum separability problem. - Sevag Gharibian (Quantum Inf. Comput., 2010)

Approximation Algorithms for QMA-Complete Problems. - Sevag Gharibian; Julia Kempe (SIAM J. Comput., 2012)

QMA variants with polynomially many provers. - Sevag Gharibian; Jamie Sikora; Sarvagya Upadhyay (Quantum Inf. Comput., 2013)

Quantum Hamiltonian Complexity. - Sevag Gharibian; Yichen Huang; Zeph Landau (CoRR, 2014)

Gate-efficient discrete simulations of continuous-time quantum query algorithms. - Dominic W. Berry; Richard Cleve; Sevag Gharibian (Quantum Inf. Comput., 2014)

Hardness of approximation for quantum problems. - Sevag Gharibian; Julia Kempe (Quantum Inf. Comput., 2014)

Quantum Hamiltonian Complexity. - Sevag Gharibian; Yichen Huang; Zeph Landau; Seung Woo Shin (Found. Trends Theor. Comput. Sci., 2015)

Tensor network non-zero testing. - Sevag Gharibian; Zeph Landau; Seung Woo Shin; Guoming Wang (Quantum Inf. Comput., 2015)

A Linear Time Algorithm for Quantum 2-SAT. - J. Niel de Beaudrap; Sevag Gharibian (CCC, 2016)

The complexity of estimating local physical quantities. - Sevag Gharibian; Justin Yirka (CoRR, 2016)

On Efficiently Solvable Cases of Quantum k-SAT. - Marco Aldi; Niel de Beaudrap; Sevag Gharibian; Seyran Saeedi (MFCS, 2018)

Ground State Connectivity of Local Hamiltonians. - Sevag Gharibian; Jamie Sikora (ACM Trans. Comput. Theory, 2018)

Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. - Sevag Gharibian; Ojas Parekh (APPROX-RANDOM, 2019)

The complexity of simulating local measurements on quantum systems. - Sevag Gharibian; Justin Yirka (Quantum, 2019)

Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. - Sevag Gharibian; Stephen Piddock; Justin Yirka (STACS, 2020)

Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261). - Bill Fefferman; Sevag Gharibian; Norbert Schuch; Barbara M. Terhal (Dagstuhl Reports, 2021)

On polynomially many queries to NP or QMA oracles. - Sevag Gharibian; Dorian Rudolph (Electron. Colloquium Comput. Complex., 2021)

Towards Quantum One-Time Memories from Stateless Hardware. - Anne Broadbent; Sevag Gharibian; Hong-Sheng Zhou (Quantum, 2021)

Quantum generalizations of the polynomial hierarchy with applications to QMA(2). - Sevag Gharibian; Miklos Santha; Jamie Sikora; Aarthi Sundaram; Justin Yirka (Comput. Complex., 2022)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae (CoRR, 2022)

Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate. - Lennart Bittel; Sevag Gharibian; Martin Kliesch (CoRR, 2022)

The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. - Lennart Bittel; Sevag Gharibian; Martin Kliesch (CCC, 2023)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Chris Cade; Marten Folkertsma; Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae; Jordi Weggemans (ICALP, 2023)

Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement. - Sevag Gharibian; Dorian Rudolph (ITCS, 2023)

The Complexity of Translationally Invariant Problems Beyond Ground State Energies. - James D. Watson; Johannes Bausch; Sevag Gharibian (STACS, 2023)

The 7 faces of quantum NP. - Sevag Gharibian (CoRR, 2023)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. - Sevag Gharibian; François Le Gall (SIAM J. Comput., 2023)

Guest Column: The 7 faces of quantum NP. - Sevag Gharibian (SIGACT News, 2023)

BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting. - Sevag Gharibian; Jonas Kamminga (ICALP, 2024)

Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds. - Avantika Agarwal; Sevag Gharibian; Venkata Koppula; Dorian Rudolph (MFCS, 2024)

Quantum 2-SAT on low dimensional systems is QMA1-complete: Direct embeddings and black-box simulation. - Dorian Rudolph; Sevag Gharibian; Daniel Nagaj (CoRR, 2024)

Beating Grover search for low-energy estimation and state preparation. - Harry Buhrman; Sevag Gharibian; Zeph Landau; François Le Gall; Norbert Schuch; Suguru Tamaki (CoRR, 2024)

Hardness of approximation for ground state problems. - Sevag Gharibian; Carsten Hecht (CoRR, 2024)

Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box Simulation. - Dorian Rudolph; Sevag Gharibian; Daniel Nagaj (ITCS, 2025)

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem. - Marco Aldi; Sevag Gharibian; Dorian Rudolph (Electron. Colloquium Comput. Complex., 2025)

Quantum k-SAT Related Hypergraph Problems. - Simon-Luca Kremer; Dorian Rudolph; Sevag Gharibian (CoRR, 2025)