JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "McGill University, Montr\u00e9al, QC, Canada", 
          "id": "http://www.grid.ac/institutes/grid.14709.3b", 
          "name": [
            "McGill University, Montr\u00e9al, QC, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Cr\u00e9peau", 
        "givenName": "Claude", 
        "id": "sg:person.01127736412.71", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01127736412.71"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Perimeter Institute, Waterloo, ON, Canada", 
          "id": "http://www.grid.ac/institutes/grid.420198.6", 
          "name": [
            "Perimeter Institute, Waterloo, ON, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gottesman", 
        "givenName": "Daniel", 
        "id": "sg:person.013605661215.68", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013605661215.68"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Weizmann Institute of Science, Rehovot, Israel", 
          "id": "http://www.grid.ac/institutes/grid.13992.30", 
          "name": [
            "Weizmann Institute of Science, Rehovot, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Smith", 
        "givenName": "Adam", 
        "id": "sg:person.013307226666.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2005", 
    "datePublishedReg": "2005-01-01", 
    "description": "It is a standard result in the theory of quantum error- correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies to codes which recover the message exactly. Naively, one might expect that correcting errors to very high fidelity would only allow small violations of this bound. This intuition is incorrect: in this paper we describe quantum error-correcting codes capable of correcting up to \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\lfloor(n - 1)/2\\rfloor$\\end{document} arbitrary errors with fidelity exponentially close to 1, at the price of increasing the size of the registers (i.e., the coding alphabet). This demonstrates a sharp distinction between exact and approximate quantum error correction. The codes have the property that any t components reveal no information about the message, and so they can also be viewed as error-tolerant secret sharing schemes.The construction has several interesting implications for cryptography and quantum information theory. First, it suggests that secret sharing is a better classical analogue to quantum error correction than is classical error correction. Second, it highlights an error in a purported proof that verifiable quantum secret sharing (VQSS) is impossible when the number of cheaters t is n/4. In particular, the construction directly yields an honest-dealer VQSS scheme for \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$t= \\lfloor(n - 1)/2\\rfloor$\\end{document}. We believe the codes could also potentially lead to improved protocols for dishonest-dealer VQSS and secure multi-party quantum computation.More generally, the construction illustrates a difference between exact and approximate requirements in quantum cryptography and (yet again) the delicacy of security proofs and impossibility results in the quantum model.", 
    "editor": [
      {
        "familyName": "Cramer", 
        "givenName": "Ronald", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11426639_17", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-25910-7", 
        "978-3-540-32055-5"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2005", 
      "type": "Book"
    }, 
    "keywords": [
      "verifiable quantum secret sharing", 
      "secret sharing scheme", 
      "error-correcting codes", 
      "secret sharing", 
      "quantum error-correcting codes", 
      "sharing scheme", 
      "error correction", 
      "arbitrary errors", 
      "error correcting codes", 
      "security proof", 
      "classical error correction", 
      "quantum error correcting codes", 
      "quantum secret sharing", 
      "cryptography", 
      "quantum cryptography", 
      "information theory", 
      "impossibility results", 
      "purported proof", 
      "approximate quantum error correction", 
      "code", 
      "sharing", 
      "quantum error correction", 
      "approximate quantum error correcting codes", 
      "quantum information theory", 
      "quantum computation", 
      "scheme", 
      "messages", 
      "improved protocol", 
      "classical analog", 
      "quantum model", 
      "high fidelity", 
      "error", 
      "coding", 
      "small violations", 
      "length n", 
      "computation", 
      "proof", 
      "requirements", 
      "information", 
      "fidelity", 
      "approximate requirements", 
      "construction", 
      "protocol", 
      "intuition", 
      "interesting implications", 
      "Hilbert space", 
      "standard results", 
      "correction", 
      "space", 
      "T component", 
      "violation", 
      "model", 
      "results", 
      "theory", 
      "number", 
      "components", 
      "properties", 
      "dimensions", 
      "sharp distinction", 
      "prices", 
      "Register", 
      "size", 
      "distinction", 
      "analogues", 
      "delicacy", 
      "implications", 
      "paper", 
      "differences"
    ], 
    "name": "Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes", 
    "pagination": "285-301", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1040777272"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11426639_17"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11426639_17", 
      "https://app.dimensions.ai/details/publication/pub.1040777272"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:33", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_367.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11426639_17"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

148 TRIPLES      23 PREDICATES      94 URIs      87 LITERALS      7 BLANK NODES