{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NDAGKC6QAB46EYQJKRL57VZOSA","short_pith_number":"pith:NDAGKC6Q","schema_version":"1.0","canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","source":{"kind":"arxiv","id":"2110.04637","version":1},"attestation_state":"computed","paper":{"title":"Depth Optimized Ansatz Circuit 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-10-09T19:45:12Z","abstract_excerpt":"While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise in the system is a hurdle in exploiting its full potential. Several error mitigation techniques have been studied to lessen the effect of noise on this algorithm. Recently, Majumdar et al. proposed a Depth First Search (DFS) based method to reduce $n-1$ CNOT gates in the ansatz design of QAOA for finding Max-Cut in a graph G = (V, E), |V| = n. However, this method tends to increase the depth of the circuit, making it"},"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":"2110.04637","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-09T19:45:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ee5379679b8641b22c5725b742943e7fbfa09de058d88b3ab1d797fdce0b7e49","abstract_canon_sha256":"86ef28d8212b1ae5e756e20e5e09080cda9d3ea7edb717ea848672289413be9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:19.559055Z","signature_b64":"gmnM14Jkyx/Uj4Lh66WcfgeXUUOgOgOjR52k39gadWp0gKm4jCB3oSGXzG+2O8qAJlZDGv2yAhhLMshR3yjaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","last_reissued_at":"2026-07-05T03:21:19.558647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:19.558647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth Optimized Ansatz Circuit 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-10-09T19:45:12Z","abstract_excerpt":"While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise in the system is a hurdle in exploiting its full potential. Several error mitigation techniques have been studied to lessen the effect of noise on this algorithm. Recently, Majumdar et al. proposed a Depth First Search (DFS) based method to reduce $n-1$ CNOT gates in the ansatz design of QAOA for finding Max-Cut in a graph G = (V, E), |V| = n. However, this method tends to increase the depth of the circuit, making it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04637","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/2110.04637/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":"2110.04637","created_at":"2026-07-05T03:21:19.558705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.04637v1","created_at":"2026-07-05T03:21:19.558705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04637","created_at":"2026-07-05T03:21:19.558705+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDAGKC6QAB46","created_at":"2026-07-05T03:21:19.558705+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDAGKC6QAB46EYQJ","created_at":"2026-07-05T03:21:19.558705+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDAGKC6Q","created_at":"2026-07-05T03:21:19.558705+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/NDAGKC6QAB46EYQJKRL57VZOSA","json":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA.json","graph_json":"https://pith.science/api/pith-number/NDAGKC6QAB46EYQJKRL57VZOSA/graph.json","events_json":"https://pith.science/api/pith-number/NDAGKC6QAB46EYQJKRL57VZOSA/events.json","paper":"https://pith.science/paper/NDAGKC6Q"},"agent_actions":{"view_html":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA","download_json":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA.json","view_paper":"https://pith.science/paper/NDAGKC6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.04637&json=true","fetch_graph":"https://pith.science/api/pith-number/NDAGKC6QAB46EYQJKRL57VZOSA/graph.json","fetch_events":"https://pith.science/api/pith-number/NDAGKC6QAB46EYQJKRL57VZOSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/action/storage_attestation","attest_author":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/action/author_attestation","sign_citation":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/action/citation_signature","submit_replication":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/action/replication_record"}},"created_at":"2026-07-05T03:21:19.558705+00:00","updated_at":"2026-07-05T03:21:19.558705+00:00"}