{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VUTGNYKRIG4B245Y6DV2UFPXLW","short_pith_number":"pith:VUTGNYKR","schema_version":"1.0","canonical_sha256":"ad2666e15141b81d73b8f0ebaa15f75d9049b42c48086c3cd81a4a81c2f27841","source":{"kind":"arxiv","id":"2103.07093","version":1},"attestation_state":"computed","paper":{"title":"QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis","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":"2021-03-12T05:20:12Z","abstract_excerpt":"We present a quantum synthesis algorithm designed to produce short circuits and to scale well in practice. The main contribution is a novel representation of circuits able to encode placement and topology using generic \"gates\", which allows the QFAST algorithm to replace expensive searches over circuit structures with few steps of numerical optimization. When compared against optimal depth, search based state-of-the-art techniques, QFAST produces comparable results: 1.19x longer circuits up to four qubits, with an increase in compilation speed of 3.6x. In addition, QFAST scales up to seven qub"},"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":"2103.07093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-12T05:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"5d930ce5b4d9a0a81d8549ca55f9d06bde06c73cf9806325ac141439bc68b5e1","abstract_canon_sha256":"21e033ea9b2f43d5aec904399f92ce1dc1b9ad07e6537374465705912848ac21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:28.540135Z","signature_b64":"z9VZn3dOaZsOAMJYxEjHT9J1MrJlNI5RSASsbW/uaGLuT+MWw4Gf+komaf/mVHoIsSfHo1UrNX+jplCAhgvOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad2666e15141b81d73b8f0ebaa15f75d9049b42c48086c3cd81a4a81c2f27841","last_reissued_at":"2026-07-05T02:22:28.539284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:28.539284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis","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":"2021-03-12T05:20:12Z","abstract_excerpt":"We present a quantum synthesis algorithm designed to produce short circuits and to scale well in practice. The main contribution is a novel representation of circuits able to encode placement and topology using generic \"gates\", which allows the QFAST algorithm to replace expensive searches over circuit structures with few steps of numerical optimization. When compared against optimal depth, search based state-of-the-art techniques, QFAST produces comparable results: 1.19x longer circuits up to four qubits, with an increase in compilation speed of 3.6x. In addition, QFAST scales up to seven qub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.07093","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/2103.07093/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":"2103.07093","created_at":"2026-07-05T02:22:28.539596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.07093v1","created_at":"2026-07-05T02:22:28.539596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.07093","created_at":"2026-07-05T02:22:28.539596+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUTGNYKRIG4B","created_at":"2026-07-05T02:22:28.539596+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUTGNYKRIG4B245Y","created_at":"2026-07-05T02:22:28.539596+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUTGNYKR","created_at":"2026-07-05T02:22:28.539596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":177,"is_internal_anchor":false},{"citing_arxiv_id":"2202.05792","citing_title":"Co-Design quantum simulation of nanoscale NMR","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2504.21172","citing_title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW","json":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW.json","graph_json":"https://pith.science/api/pith-number/VUTGNYKRIG4B245Y6DV2UFPXLW/graph.json","events_json":"https://pith.science/api/pith-number/VUTGNYKRIG4B245Y6DV2UFPXLW/events.json","paper":"https://pith.science/paper/VUTGNYKR"},"agent_actions":{"view_html":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW","download_json":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW.json","view_paper":"https://pith.science/paper/VUTGNYKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.07093&json=true","fetch_graph":"https://pith.science/api/pith-number/VUTGNYKRIG4B245Y6DV2UFPXLW/graph.json","fetch_events":"https://pith.science/api/pith-number/VUTGNYKRIG4B245Y6DV2UFPXLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW/action/storage_attestation","attest_author":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW/action/author_attestation","sign_citation":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW/action/citation_signature","submit_replication":"https://pith.science/pith/VUTGNYKRIG4B245Y6DV2UFPXLW/action/replication_record"}},"created_at":"2026-07-05T02:22:28.539596+00:00","updated_at":"2026-07-05T02:22:28.539596+00:00"}