{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TYOOXLD7IFUZVBSBWIVNFZJP27","short_pith_number":"pith:TYOOXLD7","schema_version":"1.0","canonical_sha256":"9e1cebac7f41699a8641b22ad2e52fd7db498ad9e5d94bce8903edcde5ae1391","source":{"kind":"arxiv","id":"2108.03171","version":3},"attestation_state":"computed","paper":{"title":"Quantum Meets the Minimum Circuit Size Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Chi-Ning Chou, Jiayu Zhang, Nai-Hui Chia, Ruizhe Zhang","submitted_at":"2021-08-06T15:34:49Z","abstract_excerpt":"In this work, we initiate the study of the Minimum Circuit Size Problem (MCSP) in the quantum setting. MCSP is a problem to compute the circuit complexity of Boolean functions. It is a fascinating problem in complexity theory -- its hardness is mysterious, and a better understanding of its hardness can have surprising implications to many fields in computer science.\n  We first define and investigate the basic complexity-theoretic properties of minimum quantum circuit size problems for three natural objects: Boolean functions, unitaries, and quantum states. We show that these problems are not t"},"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":"2108.03171","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-08-06T15:34:49Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"ff93979a87c8bce5687804f3b83a28a4859d1acb0ff4ff9f2708723a6ad8160d","abstract_canon_sha256":"c0aeef58e1404d824cf953f7b58f8358382916015ff7840ecaed745f2f75fd46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:25.156911Z","signature_b64":"/ALn1JcndkaxhW67hRLPcGf634FM/yUlEGviLgAj6gs/l89jIbSAqo4cxA9ZaF1zJVU+IlKFBDfLqEK4mDRQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e1cebac7f41699a8641b22ad2e52fd7db498ad9e5d94bce8903edcde5ae1391","last_reissued_at":"2026-07-05T03:14:25.156489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:25.156489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Meets the Minimum Circuit Size Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Chi-Ning Chou, Jiayu Zhang, Nai-Hui Chia, Ruizhe Zhang","submitted_at":"2021-08-06T15:34:49Z","abstract_excerpt":"In this work, we initiate the study of the Minimum Circuit Size Problem (MCSP) in the quantum setting. MCSP is a problem to compute the circuit complexity of Boolean functions. It is a fascinating problem in complexity theory -- its hardness is mysterious, and a better understanding of its hardness can have surprising implications to many fields in computer science.\n  We first define and investigate the basic complexity-theoretic properties of minimum quantum circuit size problems for three natural objects: Boolean functions, unitaries, and quantum states. We show that these problems are not t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03171","kind":"arxiv","version":3},"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/2108.03171/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":"2108.03171","created_at":"2026-07-05T03:14:25.156546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.03171v3","created_at":"2026-07-05T03:14:25.156546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03171","created_at":"2026-07-05T03:14:25.156546+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYOOXLD7IFUZ","created_at":"2026-07-05T03:14:25.156546+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYOOXLD7IFUZVBSB","created_at":"2026-07-05T03:14:25.156546+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYOOXLD7","created_at":"2026-07-05T03:14:25.156546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27886","citing_title":"The power of unentanglement without destructive interference","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27","json":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27.json","graph_json":"https://pith.science/api/pith-number/TYOOXLD7IFUZVBSBWIVNFZJP27/graph.json","events_json":"https://pith.science/api/pith-number/TYOOXLD7IFUZVBSBWIVNFZJP27/events.json","paper":"https://pith.science/paper/TYOOXLD7"},"agent_actions":{"view_html":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27","download_json":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27.json","view_paper":"https://pith.science/paper/TYOOXLD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.03171&json=true","fetch_graph":"https://pith.science/api/pith-number/TYOOXLD7IFUZVBSBWIVNFZJP27/graph.json","fetch_events":"https://pith.science/api/pith-number/TYOOXLD7IFUZVBSBWIVNFZJP27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27/action/storage_attestation","attest_author":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27/action/author_attestation","sign_citation":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27/action/citation_signature","submit_replication":"https://pith.science/pith/TYOOXLD7IFUZVBSBWIVNFZJP27/action/replication_record"}},"created_at":"2026-07-05T03:14:25.156546+00:00","updated_at":"2026-07-05T03:14:25.156546+00:00"}