An Algorithmic Approach for Generating Quantum Ternary Superposition Operators and Related Performance Measures View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2018-10-05

AUTHORS

Bipulan Gain , Sudhindu Bikash Mandal , Amlan Chakrabarti , Subhansu Bandyopadhyay

ABSTRACT

Quantum computing promises to outperform classical computing in terms of algorithmic speedup for certain classes of computational problems. A quantum algorithm exploits quantum mechanical processes like superposition, interference, and entanglement that works on quantum states of matter providing exponential or super polynomial speedup. In recent times, multi-valued quantum computing is gaining popularity due to its higher state space dimension, and ternary quantum computing is one of the most popular multi-valued quantum computing. In this paper, we propose an algorithmic approach for the generation of quantum ternary superposition operators and evaluating them in terms of trace distance, fidelity, and the entanglement measure. We also propose five new quantum ternary superposition operators, which have larger trace distance and smaller fidelity than the existing ternary superposition operators “Chrestenson gates” and “S-gate” (Sudhindu Bikash, IEEE Comput Soc 2014, [1]). To characterize the amount of entanglement in two given qutrit composite ternary states, we also measure the concurrence of the newly proposed and the existing quantum superposition operators. We have shown that the newly proposed superposition operators generate maximally entangled states with concurrence equal to 1. More... »

PAGES

273-287

Book

TITLE

Proceedings of International Ethical Hacking Conference 2018

ISBN

978-981-13-1543-5
978-981-13-1544-2

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-981-13-1544-2_23

DOI

http://dx.doi.org/10.1007/978-981-13-1544-2_23

DIMENSIONS

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


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": {
          "name": [
            "Department of Computer Science and Engineering, Brainwere University, Kolkata, West Bengal, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gain", 
        "givenName": "Bipulan", 
        "id": "sg:person.015533106251.57", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015533106251.57"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "Regent Education and Research Foundation, Kolkata, West Bengal, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mandal", 
        "givenName": "Sudhindu Bikash", 
        "id": "sg:person.011374127355.48", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011374127355.48"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Calcutta", 
          "id": "https://www.grid.ac/institutes/grid.59056.3f", 
          "name": [
            "A.K.Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chakrabarti", 
        "givenName": "Amlan", 
        "id": "sg:person.010222361716.17", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010222361716.17"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "Department of Computer Science and Engineering, Brainwere University, Kolkata, West Bengal, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bandyopadhyay", 
        "givenName": "Subhansu", 
        "id": "sg:person.010525130071.44", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010525130071.44"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1109/ismvl.2014.39", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095404493"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-10-05", 
    "datePublishedReg": "2018-10-05", 
    "description": "Quantum computing promises to outperform classical computing in terms of algorithmic speedup for certain classes of computational problems. A quantum algorithm exploits quantum mechanical processes like superposition, interference, and entanglement that works on quantum states of matter providing exponential or super polynomial speedup. In recent times, multi-valued quantum computing is gaining popularity due to its higher state space dimension, and ternary quantum computing is one of the most popular multi-valued quantum computing. In this paper, we propose an algorithmic approach for the generation of quantum ternary superposition operators and evaluating them in terms of trace distance, fidelity, and the entanglement measure. We also propose five new quantum ternary superposition operators, which have larger trace distance and smaller fidelity than the existing ternary superposition operators \u201cChrestenson gates\u201d and \u201cS-gate\u201d (Sudhindu Bikash, IEEE Comput Soc 2014, [1]). To characterize the amount of entanglement in two given qutrit composite ternary states, we also measure the concurrence of the newly proposed and the existing quantum superposition operators. We have shown that the newly proposed superposition operators generate maximally entangled states with concurrence equal to 1.", 
    "editor": [
      {
        "familyName": "Chakraborty", 
        "givenName": "Mohuya", 
        "type": "Person"
      }, 
      {
        "familyName": "Chakrabarti", 
        "givenName": "Satyajit", 
        "type": "Person"
      }, 
      {
        "familyName": "Balas", 
        "givenName": "Valentina Emilia", 
        "type": "Person"
      }, 
      {
        "familyName": "Mandal", 
        "givenName": "J. K.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-981-13-1544-2_23", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-981-13-1543-5", 
        "978-981-13-1544-2"
      ], 
      "name": "Proceedings of International Ethical Hacking Conference 2018", 
      "type": "Book"
    }, 
    "name": "An Algorithmic Approach for Generating Quantum Ternary Superposition Operators and Related Performance Measures", 
    "pagination": "273-287", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-981-13-1544-2_23"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "b036e7f6bdae017b20282996a4a040e795fd31c7c752f171e2a26c6d29c3928c"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1107414794"
        ]
      }
    ], 
    "publisher": {
      "location": "Singapore", 
      "name": "Springer Singapore", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-981-13-1544-2_23", 
      "https://app.dimensions.ai/details/publication/pub.1107414794"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T04:40", 
    "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/0000000322_0000000322/records_64987_00000000.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F978-981-13-1544-2_23"
  }
]
 

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-981-13-1544-2_23'

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-981-13-1544-2_23'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-981-13-1544-2_23'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-981-13-1544-2_23'


 

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

110 TRIPLES      23 PREDICATES      27 URIs      19 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-981-13-1544-2_23 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N6c05e73250cf4d9d9bec68b66eb4c540
4 schema:citation https://doi.org/10.1109/ismvl.2014.39
5 schema:datePublished 2018-10-05
6 schema:datePublishedReg 2018-10-05
7 schema:description Quantum computing promises to outperform classical computing in terms of algorithmic speedup for certain classes of computational problems. A quantum algorithm exploits quantum mechanical processes like superposition, interference, and entanglement that works on quantum states of matter providing exponential or super polynomial speedup. In recent times, multi-valued quantum computing is gaining popularity due to its higher state space dimension, and ternary quantum computing is one of the most popular multi-valued quantum computing. In this paper, we propose an algorithmic approach for the generation of quantum ternary superposition operators and evaluating them in terms of trace distance, fidelity, and the entanglement measure. We also propose five new quantum ternary superposition operators, which have larger trace distance and smaller fidelity than the existing ternary superposition operators “Chrestenson gates” and “S-gate” (Sudhindu Bikash, IEEE Comput Soc 2014, [1]). To characterize the amount of entanglement in two given qutrit composite ternary states, we also measure the concurrence of the newly proposed and the existing quantum superposition operators. We have shown that the newly proposed superposition operators generate maximally entangled states with concurrence equal to 1.
8 schema:editor N56072b4fb41c45eaa18b464217a1c177
9 schema:genre chapter
10 schema:inLanguage en
11 schema:isAccessibleForFree false
12 schema:isPartOf N132745c23da04ba6b68e531eef8e4cf1
13 schema:name An Algorithmic Approach for Generating Quantum Ternary Superposition Operators and Related Performance Measures
14 schema:pagination 273-287
15 schema:productId N08adbd98556c4ab29f242386198bd4a7
16 Nc757a925298c43b19d3bba12f974e726
17 Ne93a62b2fc4d43dcb686c3373015bd94
18 schema:publisher Nab0b4109c8664fab89eec2ce717a4ee4
19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1107414794
20 https://doi.org/10.1007/978-981-13-1544-2_23
21 schema:sdDatePublished 2019-04-16T04:40
22 schema:sdLicense https://scigraph.springernature.com/explorer/license/
23 schema:sdPublisher N4e22cb776d0e41c482efb6400e46318b
24 schema:url https://link.springer.com/10.1007%2F978-981-13-1544-2_23
25 sgo:license sg:explorer/license/
26 sgo:sdDataset chapters
27 rdf:type schema:Chapter
28 N0341d387a03142ff891df58b9a74d4a7 rdf:first N799cbda9db77444aafd92b199b39deae
29 rdf:rest rdf:nil
30 N08adbd98556c4ab29f242386198bd4a7 schema:name doi
31 schema:value 10.1007/978-981-13-1544-2_23
32 rdf:type schema:PropertyValue
33 N132745c23da04ba6b68e531eef8e4cf1 schema:isbn 978-981-13-1543-5
34 978-981-13-1544-2
35 schema:name Proceedings of International Ethical Hacking Conference 2018
36 rdf:type schema:Book
37 N208a4ecd51ef42409ef06fe230d6e384 schema:familyName Balas
38 schema:givenName Valentina Emilia
39 rdf:type schema:Person
40 N246113ad4f6d460aa28faeaa4dc074c3 schema:familyName Chakraborty
41 schema:givenName Mohuya
42 rdf:type schema:Person
43 N4e22cb776d0e41c482efb6400e46318b schema:name Springer Nature - SN SciGraph project
44 rdf:type schema:Organization
45 N56072b4fb41c45eaa18b464217a1c177 rdf:first N246113ad4f6d460aa28faeaa4dc074c3
46 rdf:rest Nc2a17c2f6e2748349fffea711eb3e9a5
47 N5b85f8e322894be4b1105f686d978da1 schema:name Department of Computer Science and Engineering, Brainwere University, Kolkata, West Bengal, India
48 rdf:type schema:Organization
49 N68091bb8ca384a6694adeee049a7a15c schema:name Department of Computer Science and Engineering, Brainwere University, Kolkata, West Bengal, India
50 rdf:type schema:Organization
51 N6c05e73250cf4d9d9bec68b66eb4c540 rdf:first sg:person.015533106251.57
52 rdf:rest N877342a38cce4ff2a94d11a898268234
53 N799cbda9db77444aafd92b199b39deae schema:familyName Mandal
54 schema:givenName J. K.
55 rdf:type schema:Person
56 N877342a38cce4ff2a94d11a898268234 rdf:first sg:person.011374127355.48
57 rdf:rest Ne5e53ab351424c0da723532418dea997
58 N8c5f1f19d8f04b3db4e642d5c172867a schema:name Regent Education and Research Foundation, Kolkata, West Bengal, India
59 rdf:type schema:Organization
60 N94ce8a75da1a488880e7917c6e215ae6 rdf:first N208a4ecd51ef42409ef06fe230d6e384
61 rdf:rest N0341d387a03142ff891df58b9a74d4a7
62 N9be4dbefd4e148d28ee74ff1bf315f57 rdf:first sg:person.010525130071.44
63 rdf:rest rdf:nil
64 Nab0b4109c8664fab89eec2ce717a4ee4 schema:location Singapore
65 schema:name Springer Singapore
66 rdf:type schema:Organisation
67 Nc2a17c2f6e2748349fffea711eb3e9a5 rdf:first Nf705a600c9d5424199c88865b676d95d
68 rdf:rest N94ce8a75da1a488880e7917c6e215ae6
69 Nc757a925298c43b19d3bba12f974e726 schema:name dimensions_id
70 schema:value pub.1107414794
71 rdf:type schema:PropertyValue
72 Ne5e53ab351424c0da723532418dea997 rdf:first sg:person.010222361716.17
73 rdf:rest N9be4dbefd4e148d28ee74ff1bf315f57
74 Ne93a62b2fc4d43dcb686c3373015bd94 schema:name readcube_id
75 schema:value b036e7f6bdae017b20282996a4a040e795fd31c7c752f171e2a26c6d29c3928c
76 rdf:type schema:PropertyValue
77 Nf705a600c9d5424199c88865b676d95d schema:familyName Chakrabarti
78 schema:givenName Satyajit
79 rdf:type schema:Person
80 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
81 schema:name Information and Computing Sciences
82 rdf:type schema:DefinedTerm
83 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
84 schema:name Computation Theory and Mathematics
85 rdf:type schema:DefinedTerm
86 sg:person.010222361716.17 schema:affiliation https://www.grid.ac/institutes/grid.59056.3f
87 schema:familyName Chakrabarti
88 schema:givenName Amlan
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010222361716.17
90 rdf:type schema:Person
91 sg:person.010525130071.44 schema:affiliation N5b85f8e322894be4b1105f686d978da1
92 schema:familyName Bandyopadhyay
93 schema:givenName Subhansu
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010525130071.44
95 rdf:type schema:Person
96 sg:person.011374127355.48 schema:affiliation N8c5f1f19d8f04b3db4e642d5c172867a
97 schema:familyName Mandal
98 schema:givenName Sudhindu Bikash
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011374127355.48
100 rdf:type schema:Person
101 sg:person.015533106251.57 schema:affiliation N68091bb8ca384a6694adeee049a7a15c
102 schema:familyName Gain
103 schema:givenName Bipulan
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015533106251.57
105 rdf:type schema:Person
106 https://doi.org/10.1109/ismvl.2014.39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095404493
107 rdf:type schema:CreativeWork
108 https://www.grid.ac/institutes/grid.59056.3f schema:alternateName University of Calcutta
109 schema:name A.K.Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India
110 rdf:type schema:Organization
 




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


...