{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XNP57X66CJKC3RLLARGIOIC27Y","short_pith_number":"pith:XNP57X66","schema_version":"1.0","canonical_sha256":"bb5fdfdfde12542dc56b044c87205afe20956b8d30fe82a14d4a6855c5b06662","source":{"kind":"arxiv","id":"2201.06380","version":1},"attestation_state":"computed","paper":{"title":"Reducing the Depth of Linear Reversible Quantum Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Beno\\^it Valiron, Cyril Allouche, Marc Baboulin, Simon Martiel, Timoth\\'ee Goubault de Brugi\\`ere","submitted_at":"2022-01-17T12:36:32Z","abstract_excerpt":"In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, CNOT+T circuits, etc.). We propose a practical formulation of a divide and conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. We improve the theoretical upper bound of the dept"},"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":"2201.06380","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-01-17T12:36:32Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"d7b2eb7917734f795e19b95d706d7577476b01508cdaee0ed8c58ed92bc72b2a","abstract_canon_sha256":"04355f1c2842024e1c42925a80322eebb7bc6d2d7502bc4385b78a642c0f97e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:57.758784Z","signature_b64":"C53skKC09KTH0lvnGnUCI7kDYDE2i88LJvNefmPl15zyfz+bcwcxAoFV9po3lTa4kU9gvX3fi+JepXBeQJyACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb5fdfdfde12542dc56b044c87205afe20956b8d30fe82a14d4a6855c5b06662","last_reissued_at":"2026-07-05T03:48:57.758398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:57.758398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the Depth of Linear Reversible Quantum Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Beno\\^it Valiron, Cyril Allouche, Marc Baboulin, Simon Martiel, Timoth\\'ee Goubault de Brugi\\`ere","submitted_at":"2022-01-17T12:36:32Z","abstract_excerpt":"In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, CNOT+T circuits, etc.). We propose a practical formulation of a divide and conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. We improve the theoretical upper bound of the dept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06380","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/2201.06380/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":"2201.06380","created_at":"2026-07-05T03:48:57.758456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.06380v1","created_at":"2026-07-05T03:48:57.758456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06380","created_at":"2026-07-05T03:48:57.758456+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNP57X66CJKC","created_at":"2026-07-05T03:48:57.758456+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNP57X66CJKC3RLL","created_at":"2026-07-05T03:48:57.758456+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNP57X66","created_at":"2026-07-05T03:48:57.758456+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/XNP57X66CJKC3RLLARGIOIC27Y","json":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y.json","graph_json":"https://pith.science/api/pith-number/XNP57X66CJKC3RLLARGIOIC27Y/graph.json","events_json":"https://pith.science/api/pith-number/XNP57X66CJKC3RLLARGIOIC27Y/events.json","paper":"https://pith.science/paper/XNP57X66"},"agent_actions":{"view_html":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y","download_json":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y.json","view_paper":"https://pith.science/paper/XNP57X66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.06380&json=true","fetch_graph":"https://pith.science/api/pith-number/XNP57X66CJKC3RLLARGIOIC27Y/graph.json","fetch_events":"https://pith.science/api/pith-number/XNP57X66CJKC3RLLARGIOIC27Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y/action/storage_attestation","attest_author":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y/action/author_attestation","sign_citation":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y/action/citation_signature","submit_replication":"https://pith.science/pith/XNP57X66CJKC3RLLARGIOIC27Y/action/replication_record"}},"created_at":"2026-07-05T03:48:57.758456+00:00","updated_at":"2026-07-05T03:48:57.758456+00:00"}