{"as_of":"2026-08-18T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85ea9479024f97679c4d18b4b08ef2694a104f57dc2dccdf35056a99c1ad14f7","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:26:32.016638Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.11385/citation-record","integrity":"/paper/2608.11385/integrity","json":"/paper/2608.11385/citation-record.json","paper":"/paper/2608.11385"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.726895Z","title":"Challenges and opportunities in quantum optimization.Nature Reviews Physics, pages 1–18, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.726895Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:4ddce4dffe2da9eff84de55c8ffb7a358095cc80ee9798cc9b5df07de3393fe1","observation_id":"9a432d83-cc3f-4ffd-86fa-b7ed5c0f6dc7","resolution":{"observed_at":"2026-08-15T14:26:31.726895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-16T20:17:55.570300Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-15T14:26:31.733319Z","title":"A quantum approximate optimization algorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.733319Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:cf6b93edfd48d656b85c7b4e1746ef20aae3f0f9d84dc3bf37e7d266ebe6a11f","observation_id":"3afa827b-3b2b-4843-9107-0f6b106367d9","resolution":{"observed_at":"2026-08-15T14:26:31.733319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.228349Z","title":"Rieffel, Davide Venturelli, and Rupak Biswas","venue":null,"work_id":"4e6655db-7a56-448c-b160-dd60bc958be8","year":2019},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.739512Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:e879c2807697a788728501c3431b49b5ae580f8c4b931ac6c1f4e91db2cae170","observation_id":"fe22a873-711b-4c0a-9754-3fb67dc7785a","resolution":{"observed_at":"2026-08-15T14:26:33.233793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.210636Z","title":"Quantum approximate optimization algorithm for MaxCut: A fermionic view.Physical Review A, 97(2):022304, 2018","venue":null,"work_id":"d8933e84-237a-430d-92a8-e7a06a919da0","year":2018},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.745704Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:b61979bf7d5f60095edd65a278b59b094d86e593343065731508466773def3a3","observation_id":"3c10eb4a-5c2c-4471-bb5f-d6892f652eee","resolution":{"observed_at":"2026-08-15T14:26:33.216049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.751500Z","title":"A unified complexity- algorithm account of constant-round QAOA expectation computation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.751500Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:20206e711b176dbd82664226c85a759637b56a73cc191a07c8bcdbe65e06e485","observation_id":"24dd9c96-29d7-4e4c-9b10-8c277b61156b","resolution":{"observed_at":"2026-08-15T14:26:31.751500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.193855Z","title":null,"venue":null,"work_id":"68197e97-031f-4706-b04a-c5a522735115","year":1979},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.756609Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:eab9f4e81af9d8251bea7ab95b23b3b7ba661b9b7cc1890ff78b92b592b52764","observation_id":"e740b920-4975-4631-adfd-8c8718cc4cac","resolution":{"observed_at":"2026-08-15T14:26:33.199460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.176180Z","title":null,"venue":null,"work_id":"ad6537cf-c100-41d5-aeda-dc2c15e08792","year":1988},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.762381Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:e81a1dfd5762654b4f3421608c86af34f86e19b1f6e56c8a9629c666e85e4eb4","observation_id":"0427b049-b4ef-440e-bc90-6123ea710497","resolution":{"observed_at":"2026-08-15T14:26:33.181801Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.158646Z","title":"Polynomial-time approximation algorithms for the Ising model","venue":null,"work_id":"df9c37ed-d604-46ba-8c78-7210045c46e1","year":1993},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.767278Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:3916f7d514d9de37f166b4923baf10d113f04be9643dbf932e852f73ae552d42","observation_id":"d5257bc2-7d4a-4c24-89fb-1bc61fbf4c93","resolution":{"observed_at":"2026-08-15T14:26:33.164651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.141926Z","title":"The complexity of counting cuts and of computing the probability that a graph is connected.SIAM Journal on Computing, 12(4):777–788, 1983","venue":null,"work_id":"75f83bc8-2b52-4be0-9103-de2bb91d0c69","year":1983},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.772560Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:ab2781b161aef8acf3fd333cd9ffd6bd59e75c3bccd0943ccf63e44541884a91","observation_id":"4f45b677-fd6a-440f-bdaa-30379df00f12","resolution":{"observed_at":"2026-08-15T14:26:33.147335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.125333Z","title":"Complexity of counting the optimal solutions.Theoretical Computer Science, 410(38-40):3814–3825, 2009","venue":null,"work_id":"68cf160a-cbb0-43d4-94aa-ea77e46ab240","year":2009},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.777493Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:3aa367a7b4e9db61b6c2f6f70c25826fddc0a00bf9a8bf1271778eaefb2c9519","observation_id":"f9015fb0-b451-4e03-9115-afe3351e0ec7","resolution":{"observed_at":"2026-08-15T14:26:33.130696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.108670Z","title":"Standard implementations ofe−iγCG require at least∆(G)two-qubit gate depth","venue":null,"work_id":"9e23af3c-5699-4f8b-8313-72e9598fa0e5","year":null},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.782410Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:06fe173056b9dc94c37a3de49b11a6285a18c77f473fd72393ab0d8f238223ef","observation_id":"0f03e250-99e8-4153-b82a-21b43c728004","resolution":{"observed_at":"2026-08-15T14:26:33.114256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.091549Z","title":"Quantum algorithms for scientific computing and approximate optimization","venue":null,"work_id":"d871c6ad-be9d-4662-96b6-e93807476940","year":2018},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.787605Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:99d9ab9190f1808da99fda103ebfb36f69a8db8181273aeb67b3f75d7af1b7ce","observation_id":"dfbb3ed4-3eab-4393-a387-017f2a6e6e39","resolution":{"observed_at":"2026-08-15T14:26:33.096630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-14T22:08:56.225697Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-15T14:26:31.792601Z","title":"Quantum supremacy through the quantum approximate optimization algorithm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.792601Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:847b34cde0ecb16826d05bb2e96f358da19fc2d0f814b1283dadfbe0d97306b7","observation_id":"1988896d-c392-4b45-8354-f4c1a2e3b3ce","resolution":{"observed_at":"2026-08-15T14:26:31.792601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.072913Z","title":"In particular, choosingb =O(N)permits exponentially small error while preserving a polynomial-time reduction","venue":null,"work_id":"5bf42394-7a39-4fbd-a101-b75e26f95c2c","year":null},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.797759Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:38883f14978fc7aa5b67830534fd43d4a40e0e3ef9026581a3db229951283c37","observation_id":"9fe01bb3-2568-43d4-9cc3-01b72f8dab76","resolution":{"observed_at":"2026-08-15T14:26:33.077827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.056478Z","title":"1.2 may be formalized as follows","venue":null,"work_id":"a85a27ee-6a3d-457f-b731-870f0b0a8463","year":null},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.803137Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:18914b082aff0da28b4170b0f542605274ffb2021b993e6f4fd9dcd6f755bd3d","observation_id":"bfee9827-1cd8-4e08-aa30-e6cd32789743","resolution":{"observed_at":"2026-08-15T14:26:33.061968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.038435Z","title":"1.2 can all be performed in polynomial time and with polynomially scaling number of bits [55–57]","venue":null,"work_id":"55201018-8724-4b10-a56e-3e4ceb9d4ba3","year":null},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.808426Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:2f282d08b0b6b98bda94682cde7b145354d7e4cd3e3a9529a1eb13269df4c57a","observation_id":"a8d97056-8739-4131-b080-cce9ce1f0755","resolution":{"observed_at":"2026-08-15T14:26:33.044203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.022006Z","title":"PP is as hard as the polynomial-time hierarchy.SIAM Journal on Computing, 20(5):865–877, 1991","venue":null,"work_id":"75a7ffa5-a1b5-4915-9b51-852077a029af","year":1991},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.813751Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:5e1b912eed3afe43a84f9d45421f778d68da5a5559d8105b85b9fbc5751ede98","observation_id":"1b6c5732-9cb1-486f-a5da-c1f91b3d6660","resolution":{"observed_at":"2026-08-15T14:26:33.027173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6062","last_updated":"2015-06-25T17:43:01Z","snapshot_observed_at":"2026-08-14T23:06:54.296666Z","submitted_at":"2014-12-18T20:38:18Z","title":"A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6062","snapshot_observed_at":"2026-08-15T14:26:31.818964Z","title":"A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem.arXiv preprintarXiv:1412.6062, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.818964Z"},"links":{"cited_paper":"/paper/1412.6062","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:86e1c35513c8fbacf98c332bf1bf91b50459315397803ea2274bf12db271a7fe","observation_id":"ee077af6-6350-485e-af30-3c82b189ab8f","resolution":{"observed_at":"2026-08-15T14:26:31.818964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:33.004789Z","title":"Near-optimal quantum circuit for Grover’s unstructured search using a transverse field.Physical Review A, 95(6):062317, 2017","venue":null,"work_id":"dc64aba0-c0c7-4c01-8928-50fa4ca41af7","year":2017},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.824271Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:499e1e86e08e17d743283690af30a2b66111a058139b5f299f77c556da93b59e","observation_id":"80647356-4212-4ade-8f15-99417200d6c8","resolution":{"observed_at":"2026-08-15T14:26:33.010152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.829735Z","title":"Obstacles to variational quantum optimization from symmetry protection.Physical Review Letters, 125(26):260505, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.829735Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:76f28cac98ff6729eef4ae1156724ba4eadec23e15b65533686cc0b2d365e400","observation_id":"7d4d92d3-bf59-497f-9bd9-e6f22c1862d1","resolution":{"observed_at":"2026-08-15T14:26:31.829735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07047","last_updated":"2019-08-01T19:12:32Z","snapshot_observed_at":"2026-08-15T04:08:34.129692Z","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07047","snapshot_observed_at":"2026-08-15T14:26:31.834405Z","title":"Classical and quantum bounded depth approximation algorithms.arXiv preprint arXiv:1905.07047, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.834405Z"},"links":{"cited_paper":"/paper/1905.07047","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:4396f4a17145a69e11f54d15fa531352c03eb9321dc6a66b45031ee3d251e947","observation_id":"1b05de1b-7c04-4fb8-9bba-226d413cd8a3","resolution":{"observed_at":"2026-08-15T14:26:31.834405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.976527Z","title":"Local classical MAX-CUT algorithm outperformsp = 2QAOA on high-girth regular graphs","venue":null,"work_id":"064408c7-f5bc-45e9-a633-1f02a1916d5e","year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.839463Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:a9bfda887628c7a6f5bed17b7f1d990eb7781408f1c707ce9716cb54f5940f15","observation_id":"4e03299b-336f-4f2a-97c1-c6b23f4424c8","resolution":{"observed_at":"2026-08-15T14:26:32.982169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.957764Z","title":"MaxCut quantum approximate optimization algorithm performance guarantees forp>1","venue":null,"work_id":"167df9d5-f18a-4287-b024-e5cd6eb8652e","year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.844395Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:69587389108394a5d3d30589539f5407696f16d7fee5f7cdfebe1cc57d0fcd3f","observation_id":"c0d9b96f-2a92-49f2-8a64-c0d01f96eea6","resolution":{"observed_at":"2026-08-15T14:26:32.963048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05900","last_updated":"2021-06-10T16:28:23Z","snapshot_observed_at":"2026-08-17T20:35:00.661676Z","submitted_at":"2021-06-10T16:28:23Z","title":"Classical algorithms and quantum limitations for maximum cut on high-girth graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.05900","snapshot_observed_at":"2026-08-15T14:26:31.849367Z","title":"Classical algorithms and quantum limitations for maximum cut on high-girth graphs.arXiv preprint arXiv:2106.05900, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.849367Z"},"links":{"cited_paper":"/paper/2106.05900","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:18e6f06a180fb29f834795a6b99d9dcf824615aed0a57e00cf9973e8e8e95e37","observation_id":"4b86f367-e9ee-4199-93b9-5dcbe8262833","resolution":{"observed_at":"2026-08-15T14:26:31.849367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.940991Z","title":"Bounds on approximating MaxkXOR with quantum and classical local algorithms.Quantum, 6:757, 2022","venue":null,"work_id":"886a092b-02af-4002-a915-ed3374deeac3","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.854643Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:f60285625018993f6e7f1f0fdf75b5268844193eea2e042924815bb0d6c5bb1a","observation_id":"a1be3f5e-6fe9-4f50-8ed0-9034431e3599","resolution":{"observed_at":"2026-08-15T14:26:32.946250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.925609Z","title":"Analytical framework for quantum alternating operator ansätze.Quantum Science and Technology, 8(1):015017, 2022","venue":null,"work_id":"f51e9321-7062-4a3a-b567-e869506cd7f9","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.858884Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:26c53707b5e66a508ba6ed4a21bc12266e8859a7aace959a883bf0f077bff51b","observation_id":"37d84448-403c-40d9-a039-e2b343937777","resolution":{"observed_at":"2026-08-15T14:26:32.930220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.910479Z","title":"Expectation values from the single- layer quantum approximate optimization algorithm on Ising problems.Quantum Science and Technology, 7(4):045036, 2022","venue":null,"work_id":"714a29bc-be4d-4fbd-a1e7-202ccbd864da","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.863097Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:2f1ef33ab45e60ebf7589741fb7b1b5e6440b465a2d7f1f03e3b791ce62ef55d","observation_id":"d0b7e734-a0e4-41ba-b2a3-b5af90993913","resolution":{"observed_at":"2026-08-15T14:26:32.915281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.894423Z","title":"The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model","venue":null,"work_id":"e9bc0585-924c-4dc0-b024-d5021abde3fe","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.867334Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:8765826ed4eb9fcbc5a7d310140d73426119ce27805d67a10213fa420478f92e","observation_id":"5b97e1f8-caba-4e11-a32d-e4b30f9683e4","resolution":{"observed_at":"2026-08-15T14:26:32.899650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-08-15T14:26:31.871575Z","title":"Predicting parameters for the quantum approx- imate optimization algorithm for MAX-CUT from the infinite-size limit","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.871575Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:1f6080a322b34954ed7fc93942254d127e5967aadfc3fe90f14050f44ada5302","observation_id":"ec1f0e30-f922-448f-8048-ed7f3528475a","resolution":{"observed_at":"2026-08-15T14:26:31.871575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.876825Z","title":"The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size.Quantum, 6:759, 2022","venue":null,"work_id":"70eabb0e-b51b-4ab9-af00-3cba879ec203","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.876426Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:747cdecd014e43132bd2ed38e014bf264ad9d4ae67064c060330857d9df8c83d","observation_id":"5fd5f979-458a-43d6-9119-0632c8bdb2a8","resolution":{"observed_at":"2026-08-15T14:26:32.882754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.859218Z","title":"Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models","venue":null,"work_id":"e6e4d50b-1042-4efe-bcde-4b35de696c4f","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.880750Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:eb42e5d21956789816ed5df2ded9415f236c298a23f5edbdd3be729d086eaba9","observation_id":"802932a1-a922-413c-8874-5a9ef9195fd9","resolution":{"observed_at":"2026-08-15T14:26:32.864030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.842381Z","title":"Spin–boson mapping of the quantum approximate optimization algorithm","venue":null,"work_id":"f740bc9e-589f-419e-b027-e7a7cee24b72","year":2026},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.885939Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:72932e700bf5dc987f43283d99b6a937f63a23d9cb4cf59940420e14b3c60671","observation_id":"6d249d8a-3b53-4dd4-bc7c-65912480186a","resolution":{"observed_at":"2026-08-15T14:26:32.847523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.825602Z","title":"Training variational quantum algorithms is NP-hard","venue":null,"work_id":"ac08e90c-1d7d-428b-a5c3-352999b4e3e4","year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.890926Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:2424a9dcc7b0ce3db38341602d9f2a11804429274dc9ba1213316387176347b7","observation_id":"99151de5-e4e4-4a0a-ae4b-d6963e04f409","resolution":{"observed_at":"2026-08-15T14:26:32.831155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.808866Z","title":"Bremner, Richard Jozsa, and Dan J","venue":null,"work_id":"d9847421-6950-45bd-b089-eee0892116a0","year":2011},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.896071Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:e1208535bf9dd2e92d0c9da4b49298b821fa1887390485fbdf80bb4c855514a6","observation_id":"c1a61c7b-23dc-4985-8456-0c0fe1149aa1","resolution":{"observed_at":"2026-08-15T14:26:32.814018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.22758","last_updated":"2026-06-17T09:47:17Z","snapshot_observed_at":"2026-08-13T21:43:02.284045Z","submitted_at":"2026-05-21T17:24:00Z","title":"A sharp interaction-degree threshold for simulating QAOA","version":2},"cited_work":{"arxiv_id":"2605.22758","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.22758","snapshot_observed_at":"2026-08-15T14:26:32.315425Z","title":"A sharp interaction-degree threshold for simulating QAOA","venue":"quant-ph","work_id":"e7413ca3-a7cc-402a-8ca5-25857dd71ac2","year":2026},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.900799Z"},"links":{"cited_paper":"/paper/2605.22758","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:79119a9dc1b3ae8c11aec2e04f3f83ca1a11e69cfed4a8cae825da9e0eff8464","observation_id":"a6ce05ba-734b-43d9-94db-ef13615dfccd","resolution":{"observed_at":"2026-08-15T14:26:32.322631Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.05642","last_updated":"2022-06-12T02:35:51Z","snapshot_observed_at":"2026-08-17T08:07:54.995549Z","submitted_at":"2022-06-12T02:35:51Z","title":"Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.05642","snapshot_observed_at":"2026-08-15T14:26:31.906387Z","title":"Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent.arXiv preprint arXiv:2206.05642, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.906387Z"},"links":{"cited_paper":"/paper/2206.05642","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:78a9eef8c6f4dd5592ed21603bc3820b99aa76507b031df312d7c4ee1d9f41cd","observation_id":"b527dd36-6fad-48d9-836e-ff7843e0013c","resolution":{"observed_at":"2026-08-15T14:26:31.906387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.790709Z","title":"How many qubits are needed for quantum computational supremacy?Quantum, 4:264, 2020","venue":null,"work_id":"6f2b0353-ee98-440b-9fc2-a9592223b88d","year":2020},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.911725Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:4ddc7f4d8239edcc2d1c8b6bba54717804798e28b80bc53f7dd811e7673c5dec","observation_id":"5d1e3163-816c-4835-bf4b-df67b6fa7ca8","resolution":{"observed_at":"2026-08-15T14:26:32.796376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.916725Z","title":"Quantum computational supremacy","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.916725Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:80d5fd37dc0cc059fd035fa15c5a4f9958392e5bbea2592ee1840832e1227390","observation_id":"061c71b4-6702-484a-98a8-ebc195507730","resolution":{"observed_at":"2026-08-15T14:26:31.916725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.761159Z","title":"Classical algorithms for quantum mean values","venue":null,"work_id":"2bf7ccca-cd54-40d0-98d6-acf6186e51eb","year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.921629Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:dbf2840f528e2cf9c5fb61805cb553ec15172a37444a3c8dbea2ce73e8fa83aa","observation_id":"e5cd2f7f-2dd7-4a1a-8ea5-530ab2d9eff7","resolution":{"observed_at":"2026-08-15T14:26:32.766562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.12277","last_updated":"2019-12-31T09:23:58Z","snapshot_observed_at":"2026-08-10T10:33:38.505161Z","submitted_at":"2019-12-27T18:37:30Z","title":"What do QAOA energies reveal about graphs?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.12277","snapshot_observed_at":"2026-08-15T14:26:31.926722Z","title":"WhatdoQAOAenergiesrevealaboutgraphs? arXivpreprintarXiv:1912.12277, 2019","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.926722Z"},"links":{"cited_paper":"/paper/1912.12277","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:650c8a0d2d430188f95a49746c1716be737ec73c45f7ab6d049909362d0476e6","observation_id":"8082621a-a273-4b21-a191-562b09ca910f","resolution":{"observed_at":"2026-08-15T14:26:31.926722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.741301Z","title":"On the representation of Boolean and real functions as Hamiltonians for quantum computing","venue":null,"work_id":"8f731804-f18f-497a-9eb5-41b8bb2b91a4","year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.931736Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:6c6d6d06ab9cf57b29377514aae6879d846d4bf6307d20016d30e067a28fae0d","observation_id":"c7de68ab-4f79-4e48-a3b4-60fe428b0457","resolution":{"observed_at":"2026-08-15T14:26:32.748885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07720","last_updated":"2026-04-14T18:00:04Z","snapshot_observed_at":"2026-08-13T03:44:22.940399Z","submitted_at":"2025-03-10T18:00:02Z","title":"Counting with the quantum alternating operator ansatz","version":2},"cited_work":{"arxiv_id":"2503.07720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.07720","snapshot_observed_at":"2026-08-15T14:26:32.249703Z","title":"Counting with the quantum alternating operator ansatz","venue":"quant-ph","work_id":"7ca335a0-acdb-484a-92fb-6df8848ae0c5","year":2025},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.936557Z"},"links":{"cited_paper":"/paper/2503.07720","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:f92d4f348c7fcd506e50808ae1a4c6186455c1aef297288eb15da02e0211f92a","observation_id":"6807ddc4-87b8-44a8-b640-befb26239415","resolution":{"observed_at":"2026-08-15T14:26:32.255463Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.29562","last_updated":"2026-06-28T19:00:40Z","snapshot_observed_at":"2026-07-07T00:03:31.715960Z","submitted_at":"2026-06-28T19:00:40Z","title":"The QAOA on the ring of disagrees","version":1},"cited_work":{"arxiv_id":"2606.29562","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.29562","snapshot_observed_at":"2026-08-15T14:26:32.225737Z","title":"The QAOA on the ring of disagrees","venue":"quant-ph","work_id":"0e1004de-ef4e-478e-8321-e306b3868d6c","year":2026},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.941656Z"},"links":{"cited_paper":"/paper/2606.29562","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:fe9b02f57262388aaa8b6b3c9f04f6c285371818364dc5a41da0083e7ad35560","observation_id":"b68af2dc-dfd4-4ec3-92f9-6de47c40bbfc","resolution":{"observed_at":"2026-08-15T14:26:32.231032Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.29687","last_updated":"2026-06-29T01:25:40Z","snapshot_observed_at":"2026-07-07T00:03:36.327050Z","submitted_at":"2026-06-29T01:25:40Z","title":"A Machine-Verified Proof of a Quantum-Optimization Conjecture","version":1},"cited_work":{"arxiv_id":"2606.29687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.29687","snapshot_observed_at":"2026-08-15T14:26:32.198993Z","title":"A Machine-Verified Proof of a Quantum-Optimization Conjecture","venue":"quant-ph","work_id":"f2858c5c-1fc9-4df2-ac26-fc73f886242f","year":2026},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.947307Z"},"links":{"cited_paper":"/paper/2606.29687","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:da2a4b05a900f3a15498d767f6ce065c158d3fab58e509c904aa0b561503bc67","observation_id":"9f5a88d8-cbd3-48e5-a045-1c1c8650948f","resolution":{"observed_at":"2026-08-15T14:26:32.206792Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.952451Z","title":"Parameter setting in quantum approximate optimization of weighted problems.Quantum, 8:1231, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.952451Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:d16035557c6fd22c3616cb9b8352174f4b529fb194bcf12457888c48608145d1","observation_id":"22d2a918-cebf-43cc-a824-d62c7796f169","resolution":{"observed_at":"2026-08-15T14:26:31.952451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.957436Z","title":"Lower bounding the MaxCut of high-girth 3-regular graphs using the QAOA.arXiv preprint arXiv:2503.12789, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.957436Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:7e086be9d451cae1d14327672f65707de13bfc7535d63daea1f5b35abfacc135","observation_id":"753d48df-7498-406b-b8c7-bbade394cba1","resolution":{"observed_at":"2026-08-15T14:26:31.957436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.706218Z","title":"Characterizing local noise in QAOA circuits.IOP SciNotes, 1(2):025208, 2020","venue":null,"work_id":"f08784b7-e16c-42d5-8bcc-b1121aa51972","year":2020},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.962276Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:fe2edcc5329aa22ec2bd41eee96009fc46d86ff98c78b4fbfff656e504c847e5","observation_id":"565c6f5f-2ac2-4e0b-b258-3c739a71d5fc","resolution":{"observed_at":"2026-08-15T14:26:32.711599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.687914Z","title":"Hybrid quantum-classical algorithms for approximate graph coloring.Quantum, 6:678, 2022","venue":null,"work_id":"41bf69cd-2329-428f-85c5-f74f2049f194","year":2022},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.967091Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:5017d63ee83955e19c1332b7229b39832e4fb4b611d3f974fae6fb061aa6e1a1","observation_id":"411c2c85-1172-4e2b-af91-cc9d28d577bc","resolution":{"observed_at":"2026-08-15T14:26:32.693874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.669330Z","title":"Hodson, Bhuvanesh Sundar, Stephen Jeffrey, Yuki Yamaguchi, Dennis Feng, Filip B","venue":null,"work_id":"e79ff5a1-0419-4648-ae44-22e746d409ca","year":2023},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.972106Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:e375c549ab34aba15efdaabf93894f10eab49636bba78b89aa540942a0354304","observation_id":"5b363ad1-b778-47be-975d-1139f442cc2a","resolution":{"observed_at":"2026-08-15T14:26:32.674627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.654059Z","title":"Iterative quantum algorithms for maximum independent set","venue":null,"work_id":"0c0bd1a8-36f1-4964-802f-420607b9a9db","year":2024},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.977209Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:c4ad246632abe54f47f1bbd7fa142cabc2b6b17edd6ee5d19fd9f8e3ccfdd807","observation_id":"dab7a6f6-2bad-4e2e-a9b7-f799a35a5c4b","resolution":{"observed_at":"2026-08-15T14:26:32.658764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.636565Z","title":"Quantum-informed recursive optimization algorithms.PRX Quantum, 5(2):020327, 2024","venue":null,"work_id":"193c9334-3bf6-4823-840c-5e44b1a4203c","year":2024},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.982239Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:3ee9cde777c7da3b34b109561f7bfe76312d791552f4b46c8344967424da7df9","observation_id":"9a508bb3-a257-4941-b15d-54200a15364b","resolution":{"observed_at":"2026-08-15T14:26:32.643191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.619379Z","title":"Brady and Stuart Hadfield","venue":null,"work_id":"862dff15-999d-4172-a8ef-46d07370a616","year":2026},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.987366Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:06ea2f9d1efc7ec573a8d95a0f8d9e78ffaa057ed84b15afd852ebe65a80fb42","observation_id":"0149c67f-e5a4-4bc4-b92b-937d91e2e66f","resolution":{"observed_at":"2026-08-15T14:26:32.624574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:31.992401Z","title":"A scalable quantum-enhanced greedy algorithm for maximum independent set problems.arXiv preprint arXiv:2601.21923, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.992401Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:252caae23f4ef1c027bc31f983e1342e14839e7ca0541222aae41ab73e291050","observation_id":"99f5be1d-3261-457a-ba87-15f2bdc6aac6","resolution":{"observed_at":"2026-08-15T14:26:31.992401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.600808Z","title":"Extendingrelax-and-roundcombinatorialoptimization solvers with quantum correlations.Physical Review A, 109(1):012429, 2024","venue":null,"work_id":"6cdf7918-2b1d-4ff1-af19-82d3a92a682a","year":2024},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.997642Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:6f88aecb12edab93f746454fa935442b4461c63394a7e98e9b7aca237f4583de","observation_id":"54044a2b-938f-432e-beb4-79c711576729","resolution":{"observed_at":"2026-08-15T14:26:32.606394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.581919Z","title":"A multilevel approach for solving large-scale QUBO problems with noisy hybrid quantum approximate optimization","venue":null,"work_id":"f23fb99b-bc57-4a22-b96b-5ecd6cfbb153","year":null},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:32.002740Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:1adcbf89d88e2e7ad14e7fb85ec75e232a5c1586a697c4a0ebcaf592c4b5268f","observation_id":"012cda86-69a6-4d71-ae71-1c067d461f67","resolution":{"observed_at":"2026-08-15T14:26:32.587958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.565194Z","title":"Lenstra, Hendrik W","venue":null,"work_id":"a23528a9-9dcb-49da-ad33-06eddad8fed7","year":1982},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:32.007890Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:f0d3bf00549cbe1555ce032595764b7705e01d745aee32a4b074fee177dcc3be","observation_id":"e0ae0e49-c4da-4741-9928-607b2d71a066","resolution":{"observed_at":"2026-08-15T14:26:32.570407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.547877Z","title":"Algorithms in real algebraic geometry","venue":null,"work_id":"8e875779-4047-4dee-b05c-c8713542f3bf","year":2006},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:32.012124Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:30869380b0b1d6ae39e5621257ebe5e96b154511046c5bc25ecbdb959c77a69c","observation_id":"493b7c0b-897c-4a80-aec3-ba4ac1c6a9e8","resolution":{"observed_at":"2026-08-15T14:26:32.553488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:26:32.529919Z","title":"Springer Science & Business Media, 2013","venue":null,"work_id":"76328da8-6e0f-433d-9a27-11b2c6ce4bfb","year":2013},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:32.016638Z"},"links":{"citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:476829bc56fd6411cea82119d6e6f535f60968a1493b1735eaa41048acdecc32","observation_id":"69562b21-9ea4-4de7-b4bd-047369fe9646","resolution":{"observed_at":"2026-08-15T14:26:32.535266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":4,"verified_fuzzy":37},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2608.11385."}