{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5M4SBIX4NNLP62MBPH23Y3NPEY","short_pith_number":"pith:5M4SBIX4","schema_version":"1.0","canonical_sha256":"eb3920a2fc6b56ff698179f5bc6daf260ba2db7abc2fffc1f8d504d0c4d2c24d","source":{"kind":"arxiv","id":"2401.08950","version":1},"attestation_state":"computed","paper":{"title":"Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Priyanka Mukhopadhyay","submitted_at":"2024-01-17T03:53:37Z","abstract_excerpt":"In this paper we study the Clifford+Toffoli universal fault-tolerant gate set. We introduce a generating set in order to represent any unitary implementable by this gate set and with this we derive a bound on the Toffoli-count of arbitrary multi-qubit unitaries. We analyse the channel representation of the generating set elements, with the help of which we infer $|\\mathcal{J}_n^{Tof}|<|\\mathcal{J}_n^T|$, where $\\mathcal{J}_n^{Tof}$ and $\\mathcal{J}_n^T$ are the set of unitaries exactly implementable by the Clifford+Toffoli and Clifford+T gate set, respectively. We develop Toffoli-count optimal"},"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":"2401.08950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-17T03:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"667cc561cfb82b6af374a9ab6077a946fa0d3ad727d47b7e487532355220195f","abstract_canon_sha256":"b594bc7468aa6055829ead82a918fd8db2de631ae7a0e593a3df3d4439ea1416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:24.135147Z","signature_b64":"9bRthxhrVHfN9Wy5oAfZpsN5aOTzoF49OQ4jI2wn8JFt0uZPazOUR2+57l6ZR8rJuOfjsJDt3cXADvYHWdP4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb3920a2fc6b56ff698179f5bc6daf260ba2db7abc2fffc1f8d504d0c4d2c24d","last_reissued_at":"2026-07-05T07:34:24.134553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:24.134553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Priyanka Mukhopadhyay","submitted_at":"2024-01-17T03:53:37Z","abstract_excerpt":"In this paper we study the Clifford+Toffoli universal fault-tolerant gate set. We introduce a generating set in order to represent any unitary implementable by this gate set and with this we derive a bound on the Toffoli-count of arbitrary multi-qubit unitaries. We analyse the channel representation of the generating set elements, with the help of which we infer $|\\mathcal{J}_n^{Tof}|<|\\mathcal{J}_n^T|$, where $\\mathcal{J}_n^{Tof}$ and $\\mathcal{J}_n^T$ are the set of unitaries exactly implementable by the Clifford+Toffoli and Clifford+T gate set, respectively. We develop Toffoli-count optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08950","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/2401.08950/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":"2401.08950","created_at":"2026-07-05T07:34:24.134637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.08950v1","created_at":"2026-07-05T07:34:24.134637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08950","created_at":"2026-07-05T07:34:24.134637+00:00"},{"alias_kind":"pith_short_12","alias_value":"5M4SBIX4NNLP","created_at":"2026-07-05T07:34:24.134637+00:00"},{"alias_kind":"pith_short_16","alias_value":"5M4SBIX4NNLP62MB","created_at":"2026-07-05T07:34:24.134637+00:00"},{"alias_kind":"pith_short_8","alias_value":"5M4SBIX4","created_at":"2026-07-05T07:34:24.134637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04038","citing_title":"Graphical and algebraic methods for Boolean factoring","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY","json":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY.json","graph_json":"https://pith.science/api/pith-number/5M4SBIX4NNLP62MBPH23Y3NPEY/graph.json","events_json":"https://pith.science/api/pith-number/5M4SBIX4NNLP62MBPH23Y3NPEY/events.json","paper":"https://pith.science/paper/5M4SBIX4"},"agent_actions":{"view_html":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY","download_json":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY.json","view_paper":"https://pith.science/paper/5M4SBIX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.08950&json=true","fetch_graph":"https://pith.science/api/pith-number/5M4SBIX4NNLP62MBPH23Y3NPEY/graph.json","fetch_events":"https://pith.science/api/pith-number/5M4SBIX4NNLP62MBPH23Y3NPEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY/action/storage_attestation","attest_author":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY/action/author_attestation","sign_citation":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY/action/citation_signature","submit_replication":"https://pith.science/pith/5M4SBIX4NNLP62MBPH23Y3NPEY/action/replication_record"}},"created_at":"2026-07-05T07:34:24.134637+00:00","updated_at":"2026-07-05T07:34:24.134637+00:00"}