Bingren Chen, Hanqing Wu, Haomu Yuan, Lei Wu, Xin Li
{"title":"在一热编码和二进制编码之间进行转换的新型量子算法","authors":"Bingren Chen, Hanqing Wu, Haomu Yuan, Lei Wu, Xin Li","doi":"10.1007/s11128-024-04403-z","DOIUrl":null,"url":null,"abstract":"<div><p>In the domain of quantum computing, two widely employed techniques for encoding a normalized vector of length <i>N</i>, denoted as <span>\\(\\{ \\alpha _i \\}\\)</span>, are one-hot encoding and binary encoding. The one-hot encoding state is represented as <span>\\(\\vert \\psi _{OH}^{(N)} \\rangle \\)</span> and can be expressed as: <span>\\(\\vert \\psi _{OH}^{(N)} \\rangle =\\sum _{i=0}^{N-1} \\alpha _i \\vert 0 \\rangle ^{\\otimes N-i-1} \\vert 1 \\rangle \\vert 0 \\rangle ^{\\otimes i}\\)</span>. On the other hand, the binary encoding state is symbolized as <span>\\(\\vert \\psi _{BI}^{(N)} \\rangle \\)</span> and is defined as: <span>\\(\\vert \\psi _{BI}^{(N)} \\rangle =\\sum _{i=0}^{N-1} \\alpha _i \\vert b_i \\rangle \\)</span>, where <span>\\(b_i\\)</span> corresponds to the binary representation of <i>i</i>. In this paper, we introduce a method for converting between the one-hot encoding state and the binary encoding state, utilizing the Domain Wall state as an intermediary. The Domain Wall state, denoted as <span>\\(\\vert \\psi _{DW}^{(N)} \\rangle \\)</span>, is defined as: <span>\\(\\vert \\psi _{DW}^{(N)} \\rangle =\\sum _{i=0}^{N-1} \\alpha _i \\vert 0 \\rangle ^{\\otimes N-i-1} \\vert 1 \\rangle ^{\\otimes i}\\)</span>. Our proposed circuit achieves a depth of <span>\\(O(\\log ^2 N)\\)</span> and a size of <i>O</i>(<i>N</i>).Kindly check and confirm that the corresponding author mail id is correctly identified.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel quantum algorithm for converting between one-hot and binary encodings\",\"authors\":\"Bingren Chen, Hanqing Wu, Haomu Yuan, Lei Wu, Xin Li\",\"doi\":\"10.1007/s11128-024-04403-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In the domain of quantum computing, two widely employed techniques for encoding a normalized vector of length <i>N</i>, denoted as <span>\\\\(\\\\{ \\\\alpha _i \\\\}\\\\)</span>, are one-hot encoding and binary encoding. The one-hot encoding state is represented as <span>\\\\(\\\\vert \\\\psi _{OH}^{(N)} \\\\rangle \\\\)</span> and can be expressed as: <span>\\\\(\\\\vert \\\\psi _{OH}^{(N)} \\\\rangle =\\\\sum _{i=0}^{N-1} \\\\alpha _i \\\\vert 0 \\\\rangle ^{\\\\otimes N-i-1} \\\\vert 1 \\\\rangle \\\\vert 0 \\\\rangle ^{\\\\otimes i}\\\\)</span>. On the other hand, the binary encoding state is symbolized as <span>\\\\(\\\\vert \\\\psi _{BI}^{(N)} \\\\rangle \\\\)</span> and is defined as: <span>\\\\(\\\\vert \\\\psi _{BI}^{(N)} \\\\rangle =\\\\sum _{i=0}^{N-1} \\\\alpha _i \\\\vert b_i \\\\rangle \\\\)</span>, where <span>\\\\(b_i\\\\)</span> corresponds to the binary representation of <i>i</i>. In this paper, we introduce a method for converting between the one-hot encoding state and the binary encoding state, utilizing the Domain Wall state as an intermediary. The Domain Wall state, denoted as <span>\\\\(\\\\vert \\\\psi _{DW}^{(N)} \\\\rangle \\\\)</span>, is defined as: <span>\\\\(\\\\vert \\\\psi _{DW}^{(N)} \\\\rangle =\\\\sum _{i=0}^{N-1} \\\\alpha _i \\\\vert 0 \\\\rangle ^{\\\\otimes N-i-1} \\\\vert 1 \\\\rangle ^{\\\\otimes i}\\\\)</span>. Our proposed circuit achieves a depth of <span>\\\\(O(\\\\log ^2 N)\\\\)</span> and a size of <i>O</i>(<i>N</i>).Kindly check and confirm that the corresponding author mail id is correctly identified.</p></div>\",\"PeriodicalId\":746,\"journal\":{\"name\":\"Quantum Information Processing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Information Processing\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11128-024-04403-z\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04403-z","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
A novel quantum algorithm for converting between one-hot and binary encodings
In the domain of quantum computing, two widely employed techniques for encoding a normalized vector of length N, denoted as \(\{ \alpha _i \}\), are one-hot encoding and binary encoding. The one-hot encoding state is represented as \(\vert \psi _{OH}^{(N)} \rangle \) and can be expressed as: \(\vert \psi _{OH}^{(N)} \rangle =\sum _{i=0}^{N-1} \alpha _i \vert 0 \rangle ^{\otimes N-i-1} \vert 1 \rangle \vert 0 \rangle ^{\otimes i}\). On the other hand, the binary encoding state is symbolized as \(\vert \psi _{BI}^{(N)} \rangle \) and is defined as: \(\vert \psi _{BI}^{(N)} \rangle =\sum _{i=0}^{N-1} \alpha _i \vert b_i \rangle \), where \(b_i\) corresponds to the binary representation of i. In this paper, we introduce a method for converting between the one-hot encoding state and the binary encoding state, utilizing the Domain Wall state as an intermediary. The Domain Wall state, denoted as \(\vert \psi _{DW}^{(N)} \rangle \), is defined as: \(\vert \psi _{DW}^{(N)} \rangle =\sum _{i=0}^{N-1} \alpha _i \vert 0 \rangle ^{\otimes N-i-1} \vert 1 \rangle ^{\otimes i}\). Our proposed circuit achieves a depth of \(O(\log ^2 N)\) and a size of O(N).Kindly check and confirm that the corresponding author mail id is correctly identified.
期刊介绍:
Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.