default search action
Kunal Marwaha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha
:
Quantum Merlin-Arthur and Proofs Without Relative Phase. ITCS 2024: 9:1-9:19 - [i13]Roozbeh Bassirian, Kunal Marwaha:
Superposition detection and QMA with non-collapsing measurements. CoRR abs/2403.02532 (2024) - [i12]Roozbeh Bassirian, Bill Fefferman, Itai Leigh, Kunal Marwaha, Pei Wu:
Quantum Merlin-Arthur with an internally separable proof. CoRR abs/2410.19152 (2024) - 2023
- [c6]Chris Jones, Kunal Marwaha
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses. ITCS 2023: 77:1-77:26 - [c5]Pranay Gorantla, Kunal Marwaha, Santhoshini Velusamy
Fair allocation of a multiset of indivisible items. SODA 2023: 304-331 - [c4]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha:
On the Power of Nonstandard Quantum Oracles. TQC 2023: 11:1-11:25 - [i11]Kunal Marwaha
A useful inequality of inverse hyperbolic tangent. CoRR abs/2305.18348 (2023) - [i10]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha
Quantum Merlin-Arthur and proofs without relative phase. CoRR abs/2306.13247 (2023) - [i9]Antares Chen, Neng Huang, Kunal Marwaha
Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs. CoRR abs/2310.01563 (2023) - 2022
- [j2]Kunal Marwaha
Bounds on approximating Max kXOR with quantum and classical local algorithms. Quantum 6: 757 (2022) - [c3]Boaz Barak, Kunal Marwaha:
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs. ITCS 2022: 14:1-14:21 - [c2]Jessica K. Thompson, Ojas Parekh, Kunal Marwaha:
An explicit vector algorithm for high-girth MaxCut. SOSA 2022: 238-246 - [c1]Joao Basso, Edward Farhi, Kunal Marwaha
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. TQC 2022: 7:1-7:21 - [i8]Pranay Gorantla, Kunal Marwaha, Santhoshini Velusamy:
Fair allocation of a multiset of indivisible items. CoRR abs/2202.05186 (2022) - [i7]Chris Jones, Kunal Marwaha, Juspreet Singh Sandhu, Jonathan Shi:
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses. CoRR abs/2210.03006 (2022) - [i6]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha
On the power of nonstandard quantum oracles. CoRR abs/2212.00098 (2022) - 2021
- [j1]Kunal Marwaha
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs. Quantum 5: 437 (2021) - [i5]Boaz Barak, Kunal Marwaha
Classical algorithms and quantum limitations for maximum cut on high-girth graphs. CoRR abs/2106.05900 (2021) - [i4]Jessica K. Thompson, Ojas Parekh, Kunal Marwaha
An explicit vector algorithm for high-girth MaxCut. CoRR abs/2108.12477 (2021) - [i3]Kunal Marwaha
Bounds on approximating Max kXOR with quantum and classical local algorithms. CoRR abs/2109.10833 (2021) - [i2]Ruslan Shaydulin, Kunal Marwaha
QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA. CoRR abs/2110.05555 (2021) - [i1]Joao Basso
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. CoRR abs/2110.14206 (2021)
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 2024-12-01 00:18 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: