{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VIPIFFCBU5ZIFGXMLCFTEKJ7PW","short_pith_number":"pith:VIPIFFCB","schema_version":"1.0","canonical_sha256":"aa1e829441a772829aec588b32293f7d8a35718051493c497eb2bd6e6b4fd2cf","source":{"kind":"arxiv","id":"2111.01410","version":1},"attestation_state":"computed","paper":{"title":"Nonadiabatic geometric quantum computation with shortened path on superconducting circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"Cheng-Yun Ding, Kai-Zhi Yu, Yan Liang, Zheng-Yuan Xue","submitted_at":"2021-11-02T08:03:38Z","abstract_excerpt":"Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually requires longer gate-time and more operational steps, and thus leads to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gat"},"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":"2111.01410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-02T08:03:38Z","cross_cats_sorted":["cond-mat.supr-con"],"title_canon_sha256":"55ec71c7549d9377a71f144dcc0d63c0af3e502fd9c3edc91d00e5b0d08f4c3f","abstract_canon_sha256":"6d63ab74ee83e35081b5504622e035c13a250e8776af87a27ac4a9558af8922f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:02.732968Z","signature_b64":"YP6j84ZmbgoFx580lSVfqaTW86hjjTiU5d1ZMdr+U/zurZGePOmiZHQgDkEjHahkog2Za3U4jGpe7yfEt1riBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa1e829441a772829aec588b32293f7d8a35718051493c497eb2bd6e6b4fd2cf","last_reissued_at":"2026-07-05T03:28:02.732306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:02.732306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonadiabatic geometric quantum computation with shortened path on superconducting circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"Cheng-Yun Ding, Kai-Zhi Yu, Yan Liang, Zheng-Yuan Xue","submitted_at":"2021-11-02T08:03:38Z","abstract_excerpt":"Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually requires longer gate-time and more operational steps, and thus leads to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.01410","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/2111.01410/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":"2111.01410","created_at":"2026-07-05T03:28:02.732476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.01410v1","created_at":"2026-07-05T03:28:02.732476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.01410","created_at":"2026-07-05T03:28:02.732476+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIPIFFCBU5ZI","created_at":"2026-07-05T03:28:02.732476+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIPIFFCBU5ZIFGXM","created_at":"2026-07-05T03:28:02.732476+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIPIFFCB","created_at":"2026-07-05T03:28:02.732476+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/VIPIFFCBU5ZIFGXMLCFTEKJ7PW","json":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW.json","graph_json":"https://pith.science/api/pith-number/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/graph.json","events_json":"https://pith.science/api/pith-number/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/events.json","paper":"https://pith.science/paper/VIPIFFCB"},"agent_actions":{"view_html":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW","download_json":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW.json","view_paper":"https://pith.science/paper/VIPIFFCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.01410&json=true","fetch_graph":"https://pith.science/api/pith-number/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/graph.json","fetch_events":"https://pith.science/api/pith-number/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/action/storage_attestation","attest_author":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/action/author_attestation","sign_citation":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/action/citation_signature","submit_replication":"https://pith.science/pith/VIPIFFCBU5ZIFGXMLCFTEKJ7PW/action/replication_record"}},"created_at":"2026-07-05T03:28:02.732476+00:00","updated_at":"2026-07-05T03:28:02.732476+00:00"}