Automatic synthesis algorithm for quantum computing circuit model View Homepage


Ontology type: schema:MonetaryGrant     


Grant Info

YEARS

2011-2013

FUNDING AMOUNT

210000 CNY

ABSTRACT

Complex quantum circuits are described in the common language of quantum computing, quantum circuit is reversible, reversible circuit also widely used in low-power CMOS circuitry, nanotechnology, optical computing and other fields, according to how the optimal design requirements for automatic quantum circuit, which description, implementation and optimization of quantum algorithms is particularly important. The problem in the long term on the basis of in-depth research, based on the truth table, template, Reed-Muller and group theory reversible logic synthesis algorithm, combining the characteristics of quantum circuits is proposed based on the new Hash table based flutter extension transformation fast algorithm for integrated quantum 3 and 4 quantum circuit; combined group theory, quantum circuits decomposition algorithm designed to optimize the efficient design of large-scale quantum circuits; propose fast quantum integrated circuit based on the optimal NCV novel quantum logic gates algorithm library for the proposed synthesis algorithm based on quantum logic gates, a common non-efficient new method; automatic configuration of new quantum algorithms door to find more and better new quantum gates; quantum computation and quantum communication, quantum measurement-related automatic synthesis algorithm complex quantum circuits. Objectively analyzed and compared with each general optimization algorithm, to build a comprehensive unified algorithm running, testing, analysis and design of the auxiliary common experimental platform. More... »

URL

http://npd.nsfc.gov.cn/projectDetail.action?pid=61070240

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/2208", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "type": "DefinedTerm"
      }
    ], 
    "amount": {
      "currency": "CNY", 
      "type": "MonetaryAmount", 
      "value": "210000"
    }, 
    "description": "Complex quantum circuits are described in the common language of quantum computing, quantum circuit is reversible, reversible circuit also widely used in low-power CMOS circuitry, nanotechnology, optical computing and other fields, according to how the optimal design requirements for automatic quantum circuit, which description, implementation and optimization of quantum algorithms is particularly important. The problem in the long term on the basis of in-depth research, based on the truth table, template, Reed-Muller and group theory reversible logic synthesis algorithm, combining the characteristics of quantum circuits is proposed based on the new Hash table based flutter extension transformation fast algorithm for integrated quantum 3 and 4 quantum circuit; combined group theory, quantum circuits decomposition algorithm designed to optimize the efficient design of large-scale quantum circuits; propose fast quantum integrated circuit based on the optimal NCV novel quantum logic gates algorithm library for the proposed synthesis algorithm based on quantum logic gates, a common non-efficient new method; automatic configuration of new quantum algorithms door to find more and better new quantum gates; quantum computation and quantum communication, quantum measurement-related automatic synthesis algorithm complex quantum circuits. Objectively analyzed and compared with each general optimization algorithm, to build a comprehensive unified algorithm running, testing, analysis and design of the auxiliary common experimental platform.", 
    "endDate": "2013-12-31T00:00:00Z", 
    "funder": {
      "id": "https://www.grid.ac/institutes/grid.419696.5", 
      "type": "Organization"
    }, 
    "id": "sg:grant.5013317", 
    "identifier": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "5013317"
        ]
      }, 
      {
        "name": "nsfc_id", 
        "type": "PropertyValue", 
        "value": [
          "61070240"
        ]
      }
    ], 
    "inLanguage": [
      "zh"
    ], 
    "keywords": [
      "large-scale quantum circuits", 
      "implementation", 
      "template", 
      "low-power CMOS circuitry", 
      "quantum algorithms", 
      "problem", 
      "reversible circuits", 
      "quantum computing circuit model", 
      "flutter extension transformation", 
      "quantum logic gates", 
      "library", 
      "comprehensive unified algorithm", 
      "new quantum algorithms door", 
      "optimal design requirements", 
      "efficient design", 
      "design", 
      "Reed-Muller", 
      "better new quantum gates", 
      "circuit", 
      "common non-efficient new method", 
      "quantum computation", 
      "optimization", 
      "synthesis algorithm", 
      "testing", 
      "common language", 
      "quantum 3", 
      "automatic synthesis algorithm", 
      "optical computing", 
      "truth table", 
      "general optimization algorithm", 
      "depth research", 
      "quantum measurement", 
      "algorithm", 
      "optimal NCV novel", 
      "quantum communication", 
      "auxiliary common experimental platform", 
      "complex quantum circuits", 
      "new Hash table", 
      "automatic quantum circuit", 
      "description", 
      "quantum circuits decomposition algorithm", 
      "group theory", 
      "reversible logic synthesis algorithm", 
      "quantum computing", 
      "quantum circuits", 
      "characteristics", 
      "other fields", 
      "basis", 
      "analysis", 
      "automatic configuration", 
      "nanotechnology", 
      "long term"
    ], 
    "name": "Automatic synthesis algorithm for quantum computing circuit model", 
    "recipient": [
      {
        "id": "https://www.grid.ac/institutes/grid.268415.c", 
        "type": "Organization"
      }, 
      {
        "affiliation": {
          "id": "https://www.grid.ac/institutes/grid.268415.c", 
          "name": "Yangzhou University", 
          "type": "Organization"
        }, 
        "familyName": "Li", 
        "givenName": "Zhi Qiang", 
        "id": "sg:person.01336605353.12", 
        "type": "Person"
      }, 
      {
        "member": "sg:person.01336605353.12", 
        "roleName": "PI", 
        "type": "Role"
      }
    ], 
    "sameAs": [
      "https://app.dimensions.ai/details/grant/grant.5013317"
    ], 
    "sdDataset": "grants", 
    "sdDatePublished": "2019-03-07T12:39", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com.uberresearch.data.processor/core_data/20181219_192338/projects/base/nsfc_projects_0.xml.gz", 
    "startDate": "2011-01-01T00:00:00Z", 
    "type": "MonetaryGrant", 
    "url": "http://npd.nsfc.gov.cn/projectDetail.action?pid=61070240"
  }
]
 

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/grant.5013317'

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

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/grant.5013317'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/grant.5013317'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/grant.5013317'


 

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

96 TRIPLES      19 PREDICATES      74 URIs      66 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:grant.5013317 schema:about anzsrc-for:2208
2 schema:amount Nf4adf0ca30bc4eaf8769b5cc31a47dbe
3 schema:description Complex quantum circuits are described in the common language of quantum computing, quantum circuit is reversible, reversible circuit also widely used in low-power CMOS circuitry, nanotechnology, optical computing and other fields, according to how the optimal design requirements for automatic quantum circuit, which description, implementation and optimization of quantum algorithms is particularly important. The problem in the long term on the basis of in-depth research, based on the truth table, template, Reed-Muller and group theory reversible logic synthesis algorithm, combining the characteristics of quantum circuits is proposed based on the new Hash table based flutter extension transformation fast algorithm for integrated quantum 3 and 4 quantum circuit; combined group theory, quantum circuits decomposition algorithm designed to optimize the efficient design of large-scale quantum circuits; propose fast quantum integrated circuit based on the optimal NCV novel quantum logic gates algorithm library for the proposed synthesis algorithm based on quantum logic gates, a common non-efficient new method; automatic configuration of new quantum algorithms door to find more and better new quantum gates; quantum computation and quantum communication, quantum measurement-related automatic synthesis algorithm complex quantum circuits. Objectively analyzed and compared with each general optimization algorithm, to build a comprehensive unified algorithm running, testing, analysis and design of the auxiliary common experimental platform.
4 schema:endDate 2013-12-31T00:00:00Z
5 schema:funder https://www.grid.ac/institutes/grid.419696.5
6 schema:identifier N3585093e9d2146a5bd51d268e026bffe
7 Na1ae6ee689464a438764684315a48fa6
8 schema:inLanguage zh
9 schema:keywords Reed-Muller
10 algorithm
11 analysis
12 automatic configuration
13 automatic quantum circuit
14 automatic synthesis algorithm
15 auxiliary common experimental platform
16 basis
17 better new quantum gates
18 characteristics
19 circuit
20 common language
21 common non-efficient new method
22 complex quantum circuits
23 comprehensive unified algorithm
24 depth research
25 description
26 design
27 efficient design
28 flutter extension transformation
29 general optimization algorithm
30 group theory
31 implementation
32 large-scale quantum circuits
33 library
34 long term
35 low-power CMOS circuitry
36 nanotechnology
37 new Hash table
38 new quantum algorithms door
39 optical computing
40 optimal NCV novel
41 optimal design requirements
42 optimization
43 other fields
44 problem
45 quantum 3
46 quantum algorithms
47 quantum circuits
48 quantum circuits decomposition algorithm
49 quantum communication
50 quantum computation
51 quantum computing
52 quantum computing circuit model
53 quantum logic gates
54 quantum measurement
55 reversible circuits
56 reversible logic synthesis algorithm
57 synthesis algorithm
58 template
59 testing
60 truth table
61 schema:name Automatic synthesis algorithm for quantum computing circuit model
62 schema:recipient Neb53599b4f164982b802f6639f92f6d7
63 sg:person.01336605353.12
64 https://www.grid.ac/institutes/grid.268415.c
65 schema:sameAs https://app.dimensions.ai/details/grant/grant.5013317
66 schema:sdDatePublished 2019-03-07T12:39
67 schema:sdLicense https://scigraph.springernature.com/explorer/license/
68 schema:sdPublisher N5508db20301544568d129eba907a8411
69 schema:startDate 2011-01-01T00:00:00Z
70 schema:url http://npd.nsfc.gov.cn/projectDetail.action?pid=61070240
71 sgo:license sg:explorer/license/
72 sgo:sdDataset grants
73 rdf:type schema:MonetaryGrant
74 N3585093e9d2146a5bd51d268e026bffe schema:name nsfc_id
75 schema:value 61070240
76 rdf:type schema:PropertyValue
77 N5508db20301544568d129eba907a8411 schema:name Springer Nature - SN SciGraph project
78 rdf:type schema:Organization
79 Na1ae6ee689464a438764684315a48fa6 schema:name dimensions_id
80 schema:value 5013317
81 rdf:type schema:PropertyValue
82 Neb53599b4f164982b802f6639f92f6d7 schema:member sg:person.01336605353.12
83 schema:roleName PI
84 rdf:type schema:Role
85 Nf4adf0ca30bc4eaf8769b5cc31a47dbe schema:currency CNY
86 schema:value 210000
87 rdf:type schema:MonetaryAmount
88 anzsrc-for:2208 schema:inDefinedTermSet anzsrc-for:
89 rdf:type schema:DefinedTerm
90 sg:person.01336605353.12 schema:affiliation https://www.grid.ac/institutes/grid.268415.c
91 schema:familyName Li
92 schema:givenName Zhi Qiang
93 rdf:type schema:Person
94 https://www.grid.ac/institutes/grid.268415.c schema:name Yangzhou University
95 rdf:type schema:Organization
96 https://www.grid.ac/institutes/grid.419696.5 schema:Organization
 




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


...