{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SYWQJKE466LIHGMLCUHAHFEMOP","short_pith_number":"pith:SYWQJKE4","schema_version":"1.0","canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","source":{"kind":"arxiv","id":"2406.13412","version":1},"attestation_state":"computed","paper":{"title":"Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Valter Uotila","submitted_at":"2024-06-19T10:05:57Z","abstract_excerpt":"Quantum computing and modern tensor-based computing have a strong connection, which is especially demonstrated by simulating quantum computations with tensor networks. The other direction is less studied: quantum computing is not often applied to tensor-based problems. Considering tensor decompositions, we focus on discovering practical matrix multiplication algorithms and develop two algorithms to compute decompositions on quantum computers. The algorithms are expressed as higher-order unconstrained binary optimization (HUBO) problems, which are translated into quadratic unconstrained binary "},"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":"2406.13412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T10:05:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c29e4e12cea3a12318a9ed0ab7ef7242d9a7c96f90d936e7fb6848a7e5caecb2","abstract_canon_sha256":"4b897583f741ccbc849577a81e4c917a5adc61f4936a9f0b4bf842503e290348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:34.726244Z","signature_b64":"3Xa2dBwMLkvqEPSVP9c3ecLabXkWYYr0R+9c8A74NYZ8cUZP/WqfyWx6vCLipVQPz2KutxXk+J3l2fUf2BDcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","last_reissued_at":"2026-07-05T12:02:34.725741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:34.725741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Valter Uotila","submitted_at":"2024-06-19T10:05:57Z","abstract_excerpt":"Quantum computing and modern tensor-based computing have a strong connection, which is especially demonstrated by simulating quantum computations with tensor networks. The other direction is less studied: quantum computing is not often applied to tensor-based problems. Considering tensor decompositions, we focus on discovering practical matrix multiplication algorithms and develop two algorithms to compute decompositions on quantum computers. The algorithms are expressed as higher-order unconstrained binary optimization (HUBO) problems, which are translated into quadratic unconstrained binary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13412","kind":"arxiv","version":1},"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/2406.13412/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":"2406.13412","created_at":"2026-07-05T12:02:34.725811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13412v1","created_at":"2026-07-05T12:02:34.725811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13412","created_at":"2026-07-05T12:02:34.725811+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYWQJKE466LI","created_at":"2026-07-05T12:02:34.725811+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYWQJKE466LIHGML","created_at":"2026-07-05T12:02:34.725811+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYWQJKE4","created_at":"2026-07-05T12:02:34.725811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00362","citing_title":"Left-Deep Join Order Selection with Higher-Order Unconstrained Binary Optimization on Quantum Computers","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP","json":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP.json","graph_json":"https://pith.science/api/pith-number/SYWQJKE466LIHGMLCUHAHFEMOP/graph.json","events_json":"https://pith.science/api/pith-number/SYWQJKE466LIHGMLCUHAHFEMOP/events.json","paper":"https://pith.science/paper/SYWQJKE4"},"agent_actions":{"view_html":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP","download_json":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP.json","view_paper":"https://pith.science/paper/SYWQJKE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13412&json=true","fetch_graph":"https://pith.science/api/pith-number/SYWQJKE466LIHGMLCUHAHFEMOP/graph.json","fetch_events":"https://pith.science/api/pith-number/SYWQJKE466LIHGMLCUHAHFEMOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/action/storage_attestation","attest_author":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/action/author_attestation","sign_citation":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/action/citation_signature","submit_replication":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/action/replication_record"}},"created_at":"2026-07-05T12:02:34.725811+00:00","updated_at":"2026-07-05T12:02:34.725811+00:00"}