{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JAFYWRYQNGG4BLROQJ7VDHUNJN","short_pith_number":"pith:JAFYWRYQ","schema_version":"1.0","canonical_sha256":"480b8b4710698dc0ae2e827f519e8d4b4203a9b375a8a065b4f2d136bade87fc","source":{"kind":"arxiv","id":"2307.15767","version":2},"attestation_state":"computed","paper":{"title":"Two-Qubit Gate Set Tomography with Fewer Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Corey I. Ostrove, Erik Nielsen, Kenneth M. Rudinger, Kevin C. Young, Matthew D. Grace, Robin J. Blume-Kohout, Stefan K. Seritan","submitted_at":"2023-07-28T18:52:34Z","abstract_excerpt":"Gate set tomography (GST) is a self-consistent and highly accurate method for the tomographic reconstruction of a quantum information processor's quantum logic operations, including gates, state preparations, and measurements. However, GST's experimental cost grows exponentially with qubit number. For characterizing even just two qubits, a standard GST experiment may have tens of thousands of circuits, making it prohibitively expensive for platforms. We show that, because GST experiments are massively overcomplete, many circuits can be discarded. This dramatically reduces GST's experimental co"},"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":"2307.15767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-28T18:52:34Z","cross_cats_sorted":[],"title_canon_sha256":"c69629f6a1ca9c8d380e274890e84d510a1dd7ad334c57f97b2d32692137a9ce","abstract_canon_sha256":"b0c1f8cb939661121269d1d3475c9e34328da442472f7d9fdd19b8f30ee7c377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:08.963288Z","signature_b64":"r++g2pHmc4zqeEZAZ2/zxZEojrW7cCRYjyTmre5HjmcdizRfjF6cL/Z77qUBsoZQAHGZMSChPEazgmc83+W+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480b8b4710698dc0ae2e827f519e8d4b4203a9b375a8a065b4f2d136bade87fc","last_reissued_at":"2026-07-05T06:53:08.962833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:08.962833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Qubit Gate Set Tomography with Fewer Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Corey I. Ostrove, Erik Nielsen, Kenneth M. Rudinger, Kevin C. Young, Matthew D. Grace, Robin J. Blume-Kohout, Stefan K. Seritan","submitted_at":"2023-07-28T18:52:34Z","abstract_excerpt":"Gate set tomography (GST) is a self-consistent and highly accurate method for the tomographic reconstruction of a quantum information processor's quantum logic operations, including gates, state preparations, and measurements. However, GST's experimental cost grows exponentially with qubit number. For characterizing even just two qubits, a standard GST experiment may have tens of thousands of circuits, making it prohibitively expensive for platforms. We show that, because GST experiments are massively overcomplete, many circuits can be discarded. This dramatically reduces GST's experimental co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15767","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/2307.15767/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":"2307.15767","created_at":"2026-07-05T06:53:08.962888+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.15767v2","created_at":"2026-07-05T06:53:08.962888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15767","created_at":"2026-07-05T06:53:08.962888+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAFYWRYQNGG4","created_at":"2026-07-05T06:53:08.962888+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAFYWRYQNGG4BLRO","created_at":"2026-07-05T06:53:08.962888+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAFYWRYQ","created_at":"2026-07-05T06:53:08.962888+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2308.08781","citing_title":"Near-Minimal Gate Set Tomography Experiment Designs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11158","citing_title":"Scalable linearized gate set tomography","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN","json":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN.json","graph_json":"https://pith.science/api/pith-number/JAFYWRYQNGG4BLROQJ7VDHUNJN/graph.json","events_json":"https://pith.science/api/pith-number/JAFYWRYQNGG4BLROQJ7VDHUNJN/events.json","paper":"https://pith.science/paper/JAFYWRYQ"},"agent_actions":{"view_html":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN","download_json":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN.json","view_paper":"https://pith.science/paper/JAFYWRYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.15767&json=true","fetch_graph":"https://pith.science/api/pith-number/JAFYWRYQNGG4BLROQJ7VDHUNJN/graph.json","fetch_events":"https://pith.science/api/pith-number/JAFYWRYQNGG4BLROQJ7VDHUNJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN/action/storage_attestation","attest_author":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN/action/author_attestation","sign_citation":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN/action/citation_signature","submit_replication":"https://pith.science/pith/JAFYWRYQNGG4BLROQJ7VDHUNJN/action/replication_record"}},"created_at":"2026-07-05T06:53:08.962888+00:00","updated_at":"2026-07-05T06:53:08.962888+00:00"}