{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KG3ID5WI5IYF4ATLE7WNVVW7RS","short_pith_number":"pith:KG3ID5WI","schema_version":"1.0","canonical_sha256":"51b681f6c8ea305e026b27ecdad6df8cacc5169391dfb72a449196ee4d4c7b9a","source":{"kind":"arxiv","id":"2308.12103","version":2},"attestation_state":"computed","paper":{"title":"Multi-sequence alignment using the Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederik Kofoed Marqversen, Nikolaj Thomas Zinner, Sebastian Yde Madsen, Stig Elkj{\\ae}r Rasmussen","submitted_at":"2023-08-23T12:46:24Z","abstract_excerpt":"The task of Multiple Sequence Alignment (MSA) is a constrained combinatorial optimization problem that is generally considered a complex computational problem. In this paper, we first present a binary encoding of MSA and devise a corresponding soft-constrained cost-function that enables a Hamiltonian formulation and implementation of the MSA problem with the variational Quantum Approximate Optimization Algorithm (QAOA). Through theoretical analysis, a bound on the ratio of the number of feasible states to the size of the Hilbert space is determined. Furthermore, we consider a small instance of"},"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":"2308.12103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-23T12:46:24Z","cross_cats_sorted":[],"title_canon_sha256":"25829fe33b5b1051c143466159c182cdbddd9e78003928702b54632463e837ac","abstract_canon_sha256":"fa564707a8793faf6baa378aa427a9c058a969e83e4f841d87d27cf6c66f885e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:08.249449Z","signature_b64":"euGcwezoBqHxNIZxVhdmLAnOarJCLMVSU/RUSDxUhw7DCPL3h2+sKxVStEdVmdBrb3F9p7Ng+geDPZIfIGVCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b681f6c8ea305e026b27ecdad6df8cacc5169391dfb72a449196ee4d4c7b9a","last_reissued_at":"2026-07-05T10:53:08.248899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:08.248899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-sequence alignment using the Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederik Kofoed Marqversen, Nikolaj Thomas Zinner, Sebastian Yde Madsen, Stig Elkj{\\ae}r Rasmussen","submitted_at":"2023-08-23T12:46:24Z","abstract_excerpt":"The task of Multiple Sequence Alignment (MSA) is a constrained combinatorial optimization problem that is generally considered a complex computational problem. In this paper, we first present a binary encoding of MSA and devise a corresponding soft-constrained cost-function that enables a Hamiltonian formulation and implementation of the MSA problem with the variational Quantum Approximate Optimization Algorithm (QAOA). Through theoretical analysis, a bound on the ratio of the number of feasible states to the size of the Hilbert space is determined. Furthermore, we consider a small instance of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12103","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.12103/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":"2308.12103","created_at":"2026-07-05T10:53:08.248956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12103v2","created_at":"2026-07-05T10:53:08.248956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12103","created_at":"2026-07-05T10:53:08.248956+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG3ID5WI5IYF","created_at":"2026-07-05T10:53:08.248956+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG3ID5WI5IYF4ATL","created_at":"2026-07-05T10:53:08.248956+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG3ID5WI","created_at":"2026-07-05T10:53:08.248956+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01559","citing_title":"hqQUBO: A Hybrid-querying Quantum Optimization Model Validated with 16-qubits on an Ion Trap Quantum Computer for Life Science Applications","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS","json":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS.json","graph_json":"https://pith.science/api/pith-number/KG3ID5WI5IYF4ATLE7WNVVW7RS/graph.json","events_json":"https://pith.science/api/pith-number/KG3ID5WI5IYF4ATLE7WNVVW7RS/events.json","paper":"https://pith.science/paper/KG3ID5WI"},"agent_actions":{"view_html":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS","download_json":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS.json","view_paper":"https://pith.science/paper/KG3ID5WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12103&json=true","fetch_graph":"https://pith.science/api/pith-number/KG3ID5WI5IYF4ATLE7WNVVW7RS/graph.json","fetch_events":"https://pith.science/api/pith-number/KG3ID5WI5IYF4ATLE7WNVVW7RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS/action/storage_attestation","attest_author":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS/action/author_attestation","sign_citation":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS/action/citation_signature","submit_replication":"https://pith.science/pith/KG3ID5WI5IYF4ATLE7WNVVW7RS/action/replication_record"}},"created_at":"2026-07-05T10:53:08.248956+00:00","updated_at":"2026-07-05T10:53:08.248956+00:00"}