{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MQYVT3EZXV4A6NYGXCWDGU34LE","short_pith_number":"pith:MQYVT3EZ","schema_version":"1.0","canonical_sha256":"643159ec99bd780f3706b8ac33537c590dc1a3742daf3d157c5fca92fefb7b01","source":{"kind":"arxiv","id":"2412.20543","version":1},"attestation_state":"computed","paper":{"title":"Automated Auxiliary Qubit Allocation in High-Level Quantum Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Eduardo I. Duzzioni, Evandro C. R. Rosa, Jerusa Marchi, Rafael de Santiago","submitted_at":"2024-12-29T18:19:06Z","abstract_excerpt":"We present a method for optimizing quantum circuit compilation by automating the allocation of auxiliary qubits for multi-qubit gate decompositions. This approach is implemented and evaluated within the high-level quantum programming platform Ket. Our results indicate that the decomposition of multi-qubit gates is more effectively handled by the compiler, which has access to all circuit parameters, rather than through a quantum programming API. To evaluate the approach, we compared our implementation against Qiskit, a widely used quantum programming platform, by analyzing two quantum algorithm"},"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":"2412.20543","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-29T18:19:06Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"90c1b4b3c7949b0060c047c8ac69b85e7511a7bf78c0d251b122dd24ef62bd48","abstract_canon_sha256":"18b75ebf5c4a75e024c4fd2a8e8a711ee233c7b618a61c8713c0ba44701a694e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:18.795566Z","signature_b64":"KFhEm5cxUPcP8r92c33WtFp1AU6VlcwJbPdebt6l5t6A4SiLBQL3MRR0K1LQ+rgUQlU3WiVY/VbquadwT2fMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"643159ec99bd780f3706b8ac33537c590dc1a3742daf3d157c5fca92fefb7b01","last_reissued_at":"2026-07-05T09:55:18.795137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:18.795137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Auxiliary Qubit Allocation in High-Level Quantum Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Eduardo I. Duzzioni, Evandro C. R. Rosa, Jerusa Marchi, Rafael de Santiago","submitted_at":"2024-12-29T18:19:06Z","abstract_excerpt":"We present a method for optimizing quantum circuit compilation by automating the allocation of auxiliary qubits for multi-qubit gate decompositions. This approach is implemented and evaluated within the high-level quantum programming platform Ket. Our results indicate that the decomposition of multi-qubit gates is more effectively handled by the compiler, which has access to all circuit parameters, rather than through a quantum programming API. To evaluate the approach, we compared our implementation against Qiskit, a widely used quantum programming platform, by analyzing two quantum algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20543","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/2412.20543/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":"2412.20543","created_at":"2026-07-05T09:55:18.795195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20543v1","created_at":"2026-07-05T09:55:18.795195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20543","created_at":"2026-07-05T09:55:18.795195+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQYVT3EZXV4A","created_at":"2026-07-05T09:55:18.795195+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQYVT3EZXV4A6NYG","created_at":"2026-07-05T09:55:18.795195+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQYVT3EZ","created_at":"2026-07-05T09:55:18.795195+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/MQYVT3EZXV4A6NYGXCWDGU34LE","json":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE.json","graph_json":"https://pith.science/api/pith-number/MQYVT3EZXV4A6NYGXCWDGU34LE/graph.json","events_json":"https://pith.science/api/pith-number/MQYVT3EZXV4A6NYGXCWDGU34LE/events.json","paper":"https://pith.science/paper/MQYVT3EZ"},"agent_actions":{"view_html":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE","download_json":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE.json","view_paper":"https://pith.science/paper/MQYVT3EZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20543&json=true","fetch_graph":"https://pith.science/api/pith-number/MQYVT3EZXV4A6NYGXCWDGU34LE/graph.json","fetch_events":"https://pith.science/api/pith-number/MQYVT3EZXV4A6NYGXCWDGU34LE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE/action/storage_attestation","attest_author":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE/action/author_attestation","sign_citation":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE/action/citation_signature","submit_replication":"https://pith.science/pith/MQYVT3EZXV4A6NYGXCWDGU34LE/action/replication_record"}},"created_at":"2026-07-05T09:55:18.795195+00:00","updated_at":"2026-07-05T09:55:18.795195+00:00"}