{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K4BQLEDV64ZHVGWO7EUZUN3RJT","short_pith_number":"pith:K4BQLEDV","schema_version":"1.0","canonical_sha256":"5703059075f7327a9acef9299a37714ce397b96effe43bfb170f92dfe8a5d722","source":{"kind":"arxiv","id":"1904.01972","version":3},"attestation_state":"computed","paper":{"title":"Quantum circuit optimizations for NISQ architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Beatrice Nash, Michele Mosca, Vlad Gheorghiu","submitted_at":"2019-04-03T12:35:09Z","abstract_excerpt":"Currently available quantum computing hardware platforms have limited 2-qubit connectivity among their addressable qubits. In order to run a generic quantum algorithm on such a platform, one has to transform the initial logical quantum circuit describing the algorithm into an equivalent one that obeys the connectivity restrictions.\n  In this work we construct a circuit synthesis scheme that takes as input the qubit connectivity graph and a quantum circuit over the gate set generated by $\\{\\text{CNOT},R_{Z}\\}$ and outputs a circuit that respects the connectivity of the device. As a concrete app"},"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":"1904.01972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-03T12:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"da0cac85df06ec1aacdeac0451e4d5716f02fb17892017c62cee06b3935e30ea","abstract_canon_sha256":"bb29a572c0e9af684117eb72736cc4b3aee24c9657c3357055b04447790707fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:02.680492Z","signature_b64":"yHwaeRUz7y3P+baxCRNNM5gfQJ8Sd4AYngWoXMQgqvTwM7AONCO5a5feX/vVoWwgFqqilUH+/c+ZAuCq1exRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5703059075f7327a9acef9299a37714ce397b96effe43bfb170f92dfe8a5d722","last_reissued_at":"2026-07-05T00:58:02.680106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:02.680106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit optimizations for NISQ architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Beatrice Nash, Michele Mosca, Vlad Gheorghiu","submitted_at":"2019-04-03T12:35:09Z","abstract_excerpt":"Currently available quantum computing hardware platforms have limited 2-qubit connectivity among their addressable qubits. In order to run a generic quantum algorithm on such a platform, one has to transform the initial logical quantum circuit describing the algorithm into an equivalent one that obeys the connectivity restrictions.\n  In this work we construct a circuit synthesis scheme that takes as input the qubit connectivity graph and a quantum circuit over the gate set generated by $\\{\\text{CNOT},R_{Z}\\}$ and outputs a circuit that respects the connectivity of the device. As a concrete app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01972","kind":"arxiv","version":3},"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/1904.01972/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":"1904.01972","created_at":"2026-07-05T00:58:02.680159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01972v3","created_at":"2026-07-05T00:58:02.680159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01972","created_at":"2026-07-05T00:58:02.680159+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4BQLEDV64ZH","created_at":"2026-07-05T00:58:02.680159+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4BQLEDV64ZHVGWO","created_at":"2026-07-05T00:58:02.680159+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4BQLEDV","created_at":"2026-07-05T00:58:02.680159+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.05415","citing_title":"Learning to learn with quantum neural networks via classical neural networks","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT","json":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT.json","graph_json":"https://pith.science/api/pith-number/K4BQLEDV64ZHVGWO7EUZUN3RJT/graph.json","events_json":"https://pith.science/api/pith-number/K4BQLEDV64ZHVGWO7EUZUN3RJT/events.json","paper":"https://pith.science/paper/K4BQLEDV"},"agent_actions":{"view_html":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT","download_json":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT.json","view_paper":"https://pith.science/paper/K4BQLEDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01972&json=true","fetch_graph":"https://pith.science/api/pith-number/K4BQLEDV64ZHVGWO7EUZUN3RJT/graph.json","fetch_events":"https://pith.science/api/pith-number/K4BQLEDV64ZHVGWO7EUZUN3RJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT/action/storage_attestation","attest_author":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT/action/author_attestation","sign_citation":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT/action/citation_signature","submit_replication":"https://pith.science/pith/K4BQLEDV64ZHVGWO7EUZUN3RJT/action/replication_record"}},"created_at":"2026-07-05T00:58:02.680159+00:00","updated_at":"2026-07-05T00:58:02.680159+00:00"}