{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3A644IJQF6FPPLVHG2AGMC3MRX","short_pith_number":"pith:3A644IJQ","schema_version":"1.0","canonical_sha256":"d83dce21302f8af7aea73680660b6c8dcc8fe44dbcfd294b4ad3c287c2c50fe3","source":{"kind":"arxiv","id":"2012.09835","version":5},"attestation_state":"computed","paper":{"title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Costin Iancu, Frederic T. Chong, Marc Grau Davis, Xin-Chuan Wu","submitted_at":"2020-12-17T18:54:38Z","abstract_excerpt":"The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit s"},"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":"2012.09835","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T18:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"52a8fb2add1ee45dc5b33b61f742547f1d5f3830d8fa09c6649d3b1a8076d7a9","abstract_canon_sha256":"c1881bd39168adb0216f12193a9ef83d05c0d07a8b4cd6a6519eb9a23b6738c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:36.969874Z","signature_b64":"eNyRc1e3eJrMJKrslMYdXZpF/pIY7MVTQzKPzldcfEYo1kyYCgxaeWcMeowryY2917gPOkjR1IzjyE+bT1CgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d83dce21302f8af7aea73680660b6c8dcc8fe44dbcfd294b4ad3c287c2c50fe3","last_reissued_at":"2026-07-05T04:07:36.969440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:36.969440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Costin Iancu, Frederic T. Chong, Marc Grau Davis, Xin-Chuan Wu","submitted_at":"2020-12-17T18:54:38Z","abstract_excerpt":"The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09835","kind":"arxiv","version":5},"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/2012.09835/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":"2012.09835","created_at":"2026-07-05T04:07:36.969498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09835v5","created_at":"2026-07-05T04:07:36.969498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09835","created_at":"2026-07-05T04:07:36.969498+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A644IJQF6FP","created_at":"2026-07-05T04:07:36.969498+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A644IJQF6FPPLVH","created_at":"2026-07-05T04:07:36.969498+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A644IJQ","created_at":"2026-07-05T04:07:36.969498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07554","citing_title":"RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis","ref_index":62,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04070","citing_title":"Quantum circuit partition as a maze: emerging percolation transition via path finding","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28723","citing_title":"Variational Quantum Models for Knowledge Graph Embeddings on NISQ Devices","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2603.25101","citing_title":"T Count as a Numerically Solvable Minimization Problem","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2511.04608","citing_title":"Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX","json":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX.json","graph_json":"https://pith.science/api/pith-number/3A644IJQF6FPPLVHG2AGMC3MRX/graph.json","events_json":"https://pith.science/api/pith-number/3A644IJQF6FPPLVHG2AGMC3MRX/events.json","paper":"https://pith.science/paper/3A644IJQ"},"agent_actions":{"view_html":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX","download_json":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX.json","view_paper":"https://pith.science/paper/3A644IJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09835&json=true","fetch_graph":"https://pith.science/api/pith-number/3A644IJQF6FPPLVHG2AGMC3MRX/graph.json","fetch_events":"https://pith.science/api/pith-number/3A644IJQF6FPPLVHG2AGMC3MRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX/action/storage_attestation","attest_author":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX/action/author_attestation","sign_citation":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX/action/citation_signature","submit_replication":"https://pith.science/pith/3A644IJQF6FPPLVHG2AGMC3MRX/action/replication_record"}},"created_at":"2026-07-05T04:07:36.969498+00:00","updated_at":"2026-07-05T04:07:36.969498+00:00"}