{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3VEQ6VZXVXXRMVGGDHJ2CSNZVQ","short_pith_number":"pith:3VEQ6VZX","canonical_record":{"source":{"id":"2010.07453","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-10-15T00:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"abb18f0f88ee394c341407da08588c4ecc9ca92c30b2236fff36f072a5d6f9f1","abstract_canon_sha256":"705ba30874faf7b0a8a5b7570efe30a1d0fe03f146b5ddc208eb6a8349c627e2"},"schema_version":"1.0"},"canonical_sha256":"dd490f5737adef1654c619d3a149b9ac14e775c31333626493480878a1b132a1","source":{"kind":"arxiv","id":"2010.07453","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.07453","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"arxiv_version","alias_value":"2010.07453v2","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07453","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"pith_short_12","alias_value":"3VEQ6VZXVXXR","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"pith_short_16","alias_value":"3VEQ6VZXVXXRMVGG","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"pith_short_8","alias_value":"3VEQ6VZX","created_at":"2026-07-05T02:13:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3VEQ6VZXVXXRMVGGDHJ2CSNZVQ","target":"record","payload":{"canonical_record":{"source":{"id":"2010.07453","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-10-15T00:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"abb18f0f88ee394c341407da08588c4ecc9ca92c30b2236fff36f072a5d6f9f1","abstract_canon_sha256":"705ba30874faf7b0a8a5b7570efe30a1d0fe03f146b5ddc208eb6a8349c627e2"},"schema_version":"1.0"},"canonical_sha256":"dd490f5737adef1654c619d3a149b9ac14e775c31333626493480878a1b132a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:51.874119Z","signature_b64":"/0XWdVE9iAGnmKEvbYrWI2FbnrHFOg/ddfVVUAPzvJ7IngAENqT1PUhkUghIMAI1etgnufCNJB957bYSoGQADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd490f5737adef1654c619d3a149b9ac14e775c31333626493480878a1b132a1","last_reissued_at":"2026-07-05T02:13:51.873756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:51.873756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.07453","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:13:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"197oW1oLxgkri7D3F+GrAGAm+ryV46ZrlVirslLH1JCy2IdtF7yWiuzCTPX7s6qmkcDH6HQhQ9TL/UG/CodCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:51:04.896350Z"},"content_sha256":"bc18fd8c0211ac791c75da22ab2f5a56349614c68c5968e92fdadd33e142e25e","schema_version":"1.0","event_id":"sha256:bc18fd8c0211ac791c75da22ab2f5a56349614c68c5968e92fdadd33e142e25e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3VEQ6VZXVXXRMVGGDHJ2CSNZVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact and approximate continuous-variable gate decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nicol\\'as Quesada, Timjan Kalajdzievski","submitted_at":"2020-10-15T00:41:14Z","abstract_excerpt":"We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods are studied and gate counts are compared for some common operations. While each having distinct advantages, we find that exact decompositions have lower gate counts whereas approximate techniques can cover decompositions for all continuous-variable operations but require significant circuit depth for a modest precision."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07453","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/2010.07453/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:13:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/N1tV8wTGy/pJalYQojvwRVcw+5lJYwIdLCclDe1QT/1GMWnAJT+D9A4TaCqzM2ItwLRJOzeegGkMjL8OZlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:51:04.896872Z"},"content_sha256":"74d57951e2efd8eaf56fb9e384d5546f5ffc489473c4b97174e9db761435497c","schema_version":"1.0","event_id":"sha256:74d57951e2efd8eaf56fb9e384d5546f5ffc489473c4b97174e9db761435497c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ/bundle.json","state_url":"https://pith.science/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T09:51:04Z","links":{"resolver":"https://pith.science/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ","bundle":"https://pith.science/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ/bundle.json","state":"https://pith.science/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VEQ6VZXVXXRMVGGDHJ2CSNZVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3VEQ6VZXVXXRMVGGDHJ2CSNZVQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"705ba30874faf7b0a8a5b7570efe30a1d0fe03f146b5ddc208eb6a8349c627e2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-10-15T00:41:14Z","title_canon_sha256":"abb18f0f88ee394c341407da08588c4ecc9ca92c30b2236fff36f072a5d6f9f1"},"schema_version":"1.0","source":{"id":"2010.07453","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.07453","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"arxiv_version","alias_value":"2010.07453v2","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07453","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"pith_short_12","alias_value":"3VEQ6VZXVXXR","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"pith_short_16","alias_value":"3VEQ6VZXVXXRMVGG","created_at":"2026-07-05T02:13:51Z"},{"alias_kind":"pith_short_8","alias_value":"3VEQ6VZX","created_at":"2026-07-05T02:13:51Z"}],"graph_snapshots":[{"event_id":"sha256:74d57951e2efd8eaf56fb9e384d5546f5ffc489473c4b97174e9db761435497c","target":"graph","created_at":"2026-07-05T02:13:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.07453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods are studied and gate counts are compared for some common operations. While each having distinct advantages, we find that exact decompositions have lower gate counts whereas approximate techniques can cover decompositions for all continuous-variable operations but require significant circuit depth for a modest precision.","authors_text":"Nicol\\'as Quesada, Timjan Kalajdzievski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-10-15T00:41:14Z","title":"Exact and approximate continuous-variable gate decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07453","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bc18fd8c0211ac791c75da22ab2f5a56349614c68c5968e92fdadd33e142e25e","target":"record","created_at":"2026-07-05T02:13:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"705ba30874faf7b0a8a5b7570efe30a1d0fe03f146b5ddc208eb6a8349c627e2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-10-15T00:41:14Z","title_canon_sha256":"abb18f0f88ee394c341407da08588c4ecc9ca92c30b2236fff36f072a5d6f9f1"},"schema_version":"1.0","source":{"id":"2010.07453","kind":"arxiv","version":2}},"canonical_sha256":"dd490f5737adef1654c619d3a149b9ac14e775c31333626493480878a1b132a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd490f5737adef1654c619d3a149b9ac14e775c31333626493480878a1b132a1","first_computed_at":"2026-07-05T02:13:51.873756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:13:51.873756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/0XWdVE9iAGnmKEvbYrWI2FbnrHFOg/ddfVVUAPzvJ7IngAENqT1PUhkUghIMAI1etgnufCNJB957bYSoGQADw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:13:51.874119Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.07453","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc18fd8c0211ac791c75da22ab2f5a56349614c68c5968e92fdadd33e142e25e","sha256:74d57951e2efd8eaf56fb9e384d5546f5ffc489473c4b97174e9db761435497c"],"state_sha256":"8bfccba561b3be8120223cf75daf2d0f98f3c82851b12246634f2ced6ad86dd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EsNjTzU3uWCH3gqPlZxBBbL6itPhohw6mCwm0Mz0tpdJ0Os7gZjqvetansnRbB8EIH7zkwIBCUjp6DxCnMClBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:51:04.901488Z","bundle_sha256":"4f189587e512eba1d25b24588034a37aec05a3dae392a06f2cf2eaecb568c3e2"}}