default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSevag Gharibian
Person information
- affiliation: University of Paderborn, Department of Computer Science, Germany
- affiliation: Virginia Commonwealth University, Department of Computer Science, Richmond, VA, USA
- affiliation: University of California, Berkeley, Simons Institute for the Theory of Computing, CA, USA
- affiliation: University of Waterloo, Institute for Quantum Computing, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Sevag Gharibian, Jonas Kamminga:
BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting. ICALP 2024: 70:1-70:19- [c18]Avantika Agarwal, Sevag Gharibian, Venkata Koppula, Dorian Rudolph:
Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds. MFCS 2024: 7:1-7:17 - [i27]Avantika Agarwal, Sevag Gharibian, Venkata Koppula, Dorian Rudolph:
Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds. CoRR abs/2401.01633 (2024) - [i26]Dorian Rudolph, Sevag Gharibian, Daniel Nagaj:
Quantum 2-SAT on low dimensional systems is QMA1-complete: Direct embeddings and black-box simulation. CoRR abs/2401.02368 (2024) - [i25]Sevag Gharibian, Jonas Kamminga:
BQP, meet NP: Search-to-decision reductions and approximate counting. CoRR abs/2401.03943 (2024) - [i24]Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
Beating Grover search for low-energy estimation and state preparation. CoRR abs/2407.03073 (2024) - [i23]Sevag Gharibian, Carsten Hecht:
Hardness of approximation for ground state problems. CoRR abs/2411.04874 (2024) - 2023
- [j13]Sevag Gharibian, François Le Gall:
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. SIAM J. Comput. 52(4): 1009-1038 (2023) - [j12]Sevag Gharibian:
Guest Column: The 7 faces of quantum NP. SIGACT News 54(4): 54-91 (2023) - [c17]Lennart Bittel, Sevag Gharibian, Martin Kliesch:
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. CCC 2023: 34:1-34:24 - [c16]Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans:
Improved Hardness Results for the Guided Local Hamiltonian Problem. ICALP 2023: 32:1-32:19 - [c15]Sevag Gharibian, Dorian Rudolph:
Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement. ITCS 2023: 53:1-53:23 - [c14]James D. Watson
, Johannes Bausch, Sevag Gharibian:
The Complexity of Translationally Invariant Problems Beyond Ground State Energies. STACS 2023: 54:1-54:21 - [i22]Sevag Gharibian:
The 7 faces of quantum NP. CoRR abs/2310.18010 (2023) - 2022
- [j11]Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Comput. Complex. 31(2): 13 (2022) - [c13]Sevag Gharibian, Dorian Rudolph:
On Polynomially Many Queries to NP or QMA Oracles. ITCS 2022: 75:1-75:27 - [c12]Sevag Gharibian, François Le Gall:
Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. STOC 2022: 19-32 - [i21]Sevag Gharibian, Dorian Rudolph:
Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement. CoRR abs/2206.05243 (2022) - [i20]Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae:
Improved Hardness Results for the Guided Local Hamiltonian Problem. CoRR abs/2207.10250 (2022) - [i19]Lennart Bittel, Sevag Gharibian, Martin Kliesch:
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate. CoRR abs/2211.12519 (2022) - 2021
- [j10]Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou:
Towards Quantum One-Time Memories from Stateless Hardware. Quantum 5: 429 (2021) - [i18]Sevag Gharibian, Dorian Rudolph:
On polynomially many queries to NP or QMA oracles. CoRR abs/2111.02296 (2021) - [i17]Sevag Gharibian, François Le Gall:
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. CoRR abs/2111.09079 (2021) - [i16]Bill Fefferman, Sevag Gharibian, Norbert Schuch, Barbara M. Terhal:
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261). Dagstuhl Reports 11(5): 76-88 (2021) - [i15]Sevag Gharibian, Dorian Rudolph:
On polynomially many queries to NP or QMA oracles. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c11]Sevag Gharibian, Stephen Piddock, Justin Yirka:
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. STACS 2020: 20:1-20:37 - [c10]Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou:
Towards Quantum One-Time Memories from Stateless Hardware. TQC 2020: 6:1-6:25 - [i14]James D. Watson, Johannes Bausch, Sevag Gharibian:
The Complexity of Translationally Invariant Problems beyond Ground State Energies. CoRR abs/2012.12717 (2020)
2010 – 2019
- 2019
- [c9]Sevag Gharibian, Ojas Parekh:
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. APPROX-RANDOM 2019: 31:1-31:17 - [i13]Sevag Gharibian, Stephen Piddock, Justin Yirka:
Oracle complexity classes and local measurements on physical Hamiltonians. CoRR abs/1909.05981 (2019) - [i12]Sevag Gharibian, Ojas Parekh:
Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut. CoRR abs/1909.08846 (2019) - 2018
- [j9]Sevag Gharibian, Jamie Sikora:
Ground State Connectivity of Local Hamiltonians. ACM Trans. Comput. Theory 10(2): 8:1-8:28 (2018) - [c8]Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi:
On Efficiently Solvable Cases of Quantum k-SAT. MFCS 2018: 38:1-38:16 - [c7]Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). MFCS 2018: 58:1-58:16 - [i11]Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum generalizations of the polynomial hierarchy with applications to QMA(2). CoRR abs/1805.11139 (2018) - [i10]Anne Broadbent, Sevag Gharibian, Hong-Sheng Zhou:
Towards Quantum One-Time Memories from Stateless Hardware. IACR Cryptol. ePrint Arch. 2018: 960 (2018) - 2017
- [c6]Sevag Gharibian, Justin Yirka:
The Complexity of Simulating Local Measurements on Quantum Systems. TQC 2017: 2:1-2:17 - [i9]Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi:
On efficiently solvable cases of Quantum k-SAT. CoRR abs/1712.09617 (2017) - 2016
- [c5]J. Niel de Beaudrap, Sevag Gharibian:
A Linear Time Algorithm for Quantum 2-SAT. CCC 2016: 27:1-27:21 - [i8]Sevag Gharibian, Justin Yirka:
The complexity of estimating local physical quantities. CoRR abs/1606.05626 (2016) - 2015
- [j8]Sevag Gharibian, Yichen Huang, Zeph Landau, Seung Woo Shin:
Quantum Hamiltonian Complexity. Found. Trends Theor. Comput. Sci. 10(3): 159-282 (2015) - [j7]Sevag Gharibian, Zeph Landau, Seung Woo Shin, Guoming Wang:
Tensor network non-zero testing. Quantum Inf. Comput. 15(9&10): 885-899 (2015) - [c4]Sevag Gharibian, Jamie Sikora:
Ground State Connectivity of Local Hamiltonians. ICALP (1) 2015: 617-628 - [i7]Niel de Beaudrap, Sevag Gharibian:
A linear time algorithm for quantum 2-SAT. CoRR abs/1508.07338 (2015) - 2014
- [j6]Dominic W. Berry, Richard Cleve, Sevag Gharibian:
Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Inf. Comput. 14(1-2): 1-30 (2014) - [j5]Sevag Gharibian, Julia Kempe:
Hardness of approximation for quantum problems. Quantum Inf. Comput. 14(5-6): 517-540 (2014) - [i6]Sevag Gharibian, Yichen Huang, Zeph Landau:
Quantum Hamiltonian Complexity. CoRR abs/1401.3916 (2014) - [i5]Sevag Gharibian, Zeph Landau, Seung Woo Shin, Guoming Wang:
Tensor network non-zero testing. CoRR abs/1406.5279 (2014) - [i4]Sevag Gharibian, Jamie Sikora:
Ground state connectivity of local Hamiltonians. CoRR abs/1409.3182 (2014) - 2013
- [j4]Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay:
QMA variants with polynomially many provers. Quantum Inf. Comput. 13(1-2): 135-157 (2013) - 2012
- [j3]Sevag Gharibian, Julia Kempe:
Approximation Algorithms for QMA-Complete Problems. SIAM J. Comput. 41(4): 1028-1050 (2012) - [c3]Sevag Gharibian, Julia Kempe:
Hardness of Approximation for Quantum Problems. ICALP (1) 2012: 387-398 - [i3]Sevag Gharibian, Julia Kempe:
Hardness of approximation for quantum problems. CoRR abs/1209.1055 (2012) - 2011
- [c2]Sevag Gharibian, Julia Kempe:
Approximation Algorithms for QMA-Complete Problems. CCC 2011: 178-188 - [i2]Sevag Gharibian, Julia Kempe:
Approximation algorithms for QMA-complete problems. CoRR abs/1101.3884 (2011) - [i1]Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay:
QMA variants with polynomially many provers. CoRR abs/1108.0617 (2011) - 2010
- [j2]Sevag Gharibian:
Strong NP-hardness of the quantum separability problem. Quantum Inf. Comput. 10(3&4): 343-360 (2010)
2000 – 2009
- 2009
- [j1]Sevag Gharibian, Hermann Kampermann, Dagmar Bruß:
On global effects caused by locally noneffective unitary operations. Quantum Inf. Comput. 9(11&12): 1013-1029 (2009) - [c1]Dagmar Bruß, Sevag Gharibian, Hermann Kampermann:
Revealing Quantum Entanglement via Locally Noneffective Operations. QI 2009: 3-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
