{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WW657K2GHHD3OPXOOOTQZXIAYY","short_pith_number":"pith:WW657K2G","schema_version":"1.0","canonical_sha256":"b5bddfab4639c7b73eee73a70cdd00c60432eabaa5fab1abd414eb7e7c764eb9","source":{"kind":"arxiv","id":"2302.09481","version":2},"attestation_state":"computed","paper":{"title":"Quantum-Relaxation Based Optimization Algorithms: Theoretical Extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eyuri Wakakuwa, Hiroshi Imai, Kosei Teramoto, Rudy Raymond","submitted_at":"2023-02-19T05:31:21Z","abstract_excerpt":"Quantum Random Access Optimizer (QRAO) is a quantum-relaxation based optimization algorithm proposed by Fuller et al. that utilizes Quantum Random Access Code (QRAC) to encode multiple variables of binary optimization in a single qubit. The approximation ratio bound of QRAO for the maximum cut problem is $0.555$ if the bit-to-qubit compression ratio is $3$x, while it is $0.625$ if the compression ratio is $2$x, thus demonstrating a trade-off between space efficiency and approximability. In this research, we extend the quantum-relaxation by using another QRAC which encodes three classical bits "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.09481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-19T05:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"bcb89ee5ccc25d07509c94ee01838c8d5578c6c919a5040ad45137848b0a0cd4","abstract_canon_sha256":"c8cda99ba7ab5627f415babf66f13022b39d14042b6d1d224cab56ab6b7e9ee0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:57:16.190048Z","signature_b64":"S2Bzf/4t6htHqrpGLtdsxxl12sNnM21JzahIt4bq5RbOJfuvemGphRAknMKY562BUUzRGAqbEFv+mpWq7vpEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5bddfab4639c7b73eee73a70cdd00c60432eabaa5fab1abd414eb7e7c764eb9","last_reissued_at":"2026-07-05T05:57:16.189551Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:57:16.189551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Relaxation Based Optimization Algorithms: Theoretical Extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eyuri Wakakuwa, Hiroshi Imai, Kosei Teramoto, Rudy Raymond","submitted_at":"2023-02-19T05:31:21Z","abstract_excerpt":"Quantum Random Access Optimizer (QRAO) is a quantum-relaxation based optimization algorithm proposed by Fuller et al. that utilizes Quantum Random Access Code (QRAC) to encode multiple variables of binary optimization in a single qubit. The approximation ratio bound of QRAO for the maximum cut problem is $0.555$ if the bit-to-qubit compression ratio is $3$x, while it is $0.625$ if the compression ratio is $2$x, thus demonstrating a trade-off between space efficiency and approximability. In this research, we extend the quantum-relaxation by using another QRAC which encodes three classical bits "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09481","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/2302.09481/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.09481","created_at":"2026-07-05T05:57:16.189611+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.09481v2","created_at":"2026-07-05T05:57:16.189611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09481","created_at":"2026-07-05T05:57:16.189611+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW657K2GHHD3","created_at":"2026-07-05T05:57:16.189611+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW657K2GHHD3OPXO","created_at":"2026-07-05T05:57:16.189611+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW657K2G","created_at":"2026-07-05T05:57:16.189611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12700","citing_title":"Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05604","citing_title":"Decoder-Consistent Hamiltonians for POVM-Based Quantum Relaxations","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16060","citing_title":"Mutually Unbiased Bases for Variational Quantum Initialization: Basis-Union Optimality and Adaptive Family Search","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16060","citing_title":"Mutually Unbiased Bases for Variational Quantum Initialization: Basis-Union Optimality and Adaptive Family Search","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY","json":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY.json","graph_json":"https://pith.science/api/pith-number/WW657K2GHHD3OPXOOOTQZXIAYY/graph.json","events_json":"https://pith.science/api/pith-number/WW657K2GHHD3OPXOOOTQZXIAYY/events.json","paper":"https://pith.science/paper/WW657K2G"},"agent_actions":{"view_html":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY","download_json":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY.json","view_paper":"https://pith.science/paper/WW657K2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.09481&json=true","fetch_graph":"https://pith.science/api/pith-number/WW657K2GHHD3OPXOOOTQZXIAYY/graph.json","fetch_events":"https://pith.science/api/pith-number/WW657K2GHHD3OPXOOOTQZXIAYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY/action/storage_attestation","attest_author":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY/action/author_attestation","sign_citation":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY/action/citation_signature","submit_replication":"https://pith.science/pith/WW657K2GHHD3OPXOOOTQZXIAYY/action/replication_record"}},"created_at":"2026-07-05T05:57:16.189611+00:00","updated_at":"2026-07-05T05:57:16.189611+00:00"}