Methods Of Adiabatic Quantum Computation


Ontology type: sgo:Patent     


Patent Info

DATE

N/A

AUTHORS

AMIN, DR. MOHAMMAD H.

ABSTRACT

A method for quantum computing using a quantum system comprising a plurality of qubits is provided. The system can be in any one of at least two configurations at any given time including one characterized by an initialization Hamiltonian Ho and one characterized by a problem Hamiltonian HP. The problem Hamiltonian HP has a final state. Each respective first qubit in the qubits is arranged with respect to a respective second qubit in the qubits such that they define a predetermined coupling strength. The predetermined coupling strengths between the qubits in the plurality of qubits collectively define a computational problem to be solved. In the method, the system is initialized to Ho and is then adiabatically changed until the system is described by the final state of the problem Hamiltonian HP. Then the state of the system is read out by probing an observable of the σx Pauli matrix operator. More... »

Related SciGraph Publications

  • 2005. Simulated Quantum Annealing by the Real-time Evolution in QUANTUM ANNEALING AND OTHER OPTIMIZATION METHODS
  • 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/2581", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "name": "AMIN, DR. MOHAMMAD H.", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/11526216_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018641186", 
              "https://doi.org/10.1007/11526216_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1103/physreva.65.042308", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033767072"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "description": "

    A method for quantum computing using a quantum system comprising a plurality of qubits is provided. The system can be in any one of at least two configurations at any given time including one characterized by an initialization Hamiltonian Ho and one characterized by a problem Hamiltonian HP. The problem Hamiltonian HP has a final state. Each respective first qubit in the qubits is arranged with respect to a respective second qubit in the qubits such that they define a predetermined coupling strength. The predetermined coupling strengths between the qubits in the plurality of qubits collectively define a computational problem to be solved. In the method, the system is initialized to Ho and is then adiabatically changed until the system is described by the final state of the problem Hamiltonian HP. Then the state of the system is read out by probing an observable of the σx Pauli matrix operator.

    ", "id": "sg:patent.EP-1974315-A1", "keywords": [ "adiabatic quantum computation", "method", "quantum", "quantum system", "plurality", "qubits", "configuration", "given time", "initialization", "Hamiltonian", "final state", "respect", "coupling strength", "computational problem", "HO", "state", "operator" ], "name": "METHODS OF ADIABATIC QUANTUM COMPUTATION", "recipient": [ { "id": "https://www.grid.ac/institutes/grid.421761.7", "type": "Organization" } ], "sameAs": [ "https://app.dimensions.ai/details/patent/EP-1974315-A1" ], "sdDataset": "patents", "sdDatePublished": "2019-03-07T15:32", "sdLicense": "https://scigraph.springernature.com/explorer/license/", "sdPublisher": { "name": "Springer Nature - SN SciGraph project", "type": "Organization" }, "sdSource": "s3://com.uberresearch.data.dev.patents-pipeline/full_run_10/sn-export/5eb3e5a348d7f117b22cc85fb0b02730/0000100128-0000348334/json_export_1a463c9e.jsonl", "type": "Patent" } ]
     

    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/patent.EP-1974315-A1'

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

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/patent.EP-1974315-A1'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/patent.EP-1974315-A1'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/patent.EP-1974315-A1'


     

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

    45 TRIPLES      14 PREDICATES      32 URIs      24 LITERALS      2 BLANK NODES

    Subject Predicate Object
    1 sg:patent.EP-1974315-A1 schema:about anzsrc-for:2581
    2 schema:author Ned164e0b9b4d4a148a8180dcd33c9558
    3 schema:citation sg:pub.10.1007/11526216_8
    4 https://doi.org/10.1103/physreva.65.042308
    5 schema:description <p>A method for quantum computing using a quantum system comprising a plurality of qubits is provided. The system can be in any one of at least two configurations at any given time including one characterized by an initialization Hamiltonian Ho and one characterized by a problem Hamiltonian HP. The problem Hamiltonian HP has a final state. Each respective first qubit in the qubits is arranged with respect to a respective second qubit in the qubits such that they define a predetermined coupling strength. The predetermined coupling strengths between the qubits in the plurality of qubits collectively define a computational problem to be solved. In the method, the system is initialized to Ho and is then adiabatically changed until the system is described by the final state of the problem Hamiltonian HP. Then the state of the system is read out by probing an observable of the &#963;x Pauli matrix operator.</p>
    6 schema:keywords HO
    7 Hamiltonian
    8 adiabatic quantum computation
    9 computational problem
    10 configuration
    11 coupling strength
    12 final state
    13 given time
    14 initialization
    15 method
    16 operator
    17 plurality
    18 quantum
    19 quantum system
    20 qubits
    21 respect
    22 state
    23 schema:name METHODS OF ADIABATIC QUANTUM COMPUTATION
    24 schema:recipient https://www.grid.ac/institutes/grid.421761.7
    25 schema:sameAs https://app.dimensions.ai/details/patent/EP-1974315-A1
    26 schema:sdDatePublished 2019-03-07T15:32
    27 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    28 schema:sdPublisher N716591ff0c9d48f2b7dc8b6a2d7e0a78
    29 sgo:license sg:explorer/license/
    30 sgo:sdDataset patents
    31 rdf:type sgo:Patent
    32 N716591ff0c9d48f2b7dc8b6a2d7e0a78 schema:name Springer Nature - SN SciGraph project
    33 rdf:type schema:Organization
    34 Nd387e72670e54dcb92958f5f88fd5cd4 schema:name AMIN, DR. MOHAMMAD H.
    35 rdf:type schema:Person
    36 Ned164e0b9b4d4a148a8180dcd33c9558 rdf:first Nd387e72670e54dcb92958f5f88fd5cd4
    37 rdf:rest rdf:nil
    38 anzsrc-for:2581 schema:inDefinedTermSet anzsrc-for:
    39 rdf:type schema:DefinedTerm
    40 sg:pub.10.1007/11526216_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018641186
    41 https://doi.org/10.1007/11526216_8
    42 rdf:type schema:CreativeWork
    43 https://doi.org/10.1103/physreva.65.042308 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033767072
    44 rdf:type schema:CreativeWork
    45 https://www.grid.ac/institutes/grid.421761.7 schema:Organization
     




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


    ...