{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TXES7KDIZGV6E3CCC7RGED46XT","short_pith_number":"pith:TXES7KDI","schema_version":"1.0","canonical_sha256":"9dc92fa868c9abe26c4217e2620f9ebcf3927dc260daad0b3e1245b9d2221247","source":{"kind":"arxiv","id":"1907.09415","version":5},"attestation_state":"computed","paper":{"title":"Quantum Computing: Lecture Notes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"CWI, Ronald de Wolf (QuSoft, University of Amsterdam)","submitted_at":"2019-07-19T08:56:18Z","abstract_excerpt":"This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 4 chapters about complexity, 4 chapters about distributed (\"Alice and Bob\") settings, a chapter about quantum machine learning, and a fina"},"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":"1907.09415","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-19T08:56:18Z","cross_cats_sorted":["cs.CC","cs.DS","cs.ET"],"title_canon_sha256":"3a2bc885cac7acfda1e1f7f3fa91cdfe382ec9c239c3e716454fd9c09a131b76","abstract_canon_sha256":"df10808fd4c1a79fdf0485fe651458f070774b60391267ed4f4b6970d21b8cf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:02.648945Z","signature_b64":"M3qrTtU4cFNP4i07gnCIfV16oIRZDUc74OkjjSOUgBzpDsyDzK+/S/RhzxHaqkVv/4kNNlglLRPV6xNZvRtYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dc92fa868c9abe26c4217e2620f9ebcf3927dc260daad0b3e1245b9d2221247","last_reissued_at":"2026-07-05T05:33:02.648541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:02.648541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computing: Lecture Notes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"CWI, Ronald de Wolf (QuSoft, University of Amsterdam)","submitted_at":"2019-07-19T08:56:18Z","abstract_excerpt":"This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 4 chapters about complexity, 4 chapters about distributed (\"Alice and Bob\") settings, a chapter about quantum machine learning, and a fina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09415","kind":"arxiv","version":5},"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/1907.09415/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":"1907.09415","created_at":"2026-07-05T05:33:02.648598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09415v5","created_at":"2026-07-05T05:33:02.648598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09415","created_at":"2026-07-05T05:33:02.648598+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXES7KDIZGV6","created_at":"2026-07-05T05:33:02.648598+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXES7KDIZGV6E3CC","created_at":"2026-07-05T05:33:02.648598+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXES7KDI","created_at":"2026-07-05T05:33:02.648598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25124","citing_title":"Self-testing Quantum Supermaps","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05517","citing_title":"A universal and efficient hybrid digital-analog fermionic quantum simulator","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05517","citing_title":"A universal and efficient hybrid digital-analog fermionic quantum simulator","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":202,"is_internal_anchor":false},{"citing_arxiv_id":"2505.16457","citing_title":"Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09872","citing_title":"Multi-Prover Interactive Proof Systems with Leakage","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2511.12777","citing_title":"Sdim: A Qudit Stabilizer Simulator","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27886","citing_title":"The power of unentanglement without destructive interference","ref_index":100,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09872","citing_title":"Multi-Prover Interactive Proof Systems with Leakage","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05628","citing_title":"Estimation of trace distance between two arbitrary quantum states","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18936","citing_title":"Fine-Tuning Small Reasoning Models for Quantum Field Theory","ref_index":127,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT","json":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT.json","graph_json":"https://pith.science/api/pith-number/TXES7KDIZGV6E3CCC7RGED46XT/graph.json","events_json":"https://pith.science/api/pith-number/TXES7KDIZGV6E3CCC7RGED46XT/events.json","paper":"https://pith.science/paper/TXES7KDI"},"agent_actions":{"view_html":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT","download_json":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT.json","view_paper":"https://pith.science/paper/TXES7KDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09415&json=true","fetch_graph":"https://pith.science/api/pith-number/TXES7KDIZGV6E3CCC7RGED46XT/graph.json","fetch_events":"https://pith.science/api/pith-number/TXES7KDIZGV6E3CCC7RGED46XT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT/action/storage_attestation","attest_author":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT/action/author_attestation","sign_citation":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT/action/citation_signature","submit_replication":"https://pith.science/pith/TXES7KDIZGV6E3CCC7RGED46XT/action/replication_record"}},"created_at":"2026-07-05T05:33:02.648598+00:00","updated_at":"2026-07-05T05:33:02.648598+00:00"}