pdf_name stringclasses 19
values | page_number int64 0 23 | markdown stringlengths 0 7.25k | html stringlengths 0 7.32k | layout stringlengths 105 9.33k | lines stringlengths 2 27.9k | images stringlengths 2 598 | equations stringlengths 2 7.55k | tables stringclasses 1
value | page_size stringclasses 4
values | content_list stringlengths 45 8.34k | base_layout_detection stringlengths 540 32.2k | pdf_info stringlengths 1.6k 68.2k | image imagewidth (px) 2.01k 2.55k | image_path stringlengths 53 54 | image_rel_path stringlengths 22 23 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0705.3360.pdf | 0 | # The Road to Quantum Artificial Intelligence
Kyriakos N. Sgarbas
Wire Communications Lab., Dept. of Electrical and Computer Engineering,
University of Patras, GR-26500, Patras, Greece
E-mail: sgarbas $$@$$ upatras.gr
# Abstract
This paper overviews the basic principles and recent advances in the emerging field of
... | <h1>The Road to Quantum Artificial Intelligence</h1>
<p>Kyriakos N. Sgarbas</p>
<p>Wire Communications Lab., Dept. of Electrical and Computer Engineering,
University of Patras, GR-26500, Patras, Greece
E-mail: sgarbas $$@$$ upatras.gr</p>
<h1>Abstract</h1>
<p>This paper overviews the basic principles and recent advance... | [{"type": "title", "coordinates": [80, 77, 401, 99], "content": "The Road to Quantum Artificial Intelligence", "block_type": "title", "index": 1}, {"type": "text", "coordinates": [187, 124, 293, 138], "content": "Kyriakos N. Sgarbas", "block_type": "text", "index": 2}, {"type": "text", "coordinates": [74, 150, 407, 188... | [{"type": "text", "coordinates": [79, 82, 400, 98], "content": "The Road to Quantum Artificial Intelligence", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [186, 124, 295, 140], "content": "Kyriakos N. Sgarbas", "score": 1.0, "index": 2}, {"type": "text", "coordinates": [73, 149, 408, 165], "content": "Wir... | [] | [{"type": "inline", "coordinates": [248, 176, 257, 186], "content": "@", "caption": ""}] | [] | [481.0, 680.0] | [{"type": "text", "text": "The Road to Quantum Artificial Intelligence ", "text_level": 1, "page_idx": 0}, {"type": "text", "text": "Kyriakos N. Sgarbas ", "page_idx": 0}, {"type": "text", "text": "Wire Communications Lab., Dept. of Electrical and Computer Engineering, University of Patras, GR-26500, Patras, Greece E-m... | [{"category_id": 0, "poly": [223.13665771484375, 216.29258728027344, 1116.9342041015625, 216.29258728027344, 1116.9342041015625, 275.70941162109375, 223.13665771484375, 275.70941162109375], "score": 0.999996542930603}, {"category_id": 1, "poly": [522.5202026367188, 345.6185607910156, 817.049072265625, 345.6185607910156... | {"preproc_blocks": [{"type": "title", "bbox": [80, 77, 401, 99], "lines": [{"bbox": [79, 82, 400, 98], "spans": [{"bbox": [79, 82, 400, 98], "score": 1.0, "content": "The Road to Quantum Artificial Intelligence", "type": "text"}], "index": 0}], "index": 0}, {"type": "text", "bbox": [187, 124, 293, 138], "lines": [{"bbo... | ./arxiv_full_mineru_outputs_20/images/0705.3360_0.png | images/0705.3360_0.png | |
0705.3360.pdf | 1 | more details the reader is advised to read [Karafyllidis (2005a)], [Gruska (1999)] or
[Nielsen & Chuang (2000)].
# 2. Quantum Computation Basics
The quantum analog of a bit is called a quantum bit or qubit. Its physical implementa-
tion can be the energy state of an electron in an atom, the polarization of a photon, ... | <p>more details the reader is advised to read [Karafyllidis (2005a)], [Gruska (1999)] or
[Nielsen & Chuang (2000)].</p>
<h1>2. Quantum Computation Basics</h1>
<p>The quantum analog of a bit is called a quantum bit or qubit. Its physical implementa-
tion can be the energy state of an electron in an atom, the polarizatio... | [{"type": "text", "coordinates": [49, 78, 432, 105], "content": "more details the reader is advised to read [Karafyllidis (2005a)], [Gruska (1999)] or\n[Nielsen & Chuang (2000)].", "block_type": "text", "index": 1}, {"type": "title", "coordinates": [49, 117, 240, 132], "content": "2. Quantum Computation Basics", "block... | [{"type": "text", "coordinates": [50, 79, 431, 94], "content": "more details the reader is advised to read [Karafyllidis (2005a)], [Gruska (1999)] or", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [50, 92, 175, 107], "content": "[Nielsen & Chuang (2000)].", "score": 1.0, "index": 2}, {"type": "text", "coo... | [] | [{"type": "block", "coordinates": [166, 241, 321, 275], "content": "", "caption": ""}, {"type": "block", "coordinates": [89, 359, 390, 394], "content": "", "caption": ""}, {"type": "block", "coordinates": [84, 497, 398, 518], "content": "", "caption": ""}, {"type": "inline", "coordinates": [395, 176, 411, 190], "conten... | [] | [481.0, 680.0] | [{"type": "text", "text": "", "page_idx": 1}, {"type": "text", "text": "2. Quantum Computation Basics ", "text_level": 1, "page_idx": 1}, {"type": "text", "text": "The quantum analog of a bit is called a quantum bit or qubit. Its physical implementation can be the energy state of an electron in an atom, the polarizatio... | [{"category_id": 2, "poly": [140.89581298828125, 146.8037567138672, 194.87283325195312, 146.8037567138672, 194.87283325195312, 176.54458618164062, 140.89581298828125, 176.54458618164062], "score": 0.9999951720237732}, {"category_id": 8, "poly": [465.86785888671875, 672.9063110351562, 897.3070068359375, 672.906311035156... | {"preproc_blocks": [{"type": "text", "bbox": [49, 78, 432, 105], "lines": [{"bbox": [50, 79, 431, 94], "spans": [{"bbox": [50, 79, 431, 94], "score": 1.0, "content": "more details the reader is advised to read [Karafyllidis (2005a)], [Gruska (1999)] or", "type": "text"}], "index": 0}, {"bbox": [50, 92, 175, 107], "span... | ./arxiv_full_mineru_outputs_20/images/0705.3360_1.png | images/0705.3360_1.png | |
0705.3360.pdf | 2 | quantum register remain in superposition until they are measured (intentionally or
not). At the time of measurement the state of the register collapses (or is resolved) to
one of its basis states randomly, according to the probability assigned to that state.
It is not necessary to measure every single qubit of a quant... | <p>quantum register remain in superposition until they are measured (intentionally or
not). At the time of measurement the state of the register collapses (or is resolved) to
one of its basis states randomly, according to the probability assigned to that state.</p>
<p>It is not necessary to measure every single qubit o... | [{"type": "text", "coordinates": [49, 78, 432, 117], "content": "quantum register remain in superposition until they are measured (intentionally or\nnot). At the time of measurement the state of the register collapses (or is resolved) to\none of its basis states randomly, according to the probability assigned to that s... | [{"type": "text", "coordinates": [50, 80, 431, 93], "content": "quantum register remain in superposition until they are measured (intentionally or", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [50, 92, 430, 105], "content": "not). At the time of measurement the state of the register collapses (or is reso... | [] | [{"type": "block", "coordinates": [130, 154, 356, 187], "content": "", "caption": ""}, {"type": "inline", "coordinates": [105, 210, 142, 224], "content": "|00000>", "caption": ""}, {"type": "inline", "coordinates": [148, 211, 183, 223], "content": "|10000>", "caption": ""}, {"type": "inline", "coordinates": [205, 210, ... | [] | [481.0, 680.0] | [{"type": "text", "text": "", "page_idx": 2}, {"type": "text", "text": "It is not necessary to measure every single qubit of a quantum register in order to trigger its collapse to a basis state. For example, consider this case: ", "page_idx": 2}, {"type": "equation", "text": "$$\n\\left|\\mathbf{Q}_{s}\\right\\rangle\\... | [{"category_id": 2, "poly": [1145.6666259765625, 147.40145874023438, 1196.4783935546875, 147.40145874023438, 1196.4783935546875, 177.17152404785156, 1145.6666259765625, 177.17152404785156], "score": 0.9999982714653015}, {"category_id": 1, "poly": [137.08303833007812, 1522.686279296875, 1203.3995361328125, 1522.68627929... | {"preproc_blocks": [{"type": "text", "bbox": [49, 78, 432, 117], "lines": [{"bbox": [50, 80, 431, 93], "spans": [{"bbox": [50, 80, 431, 93], "score": 1.0, "content": "quantum register remain in superposition until they are measured (intentionally or", "type": "text"}], "index": 0}, {"bbox": [50, 92, 430, 105], "spans":... | ./arxiv_full_mineru_outputs_20/images/0705.3360_2.png | images/0705.3360_2.png | |
0705.3360.pdf | 3 | "computation is eventually reduced to a series of basic operations to some qubits of a\nquantum regi(...TRUNCATED) | "<p>computation is eventually reduced to a series of basic operations to some qubits of a\nquantum r(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [50, 79, 431, 104], \"content\": \"computation is eventually(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [51, 81, 430, 93], \"content\": \"computation is eventually (...TRUNCATED) | [] | "[{\"type\": \"inline\", \"coordinates\": [412, 310, 428, 323], \"content\": \"|1>\", \"caption\": \(...TRUNCATED) | [] | [481.0, 680.0] | "[{\"type\": \"text\", \"text\": \"\", \"page_idx\": 3}, {\"type\": \"text\", \"text\": \"Quantum ga(...TRUNCATED) | "[{\"category_id\": 2, \"poly\": [141.12033081054688, 148.28504943847656, 192.39727783203125, 148.28(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"text\", \"bbox\": [50, 79, 431, 104], \"lines\": [{\"bbox\": [51(...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.3360_3.png | images/0705.3360_3.png | |
0705.3360.pdf | 4 | "the intended result. This is called probability amplitude amplification [Gruska\n(1999)].\nGrover(...TRUNCATED) | "<p>the intended result. This is called probability amplitude amplification [Gruska\n(1999)].\nGrove(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [69, 79, 432, 265], \"content\": \"the intended result. This(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [85, 79, 431, 92], \"content\": \"the intended result. This (...TRUNCATED) | [] | "[{\"type\": \"inline\", \"coordinates\": [239, 105, 265, 116], \"content\": \"\\\\scriptstyle\\\\ma(...TRUNCATED) | [] | [481.0, 680.0] | "[{\"type\": \"text\", \"text\": \"the intended result. This is called probability amplitude amplifi(...TRUNCATED) | "[{\"category_id\": 2, \"poly\": [1145.6829833984375, 147.68580627441406, 1197.993408203125, 147.685(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"text\", \"bbox\": [69, 79, 432, 265], \"lines\": [{\"bbox\": [85(...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.3360_4.png | images/0705.3360_4.png | |
0705.3360.pdf | 5 | "Grover’s algorithm [Grover (1997)] and its variations are ideal for efficient content-\naddressab(...TRUNCATED) | "<p>Grover’s algorithm [Grover (1997)] and its variations are ideal for efficient content-\naddres(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [50, 79, 431, 205], \"content\": \"Grover\\u2019s algorithm (...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [51, 80, 430, 92], \"content\": \"Grover\\u2019s algorithm [(...TRUNCATED) | [] | "[{\"type\": \"inline\", \"coordinates\": [74, 193, 84, 204], \"content\": \"2^{\\\\mathrm{n}}\", \"(...TRUNCATED) | [] | [481.0, 680.0] | "[{\"type\": \"text\", \"text\": \"Grover\\u2019s algorithm [Grover (1997)] and its variations are i(...TRUNCATED) | "[{\"category_id\": 1, \"poly\": [141.4107666015625, 220.2403564453125, 1199.1956787109375, 220.2403(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"text\", \"bbox\": [50, 79, 431, 205], \"lines\": [{\"bbox\": [51(...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.3360_5.png | images/0705.3360_5.png | |
0705.3360.pdf | 6 | "cooperation [Miakisz et al. (2006)] and coordination games [Huberman & Hogg\n(2003)], simulating ec(...TRUNCATED) | "<p>cooperation [Miakisz et al. (2006)] and coordination games [Huberman & Hogg\n(2003)], simulating(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [49, 78, 432, 244], \"content\": \"cooperation [Miakisz et a(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [49, 79, 431, 93], \"content\": \"cooperation [Miakisz et al(...TRUNCATED) | [] | [] | [] | [481.0, 680.0] | "[{\"type\": \"text\", \"text\": \"\", \"page_idx\": 6}, {\"type\": \"text\", \"text\": \"The last c(...TRUNCATED) | "[{\"category_id\": 0, \"poly\": [140.0205535888672, 1552.326171875, 366.07598876953125, 1552.326171(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"text\", \"bbox\": [49, 78, 432, 244], \"lines\": [{\"bbox\": [49(...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.3360_6.png | images/0705.3360_6.png | |
0705.3360.pdf | 7 | "a very narrow choice of recent papers and research directions. For a lengthier\noverview on QC appl(...TRUNCATED) | "<p>a very narrow choice of recent papers and research directions. For a lengthier\noverview on QC a(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [50, 79, 430, 104], \"content\": \"a very narrow choice of r(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [49, 79, 431, 94], \"content\": \"a very narrow choice of re(...TRUNCATED) | [] | [] | [] | [481.0, 680.0] | "[{\"type\": \"text\", \"text\": \"\", \"page_idx\": 7}, {\"type\": \"text\", \"text\": \"The ideas (...TRUNCATED) | "[{\"category_id\": 0, \"poly\": [141.0516815185547, 798.3380737304688, 318.3129577636719, 798.33807(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"text\", \"bbox\": [50, 79, 430, 104], \"lines\": [{\"bbox\": [49(...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.3360_7.png | images/0705.3360_7.png | |
0705.3360.pdf | 8 | "Karafyllidis, I.G. (2005a), Quantum Computers – Basic Principles, Klidarithmos,\nAthens (in Greek(...TRUNCATED) | "<p>Karafyllidis, I.G. (2005a), Quantum Computers – Basic Principles, Klidarithmos,\nAthens (in Gr(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [50, 79, 433, 446], \"content\": \"Karafyllidis, I.G. (2005a(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [49, 79, 431, 94], \"content\": \"Karafyllidis, I.G. (2005a)(...TRUNCATED) | [] | "[{\"type\": \"inline\", \"coordinates\": [103, 206, 111, 215], \"content\": \"\\\\risingdotseq\", \(...TRUNCATED) | [] | [481.0, 680.0] | [{"type": "text", "text": "", "page_idx": 8}] | "[{\"category_id\": 2, \"poly\": [1144.7769775390625, 146.99856567382812, 1198.39306640625, 146.9985(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"text\", \"bbox\": [50, 79, 433, 446], \"lines\": [{\"bbox\": [49(...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.3360_8.png | images/0705.3360_8.png | |
0705.0734.pdf | 0 | "# Soft constraint abstraction based on semiring\nhomomorphism ∗\n\nSanjiang Li and Mingsheng Ying(...TRUNCATED) | "<h1>Soft constraint abstraction based on semiring\nhomomorphism ∗</h1>\n<p>Sanjiang Li and Mingsh(...TRUNCATED) | "[{\"type\": \"title\", \"coordinates\": [147, 163, 463, 202], \"content\": \"Soft constraint abstra(...TRUNCATED) | "[{\"type\": \"text\", \"coordinates\": [148, 160, 463, 182], \"content\": \"Soft constraint abstrac(...TRUNCATED) | [] | "[{\"type\": \"inline\", \"coordinates\": [282, 412, 289, 416], \"content\": \"\\\\alpha\", \"captio(...TRUNCATED) | [] | [612.0, 792.0] | "[{\"type\": \"text\", \"text\": \"Soft constraint abstraction based on semiring homomorphism \\u221(...TRUNCATED) | "[{\"category_id\": 1, \"poly\": [439.8004455566406, 859.0845336914062, 1257.0494384765625, 859.0845(...TRUNCATED) | "{\"preproc_blocks\": [{\"type\": \"title\", \"bbox\": [147, 163, 463, 202], \"lines\": [{\"bbox\": (...TRUNCATED) | ./arxiv_full_mineru_outputs_20/images/0705.0734_0.png | images/0705.0734_0.png |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 10