{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q5FY3RDOPGPECU546Z4TRPHEVH","short_pith_number":"pith:Q5FY3RDO","schema_version":"1.0","canonical_sha256":"874b8dc46e799e4153bcf67938bce4a9c163380bd94bf4998abecd5cfb7239a1","source":{"kind":"arxiv","id":"2012.02430","version":2},"attestation_state":"computed","paper":{"title":"Tensor Network Quantum Simulator With Step-Dependent Parallelization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey Galda, Danylo Lykov, Roman Schutski, Valerii Vinokur, Yuri Alexeev","submitted_at":"2020-12-04T06:35:41Z","abstract_excerpt":"In this work, we present a new large-scale quantum circuit simulator. It is based on the tensor network contraction technique to represent quantum circuits. We propose a novel parallelization algorithm based on \\stepslice . In this paper, we push the requirement on the size of a quantum computer that will be needed to demonstrate the advantage of quantum computation with Quantum Approximate Optimization Algorithm (QAOA). We computed 210 qubit QAOA circuits with 1,785 gates on 1,024 nodes of the the Cray XC 40 supercomputer Theta. To the best of our knowledge, this constitutes the largest QAOA "},"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":"2012.02430","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-04T06:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"7e6a8b8ed6cba220ea793cf263f9c3a312667635bb9bb203920b27bb4213f55d","abstract_canon_sha256":"240b3f2ad50a725c16e7f47e0e2011f99b508f21cda3cb08b547b8276aeff3d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:34.798245Z","signature_b64":"UVLYCTMaKgf7AnV2dK4GJiq7gn2BkAdM1c3OLdehTKuMtJOZYmehtuMOuK5Zw21RRboCgGngeQpbjfWVvB+kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874b8dc46e799e4153bcf67938bce4a9c163380bd94bf4998abecd5cfb7239a1","last_reissued_at":"2026-07-05T04:16:34.797572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:34.797572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Network Quantum Simulator With Step-Dependent Parallelization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey Galda, Danylo Lykov, Roman Schutski, Valerii Vinokur, Yuri Alexeev","submitted_at":"2020-12-04T06:35:41Z","abstract_excerpt":"In this work, we present a new large-scale quantum circuit simulator. It is based on the tensor network contraction technique to represent quantum circuits. We propose a novel parallelization algorithm based on \\stepslice . In this paper, we push the requirement on the size of a quantum computer that will be needed to demonstrate the advantage of quantum computation with Quantum Approximate Optimization Algorithm (QAOA). We computed 210 qubit QAOA circuits with 1,785 gates on 1,024 nodes of the the Cray XC 40 supercomputer Theta. To the best of our knowledge, this constitutes the largest QAOA "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.02430","kind":"arxiv","version":2},"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/2012.02430/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":"2012.02430","created_at":"2026-07-05T04:16:34.797636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.02430v2","created_at":"2026-07-05T04:16:34.797636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.02430","created_at":"2026-07-05T04:16:34.797636+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5FY3RDOPGPE","created_at":"2026-07-05T04:16:34.797636+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5FY3RDOPGPECU54","created_at":"2026-07-05T04:16:34.797636+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5FY3RDO","created_at":"2026-07-05T04:16:34.797636+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH","json":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH.json","graph_json":"https://pith.science/api/pith-number/Q5FY3RDOPGPECU546Z4TRPHEVH/graph.json","events_json":"https://pith.science/api/pith-number/Q5FY3RDOPGPECU546Z4TRPHEVH/events.json","paper":"https://pith.science/paper/Q5FY3RDO"},"agent_actions":{"view_html":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH","download_json":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH.json","view_paper":"https://pith.science/paper/Q5FY3RDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.02430&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5FY3RDOPGPECU546Z4TRPHEVH/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5FY3RDOPGPECU546Z4TRPHEVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH/action/storage_attestation","attest_author":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH/action/author_attestation","sign_citation":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH/action/citation_signature","submit_replication":"https://pith.science/pith/Q5FY3RDOPGPECU546Z4TRPHEVH/action/replication_record"}},"created_at":"2026-07-05T04:16:34.797636+00:00","updated_at":"2026-07-05T04:16:34.797636+00:00"}