{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ETJQGEOCR33GFC7BL5AJUOBPIN","short_pith_number":"pith:ETJQGEOC","schema_version":"1.0","canonical_sha256":"24d30311c28ef6628be15f409a382f435101a9a885b74c669a0e09d8149e86b1","source":{"kind":"arxiv","id":"1711.02249","version":1},"attestation_state":"computed","paper":{"title":"QVECTOR: an algorithm for device-tailored quantum error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Jonathan Olson, Jonathan Romero, Peter D. Johnson, Yudong Cao","submitted_at":"2017-11-07T01:30:11Z","abstract_excerpt":"Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color code and surface code schemes, must devote a large fraction of their physical quantum bits to quantum error correction. Building from recent quantum machine learning techniques, we propose an alternative approach to quantum error correction aimed at reducing this overhead, which can be implemented in existing quantum hardware and on a myriad of quantum computing architectures. This method aims to optimize the average "},"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":"1711.02249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-07T01:30:11Z","cross_cats_sorted":[],"title_canon_sha256":"122f74ee9b5b0307467dd5ccf59e4de2b53578e99b7d2472b2dcb9199a8755c7","abstract_canon_sha256":"ff5e18a0fd6fa203a626557265c1119b3c1358e343b0407ef9aeb7d812f5f50a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:08.442306Z","signature_b64":"IXiRIJcw5TsUyKbnhgadWEL5naXuKoa5k5tTjMjSfxJQMlI8h9sdiuIFLOkl4CKl9kyaDIRlpmCmHzbrpEstBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d30311c28ef6628be15f409a382f435101a9a885b74c669a0e09d8149e86b1","last_reissued_at":"2026-05-18T00:31:08.441803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:08.441803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QVECTOR: an algorithm for device-tailored quantum error correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Jonathan Olson, Jonathan Romero, Peter D. Johnson, Yudong Cao","submitted_at":"2017-11-07T01:30:11Z","abstract_excerpt":"Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color code and surface code schemes, must devote a large fraction of their physical quantum bits to quantum error correction. Building from recent quantum machine learning techniques, we propose an alternative approach to quantum error correction aimed at reducing this overhead, which can be implemented in existing quantum hardware and on a myriad of quantum computing architectures. This method aims to optimize the average "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02249","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":""},"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":"1711.02249","created_at":"2026-05-18T00:31:08.441892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02249v1","created_at":"2026-05-18T00:31:08.441892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02249","created_at":"2026-05-18T00:31:08.441892+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETJQGEOCR33G","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETJQGEOCR33GFC7B","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETJQGEOC","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2308.15884","citing_title":"Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2410.02608","citing_title":"Variational Graphical Quantum Error Correction Codes","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2506.11552","citing_title":"Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07909","citing_title":"A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"1811.04968","citing_title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14931","citing_title":"Learning to Concatenate Quantum Codes","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN","json":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN.json","graph_json":"https://pith.science/api/pith-number/ETJQGEOCR33GFC7BL5AJUOBPIN/graph.json","events_json":"https://pith.science/api/pith-number/ETJQGEOCR33GFC7BL5AJUOBPIN/events.json","paper":"https://pith.science/paper/ETJQGEOC"},"agent_actions":{"view_html":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN","download_json":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN.json","view_paper":"https://pith.science/paper/ETJQGEOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02249&json=true","fetch_graph":"https://pith.science/api/pith-number/ETJQGEOCR33GFC7BL5AJUOBPIN/graph.json","fetch_events":"https://pith.science/api/pith-number/ETJQGEOCR33GFC7BL5AJUOBPIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN/action/storage_attestation","attest_author":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN/action/author_attestation","sign_citation":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN/action/citation_signature","submit_replication":"https://pith.science/pith/ETJQGEOCR33GFC7BL5AJUOBPIN/action/replication_record"}},"created_at":"2026-05-18T00:31:08.441892+00:00","updated_at":"2026-05-18T00:31:08.441892+00:00"}