Quantum Bits and Quantum Computation View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2001

AUTHORS

Yorick Hardy , Willi-Hans Steeb

ABSTRACT

Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. More... »

PAGES

451-490

Book

TITLE

Classical and Quantum Computing

ISBN

978-3-7643-6610-0
978-3-0348-8366-5

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-0348-8366-5_17

DOI

http://dx.doi.org/10.1007/978-3-0348-8366-5_17

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Johannesburg", 
          "id": "https://www.grid.ac/institutes/grid.412988.e", 
          "name": [
            "International School for Scientific Computing, Rand Afrikaans University, Auckland Park 2006, P.O. Box 524, South Africa"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hardy", 
        "givenName": "Yorick", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Johannesburg", 
          "id": "https://www.grid.ac/institutes/grid.412988.e", 
          "name": [
            "International School for Scientific Computing, Rand Afrikaans University, Auckland Park 2006, P.O. Box 524, South Africa"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Steeb", 
        "givenName": "Willi-Hans", 
        "type": "Person"
      }
    ], 
    "datePublished": "2001", 
    "datePublishedReg": "2001-01-01", 
    "description": "Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart.", 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-0348-8366-5_17", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-7643-6610-0", 
        "978-3-0348-8366-5"
      ], 
      "name": "Classical and Quantum Computing", 
      "type": "Book"
    }, 
    "name": "Quantum Bits and Quantum Computation", 
    "pagination": "451-490", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-0348-8366-5_17"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "7d8be26c52be60d791e9dab388fa573b0df08b23ca9170c8ee388212fc8e2f24"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1026353261"
        ]
      }
    ], 
    "publisher": {
      "location": "Basel", 
      "name": "Birkh\u00e4user Basel", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-0348-8366-5_17", 
      "https://app.dimensions.ai/details/publication/pub.1026353261"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T11:18", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8660_00000045.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-0348-8366-5_17"
  }
]
 

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/978-3-0348-8366-5_17'

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/978-3-0348-8366-5_17'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-0348-8366-5_17'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-0348-8366-5_17'


 

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

64 TRIPLES      21 PREDICATES      26 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-0348-8366-5_17 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nc9633788a04d40798e8abf5fd25a56f8
4 schema:datePublished 2001
5 schema:datePublishedReg 2001-01-01
6 schema:description Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart.
7 schema:genre chapter
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isPartOf N118789233b784a08bdc1cd4f47622480
11 schema:name Quantum Bits and Quantum Computation
12 schema:pagination 451-490
13 schema:productId N24eea8fc49464b98ad3252c57cc07d2d
14 N5fdf3b5cd01d42338a68bc51b24913f9
15 N94add33ff80a4e58823fd0719f3e0b5a
16 schema:publisher Nac45aba9e68345678ba60c23c3b2f128
17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026353261
18 https://doi.org/10.1007/978-3-0348-8366-5_17
19 schema:sdDatePublished 2019-04-15T11:18
20 schema:sdLicense https://scigraph.springernature.com/explorer/license/
21 schema:sdPublisher Na674db9cb08f46c99f82862ddc52b3fb
22 schema:url http://link.springer.com/10.1007/978-3-0348-8366-5_17
23 sgo:license sg:explorer/license/
24 sgo:sdDataset chapters
25 rdf:type schema:Chapter
26 N118789233b784a08bdc1cd4f47622480 schema:isbn 978-3-0348-8366-5
27 978-3-7643-6610-0
28 schema:name Classical and Quantum Computing
29 rdf:type schema:Book
30 N24eea8fc49464b98ad3252c57cc07d2d schema:name dimensions_id
31 schema:value pub.1026353261
32 rdf:type schema:PropertyValue
33 N29f3e898f6fc49e8826ab9d4b0adb52c rdf:first N8ecfd369d1ce4c068681cd22239bc4e2
34 rdf:rest rdf:nil
35 N5fdf3b5cd01d42338a68bc51b24913f9 schema:name readcube_id
36 schema:value 7d8be26c52be60d791e9dab388fa573b0df08b23ca9170c8ee388212fc8e2f24
37 rdf:type schema:PropertyValue
38 N8ecfd369d1ce4c068681cd22239bc4e2 schema:affiliation https://www.grid.ac/institutes/grid.412988.e
39 schema:familyName Steeb
40 schema:givenName Willi-Hans
41 rdf:type schema:Person
42 N94add33ff80a4e58823fd0719f3e0b5a schema:name doi
43 schema:value 10.1007/978-3-0348-8366-5_17
44 rdf:type schema:PropertyValue
45 Na674db9cb08f46c99f82862ddc52b3fb schema:name Springer Nature - SN SciGraph project
46 rdf:type schema:Organization
47 Nac45aba9e68345678ba60c23c3b2f128 schema:location Basel
48 schema:name Birkhäuser Basel
49 rdf:type schema:Organisation
50 Nc9633788a04d40798e8abf5fd25a56f8 rdf:first Ndf903c4163244e778b8dad67f6883851
51 rdf:rest N29f3e898f6fc49e8826ab9d4b0adb52c
52 Ndf903c4163244e778b8dad67f6883851 schema:affiliation https://www.grid.ac/institutes/grid.412988.e
53 schema:familyName Hardy
54 schema:givenName Yorick
55 rdf:type schema:Person
56 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
57 schema:name Information and Computing Sciences
58 rdf:type schema:DefinedTerm
59 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
60 schema:name Computation Theory and Mathematics
61 rdf:type schema:DefinedTerm
62 https://www.grid.ac/institutes/grid.412988.e schema:alternateName University of Johannesburg
63 schema:name International School for Scientific Computing, Rand Afrikaans University, Auckland Park 2006, P.O. Box 524, South Africa
64 rdf:type schema:Organization
 




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


...