{"as_of":"2026-08-09T17:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d68db31adbb32e6a346942c4d3010f3de469a1d40421e6194878cfbb0d926475","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T23:02:56.648923Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T21:55:17.540073Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T21:57:10.395940Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"cited_work":{"arxiv_id":"2502.04277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04277","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Non-variational quantum random access optimization with alternating operator ansatz","venue":null,"work_id":"9dcd365e-870a-4dc4-bd79-22184be31130","year":2025},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2502.04277","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:da43e84fabe52ad3c4de9e19ddad9d0c78ab0476a941d87727534c660a1bb904","observation_id":"fb6b2a8b-7354-4c01-8c41-6f6d83649f24","resolution":{"observed_at":"2026-05-22T21:57:10.404765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"cited_work":{"arxiv_id":"2502.04277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04277","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Non-variational quantum random access optimization with alternating operator ansatz","venue":null,"work_id":"9dcd365e-870a-4dc4-bd79-22184be31130","year":2025},"citing_paper":{"arxiv_id":"2504.21172","last_updated":"2026-04-29T17:40:25Z","snapshot_observed_at":"2026-07-06T21:16:46.592336Z","submitted_at":"2025-04-29T20:47:20Z","title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T17:43:23.965963Z"},"links":{"cited_paper":"/paper/2502.04277","citing_paper":"/paper/2504.21172"},"observation_digest":"sha256:6a2d7cc7bdc53927cbc8b8786eefdc851af0b2b6e4c6b98376edcf1ca230900b","observation_id":"c631d9e7-9026-4329-a45b-cf835c833446","resolution":{"observed_at":"2026-05-22T17:45:00.429491Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04277/citation-record","integrity":"/paper/2502.04277/integrity","json":"/paper/2502.04277/citation-record.json","paper":"/paper/2502.04277"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-08-08T23:02:56.472832Z","title":"A quantum algorithm for finding the minimum,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.472832Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:3e3bed8cfb15acee8b590ffc09c61477686e29e074880d55492ad67ed0db95ff","observation_id":"0412849a-3629-46ab-b2d2-414144bb5942","resolution":{"observed_at":"2026-08-08T23:02:56.472832Z","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-08T23:03:28.024032Z","title":"Solving Boolean satisfiability problems with the quantum approximate optimization algorithm,","venue":null,"work_id":"d2b68a3e-2b8f-4369-a5c5-3e1f561f2acc","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.476959Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:95ebe4159f3ab42feda3a8d5af27f819ef03463b25b37488b7f221479a981749","observation_id":"9bd17ac5-4670-4c3d-9ce1-c764ecc9f63c","resolution":{"observed_at":"2026-08-08T23:03:28.028212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.922646Z","title":"Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem,","venue":null,"work_id":"ae0162b6-f4fc-4c22-9d20-2db29f336f54","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.480411Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:5d3a327b3ad52d1d40933266db3323557be39121062f2fa5965a4089169cf2b7","observation_id":"07b9d666-8a6f-42a5-92e8-3fdd002c60fb","resolution":{"observed_at":"2026-08-08T23:03:27.972928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.802360Z","title":"Mind the gap: Achieving a super-grover quantum speedup by jumping to the end,","venue":null,"work_id":"abafaec2-1229-4817-9c6a-6885633242f5","year":2023},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.483503Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:95ce8a1b19ef6c5a29788a777a2cab32b2c2a7fc8626f2d77563d45fee538951","observation_id":"26f8aa65-4ba9-4741-981b-6eb715bfeef3","resolution":{"observed_at":"2026-08-08T23:03:27.886026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:02:56.487447Z","title":"Generalized short path algorithms: Towards super-quadratic speedup over Markov chain search for combinatorial optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.487447Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:ac2e5c3c83744448a9c2c80fb940e362a74558de850fc6567204481c83f39d02","observation_id":"2125fd0d-e099-4e94-9e34-bc641498c4c1","resolution":{"observed_at":"2026-08-08T23:02:56.487447Z","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-08T23:03:27.742964Z","title":"Invited: Challenges and opportunities of quantum optimization in finance,","venue":null,"work_id":"62d98b5f-0cde-4c89-b45a-156a4cbebd74","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.491196Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:6fabecac89923c15bc55041e0a98a452fb0b716338c6b8294df6b5a59b2c3cbc","observation_id":"65f9dc52-0e69-4176-a25b-cf828e959d42","resolution":{"observed_at":"2026-08-08T23:03:27.746900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-07T16:14:03.140675Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-08T23:02:56.495061Z","title":"Threshold for fault-tolerant quan- tum advantage with the quantum approximate optimiza- tion algorithm,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.495061Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:a097f275ced376aaed05e8930cf248c47302bffb6b71ab0867e33971858e9a80","observation_id":"36eb71c6-8c06-471f-92f1-13f7a2de74de","resolution":{"observed_at":"2026-08-08T23:02:56.495061Z","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-08T23:03:27.733095Z","title":"Approximate solutions of combinatorial problems via quantum relaxations,","venue":null,"work_id":"7edd8895-1147-481f-b730-d1b555f2cf77","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.499007Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:d6df2cae2cd941cd0e767779b286d94ab27dbc8bf0edd82832f0c8a74ee6cd9b","observation_id":"aa5c8ad8-a73e-4c3c-a625-ab555c8e8e7b","resolution":{"observed_at":"2026-08-08T23:03:27.736719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.721764Z","title":"Quantum-relaxation based optimiza- tion algorithms: Theoretical extensions,","venue":null,"work_id":"1d1fb4f8-7337-41f1-935d-3979b751a092","year":2023},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.502476Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:49a50c563b12a2d877a10abed15f9a618b8441579d98af6a0042b6530c23ca75","observation_id":"65a1e658-5b2d-4875-88f0-89b537f7a7a0","resolution":{"observed_at":"2026-08-08T23:03:27.726080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.710284Z","title":"Dense quantum coding and quantum finite automata,","venue":null,"work_id":"e192620b-077d-497d-8d40-923f1ebfb3de","year":2002},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.505901Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:3e851520d8f2ffbb28232bb0f6274e4ed9e9df022bceb95123185702590af577","observation_id":"0c7a55b2-94e0-4e97-a6df-77a219f0cf5d","resolution":{"observed_at":"2026-08-08T23:03:27.714101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.699269Z","title":"Optimal lower bounds for quantum automata and random access codes,","venue":null,"work_id":"5e19c8cd-1a96-4e1e-beaa-de8f31bcc9f1","year":1999},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.509379Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:1eec6561fb0acb2d185fa158cef10bf15399d387b0a4c093baf79c8bca59a57b","observation_id":"38641adb-5230-483c-aeb1-92802f28e90e","resolution":{"observed_at":"2026-08-08T23:03:27.703009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.676508Z","title":"(4,1)-quantum random access coding does not exist—one qubit is not enough to recover one of four bits,","venue":null,"work_id":"4ecc1d48-b773-4a25-8950-cfee1a05ebac","year":2006},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.512634Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:5c3abf0537033625c60f48f3ad57962ecbd4b8917407b8c6d1117cc737456ed5","observation_id":"12be0626-c6f7-4633-9c82-09538a09290e","resolution":{"observed_at":"2026-08-08T23:03:27.686137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.660131Z","title":"Constructions of quantum random access codes,","venue":null,"work_id":"ccd847bf-7f04-486b-9a86-5757aa46f4ab","year":2018},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.516629Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:080c00da8ee59e896c91681002db64f9c92be98b058e950dd9a98c2147ca12e3","observation_id":"36ab8160-df7c-459c-8449-f262986457a2","resolution":{"observed_at":"2026-08-08T23:03:27.665580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.632327Z","title":"The geometry of bloch space in the context of quantum random access codes,","venue":null,"work_id":"1d9fcb58-033a-4bd3-a9b5-80710ac8f242","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.520146Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:02464bd9d7c07eed44bf90c96ec7dc5123ab431480c8a756df5e33bfd4694070","observation_id":"473412e1-0b15-4cd2-ba67-0058cb68cc23","resolution":{"observed_at":"2026-08-08T23:03:27.648439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.578069Z","title":"The role of entanglement in quantum-relaxation based optimization algorithms,","venue":null,"work_id":"fb3faf20-6db8-454f-97cd-45ab0faedba0","year":2023},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.523509Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:01d7250418b48f174e8e9c64b308877e7ecfce02795348b627d20c7de15cfc8f","observation_id":"a3a105af-859b-478e-a006-b0a4aac0131d","resolution":{"observed_at":"2026-08-08T23:03:27.618176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.459708Z","title":"Quantum combinato- rial optimization algorithms for network reconfiguration: QRAO vs. QAOA,","venue":null,"work_id":"980137c6-ecda-4fb6-8739-6553b707eca7","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.527419Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:871868107ee5af2bc416099edd93336cf867b14f5d718d252ccddba8a5b2e705","observation_id":"527510f3-d378-4de9-89b3-24166ac1dffb","resolution":{"observed_at":"2026-08-08T23:03:27.513152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.447697Z","title":"Noise robustness of quantum relax- ation for combinatorial optimization,","venue":null,"work_id":"90735dea-aac0-4771-a9cc-6edfd3243386","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.531004Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:7035da30c508953abf1011c9699458451048b14bc3e41c76bb45c1bdc388903c","observation_id":"90f74793-d050-47e8-a40b-c50c7dbbe64e","resolution":{"observed_at":"2026-08-08T23:03:27.452045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.435905Z","title":"Quantum relaxation for solving multiple knapsack problems,","venue":null,"work_id":"a8a188a7-de16-4586-8d85-6cedc536bf99","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.534389Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:0fb40deee8e8adb4206472f96faca52612bf857eb3ffe877268a3ce31671d8a9","observation_id":"6ded4705-6da0-4ba1-86fa-dbe589cd2e0d","resolution":{"observed_at":"2026-08-08T23:03:27.439658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.423445Z","title":"Recursive quantum relaxation for combinatorial optimization problems,","venue":null,"work_id":"65af3edc-014e-46b2-bb5f-225a91be940f","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.537903Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:a07f9fac5516d1fe5dbea7717e3f21fb4f71563f4d02a17db8f1863466cec7b8","observation_id":"19ed3c7e-cac9-42cb-8826-d1b7139c4780","resolution":{"observed_at":"2026-08-08T23:03:27.428046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.405393Z","title":"Characterizing barren plateaus in quantum ans¨atze with the adjoint representation,","venue":null,"work_id":"189caacb-04e5-4d64-8e48-52604f5c7611","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.541496Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:c44fc2f0b471a5877f49d53e57285750a389d06eca5b8fa1834ceb198f66a9a1","observation_id":"62e2c740-8fb8-412b-b7bf-408617b00804","resolution":{"observed_at":"2026-08-08T23:03:27.416099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.333105Z","title":"Diagnosing barren plateaus with tools from quantum optimal control,","venue":null,"work_id":"4c073c40-a82e-4f4a-877d-f64ea3523588","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.544929Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:98c4b5bade6314ce9315d22c8e3674dd59a0efca819baefa6f7728a868985802","observation_id":"8a297878-ed23-4581-bad7-33ba03c1e8ff","resolution":{"observed_at":"2026-08-08T23:03:27.369566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.192309Z","title":"Barren plateaus in quantum neural network training landscapes,","venue":null,"work_id":"5d751f86-98ce-4a0e-a5d3-139727977a87","year":2018},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.548441Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:cf322a4238a9d9ea7aa35d54982a5510ef895cf1cbfdab8de13eca451ff7a65f","observation_id":"3a0414b2-2617-4f9b-baaa-4d8507f0e586","resolution":{"observed_at":"2026-08-08T23:03:27.246626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.121745Z","title":"Quantum optimization,","venue":null,"work_id":"dba9652f-3988-4dc4-afed-761ac7fe223c","year":2000},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.551950Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:0342ef4016d356f9bb8ce59c121aea62c0274a32d9bdf1429d897468a2be2c1d","observation_id":"acf32770-07af-4f59-a528-181ae5b039ac","resolution":{"observed_at":"2026-08-08T23:03:27.143990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","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-08T23:02:56.555387Z","title":"A quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.555387Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:8103e5a4e2108693f5bc32c6d76f14af2f83b70b78ba4d3f43dd445bc1dad929","observation_id":"b3112669-b0e3-4f9d-9654-7adc331603eb","resolution":{"observed_at":"2026-08-08T23:02:56.555387Z","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-08T23:03:27.110081Z","title":"From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,","venue":null,"work_id":"3eb464b5-069f-4408-8861-b9b4348ad2c2","year":2019},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.558851Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:17737627a6fd2703087e5e3311300e6e9119abb9e0d01e3e0ac2442bb6afd3c4","observation_id":"c42dd222-0f55-4d98-8bec-89cfc7907f7f","resolution":{"observed_at":"2026-08-08T23:03:27.114067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.099492Z","title":"Efficient variational simulation of non-trivial quantum states,","venue":null,"work_id":"92fb0da4-8134-43b8-9342-9d7db607b2b5","year":2019},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.562234Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:a512e1c7f595c8fb87818fb1043a43aee749046ce6c4451aac34b267af7c608d","observation_id":"80391bb1-162e-4a4f-ac8b-60de52ac1741","resolution":{"observed_at":"2026-08-08T23:03:27.102769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.13056","last_updated":"2021-10-26T19:38:38Z","snapshot_observed_at":"2026-07-06T11:42:33.225865Z","submitted_at":"2021-08-30T08:24:38Z","title":"Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.13056","snapshot_observed_at":"2026-08-08T23:02:56.565895Z","title":"Quantum alternating operator ansatz (QAOA) phase diagrams and applications for quantum chemistry,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.565895Z"},"links":{"cited_paper":"/paper/2108.13056","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:d2dd64836981ed980f3b2f61f9b089ae988298dc55f9177bb7562f34e120fa68","observation_id":"5884773f-9a0a-4655-8b8c-cfc75dca2e3a","resolution":{"observed_at":"2026-08-08T23:02:56.565895Z","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-08T23:03:27.088421Z","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":"146ebeb1-2271-420f-ae1f-2854d93f217c","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.569738Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:f11e2a99cfc99c66eddbc8296e944c451a54b4b3952af7823cfe3b61fdec892d","observation_id":"35937ccd-7980-4f17-bbca-9ae851eb7623","resolution":{"observed_at":"2026-08-08T23:03:27.092372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.076819Z","title":"Parameter setting in quantum approximate optimization of weighted problems,","venue":null,"work_id":"35d88903-6dc2-4250-bdab-f39f41bc6335","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.573432Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:30e8533bb1e96f133566f4f910112d5bbe3cb83cd8e81824c44ce0d3466f34cd","observation_id":"8e7329b3-b3c2-436a-ade3-19fe27798074","resolution":{"observed_at":"2026-08-08T23:03:27.080640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.065141Z","title":"Performance of quantum approximate opti- mization with quantum error detection,","venue":null,"work_id":"677d35b8-d536-4635-b1ac-edecaf14c644","year":2025},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.576769Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:fb6f66155e0fb37bb506f0d0ff2a0f7342bf2761ffd01ab2adeb6335ec2ce952","observation_id":"6bfb86e5-69a7-47d7-b843-334c06cdffd6","resolution":{"observed_at":"2026-08-08T23:03:27.069282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:02:56.580323Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.580323Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:a5885472a03be2bb91ca21c9a043f56cebf7b21a500c9a5d0be0a9aa3869e5a5","observation_id":"3b0a4f12-e852-44ec-8c95-3b793bbc8a0f","resolution":{"observed_at":"2026-08-08T23:02:56.580323Z","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-08T23:03:27.049642Z","title":"Training variational quantum algorithms is NP-hard,","venue":null,"work_id":"765140c1-6761-4120-9e64-29f9ba974d21","year":2021},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.583734Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:f33161f29e86a2bd2e866c4592d0e9d17e6d212e1ed544e69ed8501b6b4b396f","observation_id":"14ea2125-ad0d-40b8-b1f8-129442206bba","resolution":{"observed_at":"2026-08-08T23:03:27.052608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.037275Z","title":"The quantum approximate optimization algorithm needs to see the whole graph: A typical case,","venue":null,"work_id":"e4354961-816a-4560-b255-0308f189ffa3","year":2020},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.587035Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:246270f26450fa23d6ac446ae2ee83aa9d66c4c423b1c4535c24cf63ff41e0d4","observation_id":"54b42a20-8a4b-45d3-bbc2-67eb2127132c","resolution":{"observed_at":"2026-08-08T23:03:27.043385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.020083Z","title":"Multistart methods for quantum approximate optimization,","venue":null,"work_id":"6d132016-d91c-4515-bdc3-5748820eca6b","year":2019},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.590364Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:72251b3e40b217afa3a439061140fd3832346b56a72236e6fa10e695bc41b979","observation_id":"d345f69f-91c5-4168-9167-0fc4df5b9d39","resolution":{"observed_at":"2026-08-08T23:03:27.026090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:27.009566Z","title":"Parameter setting heuristics make the quantum approximate optimization algorithm suitable for the early fault-tolerant era,","venue":null,"work_id":"c3921349-487c-4e0a-a53f-bc9c26ea0df3","year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.593855Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:89600d548f4811776892ca4a6eb6023c25264ad6d80758c03933d83ff649743f","observation_id":"45a776c9-7af4-4f42-a4ec-3303b86a1b8e","resolution":{"observed_at":"2026-08-08T23:03:27.012848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.973178Z","title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,","venue":null,"work_id":"c6aff671-b703-4377-9c14-3820b077dbc3","year":2020},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.597315Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:a62b0ad7f3d38fd49c5cca11b57add8525976cc86e018c3e150e2706c5744bb3","observation_id":"59112d16-058a-49f2-95a1-eda67ba2ff9c","resolution":{"observed_at":"2026-08-08T23:03:26.998182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.889594Z","title":"An efficient circuit compilation flow for quantum approximate optimization algorithm,","venue":null,"work_id":"debb66e0-206e-446a-b63e-768d685b9614","year":2020},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.600397Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:4459a698b2011b0000175e9a875d42cc13a706a3a666f61e5e2f4ff974c24948","observation_id":"1218c580-28f8-469b-8c9f-1e5e4cc10c05","resolution":{"observed_at":"2026-08-08T23:03:26.933982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.813518Z","title":"Alignment between initial state and mixer improves QAOA performance for constrained optimiza- tion,","venue":null,"work_id":"c4030800-0c63-46c3-a408-206e0e6f6eeb","year":2023},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.603301Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:4daa539bca6465262a91efe0cd2444a8af72795247196679bc6d78652b751c34","observation_id":"a080b985-6a2a-45e6-a6a0-9e27b664a4f3","resolution":{"observed_at":"2026-08-08T23:03:26.839335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.05089","last_updated":"2023-07-07T14:17:37Z","snapshot_observed_at":"2026-08-03T19:48:49.726219Z","submitted_at":"2022-07-11T18:00:01Z","title":"The QAOA gets stuck starting from a good classical string","version":2},"cited_work":{"arxiv_id":"2207.05089","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.05089","snapshot_observed_at":"2026-08-08T23:03:11.508384Z","title":"The QAOA gets stuck starting from a good classical string","venue":"quant-ph","work_id":"749bc74c-633d-479b-a453-e584d4157c46","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.606043Z"},"links":{"cited_paper":"/paper/2207.05089","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:606debe3bfdbef6a11d16ad13b06dca73888cdf881d4fe28b4555f986ae2fe39","observation_id":"8737d735-801c-461f-9217-b9a53ff6db70","resolution":{"observed_at":"2026-08-08T23:03:11.516233Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.761885Z","title":"Fixed-angle conjectures for the quantum approximate optimization algorithm on regular maxcut graphs,","venue":null,"work_id":"b38eb4ba-6acf-4a1c-b301-6fe767498f32","year":2021},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.609305Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:4e69bc0adca47157f6f0174ad4a9e1ee02022a6bcfb258cbb74fd2f5087cb78e","observation_id":"d240c340-5326-45d9-b870-31c6e01df336","resolution":{"observed_at":"2026-08-08T23:03:26.765819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:02:56.612336Z","title":"End-to-end protocol for high-quality QAOA parameters with few shots,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.612336Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:e0246c99842fa214e964b2552fba3328f97e0a7ef41e406b3761a310572ddc98","observation_id":"2c430408-7ea6-416a-8772-da4f2164562c","resolution":{"observed_at":"2026-08-08T23:02:56.612336Z","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-08T23:03:26.750468Z","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":"47655c92-b280-4227-8ba3-47d13c2bf5ea","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.615391Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:390f34e13f896d5525bb60d8223fc52b68ecbe1dfee0b2fb3d9d420ce7d46b64","observation_id":"65c5be57-4dd4-4f86-a1db-28ab9c17d3e2","resolution":{"observed_at":"2026-08-08T23:03:26.754312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.739005Z","title":"O(N 3) measurement cost for varia- tional quantum eigensolver on molecular Hamiltonians,","venue":null,"work_id":"018f7129-9155-4dd8-90e5-9588bae7f411","year":2020},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.618131Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:b623436672e4f5f24fa0e5433e0972a4ce9c0ef521c2be820954b89182fc006a","observation_id":"89a231a0-5ad7-4d70-996e-b0f1dbe92c36","resolution":{"observed_at":"2026-08-08T23:03:26.743259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.05983","last_updated":"2021-03-12T16:34:15Z","snapshot_observed_at":"2026-07-06T08:51:00.749363Z","submitted_at":"2020-01-16T18:33:24Z","title":"Term Grouping and Travelling Salesperson for Digital Quantum Simulation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.05983","snapshot_observed_at":"2026-08-08T23:02:56.620822Z","title":"Term grouping and travelling sales- person for digital quantum simulation,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.620822Z"},"links":{"cited_paper":"/paper/2001.05983","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:cd6cdd4e7ec7063657ea02260849af770fd41fa2056d29fa543e750617918bc4","observation_id":"259e825b-55f1-46b7-9a45-f441179700ec","resolution":{"observed_at":"2026-08-08T23:02:56.620822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0308033","last_updated":"2004-03-12T20:09:22Z","snapshot_observed_at":"2026-07-07T07:13:05.833591Z","submitted_at":"2003-08-06T19:42:16Z","title":"Minimal Universal Two-qubit Quantum Circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0308033","snapshot_observed_at":"2026-08-08T23:02:56.624661Z","title":"Minimal universal two-qubit cnot- based circuits,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.624661Z"},"links":{"cited_paper":"/paper/quant-ph/0308033","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:d94e2b3de3e6cc1d74b783b56bec8e12095a240ed262bf49e09026a41f510664","observation_id":"5db24e3c-233d-4202-8b90-4f3f7562bd6d","resolution":{"observed_at":"2026-08-08T23:02:56.624661Z","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-08T23:03:26.727993Z","title":"Validating quantum computers using randomized model circuits,","venue":null,"work_id":"3c525d4f-d423-4421-b11c-67962ba44968","year":2019},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.628368Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:205fce409ff9594915e24c5e33a16129c4c2fb9937614e8a497387eadf17678a","observation_id":"1258d072-99d9-4aa7-a0ad-501a54ff0f43","resolution":{"observed_at":"2026-08-08T23:03:26.732141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.716485Z","title":"Random compiler for fast Hamiltonian simulation,","venue":null,"work_id":"5334d449-3d95-4879-9c18-da872b05e15b","year":2019},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.631687Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:0ae229fdc12d3bcf7a537dddcb90cb6b214425a7334546484ff2baa6f744cb04","observation_id":"1ab4d6d3-8a0c-4881-a016-6891d4067fde","resolution":{"observed_at":"2026-08-08T23:03:26.719832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.703965Z","title":"qujax: Simulating quantum circuits with JAX,","venue":null,"work_id":"3f8579aa-75ee-4220-9cde-b744e4d2cd5b","year":2023},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.634990Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:1e80dd4b08dd21089f752ef7878a307764ec6a82add085d70cedf8a303764c0f","observation_id":"1318efc5-c94a-46af-a716-38b40c99f388","resolution":{"observed_at":"2026-08-08T23:03:26.708038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.692023Z","title":"Predicting many properties of a quantum system from very few measurements,","venue":null,"work_id":"bbee2b21-f3c0-48ca-876e-9df3dcef71a3","year":2020},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.638138Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:0655dcca5e6da2f5ee9e0d454494c89e8986a89d3914fa594a789597e644fe00","observation_id":"388a7c14-22d7-415d-a6d4-36373d005718","resolution":{"observed_at":"2026-08-08T23:03:26.696010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:03:26.676370Z","title":"How much entanglement do quantum op- timization algorithms require?","venue":null,"work_id":"5133578b-9f1b-4f7a-9181-7656fe9ac75c","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.641569Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:e171937f3305dc6105a31da27d268af2d10d915ac51266b9161015392e03f989","observation_id":"c12a0a12-0641-4205-bcb2-085582a25d24","resolution":{"observed_at":"2026-08-08T23:03:26.684303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.03404","last_updated":"2022-07-07T16:21:36Z","snapshot_observed_at":"2026-07-06T13:28:54.165063Z","submitted_at":"2022-07-07T16:21:36Z","title":"The Quantum Approximate Optimization Algorithm performance with low entanglement and high circuit depth","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.03404","snapshot_observed_at":"2026-08-08T23:02:56.644847Z","title":"The quantum approximate optimiza- tion algorithm performance with low entanglement and high circuit depth,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.644847Z"},"links":{"cited_paper":"/paper/2207.03404","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:48ae601dcd38a06ceb6e5f4f468bd35d5199d82d31d72430bd5abda3d6cdf704","observation_id":"abee788a-4bcd-4f4e-be94-178ce849151e","resolution":{"observed_at":"2026-08-08T23:02:56.644847Z","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-08T23:03:26.636955Z","title":"Entanglement perspective on the quantum approximate optimization algorithm,","venue":null,"work_id":"cfe73069-3cbc-4e5d-a940-20f498d0e16f","year":2022},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.648923Z"},"links":{"citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:34d9c93e562aeddb33b4b22a752a59af2b0436424e7589f5cfbcdf30cd871723","observation_id":"35648db3-5177-4ede-9b8d-7e1cab5d3293","resolution":{"observed_at":"2026-08-08T23:03:26.660642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":41},"total_outbound_references":52},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 2 inbound Pith citation observations for arXiv:2502.04277."}