Published in: LIPIcs, Volume 353, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025)
Nathan Ju and Ansh Nagda. Improved Approximation Algorithms for the EPR Hamiltonian. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 353, pp. 24:1-24:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ju_et_al:LIPIcs.APPROX/RANDOM.2025.24, author = {Ju, Nathan and Nagda, Ansh}, title = {{Improved Approximation Algorithms for the EPR Hamiltonian}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025)}, pages = {24:1--24:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-397-3}, ISSN = {1868-8969}, year = {2025}, volume = {353}, editor = {Ene, Alina and Chattopadhyay, Eshan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.24}, URN = {urn:nbn:de:0030-drops-243909}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2025.24}, annote = {Keywords: Approximation Algorithms, Quantum Local Hamiltonian} }
Feedback for Dagstuhl Publishing