Sure Success Partial Search View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2006-11-28

AUTHORS

Byung-Soo Choi, Thomas A. Walker, Samuel L. Braunstein

ABSTRACT

Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability. More... »

PAGES

1-8

References to SciGraph publications

  • 2006-02. Simple Algorithm for Partial Quantum Search in QUANTUM INFORMATION PROCESSING
  • 2006-05-10. Quest for Fast Partial Search Algorithm in QUANTUM INFORMATION PROCESSING
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s11128-006-0037-y

    DOI

    http://dx.doi.org/10.1007/s11128-006-0037-y

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1012886712


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    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": "Department of Computer Science, University of York, Y010 5DD, York, UK", 
              "id": "http://www.grid.ac/institutes/grid.5685.e", 
              "name": [
                "Department of Computer Science, University of York, Y010 5DD, York, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Choi", 
            "givenName": "Byung-Soo", 
            "id": "sg:person.013453142634.28", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013453142634.28"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Computer Science, University of York, Y010 5DD, York, UK", 
              "id": "http://www.grid.ac/institutes/grid.5685.e", 
              "name": [
                "Department of Computer Science, University of York, Y010 5DD, York, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Walker", 
            "givenName": "Thomas A.", 
            "id": "sg:person.01135047411.93", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01135047411.93"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Computer Science, University of York, Y010 5DD, York, UK", 
              "id": "http://www.grid.ac/institutes/grid.5685.e", 
              "name": [
                "Department of Computer Science, University of York, Y010 5DD, York, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Braunstein", 
            "givenName": "Samuel L.", 
            "id": "sg:person.0666766367.22", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0666766367.22"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/s11128-006-0024-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008026102", 
              "https://doi.org/10.1007/s11128-006-0024-3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s11128-005-0004-z", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016365980", 
              "https://doi.org/10.1007/s11128-005-0004-z"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2006-11-28", 
        "datePublishedReg": "2006-11-28", 
        "description": "Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s11128-006-0037-y", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1052742", 
            "issn": [
              "1570-0755", 
              "1573-1332"
            ], 
            "name": "Quantum Information Processing", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "6"
          }
        ], 
        "keywords": [
          "partial search", 
          "search algorithm", 
          "partial search algorithm", 
          "Grover's search algorithm", 
          "large algorithm", 
          "target block", 
          "algorithm", 
          "search", 
          "queries", 
          "subroutine", 
          "success rate", 
          "block", 
          "probability", 
          "success", 
          "elements", 
          "target elements", 
          "target", 
          "rate", 
          "unit probability", 
          "full Grover search algorithm", 
          "such partial searches", 
          "Sure Success Partial Search", 
          "Success Partial Search"
        ], 
        "name": "Sure Success Partial Search", 
        "pagination": "1-8", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1012886712"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s11128-006-0037-y"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s11128-006-0037-y", 
          "https://app.dimensions.ai/details/publication/pub.1012886712"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-11-01T18:08", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/article/article_424.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s11128-006-0037-y"
      }
    ]
     

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

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s11128-006-0037-y'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s11128-006-0037-y'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s11128-006-0037-y'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s11128-006-0037-y'


     

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

    103 TRIPLES      22 PREDICATES      49 URIs      39 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s11128-006-0037-y schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N8cfa7cb305f244e18153d617b9efe588
    4 schema:citation sg:pub.10.1007/s11128-005-0004-z
    5 sg:pub.10.1007/s11128-006-0024-3
    6 schema:datePublished 2006-11-28
    7 schema:datePublishedReg 2006-11-28
    8 schema:description Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
    9 schema:genre article
    10 schema:inLanguage en
    11 schema:isAccessibleForFree true
    12 schema:isPartOf N96e91708a4414bc2b92dde8ec1f4105c
    13 Nc8907f15a23a4d99af41a84ce6d7a55e
    14 sg:journal.1052742
    15 schema:keywords Grover's search algorithm
    16 Success Partial Search
    17 Sure Success Partial Search
    18 algorithm
    19 block
    20 elements
    21 full Grover search algorithm
    22 large algorithm
    23 partial search
    24 partial search algorithm
    25 probability
    26 queries
    27 rate
    28 search
    29 search algorithm
    30 subroutine
    31 success
    32 success rate
    33 such partial searches
    34 target
    35 target block
    36 target elements
    37 unit probability
    38 schema:name Sure Success Partial Search
    39 schema:pagination 1-8
    40 schema:productId N94640ca7a30941d9bc6a90952dcefea5
    41 Na54a3b5d6d6b49eea714be931ba07bff
    42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012886712
    43 https://doi.org/10.1007/s11128-006-0037-y
    44 schema:sdDatePublished 2021-11-01T18:08
    45 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    46 schema:sdPublisher N4ba9b21c910e4e329d5635cc5ac1b0f3
    47 schema:url https://doi.org/10.1007/s11128-006-0037-y
    48 sgo:license sg:explorer/license/
    49 sgo:sdDataset articles
    50 rdf:type schema:ScholarlyArticle
    51 N29e91626cf074958b06ef072bd492e70 rdf:first sg:person.0666766367.22
    52 rdf:rest rdf:nil
    53 N4ba9b21c910e4e329d5635cc5ac1b0f3 schema:name Springer Nature - SN SciGraph project
    54 rdf:type schema:Organization
    55 N8cfa7cb305f244e18153d617b9efe588 rdf:first sg:person.013453142634.28
    56 rdf:rest Nab1d83dda30b4d0ab5bfeba5a1a68fbc
    57 N94640ca7a30941d9bc6a90952dcefea5 schema:name dimensions_id
    58 schema:value pub.1012886712
    59 rdf:type schema:PropertyValue
    60 N96e91708a4414bc2b92dde8ec1f4105c schema:issueNumber 1
    61 rdf:type schema:PublicationIssue
    62 Na54a3b5d6d6b49eea714be931ba07bff schema:name doi
    63 schema:value 10.1007/s11128-006-0037-y
    64 rdf:type schema:PropertyValue
    65 Nab1d83dda30b4d0ab5bfeba5a1a68fbc rdf:first sg:person.01135047411.93
    66 rdf:rest N29e91626cf074958b06ef072bd492e70
    67 Nc8907f15a23a4d99af41a84ce6d7a55e schema:volumeNumber 6
    68 rdf:type schema:PublicationVolume
    69 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    70 schema:name Information and Computing Sciences
    71 rdf:type schema:DefinedTerm
    72 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    73 schema:name Data Format
    74 rdf:type schema:DefinedTerm
    75 sg:journal.1052742 schema:issn 1570-0755
    76 1573-1332
    77 schema:name Quantum Information Processing
    78 schema:publisher Springer Nature
    79 rdf:type schema:Periodical
    80 sg:person.01135047411.93 schema:affiliation grid-institutes:grid.5685.e
    81 schema:familyName Walker
    82 schema:givenName Thomas A.
    83 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01135047411.93
    84 rdf:type schema:Person
    85 sg:person.013453142634.28 schema:affiliation grid-institutes:grid.5685.e
    86 schema:familyName Choi
    87 schema:givenName Byung-Soo
    88 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013453142634.28
    89 rdf:type schema:Person
    90 sg:person.0666766367.22 schema:affiliation grid-institutes:grid.5685.e
    91 schema:familyName Braunstein
    92 schema:givenName Samuel L.
    93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0666766367.22
    94 rdf:type schema:Person
    95 sg:pub.10.1007/s11128-005-0004-z schema:sameAs https://app.dimensions.ai/details/publication/pub.1016365980
    96 https://doi.org/10.1007/s11128-005-0004-z
    97 rdf:type schema:CreativeWork
    98 sg:pub.10.1007/s11128-006-0024-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008026102
    99 https://doi.org/10.1007/s11128-006-0024-3
    100 rdf:type schema:CreativeWork
    101 grid-institutes:grid.5685.e schema:alternateName Department of Computer Science, University of York, Y010 5DD, York, UK
    102 schema:name Department of Computer Science, University of York, Y010 5DD, York, UK
    103 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...