{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VRTG75PWQCQ3SVDCGA6LGTPJLN","short_pith_number":"pith:VRTG75PW","schema_version":"1.0","canonical_sha256":"ac666ff5f680a1b95462303cb34de95b7d75e69a4b8007fe856d9c712591e74f","source":{"kind":"arxiv","id":"2203.01789","version":2},"attestation_state":"computed","paper":{"title":"Quantum circuit compilation and hybrid computation using Pauli-based computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ernesto F. Galv\\~ao, Filipa C. R. Peres","submitted_at":"2022-03-03T16:01:55Z","abstract_excerpt":"Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. Any quantum circuit written in terms of the Clifford+$T$ gate set and having $t$ $T$ gates can be compiled into a PBC on $t$ qubits. Here we propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing. Our schemes reduce the number of quantum gates to $O(t^2)$ (from a previous $O(t^3 / \\log t)$ scaling) and space/time trade-offs are discussed which lead to a reduction of the depth from $O(t \\log "},"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":"2203.01789","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-03T16:01:55Z","cross_cats_sorted":[],"title_canon_sha256":"16f35d2970759c90c555653d7d2fb105c1cc3ddf518b2c32756dc05aa9e77d05","abstract_canon_sha256":"6096281502220b0188feebb069412006a6f5216b6be39c6624081b1c710fa6ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:28.831251Z","signature_b64":"tz3ZX1WgpZvZX0drLImDKzLRRZpZlQklc/JYVOr2hKnASA9wNUN3HmM7DozuNQSVdFTuoDIvkTs+z391p905Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac666ff5f680a1b95462303cb34de95b7d75e69a4b8007fe856d9c712591e74f","last_reissued_at":"2026-07-05T06:56:28.830790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:28.830790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit compilation and hybrid computation using Pauli-based computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ernesto F. Galv\\~ao, Filipa C. R. Peres","submitted_at":"2022-03-03T16:01:55Z","abstract_excerpt":"Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. Any quantum circuit written in terms of the Clifford+$T$ gate set and having $t$ $T$ gates can be compiled into a PBC on $t$ qubits. Here we propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing. Our schemes reduce the number of quantum gates to $O(t^2)$ (from a previous $O(t^3 / \\log t)$ scaling) and space/time trade-offs are discussed which lead to a reduction of the depth from $O(t \\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.01789","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/2203.01789/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":"2203.01789","created_at":"2026-07-05T06:56:28.830844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.01789v2","created_at":"2026-07-05T06:56:28.830844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.01789","created_at":"2026-07-05T06:56:28.830844+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRTG75PWQCQ3","created_at":"2026-07-05T06:56:28.830844+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRTG75PWQCQ3SVDC","created_at":"2026-07-05T06:56:28.830844+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRTG75PW","created_at":"2026-07-05T06:56:28.830844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03092","citing_title":"STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation","ref_index":1126,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN","json":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN.json","graph_json":"https://pith.science/api/pith-number/VRTG75PWQCQ3SVDCGA6LGTPJLN/graph.json","events_json":"https://pith.science/api/pith-number/VRTG75PWQCQ3SVDCGA6LGTPJLN/events.json","paper":"https://pith.science/paper/VRTG75PW"},"agent_actions":{"view_html":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN","download_json":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN.json","view_paper":"https://pith.science/paper/VRTG75PW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.01789&json=true","fetch_graph":"https://pith.science/api/pith-number/VRTG75PWQCQ3SVDCGA6LGTPJLN/graph.json","fetch_events":"https://pith.science/api/pith-number/VRTG75PWQCQ3SVDCGA6LGTPJLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN/action/storage_attestation","attest_author":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN/action/author_attestation","sign_citation":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN/action/citation_signature","submit_replication":"https://pith.science/pith/VRTG75PWQCQ3SVDCGA6LGTPJLN/action/replication_record"}},"created_at":"2026-07-05T06:56:28.830844+00:00","updated_at":"2026-07-05T06:56:28.830844+00:00"}