{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QIH532TZPPL7EVSJWPCU7FJZ2K","short_pith_number":"pith:QIH532TZ","schema_version":"1.0","canonical_sha256":"820fddea797bd7f25649b3c54f9539d2aac1cc7a25d7f0aa53947bddce0a12d2","source":{"kind":"arxiv","id":"2512.11619","version":2},"attestation_state":"computed","paper":{"title":"Tight bound for the total time in digital-analog quantum computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mikel Garcia-de-Andoin, Mikel Sanz","submitted_at":"2025-12-12T14:57:53Z","abstract_excerpt":"Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a sequence of evolutions generated by two-body Hamiltonians, DAQC is inherently well-suited for realizing such operations. Suboptimal upper bounds for the total time required to perform these evolutions have been previously proposed. Here, we improve these limits by providing a tight bound for this crucial parameter, which shows a linear dependence with the number "},"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":"2512.11619","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-12-12T14:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"c8ff2c9b85e2c6662594064e3e7117c03fd621d909e7ba51340d60b7b67cb6f0","abstract_canon_sha256":"25406168f164e81da6274c91577169c88f5565a32490ad64a73e90c2f75a0fb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:26.962274Z","signature_b64":"gI9LGPBAwlPT5lT8fp7XAad5NdrlLDmBieXGRNH/u+UXzCMiRBWnu9g/LO9Th1snijStQBVODPYTmL5yjJFTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820fddea797bd7f25649b3c54f9539d2aac1cc7a25d7f0aa53947bddce0a12d2","last_reissued_at":"2026-06-29T01:14:26.961838Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:26.961838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight bound for the total time in digital-analog quantum computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mikel Garcia-de-Andoin, Mikel Sanz","submitted_at":"2025-12-12T14:57:53Z","abstract_excerpt":"Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a sequence of evolutions generated by two-body Hamiltonians, DAQC is inherently well-suited for realizing such operations. Suboptimal upper bounds for the total time required to perform these evolutions have been previously proposed. Here, we improve these limits by providing a tight bound for this crucial parameter, which shows a linear dependence with the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.11619","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/2512.11619/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":"2512.11619","created_at":"2026-06-29T01:14:26.961889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.11619v2","created_at":"2026-06-29T01:14:26.961889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11619","created_at":"2026-06-29T01:14:26.961889+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIH532TZPPL7","created_at":"2026-06-29T01:14:26.961889+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIH532TZPPL7EVSJ","created_at":"2026-06-29T01:14:26.961889+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIH532TZ","created_at":"2026-06-29T01:14:26.961889+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/QIH532TZPPL7EVSJWPCU7FJZ2K","json":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K.json","graph_json":"https://pith.science/api/pith-number/QIH532TZPPL7EVSJWPCU7FJZ2K/graph.json","events_json":"https://pith.science/api/pith-number/QIH532TZPPL7EVSJWPCU7FJZ2K/events.json","paper":"https://pith.science/paper/QIH532TZ"},"agent_actions":{"view_html":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K","download_json":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K.json","view_paper":"https://pith.science/paper/QIH532TZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.11619&json=true","fetch_graph":"https://pith.science/api/pith-number/QIH532TZPPL7EVSJWPCU7FJZ2K/graph.json","fetch_events":"https://pith.science/api/pith-number/QIH532TZPPL7EVSJWPCU7FJZ2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K/action/storage_attestation","attest_author":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K/action/author_attestation","sign_citation":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K/action/citation_signature","submit_replication":"https://pith.science/pith/QIH532TZPPL7EVSJWPCU7FJZ2K/action/replication_record"}},"created_at":"2026-06-29T01:14:26.961889+00:00","updated_at":"2026-06-29T01:14:26.961889+00:00"}