{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:7JW3VF2HMYPKYGRGO5TCXCBQIX","short_pith_number":"pith:7JW3VF2H","schema_version":"1.0","canonical_sha256":"fa6dba9747661eac1a2677662b883045c77ffcf7ddb06e4bd32c517f13340d3b","source":{"kind":"arxiv","id":"quant-ph/9508006","version":1},"attestation_state":"computed","paper":{"title":"Approximation by Quantum Circuits","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"1995-08-08T23:23:12Z","abstract_excerpt":"In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower bounds on the approximation capabilities of g-qubit unitary operations for fixed g. We consider approximation of unitary operations on subspaces as well as approximation of states and of density matrices by quantum circuits in several natural metrics. The ability of quantum circuits to probabilistically solve decision problem and guess checkable functions is di"},"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":"quant-ph/9508006","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-08-08T23:23:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"33e4cd12131b57eb29eeca03ea9153c765171d8148b4f69b1b542089819e73bb","abstract_canon_sha256":"71f9428a32e16fc20ea18ebb2f02d49db87899bf1a762e4d27e42f226a55e731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:09:12.061178Z","signature_b64":"jLb9BHlbzdqauAv+5tofTgBMCc+wKx5hPZ38HqZyn8Dz5AQMR9TuPZks2WuSK+NRjn41aQ6Ubls0IyLOGckcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa6dba9747661eac1a2677662b883045c77ffcf7ddb06e4bd32c517f13340d3b","last_reissued_at":"2026-07-04T15:09:12.060720Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:09:12.060720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation by Quantum Circuits","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"1995-08-08T23:23:12Z","abstract_excerpt":"In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower bounds on the approximation capabilities of g-qubit unitary operations for fixed g. We consider approximation of unitary operations on subspaces as well as approximation of states and of density matrices by quantum circuits in several natural metrics. The ability of quantum circuits to probabilistically solve decision problem and guess checkable functions is di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9508006","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/quant-ph/9508006/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":"quant-ph/9508006","created_at":"2026-07-04T15:09:12.060795+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9508006v1","created_at":"2026-07-04T15:09:12.060795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9508006","created_at":"2026-07-04T15:09:12.060795+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JW3VF2HMYPK","created_at":"2026-07-04T15:09:12.060795+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JW3VF2HMYPKYGRG","created_at":"2026-07-04T15:09:12.060795+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JW3VF2H","created_at":"2026-07-04T15:09:12.060795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2607.08200","citing_title":"Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26218","citing_title":"Practical Tests and Witnesses of Fermionic non-Gaussianity","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2605.27191","citing_title":"Statistical and Algorithmic Foundations of Probing Quantum Systems with Compressive Measurements: A Review","ref_index":81,"is_internal_anchor":true},{"citing_arxiv_id":"2301.09241","citing_title":"Quantum Monte Carlo algorithm for option pricing and its complexity analysis","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2509.05468","citing_title":"Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24973","citing_title":"Approximate Sparse State Preparation with the Grover-Rudolph Algorithm","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07374","citing_title":"Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03023","citing_title":"Arts & crafts: Strong random unitaries and geometric locality","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX","json":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX.json","graph_json":"https://pith.science/api/pith-number/7JW3VF2HMYPKYGRGO5TCXCBQIX/graph.json","events_json":"https://pith.science/api/pith-number/7JW3VF2HMYPKYGRGO5TCXCBQIX/events.json","paper":"https://pith.science/paper/7JW3VF2H"},"agent_actions":{"view_html":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX","download_json":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX.json","view_paper":"https://pith.science/paper/7JW3VF2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9508006&json=true","fetch_graph":"https://pith.science/api/pith-number/7JW3VF2HMYPKYGRGO5TCXCBQIX/graph.json","fetch_events":"https://pith.science/api/pith-number/7JW3VF2HMYPKYGRGO5TCXCBQIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX/action/storage_attestation","attest_author":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX/action/author_attestation","sign_citation":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX/action/citation_signature","submit_replication":"https://pith.science/pith/7JW3VF2HMYPKYGRGO5TCXCBQIX/action/replication_record"}},"created_at":"2026-07-04T15:09:12.060795+00:00","updated_at":"2026-07-04T15:09:12.060795+00:00"}