@inproceedings{BarakMarwaha22,
  author     = {Boaz Barak and
                Kunal Marwaha},
  title      = {Classical algorithms and quantum limitations for maximum cut on high-girth
                graphs},
  journal    = {CoRR},
  booktitle = {ITCS},
  year       = {2022},
  url_paper        = {https://arxiv.org/abs/2106.05900},
  eprinttype = {arXiv},
  eprint     = {2106.05900},
  series    = {LIPIcs},
  volume    = {215},
  pages     = {14:1--14:21},
  timestamp  = {Thu, 14 Oct 2021 09:14:50 +0200},
  biburl     = {https://dblp.org/rec/journals/corr/abs-2106-05900.bib},
  bibsource  = {dblp computer science bibliography, https://dblp.org},
  note=  {Also presented as poster in QIP 2022}
}

{"_id":"G9Y58vJonx4wqWNsd","bibbaseid":"barak-marwaha-classicalalgorithmsandquantumlimitationsformaximumcutonhighgirthgraphs-2022","author_short":["Barak, B.","Marwaha, K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Boaz"],"propositions":[],"lastnames":["Barak"],"suffixes":[]},{"firstnames":["Kunal"],"propositions":[],"lastnames":["Marwaha"],"suffixes":[]}],"title":"Classical algorithms and quantum limitations for maximum cut on high-girth graphs","journal":"CoRR","booktitle":"ITCS","year":"2022","url_paper":"https://arxiv.org/abs/2106.05900","eprinttype":"arXiv","eprint":"2106.05900","series":"LIPIcs","volume":"215","pages":"14:1–14:21","timestamp":"Thu, 14 Oct 2021 09:14:50 +0200","biburl":"https://dblp.org/rec/journals/corr/abs-2106-05900.bib","bibsource":"dblp computer science bibliography, https://dblp.org","note":"Also presented as poster in QIP 2022","bibtex":"@inproceedings{BarakMarwaha22,\n author = {Boaz Barak and\n Kunal Marwaha},\n title = {Classical algorithms and quantum limitations for maximum cut on high-girth\n graphs},\n journal = {CoRR},\n booktitle = {ITCS},\n year = {2022},\n url_paper = {https://arxiv.org/abs/2106.05900},\n eprinttype = {arXiv},\n eprint = {2106.05900},\n series = {LIPIcs},\n volume = {215},\n pages = {14:1--14:21},\n timestamp = {Thu, 14 Oct 2021 09:14:50 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2106-05900.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org},\n note= {Also presented as poster in QIP 2022}\n}\n\n\n","author_short":["Barak, B.","Marwaha, K."],"key":"BarakMarwaha22","id":"BarakMarwaha22","bibbaseid":"barak-marwaha-classicalalgorithmsandquantumlimitationsformaximumcutonhighgirthgraphs-2022","role":"author","urls":{" paper":"https://arxiv.org/abs/2106.05900"},"metadata":{"authorlinks":{}},"downloads":9},"bibtype":"inproceedings","biburl":"www.boazbarak.org/boaz.bib","dataSources":["763eChmCTEH5onHpy","jomRn3LFHawZsjFia","ZdZkvHBZGR7Mt6sXE","rRM8G92fpDDvXxQen"],"keywords":[],"search_terms":["classical","algorithms","quantum","limitations","maximum","cut","high","girth","graphs","barak","marwaha"],"title":"Classical algorithms and quantum limitations for maximum cut on high-girth graphs","year":2022,"downloads":9}