A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions Article Swipe
Rajiv Krishnakumar
,
Mathias Soeken
,
Martin Roetteler
,
William J. Zeng
·
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2210.11786
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2210.11786
In this paper, we present Q# implementations for arbitrary single-variabled fixed-point arithmetic operations for a gate-based quantum computer based on lookup tables (LUTs). In general, this is an inefficent way of implementing a function since the number of inputs can be large or even infinite. However, if the input domain can be bounded and there can be some error tolerance in the output (both of which are often the case in practical use-cases), the quantum LUT implementation of certain quantum arithmetic functions can be more efficient than their corresponding reversible arithmetic implementations. We discuss the implementation of the LUT using Q\# and its approximation errors. We then show examples of how to use the LUT to implement quantum arithmetic functions and compare the resources required for the implementation with the current state-of-the-art bespoke implementations of some commonly used arithmetic functions. The implementation of the LUT is designed for use by practitioners to use when implementing end-to-end quantum algorithms. In addition, given its well-defined approximation errors, the LUT implementation makes for a clear benchmark for evaluating the efficiency of bespoke quantum arithmetic circuits .
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2210.11786
- https://arxiv.org/pdf/2210.11786
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4307205408
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4307205408Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2210.11786Digital Object Identifier
- Title
-
A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic FunctionsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-10-21Full publication date if available
- Authors
-
Rajiv Krishnakumar, Mathias Soeken, Martin Roetteler, William J. ZengList of authors in order
- Landing page
-
https://arxiv.org/abs/2210.11786Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2210.11786Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2210.11786Direct OA link when available
- Concepts
-
Lookup table, Arithmetic, Computer science, Arbitrary-precision arithmetic, Quantum computer, Benchmark (surveying), Table (database), Quantum, Quantum algorithm, Algorithm, Parallel computing, Mathematics, Quantum mechanics, Physics, Programming language, Data mining, Geodesy, GeographyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4307205408 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2210.11786 |
| ids.doi | https://doi.org/10.48550/arxiv.2210.11786 |
| ids.openalex | https://openalex.org/W4307205408 |
| fwci | 0.0 |
| type | preprint |
| title | A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10682 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9975000023841858 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Quantum Computing Algorithms and Architecture |
| topics[1].id | https://openalex.org/T11697 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9789999723434448 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Numerical Methods and Algorithms |
| topics[2].id | https://openalex.org/T10054 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9549999833106995 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1708 |
| topics[2].subfield.display_name | Hardware and Architecture |
| topics[2].display_name | Parallel Computing and Optimization Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C134835016 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7808983325958252 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q690265 |
| concepts[0].display_name | Lookup table |
| concepts[1].id | https://openalex.org/C94375191 |
| concepts[1].level | 1 |
| concepts[1].score | 0.7243002653121948 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q11205 |
| concepts[1].display_name | Arithmetic |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6433452367782593 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C83581934 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5995517373085022 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q527381 |
| concepts[3].display_name | Arbitrary-precision arithmetic |
| concepts[4].id | https://openalex.org/C58053490 |
| concepts[4].level | 3 |
| concepts[4].score | 0.5174177885055542 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q176555 |
| concepts[4].display_name | Quantum computer |
| concepts[5].id | https://openalex.org/C185798385 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5009112358093262 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1161707 |
| concepts[5].display_name | Benchmark (surveying) |
| concepts[6].id | https://openalex.org/C45235069 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4464261531829834 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q278425 |
| concepts[6].display_name | Table (database) |
| concepts[7].id | https://openalex.org/C84114770 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4321141839027405 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q46344 |
| concepts[7].display_name | Quantum |
| concepts[8].id | https://openalex.org/C137019171 |
| concepts[8].level | 3 |
| concepts[8].score | 0.415166974067688 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q2623817 |
| concepts[8].display_name | Quantum algorithm |
| concepts[9].id | https://openalex.org/C11413529 |
| concepts[9].level | 1 |
| concepts[9].score | 0.34780144691467285 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[9].display_name | Algorithm |
| concepts[10].id | https://openalex.org/C173608175 |
| concepts[10].level | 1 |
| concepts[10].score | 0.33318448066711426 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[10].display_name | Parallel computing |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.29017171263694763 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C62520636 |
| concepts[12].level | 1 |
| concepts[12].score | 0.08179637789726257 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q944 |
| concepts[12].display_name | Quantum mechanics |
| concepts[13].id | https://openalex.org/C121332964 |
| concepts[13].level | 0 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[13].display_name | Physics |
| concepts[14].id | https://openalex.org/C199360897 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[14].display_name | Programming language |
| concepts[15].id | https://openalex.org/C124101348 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q172491 |
| concepts[15].display_name | Data mining |
| concepts[16].id | https://openalex.org/C13280743 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q131089 |
| concepts[16].display_name | Geodesy |
| concepts[17].id | https://openalex.org/C205649164 |
| concepts[17].level | 0 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q1071 |
| concepts[17].display_name | Geography |
| keywords[0].id | https://openalex.org/keywords/lookup-table |
| keywords[0].score | 0.7808983325958252 |
| keywords[0].display_name | Lookup table |
| keywords[1].id | https://openalex.org/keywords/arithmetic |
| keywords[1].score | 0.7243002653121948 |
| keywords[1].display_name | Arithmetic |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6433452367782593 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/arbitrary-precision-arithmetic |
| keywords[3].score | 0.5995517373085022 |
| keywords[3].display_name | Arbitrary-precision arithmetic |
| keywords[4].id | https://openalex.org/keywords/quantum-computer |
| keywords[4].score | 0.5174177885055542 |
| keywords[4].display_name | Quantum computer |
| keywords[5].id | https://openalex.org/keywords/benchmark |
| keywords[5].score | 0.5009112358093262 |
| keywords[5].display_name | Benchmark (surveying) |
| keywords[6].id | https://openalex.org/keywords/table |
| keywords[6].score | 0.4464261531829834 |
| keywords[6].display_name | Table (database) |
| keywords[7].id | https://openalex.org/keywords/quantum |
| keywords[7].score | 0.4321141839027405 |
| keywords[7].display_name | Quantum |
| keywords[8].id | https://openalex.org/keywords/quantum-algorithm |
| keywords[8].score | 0.415166974067688 |
| keywords[8].display_name | Quantum algorithm |
| keywords[9].id | https://openalex.org/keywords/algorithm |
| keywords[9].score | 0.34780144691467285 |
| keywords[9].display_name | Algorithm |
| keywords[10].id | https://openalex.org/keywords/parallel-computing |
| keywords[10].score | 0.33318448066711426 |
| keywords[10].display_name | Parallel computing |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.29017171263694763 |
| keywords[11].display_name | Mathematics |
| keywords[12].id | https://openalex.org/keywords/quantum-mechanics |
| keywords[12].score | 0.08179637789726257 |
| keywords[12].display_name | Quantum mechanics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2210.11786 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2210.11786 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2210.11786 |
| locations[1].id | doi:10.48550/arxiv.2210.11786 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article-journal |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2210.11786 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5047722466 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-1843-235X |
| authorships[0].author.display_name | Rajiv Krishnakumar |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Krishnakumar, Rajiv |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5084007478 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0229-8766 |
| authorships[1].author.display_name | Mathias Soeken |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Soeken, Mathias |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5040193392 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-0234-2496 |
| authorships[2].author.display_name | Martin Roetteler |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Roetteler, Martin |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5024956640 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-0415-1397 |
| authorships[3].author.display_name | William J. Zeng |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Zeng, William J. |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2210.11786 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10682 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9975000023841858 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Quantum Computing Algorithms and Architecture |
| related_works | https://openalex.org/W1656092346, https://openalex.org/W2073476805, https://openalex.org/W2037029451, https://openalex.org/W4245068234, https://openalex.org/W1531645310, https://openalex.org/W2435153186, https://openalex.org/W2409877639, https://openalex.org/W4388704119, https://openalex.org/W2910123824, https://openalex.org/W2391934197 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2210.11786 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2210.11786 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2210.11786 |
| primary_location.id | pmh:oai:arXiv.org:2210.11786 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2210.11786 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2210.11786 |
| publication_date | 2022-10-21 |
| publication_year | 2022 |
| referenced_works_count | 0 |
| abstract_inverted_index.. | 182 |
| abstract_inverted_index.a | 14, 32, 170 |
| abstract_inverted_index.In | 0, 23, 158 |
| abstract_inverted_index.Q# | 5 |
| abstract_inverted_index.We | 92, 105 |
| abstract_inverted_index.an | 27 |
| abstract_inverted_index.be | 40, 51, 56, 83 |
| abstract_inverted_index.by | 149 |
| abstract_inverted_index.if | 46 |
| abstract_inverted_index.in | 60, 70 |
| abstract_inverted_index.is | 26, 145 |
| abstract_inverted_index.of | 30, 37, 64, 77, 96, 109, 134, 142, 177 |
| abstract_inverted_index.on | 19 |
| abstract_inverted_index.or | 42 |
| abstract_inverted_index.to | 111, 115, 151 |
| abstract_inverted_index.we | 3 |
| abstract_inverted_index.LUT | 75, 98, 114, 144, 166 |
| abstract_inverted_index.Q\# | 100 |
| abstract_inverted_index.The | 140 |
| abstract_inverted_index.and | 53, 101, 120 |
| abstract_inverted_index.are | 66 |
| abstract_inverted_index.can | 39, 50, 55, 82 |
| abstract_inverted_index.for | 7, 13, 125, 147, 169, 173 |
| abstract_inverted_index.how | 110 |
| abstract_inverted_index.its | 102, 161 |
| abstract_inverted_index.the | 35, 47, 61, 68, 73, 94, 97, 113, 122, 126, 129, 143, 165, 175 |
| abstract_inverted_index.use | 112, 148, 152 |
| abstract_inverted_index.way | 29 |
| abstract_inverted_index.case | 69 |
| abstract_inverted_index.even | 43 |
| abstract_inverted_index.more | 84 |
| abstract_inverted_index.show | 107 |
| abstract_inverted_index.some | 57, 135 |
| abstract_inverted_index.than | 86 |
| abstract_inverted_index.then | 106 |
| abstract_inverted_index.this | 1, 25 |
| abstract_inverted_index.used | 137 |
| abstract_inverted_index.when | 153 |
| abstract_inverted_index.with | 128 |
| abstract_inverted_index.(both | 63 |
| abstract_inverted_index.based | 18 |
| abstract_inverted_index.clear | 171 |
| abstract_inverted_index.error | 58 |
| abstract_inverted_index.given | 160 |
| abstract_inverted_index.input | 48 |
| abstract_inverted_index.large | 41 |
| abstract_inverted_index.makes | 168 |
| abstract_inverted_index.often | 67 |
| abstract_inverted_index.since | 34 |
| abstract_inverted_index.their | 87 |
| abstract_inverted_index.there | 54 |
| abstract_inverted_index.using | 99 |
| abstract_inverted_index.which | 65 |
| abstract_inverted_index.domain | 49 |
| abstract_inverted_index.inputs | 38 |
| abstract_inverted_index.lookup | 20 |
| abstract_inverted_index.number | 36 |
| abstract_inverted_index.output | 62 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.tables | 21 |
| abstract_inverted_index.(LUTs). | 22 |
| abstract_inverted_index.bespoke | 132, 178 |
| abstract_inverted_index.bounded | 52 |
| abstract_inverted_index.certain | 78 |
| abstract_inverted_index.compare | 121 |
| abstract_inverted_index.current | 130 |
| abstract_inverted_index.discuss | 93 |
| abstract_inverted_index.errors, | 164 |
| abstract_inverted_index.errors. | 104 |
| abstract_inverted_index.present | 4 |
| abstract_inverted_index.quantum | 16, 74, 79, 117, 156, 179 |
| abstract_inverted_index.However, | 45 |
| abstract_inverted_index.circuits | 181 |
| abstract_inverted_index.commonly | 136 |
| abstract_inverted_index.computer | 17 |
| abstract_inverted_index.designed | 146 |
| abstract_inverted_index.examples | 108 |
| abstract_inverted_index.function | 33 |
| abstract_inverted_index.general, | 24 |
| abstract_inverted_index.required | 124 |
| abstract_inverted_index.addition, | 159 |
| abstract_inverted_index.arbitrary | 8 |
| abstract_inverted_index.benchmark | 172 |
| abstract_inverted_index.efficient | 85 |
| abstract_inverted_index.functions | 81, 119 |
| abstract_inverted_index.implement | 116 |
| abstract_inverted_index.infinite. | 44 |
| abstract_inverted_index.practical | 71 |
| abstract_inverted_index.resources | 123 |
| abstract_inverted_index.tolerance | 59 |
| abstract_inverted_index.arithmetic | 11, 80, 90, 118, 138, 180 |
| abstract_inverted_index.efficiency | 176 |
| abstract_inverted_index.end-to-end | 155 |
| abstract_inverted_index.evaluating | 174 |
| abstract_inverted_index.functions. | 139 |
| abstract_inverted_index.gate-based | 15 |
| abstract_inverted_index.inefficent | 28 |
| abstract_inverted_index.operations | 12 |
| abstract_inverted_index.reversible | 89 |
| abstract_inverted_index.algorithms. | 157 |
| abstract_inverted_index.fixed-point | 10 |
| abstract_inverted_index.use-cases), | 72 |
| abstract_inverted_index.implementing | 31, 154 |
| abstract_inverted_index.well-defined | 162 |
| abstract_inverted_index.approximation | 103, 163 |
| abstract_inverted_index.corresponding | 88 |
| abstract_inverted_index.practitioners | 150 |
| abstract_inverted_index.implementation | 76, 95, 127, 141, 167 |
| abstract_inverted_index.implementations | 6, 133 |
| abstract_inverted_index.implementations. | 91 |
| abstract_inverted_index.single-variabled | 9 |
| abstract_inverted_index.state-of-the-art | 131 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.12684576 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |