Learning the Closest Product State

Bakshi, Ainesh (ORCID:0009000102258588); Bostanci, John (ORCID:0000000196667114); Kretschmer, William (ORCID:0000000277849817); Landau, Zeph (ORCID:0009000973167585); Li, Jerry (ORCID:0009000350353728); Liu, Allen (ORCID:0000000179875755); O'Donnell, Ryan (ORCID:0000000176081458); Tang, Ewin (ORCID:0000000274519687)

doi:10.1145/3717823.3718207

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 5:00 PM ET until 8:00 PM ET on Friday, September 11 due to maintenance. We apologize for the inconvenience.

Citation Details

Learning the Closest Product State

Award ID(s):: 2016245

PAR ID:: 10678898

Author(s) / Creator(s):: Bakshi, Ainesh; Bostanci, John; Kretschmer, William; Landau, Zeph; Li, Jerry; Liu, Allen; O'Donnell, Ryan; Tang, Ewin

Publisher / Repository:: ACM

Date Published:: 2025-06-15

ISBN:: 9798400715105

Page Range / eLocation ID:: 1212 to 1221

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
https://doi.org/10.1145/3717823.3718207

More Like this