{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5KMGRYDL2VIUDCO6BGOQ3GRYGI","short_pith_number":"pith:5KMGRYDL","canonical_record":{"source":{"id":"2308.01572","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-03T07:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"2d48cfb2ea828b464c1948a88711a755b3d68b2ad3c0aa47d64ea01e5806e03e","abstract_canon_sha256":"799c83b25665259dceea8f1680a23b7f8cefecc9a0f52354d9b6b46f07abe864"},"schema_version":"1.0"},"canonical_sha256":"ea9868e06bd5514189de099d0d9a38322b04d8e797c9f6249e4a3151864b2494","source":{"kind":"arxiv","id":"2308.01572","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.01572","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"2308.01572v2","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01572","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"5KMGRYDL2VIU","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"pith_short_16","alias_value":"5KMGRYDL2VIUDCO6","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"pith_short_8","alias_value":"5KMGRYDL","created_at":"2026-07-05T08:17:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5KMGRYDL2VIUDCO6BGOQ3GRYGI","target":"record","payload":{"canonical_record":{"source":{"id":"2308.01572","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-03T07:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"2d48cfb2ea828b464c1948a88711a755b3d68b2ad3c0aa47d64ea01e5806e03e","abstract_canon_sha256":"799c83b25665259dceea8f1680a23b7f8cefecc9a0f52354d9b6b46f07abe864"},"schema_version":"1.0"},"canonical_sha256":"ea9868e06bd5514189de099d0d9a38322b04d8e797c9f6249e4a3151864b2494","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:58.659778Z","signature_b64":"dAxnL6BG4YlH9vKLbRs8BjyATe9ji8flL4gqKhtf/qU2rpX5ZR0WZjjYBFQ90jgYoXNCl1AUe9+/SHsS8UK+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea9868e06bd5514189de099d0d9a38322b04d8e797c9f6249e4a3151864b2494","last_reissued_at":"2026-07-05T08:17:58.659254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:58.659254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.01572","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9i4UURpBKMeZskr6ZvxNnyzZmsvDDJH1l/CrFVyj2AvkNEwLOWF+SekKNKV/EwleCWopMufo0eKWYmCw4fscCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:56:18.629241Z"},"content_sha256":"f5f815f786d780021577f2c38e53f288959373d1b4ad8a3b7ed9e7c78cfdde9b","schema_version":"1.0","event_id":"sha256:f5f815f786d780021577f2c38e53f288959373d1b4ad8a3b7ed9e7c78cfdde9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5KMGRYDL2VIUDCO6BGOQ3GRYGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kosuke Mitarai, Naoki Ishikawa, Naoki Yamamoto, Yuki Sano","submitted_at":"2023-08-03T07:20:24Z","abstract_excerpt":"Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve binary optimization problems. In this paper, we propose higher-order binary formulations that can simultaneously reduce the numbers of qubits and gates required for GAS. Specifically, we consider two novel strategies: one that reduces the number of gates through polynomial factorization, and the other that halves the order of the objective function, subsequently decreasing circuit runtime and implementation cost. Our analysis demonstrates that the proposed higher-order formulations improve the convergence p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01572","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.01572/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stwoHWiHaXg9tvGJ7blxpjcKUNc4Wvm+6aBNBZQ6jQqKCNxo7kI+s/Ni8DDX0iKgFKB6UxWuMexNEPfFiejjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:56:18.629628Z"},"content_sha256":"233ba1b277116bd1a4deb52084808e380685b7c9e82f653b3d6f8c21b34e70c4","schema_version":"1.0","event_id":"sha256:233ba1b277116bd1a4deb52084808e380685b7c9e82f653b3d6f8c21b34e70c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI/bundle.json","state_url":"https://pith.science/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T15:56:18Z","links":{"resolver":"https://pith.science/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI","bundle":"https://pith.science/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI/bundle.json","state":"https://pith.science/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KMGRYDL2VIUDCO6BGOQ3GRYGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5KMGRYDL2VIUDCO6BGOQ3GRYGI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"799c83b25665259dceea8f1680a23b7f8cefecc9a0f52354d9b6b46f07abe864","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-03T07:20:24Z","title_canon_sha256":"2d48cfb2ea828b464c1948a88711a755b3d68b2ad3c0aa47d64ea01e5806e03e"},"schema_version":"1.0","source":{"id":"2308.01572","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.01572","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"2308.01572v2","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01572","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"5KMGRYDL2VIU","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"pith_short_16","alias_value":"5KMGRYDL2VIUDCO6","created_at":"2026-07-05T08:17:58Z"},{"alias_kind":"pith_short_8","alias_value":"5KMGRYDL","created_at":"2026-07-05T08:17:58Z"}],"graph_snapshots":[{"event_id":"sha256:233ba1b277116bd1a4deb52084808e380685b7c9e82f653b3d6f8c21b34e70c4","target":"graph","created_at":"2026-07-05T08:17:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.01572/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve binary optimization problems. In this paper, we propose higher-order binary formulations that can simultaneously reduce the numbers of qubits and gates required for GAS. Specifically, we consider two novel strategies: one that reduces the number of gates through polynomial factorization, and the other that halves the order of the objective function, subsequently decreasing circuit runtime and implementation cost. Our analysis demonstrates that the proposed higher-order formulations improve the convergence p","authors_text":"Kosuke Mitarai, Naoki Ishikawa, Naoki Yamamoto, Yuki Sano","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-03T07:20:24Z","title":"Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01572","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f5f815f786d780021577f2c38e53f288959373d1b4ad8a3b7ed9e7c78cfdde9b","target":"record","created_at":"2026-07-05T08:17:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"799c83b25665259dceea8f1680a23b7f8cefecc9a0f52354d9b6b46f07abe864","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-03T07:20:24Z","title_canon_sha256":"2d48cfb2ea828b464c1948a88711a755b3d68b2ad3c0aa47d64ea01e5806e03e"},"schema_version":"1.0","source":{"id":"2308.01572","kind":"arxiv","version":2}},"canonical_sha256":"ea9868e06bd5514189de099d0d9a38322b04d8e797c9f6249e4a3151864b2494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea9868e06bd5514189de099d0d9a38322b04d8e797c9f6249e4a3151864b2494","first_computed_at":"2026-07-05T08:17:58.659254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:17:58.659254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dAxnL6BG4YlH9vKLbRs8BjyATe9ji8flL4gqKhtf/qU2rpX5ZR0WZjjYBFQ90jgYoXNCl1AUe9+/SHsS8UK+Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:17:58.659778Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.01572","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5f815f786d780021577f2c38e53f288959373d1b4ad8a3b7ed9e7c78cfdde9b","sha256:233ba1b277116bd1a4deb52084808e380685b7c9e82f653b3d6f8c21b34e70c4"],"state_sha256":"307669e2dcf3339f3c03971b3b0fdc31e7d8f951866227e3484f737aa84c7c10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kl6gN4ugNV+fvYrcR6CfkfIwytZr01xMny5ABWANMQfwKpc1ljghDy7tlm4ut2e9okFMpOUmls3JOaokzKlcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:56:18.631535Z","bundle_sha256":"bc3641b9696c7960f44bac950bbb2dd81ac193c832c40196873e9ec9898fd078"}}