Quantum superposing algorithm for quantum encoding
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908476138061824 |
|---|---|
| author | Kim, Jaehee Kim, Taewan Baek, Kyunghyun Hwang, Yongsoo Huh, Joonsuk Bang, Jeongho |
| author_facet | Kim, Jaehee Kim, Taewan Baek, Kyunghyun Hwang, Yongsoo Huh, Joonsuk Bang, Jeongho |
| contents | Efficient encoding of classical data into quantum state -- currently referred to as quantum encoding -- holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum encoding entails establishing a classical mapping that correlates machine-recognizable data addresses with qubit indices that are subsequently superposed. Herein, the most imperative lies in casting an algorithm for generating the superposition of any given number of qubit indices. This algorithm is formally known as quantum superposing algorithm. In this work, we present an efficient quantum superposing algorithm, affirming its effectiveness and superior computational performance in a practical quantum encoding scenario. Our theoretical and numerical analyses demonstrate a substantial enhancement in computational efficiency compared to existing algorithms. Notably, our algorithm has a maximum of 2n-3 controlled-not (CNOT) counts, representing the most optimized result to date. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19496 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum superposing algorithm for quantum encoding Kim, Jaehee Kim, Taewan Baek, Kyunghyun Hwang, Yongsoo Huh, Joonsuk Bang, Jeongho Quantum Physics Efficient encoding of classical data into quantum state -- currently referred to as quantum encoding -- holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum encoding entails establishing a classical mapping that correlates machine-recognizable data addresses with qubit indices that are subsequently superposed. Herein, the most imperative lies in casting an algorithm for generating the superposition of any given number of qubit indices. This algorithm is formally known as quantum superposing algorithm. In this work, we present an efficient quantum superposing algorithm, affirming its effectiveness and superior computational performance in a practical quantum encoding scenario. Our theoretical and numerical analyses demonstrate a substantial enhancement in computational efficiency compared to existing algorithms. Notably, our algorithm has a maximum of 2n-3 controlled-not (CNOT) counts, representing the most optimized result to date. |
| title | Quantum superposing algorithm for quantum encoding |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.19496 |