{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HRHE2VZPOFLQIYX5MSMRUTTOKS","short_pith_number":"pith:HRHE2VZP","schema_version":"1.0","canonical_sha256":"3c4e4d572f71570462fd64991a4e6e54ab3163d6b60d4b4f97b37c9bc4c0103f","source":{"kind":"arxiv","id":"1806.08863","version":2},"attestation_state":"computed","paper":{"title":"Entanglement spectroscopy with a depth-two quantum circuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Lukasz Cincio, Patrick J. Coles, Yigit Subasi","submitted_at":"2018-06-22T21:35:19Z","abstract_excerpt":"Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count. Here, we exploit this trade-off for an application called entanglement spectroscopy, where one computes the entanglement of a state $| \\psi \\rangle$ on systems $AB$ by evaluating the R\\'enyi entropy of the reduced state $\\rho_A = {\\rm Tr}_B(| \\psi \\rangle \\langle \\psi |)$. For a $k$-qubit state $\\rho(k)$, the R\\'enyi entropy of order $n$ is c"},"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":"1806.08863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-22T21:35:19Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"0158c5fe57b4d23420ee4c19d27ddd9ad91d0fc37d65263fe8b59cae453526ae","abstract_canon_sha256":"14a526a7b2eda001b03ad23c67f7755e331126de8dbacbb13b82fc2a68b02c7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:47.785129Z","signature_b64":"9Md899QrkTk5Oq7ojp5R3n7Psj+7pVGsT1NgRUGajgRxhL6GpH/DNQpUnf+0wsODdaee530JhSvy032G/ed/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c4e4d572f71570462fd64991a4e6e54ab3163d6b60d4b4f97b37c9bc4c0103f","last_reissued_at":"2026-05-17T23:56:47.784634Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:47.784634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement spectroscopy with a depth-two quantum circuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Lukasz Cincio, Patrick J. Coles, Yigit Subasi","submitted_at":"2018-06-22T21:35:19Z","abstract_excerpt":"Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count. Here, we exploit this trade-off for an application called entanglement spectroscopy, where one computes the entanglement of a state $| \\psi \\rangle$ on systems $AB$ by evaluating the R\\'enyi entropy of the reduced state $\\rho_A = {\\rm Tr}_B(| \\psi \\rangle \\langle \\psi |)$. For a $k$-qubit state $\\rho(k)$, the R\\'enyi entropy of order $n$ is c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08863","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":""},"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":"1806.08863","created_at":"2026-05-17T23:56:47.784705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08863v2","created_at":"2026-05-17T23:56:47.784705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08863","created_at":"2026-05-17T23:56:47.784705+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRHE2VZPOFLQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRHE2VZPOFLQIYX5","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRHE2VZP","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08683","citing_title":"High-Precision Variational Quantum SVD via Classical Orthogonality Correction","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS","json":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS.json","graph_json":"https://pith.science/api/pith-number/HRHE2VZPOFLQIYX5MSMRUTTOKS/graph.json","events_json":"https://pith.science/api/pith-number/HRHE2VZPOFLQIYX5MSMRUTTOKS/events.json","paper":"https://pith.science/paper/HRHE2VZP"},"agent_actions":{"view_html":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS","download_json":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS.json","view_paper":"https://pith.science/paper/HRHE2VZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08863&json=true","fetch_graph":"https://pith.science/api/pith-number/HRHE2VZPOFLQIYX5MSMRUTTOKS/graph.json","fetch_events":"https://pith.science/api/pith-number/HRHE2VZPOFLQIYX5MSMRUTTOKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS/action/storage_attestation","attest_author":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS/action/author_attestation","sign_citation":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS/action/citation_signature","submit_replication":"https://pith.science/pith/HRHE2VZPOFLQIYX5MSMRUTTOKS/action/replication_record"}},"created_at":"2026-05-17T23:56:47.784705+00:00","updated_at":"2026-05-17T23:56:47.784705+00:00"}