{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X7F65DLQ3FTWRMAJ4SQLRH7LI4","short_pith_number":"pith:X7F65DLQ","schema_version":"1.0","canonical_sha256":"bfcbee8d70d96768b009e4a0b89feb47008dc6703abbd76da19b32887127769f","source":{"kind":"arxiv","id":"2304.11159","version":1},"attestation_state":"computed","paper":{"title":"Exploring Ququart Computation on a Transmon using Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David I. Schuster, Frederic T. Chong, Jonathan M. Baker, Lennart Maximilian Seifert, Tanay Roy, Ziqian Li","submitted_at":"2023-04-21T17:58:48Z","abstract_excerpt":"Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting ququart (d = 4) processor and combine quantum optimal control with efficient gate decompositions to implement high-fidelity ququart gates. We distinguish between viewing the ququart as a generalized four-level qubit and an encoded pair of qubits, and characterize the resulting gates in each case. In randomized benchmarking experiments we observe gate fidelities g"},"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":"2304.11159","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-04-21T17:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"6aab34de1d4f8f2b4a720baf4b8da7500915ee66b4b1b4a1d5d1b0da04899e47","abstract_canon_sha256":"7da98057bde0d4504a728f6dddc35eea048740251d792d740e4ddb84506a16e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:18.047301Z","signature_b64":"kqWYI/DhQSEPuPYWnSSX+/NSYBdYNe7BohDpDqmxw4btlcCC85FPxERAcj7saUwS7mpKrwoIe7RaEm4S3q6YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfcbee8d70d96768b009e4a0b89feb47008dc6703abbd76da19b32887127769f","last_reissued_at":"2026-07-05T07:32:18.046888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:18.046888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Ququart Computation on a Transmon using Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David I. Schuster, Frederic T. Chong, Jonathan M. Baker, Lennart Maximilian Seifert, Tanay Roy, Ziqian Li","submitted_at":"2023-04-21T17:58:48Z","abstract_excerpt":"Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting ququart (d = 4) processor and combine quantum optimal control with efficient gate decompositions to implement high-fidelity ququart gates. We distinguish between viewing the ququart as a generalized four-level qubit and an encoded pair of qubits, and characterize the resulting gates in each case. In randomized benchmarking experiments we observe gate fidelities g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11159","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/2304.11159/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":"2304.11159","created_at":"2026-07-05T07:32:18.046946+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11159v1","created_at":"2026-07-05T07:32:18.046946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11159","created_at":"2026-07-05T07:32:18.046946+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7F65DLQ3FTW","created_at":"2026-07-05T07:32:18.046946+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7F65DLQ3FTWRMAJ","created_at":"2026-07-05T07:32:18.046946+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7F65DLQ","created_at":"2026-07-05T07:32:18.046946+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10945","citing_title":"Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4","json":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4.json","graph_json":"https://pith.science/api/pith-number/X7F65DLQ3FTWRMAJ4SQLRH7LI4/graph.json","events_json":"https://pith.science/api/pith-number/X7F65DLQ3FTWRMAJ4SQLRH7LI4/events.json","paper":"https://pith.science/paper/X7F65DLQ"},"agent_actions":{"view_html":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4","download_json":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4.json","view_paper":"https://pith.science/paper/X7F65DLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11159&json=true","fetch_graph":"https://pith.science/api/pith-number/X7F65DLQ3FTWRMAJ4SQLRH7LI4/graph.json","fetch_events":"https://pith.science/api/pith-number/X7F65DLQ3FTWRMAJ4SQLRH7LI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4/action/storage_attestation","attest_author":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4/action/author_attestation","sign_citation":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4/action/citation_signature","submit_replication":"https://pith.science/pith/X7F65DLQ3FTWRMAJ4SQLRH7LI4/action/replication_record"}},"created_at":"2026-07-05T07:32:18.046946+00:00","updated_at":"2026-07-05T07:32:18.046946+00:00"}