{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LOQ2DKC5VZQG4U653RDNVW6FBQ","short_pith_number":"pith:LOQ2DKC5","schema_version":"1.0","canonical_sha256":"5ba1a1a85dae606e53dddc46dadbc50c1c6386ce2d0e169c52daa80c343c758d","source":{"kind":"arxiv","id":"quant-ph/0603163","version":1},"attestation_state":"computed","paper":{"title":"On the simulation of quantum circuits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard Jozsa","submitted_at":"2006-03-19T12:18:14Z","abstract_excerpt":"We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the num"},"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/0603163","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-03-19T12:18:14Z","cross_cats_sorted":[],"title_canon_sha256":"59c752afd0637114078c443fd49ea7e42522b819976a8edb45dc38c1962582e6","abstract_canon_sha256":"04ddeaafe042d2b44e4c439045903090cfb3fdf487d95f17460ef83d9531ed45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:54:06.648580Z","signature_b64":"zVjL4g9ndw8913YbBUaGJwfZ7ZGW81w2RXEwZLARLf5FguGnmzOYBUNW/Qyal16Zj80D1pL1K+h75N/U0OC7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba1a1a85dae606e53dddc46dadbc50c1c6386ce2d0e169c52daa80c343c758d","last_reissued_at":"2026-07-04T14:54:06.648181Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:54:06.648181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the simulation of quantum circuits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard Jozsa","submitted_at":"2006-03-19T12:18:14Z","abstract_excerpt":"We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0603163","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/0603163/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/0603163","created_at":"2026-07-04T14:54:06.648244+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0603163v1","created_at":"2026-07-04T14:54:06.648244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0603163","created_at":"2026-07-04T14:54:06.648244+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOQ2DKC5VZQG","created_at":"2026-07-04T14:54:06.648244+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOQ2DKC5VZQG4U65","created_at":"2026-07-04T14:54:06.648244+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOQ2DKC5","created_at":"2026-07-04T14:54:06.648244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2307.01800","citing_title":"Classically efficient regimes in measurement based quantum computation performed using diagonal two qubit gates and cluster measurements","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":65,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27248","citing_title":"Cylindrical Matter: A beyond-quantum many-body system for efficient classical simulation of quantum pure-Ising like systems","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14287","citing_title":"Quantum-inspired tensor networks in machine learning models","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ","json":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ.json","graph_json":"https://pith.science/api/pith-number/LOQ2DKC5VZQG4U653RDNVW6FBQ/graph.json","events_json":"https://pith.science/api/pith-number/LOQ2DKC5VZQG4U653RDNVW6FBQ/events.json","paper":"https://pith.science/paper/LOQ2DKC5"},"agent_actions":{"view_html":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ","download_json":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ.json","view_paper":"https://pith.science/paper/LOQ2DKC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0603163&json=true","fetch_graph":"https://pith.science/api/pith-number/LOQ2DKC5VZQG4U653RDNVW6FBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LOQ2DKC5VZQG4U653RDNVW6FBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ/action/storage_attestation","attest_author":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ/action/author_attestation","sign_citation":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ/action/citation_signature","submit_replication":"https://pith.science/pith/LOQ2DKC5VZQG4U653RDNVW6FBQ/action/replication_record"}},"created_at":"2026-07-04T14:54:06.648244+00:00","updated_at":"2026-07-04T14:54:06.648244+00:00"}