{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VQUV73CONAKWYXCBLIIOVOPHMH","short_pith_number":"pith:VQUV73CO","schema_version":"1.0","canonical_sha256":"ac295fec4e68156c5c415a10eab9e761e03fda6af39015fa2fd89896ad6db2fc","source":{"kind":"arxiv","id":"1812.07589","version":1},"attestation_state":"computed","paper":{"title":"QAOA for Max-Cut requires hundreds of qubits for quantum speed-up","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"quant-ph","authors_text":"A. Y. Matsuura, G. G. Guerreschi","submitted_at":"2018-12-18T19:00:13Z","abstract_excerpt":"Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to provide solutions to practical problems. Instead, we believe that future users of quantum co"},"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":"1812.07589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-18T19:00:13Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"6ab6ac4106be1ee3fedf94ecd276821bbd071fd7748b4e626db6e60528845658","abstract_canon_sha256":"600eca950a69de40ab74b17f13d448e340268315b65249173aeeb1a4cc07225c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:49.547290Z","signature_b64":"Sq+HWKZ7x+EAlx0UYha8rcTeOEfJAVwbmh5V6wtME6msuf4/pIcm2mHs2qtf4Ut2CUVWpf/C6AlJ0OqYDtByCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac295fec4e68156c5c415a10eab9e761e03fda6af39015fa2fd89896ad6db2fc","last_reissued_at":"2026-07-05T00:25:49.546807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:49.546807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QAOA for Max-Cut requires hundreds of qubits for quantum speed-up","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"quant-ph","authors_text":"A. Y. Matsuura, G. G. Guerreschi","submitted_at":"2018-12-18T19:00:13Z","abstract_excerpt":"Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to provide solutions to practical problems. Instead, we believe that future users of quantum co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07589","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/1812.07589/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":"1812.07589","created_at":"2026-07-05T00:25:49.546866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.07589v1","created_at":"2026-07-05T00:25:49.546866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07589","created_at":"2026-07-05T00:25:49.546866+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQUV73CONAKW","created_at":"2026-07-05T00:25:49.546866+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQUV73CONAKWYXCB","created_at":"2026-07-05T00:25:49.546866+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQUV73CO","created_at":"2026-07-05T00:25:49.546866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.09631","citing_title":"Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH","json":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH.json","graph_json":"https://pith.science/api/pith-number/VQUV73CONAKWYXCBLIIOVOPHMH/graph.json","events_json":"https://pith.science/api/pith-number/VQUV73CONAKWYXCBLIIOVOPHMH/events.json","paper":"https://pith.science/paper/VQUV73CO"},"agent_actions":{"view_html":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH","download_json":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH.json","view_paper":"https://pith.science/paper/VQUV73CO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.07589&json=true","fetch_graph":"https://pith.science/api/pith-number/VQUV73CONAKWYXCBLIIOVOPHMH/graph.json","fetch_events":"https://pith.science/api/pith-number/VQUV73CONAKWYXCBLIIOVOPHMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH/action/storage_attestation","attest_author":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH/action/author_attestation","sign_citation":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH/action/citation_signature","submit_replication":"https://pith.science/pith/VQUV73CONAKWYXCBLIIOVOPHMH/action/replication_record"}},"created_at":"2026-07-05T00:25:49.546866+00:00","updated_at":"2026-07-05T00:25:49.546866+00:00"}