{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZQH7EJDUK6OXBNTAZYSUGTGBSE","short_pith_number":"pith:ZQH7EJDU","schema_version":"1.0","canonical_sha256":"cc0ff22474579d70b660ce25434cc1912a3ff82724471900ee0ec192e851f9b1","source":{"kind":"arxiv","id":"2003.04462","version":2},"attestation_state":"computed","paper":{"title":"QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Costin Iancu, Ed Younis, Katherine Yelick, Koushik Sen","submitted_at":"2020-03-09T23:55:43Z","abstract_excerpt":"We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines \"coarse-grained\" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for \"time dependent evolution\" algori"},"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":"2003.04462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-09T23:55:43Z","cross_cats_sorted":[],"title_canon_sha256":"da944bff8b850d49fe8321c0fc2e0b5f94fc85cf1124c774ad870d7d799ef56e","abstract_canon_sha256":"0c09ff54ea9e42d193be276c6583aeea478f093349baa9b5bdac909873fdb2da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:45.489560Z","signature_b64":"AMAzO6TGcSPm01VcKdEatVgWv1P+xgSO460d4b383qb5oip1w24UOKIA/eYdVd/xql4J3FYBxADei0pQtgk+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0ff22474579d70b660ce25434cc1912a3ff82724471900ee0ec192e851f9b1","last_reissued_at":"2026-07-05T00:50:45.489108Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:45.489108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Costin Iancu, Ed Younis, Katherine Yelick, Koushik Sen","submitted_at":"2020-03-09T23:55:43Z","abstract_excerpt":"We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines \"coarse-grained\" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for \"time dependent evolution\" algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04462","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/2003.04462/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":"2003.04462","created_at":"2026-07-05T00:50:45.489175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.04462v2","created_at":"2026-07-05T00:50:45.489175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04462","created_at":"2026-07-05T00:50:45.489175+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQH7EJDUK6OX","created_at":"2026-07-05T00:50:45.489175+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQH7EJDUK6OXBNTA","created_at":"2026-07-05T00:50:45.489175+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQH7EJDU","created_at":"2026-07-05T00:50:45.489175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.00543","citing_title":"GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE","json":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE.json","graph_json":"https://pith.science/api/pith-number/ZQH7EJDUK6OXBNTAZYSUGTGBSE/graph.json","events_json":"https://pith.science/api/pith-number/ZQH7EJDUK6OXBNTAZYSUGTGBSE/events.json","paper":"https://pith.science/paper/ZQH7EJDU"},"agent_actions":{"view_html":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE","download_json":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE.json","view_paper":"https://pith.science/paper/ZQH7EJDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.04462&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQH7EJDUK6OXBNTAZYSUGTGBSE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQH7EJDUK6OXBNTAZYSUGTGBSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE/action/storage_attestation","attest_author":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE/action/author_attestation","sign_citation":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE/action/citation_signature","submit_replication":"https://pith.science/pith/ZQH7EJDUK6OXBNTAZYSUGTGBSE/action/replication_record"}},"created_at":"2026-07-05T00:50:45.489175+00:00","updated_at":"2026-07-05T00:50:45.489175+00:00"}