{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KCYM7M3VHDG6246UGBGPKVXRN4","short_pith_number":"pith:KCYM7M3V","schema_version":"1.0","canonical_sha256":"50b0cfb37538cded73d4304cf556f16f1de8c0bb4385a20880b44237457dbb5c","source":{"kind":"arxiv","id":"1902.07890","version":3},"attestation_state":"computed","paper":{"title":"Finding Hadamard matrices by a quantum annealing machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andriyan Bayu Suksmono, Yuichiro Minato","submitted_at":"2019-02-21T07:13:34Z","abstract_excerpt":"Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix problem and address its implementation limitation on existing quantum annealing machine (QAM) that allows up to quadratic terms, whereas the problem naturally introduces higher order ones. For an M-order H-matrix, such a limitation increases the number of variables from M^2 to (M^3 +M^2-M)/2, which makes the formulation of the Hamiltonian too exhaustive to do"},"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":"1902.07890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-21T07:13:34Z","cross_cats_sorted":[],"title_canon_sha256":"c16128005d1fe755d05f7bf68d55d8312a4e7b7cc5490cd2bb9133b20f856006","abstract_canon_sha256":"2d312548fa1aa948094f56c442d0cec201c226d0d64c4909e79d9eb3e7cd370f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:19.226287Z","signature_b64":"SuktjK7qlSBE4SnXZfGTzA9jKQfLnu22eBOHI1xe1rBKPJedjsU6A6/S3UYEHRug+eVJbujfuSBrSGdn+HM1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b0cfb37538cded73d4304cf556f16f1de8c0bb4385a20880b44237457dbb5c","last_reissued_at":"2026-05-17T23:50:19.225501Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:19.225501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Hadamard matrices by a quantum annealing machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andriyan Bayu Suksmono, Yuichiro Minato","submitted_at":"2019-02-21T07:13:34Z","abstract_excerpt":"Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix problem and address its implementation limitation on existing quantum annealing machine (QAM) that allows up to quadratic terms, whereas the problem naturally introduces higher order ones. For an M-order H-matrix, such a limitation increases the number of variables from M^2 to (M^3 +M^2-M)/2, which makes the formulation of the Hamiltonian too exhaustive to do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07890","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1902.07890","created_at":"2026-05-17T23:50:19.225630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07890v3","created_at":"2026-05-17T23:50:19.225630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07890","created_at":"2026-05-17T23:50:19.225630+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCYM7M3VHDG6","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCYM7M3VHDG6246U","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCYM7M3V","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4","json":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4.json","graph_json":"https://pith.science/api/pith-number/KCYM7M3VHDG6246UGBGPKVXRN4/graph.json","events_json":"https://pith.science/api/pith-number/KCYM7M3VHDG6246UGBGPKVXRN4/events.json","paper":"https://pith.science/paper/KCYM7M3V"},"agent_actions":{"view_html":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4","download_json":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4.json","view_paper":"https://pith.science/paper/KCYM7M3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07890&json=true","fetch_graph":"https://pith.science/api/pith-number/KCYM7M3VHDG6246UGBGPKVXRN4/graph.json","fetch_events":"https://pith.science/api/pith-number/KCYM7M3VHDG6246UGBGPKVXRN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4/action/storage_attestation","attest_author":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4/action/author_attestation","sign_citation":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4/action/citation_signature","submit_replication":"https://pith.science/pith/KCYM7M3VHDG6246UGBGPKVXRN4/action/replication_record"}},"created_at":"2026-05-17T23:50:19.225630+00:00","updated_at":"2026-05-17T23:50:19.225630+00:00"}