Sevag Gharibian

sevag.gharibian@uni-paderborn.de
ID
71541

39 Publications

Mark all

[39]
2024 | Preprint | LibreCat-ID: 50272
Rudolph, D., Gharibian, S., & Nagaj, D. (2024). Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation. In arXiv:2401.02368.
LibreCat | arXiv
 
[38]
2024 | Journal Article | LibreCat-ID: 48544 | OA
Gharibian, S. (2024). Guest Column: The 7 faces of quantum NP. ACM SIGACT News, 54(4), 54–91.
LibreCat | Files available | Download (ext.)
 
[37]
2024 | Preprint | LibreCat-ID: 50273
Agarwal, A., Gharibian, S., Koppula, V., & Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In arXiv:2401.01633.
LibreCat | arXiv
 
[36]
2024 | Conference Paper | LibreCat-ID: 50406
Gharibian, S., & Kamminga, J. (n.d.). BQP, meet NP: Search-to-decision reductions and approximate counting. Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP).
LibreCat | arXiv
 
[35]
2023 | Conference Paper | LibreCat-ID: 31872
Gharibian, S., & Rudolph, D. (2023). Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement. 14th Innovations in Theoretical Computer Science (ITCS), 251, 53:1-53:23. https://doi.org/10.4230/LIPIcs.ITCS.2023.53
LibreCat | DOI | arXiv
 
[34]
2023 | Conference Paper | LibreCat-ID: 20841 | OA
Gharibian, S., Watson, J., & Bausch, J. (2023). The Complexity of Translationally Invariant Problems beyond Ground State Energies. Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 254, 54:1-54:21. https://doi.org/10.4230/LIPIcs.STACS.2023.54
LibreCat | DOI | Download (ext.) | arXiv
 
[33]
2023 | Conference Paper | LibreCat-ID: 34138
Bittel, L., Gharibian, S., & Kliesch, M. (2023). The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. Proceedings of the 38th Computational Complexity Conference (CCC), 264(34), 34:1-34:24. https://doi.org/10.4230/LIPIcs.CCC.2023.34
LibreCat | DOI | arXiv
 
[32]
2023 | Conference Paper | LibreCat-ID: 32407
Gharibian, S., Hayakawa, R., Gall, F. L., & Morimae, T. (2023). Improved Hardness Results for the Guided Local Hamiltonian Problem. Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 261(32), 1–19. https://doi.org/10.4230/LIPIcs.ICALP.2023.32
LibreCat | DOI | arXiv
 
[31]
2023 | Journal Article | LibreCat-ID: 50271
Gharibian, S., & Le Gall, F. (2023). Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. SIAM Journal on Computing, 52(4), 1009–1038. https://doi.org/10.1137/22m1513721
LibreCat | DOI
 
[30]
2022 | Journal Article | LibreCat-ID: 34700
Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2022). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Computational Complexity, 31(2), Article 13. https://doi.org/10.1007/s00037-022-00231-8
LibreCat | DOI
 
[29]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian, S., & Rudolph, D. (2022). On polynomially many queries to NP or QMA oracles. 13th Innovations in Theoretical Computer Science (ITCS 2022), 215(75), 1–27. https://doi.org/10.4230/LIPIcs.ITCS.2022.75
LibreCat | DOI | Download (ext.)
 
[28]
2022 | Conference Paper | LibreCat-ID: 27531 | OA
Gharibian, S., & Gall, F. L. (2022). Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture. Proceedings of the 54th ACM Symposium on Theory of Computing (STOC), 19–32.
LibreCat | Download (ext.) | arXiv
 
[27]
2021 | Journal Article | LibreCat-ID: 29780
Broadbent, A., Gharibian, S., & Zhou, H.-S. (2021). Towards Quantum One-Time Memories from Stateless Hardware. Quantum, 5, Article 429. https://doi.org/10.22331/q-2021-04-08-429
LibreCat | DOI
 
[26]
2020 | Conference Paper | LibreCat-ID: 8426
Broadbent, A., Gharibian, S., & Zhou, H.-S. (2020). Towards Quantum One-Time Memories from Stateless Hardware. Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 158, 6:1-6:25.
LibreCat | Download (ext.) | arXiv
 
[25]
2020 | Journal Article | LibreCat-ID: 16927 | OA
Gharibian, S., Aldi, M., de Beaudrap, N., & Saeedi, S. (2020). On efficiently solvable cases of Quantum k-SAT. Communications in Mathematical Physics.
LibreCat | Download (ext.) | arXiv
 
[24]
2020 | Conference Paper | LibreCat-ID: 13226 | OA
Gharibian, S., Piddock, S., & Yirka, J. (2020). Oracle complexity classes and local measurements on physical  Hamiltonians. Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 38.
LibreCat | Download (ext.) | arXiv
 
[23]
2019 | Conference Paper | LibreCat-ID: 13297 | OA
Gharibian, S., & Parekh, O. (2019). Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 145, 31:1-31:17. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31
LibreCat | DOI | Download (ext.)
 
[22]
2019 | Journal Article | LibreCat-ID: 13558 | OA
Gharibian, S., & Yirka, J. (2019). The complexity of simulating local measurements on quantum systems. Quantum, 3, 189. https://doi.org/10.22331/q-2019-09-30-189
LibreCat | DOI | Download (ext.)
 
[21]
2018 | Conference Paper | LibreCat-ID: 8162 | OA
Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018) (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.38
LibreCat | DOI | Download (ext.) | arXiv
 
[20]
2018 | Conference Paper | LibreCat-ID: 8161 | OA
Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018) (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
LibreCat | DOI | Download (ext.) | arXiv
 
[19]
2018 | Conference Paper | LibreCat-ID: 8160 | OA
Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2
LibreCat | DOI | Download (ext.) | arXiv
 
[18]
2018 | Journal Article | LibreCat-ID: 8167 | OA
Gharibian, S., & Sikora, J. (2018). Ground State Connectivity of Local Hamiltonians. ACM Transactions on Computation Theory (TOCT), 10(2), 8:1-8:28. https://doi.org/10.1145/3186587
LibreCat | DOI | Download (ext.) | arXiv
 
[17]
2016 | Conference Paper | LibreCat-ID: 8159 | OA
de Beaudrap, N., & Gharibian, S. (2016). A Linear Time Algorithm for Quantum 2-SAT. In R. Raz (Ed.), Proceedings of the 31st Conference on Computational Complexity (CCC 2016) (Vol. 50, p. 27:1-17:21). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.CCC.2016.27
LibreCat | DOI | Download (ext.) | arXiv
 
[16]
2015 | Conference Paper | LibreCat-ID: 8164 | OA
Gharibian, S., & Sikora, J. (2015). Ground State Connectivity of Local Hamiltonians. In M. M. Halld{\’o}rsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2015) (pp. 617–628). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_50
LibreCat | DOI | Download (ext.) | arXiv
 
[15]
2015 | Journal Article | LibreCat-ID: 8166 | OA
Gharibian, S., Huang, Y., Landau, Z., & Woo Shin, S. (2015). Quantum Hamiltonian Complexity. Foundations and Trends® in Theoretical Computer Science, 10(3), 159–282. https://doi.org/10.1561/0400000066
LibreCat | DOI | Download (ext.) | arXiv
 
[14]
2015 | Journal Article | LibreCat-ID: 8168 | OA
Gharibian, S., Landau, Z., Woo Shin, S., & Wang, G. (2015). Tensor network non-zero testing. Quantum Information & Computation, 15(9{\ & }10), 885–899.
LibreCat | Download (ext.) | arXiv
 
[13]
2014 | Journal Article | LibreCat-ID: 8171 | OA
Gharibian, S., & Kempe, J. (2014). Hardness of approximation for quantum problems. Quantum Information & Computation, 14(5–6), 517–540.
LibreCat | Download (ext.) | arXiv
 
[12]
2014 | Journal Article | LibreCat-ID: 8172 | OA
W. Berry, D., Cleve, R., & Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Information & Computation, 14(1–2), 1–30.
LibreCat | Download (ext.) | arXiv
 
[11]
2013 | Dissertation | LibreCat-ID: 8425 | OA
Gharibian, S. (2013). Approximation, Proof Systems, and Correlations in a Quantum World.
LibreCat | Files available | Download (ext.) | arXiv
 
[10]
2013 | Journal Article | LibreCat-ID: 8173 | OA
Gharibian, S., Sikora, J., & Upadhyay, S. (2013). QMA variants with polynomially many provers. Quantum Information & Computation, 13(1–2), 135–157.
LibreCat | Download (ext.) | arXiv
 
[9]
2012 | Conference Paper | LibreCat-ID: 8169 | OA
Gharibian, S., & Kempe, J. (2012). Hardness of Approximation for Quantum Problems. In A. Czumaj, K. Mehlhorn, A. Pitts, & R. Wattenhofer (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2012) (pp. 387–398). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_33
LibreCat | DOI | Download (ext.) | arXiv
 
[8]
2012 | Journal Article | LibreCat-ID: 8175 | OA
Gharibian, S., & Kempe, J. (2012). Approximation Algorithms for QMA-Complete Problems. SIAM Journal on Computing, 41(4), 1028–1050. https://doi.org/10.1137/110842272
LibreCat | DOI | Download (ext.) | arXiv
 
[7]
2012 | Journal Article | LibreCat-ID: 8174 | OA
Gharibian, S. (2012). Quantifying nonclassicality with local unitary operations. Physical Review A, 86, 042106. https://doi.org/10.1103/PhysRevA.86.042106
LibreCat | DOI | Download (ext.) | arXiv
 
[6]
2011 | Journal Article | LibreCat-ID: 8178 | OA
Gharibian, S., PIANI, M., ADESSO, G., CALSAMIGLIA, J., & HORODECKI, P. (2011). Characterizing Quantumness via Entanglement Creation. International Journal of Quantum Information, 09(07n08), 1701–1713. https://doi.org/10.1142/s0219749911008258
LibreCat | DOI | Download (ext.) | arXiv
 
[5]
2011 | Conference Paper | LibreCat-ID: 8176 | OA
Gharibian, S., & Kempe, J. (2011). Approximation Algorithms for QMA-Complete Problems. IEEE Annual Conference on Computational Complexity (CCC 2011). 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA. https://doi.org/10.1109/ccc.2011.15
LibreCat | DOI | Download (ext.) | arXiv
 
[4]
2011 | Journal Article | LibreCat-ID: 8177 | OA
Piani, M., Gharibian, S., Adesso, G., Calsamiglia, J., Horodecki, P., & Winter, A. (2011). All Nonclassical Correlations Can Be Activated into Distillable Entanglement. Physical Review Letters, 106(22). https://doi.org/10.1103/physrevlett.106.220403
LibreCat | DOI | Download (ext.) | arXiv
 
[3]
2010 | Journal Article | LibreCat-ID: 8179 | OA
Gharibian, S. (2010). Strong NP-hardness of the quantum separability problem. Quantum Information & Computation, 10(3{\ & }4), 343–360.
LibreCat | Download (ext.) | arXiv
 
[2]
2009 | Journal Article | LibreCat-ID: 8180 | OA
Gharibian, S., Kampermann, H., & Bru{\ss}, D. (2009). On global effects caused by locally noneffective unitary operations. Quantum Information & Computation, 9(11), 1013–1029.
LibreCat | Download (ext.) | arXiv
 
[1]
2009 | Journal Article | LibreCat-ID: 8181 | OA
Datta, A., & Gharibian, S. (2009). Signatures of nonclassicality in mixed-state quantum computation. Physical Review A, 79(4). https://doi.org/10.1103/physreva.79.042325
LibreCat | DOI | Download (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

39 Publications

Mark all

[39]
2024 | Preprint | LibreCat-ID: 50272
Rudolph, D., Gharibian, S., & Nagaj, D. (2024). Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation. In arXiv:2401.02368.
LibreCat | arXiv
 
[38]
2024 | Journal Article | LibreCat-ID: 48544 | OA
Gharibian, S. (2024). Guest Column: The 7 faces of quantum NP. ACM SIGACT News, 54(4), 54–91.
LibreCat | Files available | Download (ext.)
 
[37]
2024 | Preprint | LibreCat-ID: 50273
Agarwal, A., Gharibian, S., Koppula, V., & Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In arXiv:2401.01633.
LibreCat | arXiv
 
[36]
2024 | Conference Paper | LibreCat-ID: 50406
Gharibian, S., & Kamminga, J. (n.d.). BQP, meet NP: Search-to-decision reductions and approximate counting. Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP).
LibreCat | arXiv
 
[35]
2023 | Conference Paper | LibreCat-ID: 31872
Gharibian, S., & Rudolph, D. (2023). Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement. 14th Innovations in Theoretical Computer Science (ITCS), 251, 53:1-53:23. https://doi.org/10.4230/LIPIcs.ITCS.2023.53
LibreCat | DOI | arXiv
 
[34]
2023 | Conference Paper | LibreCat-ID: 20841 | OA
Gharibian, S., Watson, J., & Bausch, J. (2023). The Complexity of Translationally Invariant Problems beyond Ground State Energies. Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 254, 54:1-54:21. https://doi.org/10.4230/LIPIcs.STACS.2023.54
LibreCat | DOI | Download (ext.) | arXiv
 
[33]
2023 | Conference Paper | LibreCat-ID: 34138
Bittel, L., Gharibian, S., & Kliesch, M. (2023). The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. Proceedings of the 38th Computational Complexity Conference (CCC), 264(34), 34:1-34:24. https://doi.org/10.4230/LIPIcs.CCC.2023.34
LibreCat | DOI | arXiv
 
[32]
2023 | Conference Paper | LibreCat-ID: 32407
Gharibian, S., Hayakawa, R., Gall, F. L., & Morimae, T. (2023). Improved Hardness Results for the Guided Local Hamiltonian Problem. Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 261(32), 1–19. https://doi.org/10.4230/LIPIcs.ICALP.2023.32
LibreCat | DOI | arXiv
 
[31]
2023 | Journal Article | LibreCat-ID: 50271
Gharibian, S., & Le Gall, F. (2023). Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. SIAM Journal on Computing, 52(4), 1009–1038. https://doi.org/10.1137/22m1513721
LibreCat | DOI
 
[30]
2022 | Journal Article | LibreCat-ID: 34700
Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2022). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Computational Complexity, 31(2), Article 13. https://doi.org/10.1007/s00037-022-00231-8
LibreCat | DOI
 
[29]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian, S., & Rudolph, D. (2022). On polynomially many queries to NP or QMA oracles. 13th Innovations in Theoretical Computer Science (ITCS 2022), 215(75), 1–27. https://doi.org/10.4230/LIPIcs.ITCS.2022.75
LibreCat | DOI | Download (ext.)
 
[28]
2022 | Conference Paper | LibreCat-ID: 27531 | OA
Gharibian, S., & Gall, F. L. (2022). Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture. Proceedings of the 54th ACM Symposium on Theory of Computing (STOC), 19–32.
LibreCat | Download (ext.) | arXiv
 
[27]
2021 | Journal Article | LibreCat-ID: 29780
Broadbent, A., Gharibian, S., & Zhou, H.-S. (2021). Towards Quantum One-Time Memories from Stateless Hardware. Quantum, 5, Article 429. https://doi.org/10.22331/q-2021-04-08-429
LibreCat | DOI
 
[26]
2020 | Conference Paper | LibreCat-ID: 8426
Broadbent, A., Gharibian, S., & Zhou, H.-S. (2020). Towards Quantum One-Time Memories from Stateless Hardware. Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 158, 6:1-6:25.
LibreCat | Download (ext.) | arXiv
 
[25]
2020 | Journal Article | LibreCat-ID: 16927 | OA
Gharibian, S., Aldi, M., de Beaudrap, N., & Saeedi, S. (2020). On efficiently solvable cases of Quantum k-SAT. Communications in Mathematical Physics.
LibreCat | Download (ext.) | arXiv
 
[24]
2020 | Conference Paper | LibreCat-ID: 13226 | OA
Gharibian, S., Piddock, S., & Yirka, J. (2020). Oracle complexity classes and local measurements on physical  Hamiltonians. Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 38.
LibreCat | Download (ext.) | arXiv
 
[23]
2019 | Conference Paper | LibreCat-ID: 13297 | OA
Gharibian, S., & Parekh, O. (2019). Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 145, 31:1-31:17. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31
LibreCat | DOI | Download (ext.)
 
[22]
2019 | Journal Article | LibreCat-ID: 13558 | OA
Gharibian, S., & Yirka, J. (2019). The complexity of simulating local measurements on quantum systems. Quantum, 3, 189. https://doi.org/10.22331/q-2019-09-30-189
LibreCat | DOI | Download (ext.)
 
[21]
2018 | Conference Paper | LibreCat-ID: 8162 | OA
Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018) (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.38
LibreCat | DOI | Download (ext.) | arXiv
 
[20]
2018 | Conference Paper | LibreCat-ID: 8161 | OA
Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018) (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
LibreCat | DOI | Download (ext.) | arXiv
 
[19]
2018 | Conference Paper | LibreCat-ID: 8160 | OA
Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2
LibreCat | DOI | Download (ext.) | arXiv
 
[18]
2018 | Journal Article | LibreCat-ID: 8167 | OA
Gharibian, S., & Sikora, J. (2018). Ground State Connectivity of Local Hamiltonians. ACM Transactions on Computation Theory (TOCT), 10(2), 8:1-8:28. https://doi.org/10.1145/3186587
LibreCat | DOI | Download (ext.) | arXiv
 
[17]
2016 | Conference Paper | LibreCat-ID: 8159 | OA
de Beaudrap, N., & Gharibian, S. (2016). A Linear Time Algorithm for Quantum 2-SAT. In R. Raz (Ed.), Proceedings of the 31st Conference on Computational Complexity (CCC 2016) (Vol. 50, p. 27:1-17:21). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.CCC.2016.27
LibreCat | DOI | Download (ext.) | arXiv
 
[16]
2015 | Conference Paper | LibreCat-ID: 8164 | OA
Gharibian, S., & Sikora, J. (2015). Ground State Connectivity of Local Hamiltonians. In M. M. Halld{\’o}rsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2015) (pp. 617–628). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_50
LibreCat | DOI | Download (ext.) | arXiv
 
[15]
2015 | Journal Article | LibreCat-ID: 8166 | OA
Gharibian, S., Huang, Y., Landau, Z., & Woo Shin, S. (2015). Quantum Hamiltonian Complexity. Foundations and Trends® in Theoretical Computer Science, 10(3), 159–282. https://doi.org/10.1561/0400000066
LibreCat | DOI | Download (ext.) | arXiv
 
[14]
2015 | Journal Article | LibreCat-ID: 8168 | OA
Gharibian, S., Landau, Z., Woo Shin, S., & Wang, G. (2015). Tensor network non-zero testing. Quantum Information & Computation, 15(9{\ & }10), 885–899.
LibreCat | Download (ext.) | arXiv
 
[13]
2014 | Journal Article | LibreCat-ID: 8171 | OA
Gharibian, S., & Kempe, J. (2014). Hardness of approximation for quantum problems. Quantum Information & Computation, 14(5–6), 517–540.
LibreCat | Download (ext.) | arXiv
 
[12]
2014 | Journal Article | LibreCat-ID: 8172 | OA
W. Berry, D., Cleve, R., & Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Information & Computation, 14(1–2), 1–30.
LibreCat | Download (ext.) | arXiv
 
[11]
2013 | Dissertation | LibreCat-ID: 8425 | OA
Gharibian, S. (2013). Approximation, Proof Systems, and Correlations in a Quantum World.
LibreCat | Files available | Download (ext.) | arXiv
 
[10]
2013 | Journal Article | LibreCat-ID: 8173 | OA
Gharibian, S., Sikora, J., & Upadhyay, S. (2013). QMA variants with polynomially many provers. Quantum Information & Computation, 13(1–2), 135–157.
LibreCat | Download (ext.) | arXiv
 
[9]
2012 | Conference Paper | LibreCat-ID: 8169 | OA
Gharibian, S., & Kempe, J. (2012). Hardness of Approximation for Quantum Problems. In A. Czumaj, K. Mehlhorn, A. Pitts, & R. Wattenhofer (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2012) (pp. 387–398). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_33
LibreCat | DOI | Download (ext.) | arXiv
 
[8]
2012 | Journal Article | LibreCat-ID: 8175 | OA
Gharibian, S., & Kempe, J. (2012). Approximation Algorithms for QMA-Complete Problems. SIAM Journal on Computing, 41(4), 1028–1050. https://doi.org/10.1137/110842272
LibreCat | DOI | Download (ext.) | arXiv
 
[7]
2012 | Journal Article | LibreCat-ID: 8174 | OA
Gharibian, S. (2012). Quantifying nonclassicality with local unitary operations. Physical Review A, 86, 042106. https://doi.org/10.1103/PhysRevA.86.042106
LibreCat | DOI | Download (ext.) | arXiv
 
[6]
2011 | Journal Article | LibreCat-ID: 8178 | OA
Gharibian, S., PIANI, M., ADESSO, G., CALSAMIGLIA, J., & HORODECKI, P. (2011). Characterizing Quantumness via Entanglement Creation. International Journal of Quantum Information, 09(07n08), 1701–1713. https://doi.org/10.1142/s0219749911008258
LibreCat | DOI | Download (ext.) | arXiv
 
[5]
2011 | Conference Paper | LibreCat-ID: 8176 | OA
Gharibian, S., & Kempe, J. (2011). Approximation Algorithms for QMA-Complete Problems. IEEE Annual Conference on Computational Complexity (CCC 2011). 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA. https://doi.org/10.1109/ccc.2011.15
LibreCat | DOI | Download (ext.) | arXiv
 
[4]
2011 | Journal Article | LibreCat-ID: 8177 | OA
Piani, M., Gharibian, S., Adesso, G., Calsamiglia, J., Horodecki, P., & Winter, A. (2011). All Nonclassical Correlations Can Be Activated into Distillable Entanglement. Physical Review Letters, 106(22). https://doi.org/10.1103/physrevlett.106.220403
LibreCat | DOI | Download (ext.) | arXiv
 
[3]
2010 | Journal Article | LibreCat-ID: 8179 | OA
Gharibian, S. (2010). Strong NP-hardness of the quantum separability problem. Quantum Information & Computation, 10(3{\ & }4), 343–360.
LibreCat | Download (ext.) | arXiv
 
[2]
2009 | Journal Article | LibreCat-ID: 8180 | OA
Gharibian, S., Kampermann, H., & Bru{\ss}, D. (2009). On global effects caused by locally noneffective unitary operations. Quantum Information & Computation, 9(11), 1013–1029.
LibreCat | Download (ext.) | arXiv
 
[1]
2009 | Journal Article | LibreCat-ID: 8181 | OA
Datta, A., & Gharibian, S. (2009). Signatures of nonclassicality in mixed-state quantum computation. Physical Review A, 79(4). https://doi.org/10.1103/physreva.79.042325
LibreCat | DOI | Download (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed