{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:A75IKMJQ2XGGNABUOCBTOSPSX4","short_pith_number":"pith:A75IKMJQ","schema_version":"1.0","canonical_sha256":"07fa853130d5cc66803470833749f2bf2e1e56161106a4d4e313098b4c09dde9","source":{"kind":"arxiv","id":"2106.02812","version":4},"attestation_state":"computed","paper":{"title":"Optimizing Ansatz Design in QAOA for Max-cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Dhiraj Madan, Ritajit Majumdar, Shesha Raghunathan, Susmita Sur-Kolay","submitted_at":"2021-06-05T06:43:48Z","abstract_excerpt":"Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with $n$ vertices and $m$ edges, a depth $p$ QAOA for the Max-cut problem requires $2\\cdot m \\cdot p$ CNOT gates. CNOT is one of the primary sources of error in modern quantum computers. In this paper, we propose two hardware independent methods to reduce the number of CNOT gates in the circuit. First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and red"},"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":"2106.02812","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-05T06:43:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dd2ee96cdf8a1c730f0122a2802fc5626f31783f158d3d366e38d651894c6d6b","abstract_canon_sha256":"5eeae7d267891dfe6c699c568039f88dcfeb96040ce6be709a3da62ee3834f96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:45.590747Z","signature_b64":"HSVZ/tW85AA6l6PKwp2/IvCLW8jmPxlaKqb8bKuvnR+cfH+uRfr9O9VJ1rPWeDDErq4+9qvbp9Hp859I3rMkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07fa853130d5cc66803470833749f2bf2e1e56161106a4d4e313098b4c09dde9","last_reissued_at":"2026-07-05T02:52:45.590259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:45.590259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Ansatz Design in QAOA for Max-cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Dhiraj Madan, Ritajit Majumdar, Shesha Raghunathan, Susmita Sur-Kolay","submitted_at":"2021-06-05T06:43:48Z","abstract_excerpt":"Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with $n$ vertices and $m$ edges, a depth $p$ QAOA for the Max-cut problem requires $2\\cdot m \\cdot p$ CNOT gates. CNOT is one of the primary sources of error in modern quantum computers. In this paper, we propose two hardware independent methods to reduce the number of CNOT gates in the circuit. First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02812","kind":"arxiv","version":4},"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/2106.02812/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":"2106.02812","created_at":"2026-07-05T02:52:45.590322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.02812v4","created_at":"2026-07-05T02:52:45.590322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02812","created_at":"2026-07-05T02:52:45.590322+00:00"},{"alias_kind":"pith_short_12","alias_value":"A75IKMJQ2XGG","created_at":"2026-07-05T02:52:45.590322+00:00"},{"alias_kind":"pith_short_16","alias_value":"A75IKMJQ2XGGNABU","created_at":"2026-07-05T02:52:45.590322+00:00"},{"alias_kind":"pith_short_8","alias_value":"A75IKMJQ","created_at":"2026-07-05T02:52:45.590322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4","json":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4.json","graph_json":"https://pith.science/api/pith-number/A75IKMJQ2XGGNABUOCBTOSPSX4/graph.json","events_json":"https://pith.science/api/pith-number/A75IKMJQ2XGGNABUOCBTOSPSX4/events.json","paper":"https://pith.science/paper/A75IKMJQ"},"agent_actions":{"view_html":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4","download_json":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4.json","view_paper":"https://pith.science/paper/A75IKMJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.02812&json=true","fetch_graph":"https://pith.science/api/pith-number/A75IKMJQ2XGGNABUOCBTOSPSX4/graph.json","fetch_events":"https://pith.science/api/pith-number/A75IKMJQ2XGGNABUOCBTOSPSX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4/action/storage_attestation","attest_author":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4/action/author_attestation","sign_citation":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4/action/citation_signature","submit_replication":"https://pith.science/pith/A75IKMJQ2XGGNABUOCBTOSPSX4/action/replication_record"}},"created_at":"2026-07-05T02:52:45.590322+00:00","updated_at":"2026-07-05T02:52:45.590322+00:00"}