Jonathan Allcock, Jinge Bao, Joao F. Doriguello, Alessandro Luongo, Miklos Santha
{"title":"使用多量子比特门的布尔函数恒深电路和量子存储器件","authors":"Jonathan Allcock, Jinge Bao, Joao F. Doriguello, Alessandro Luongo, Miklos Santha","doi":"10.22331/q-2024-11-20-1530","DOIUrl":null,"url":null,"abstract":"We explore the power of the unbounded Fan-Out gate and the Global Tunable gates generated by Ising-type Hamiltonians in constructing constant-depth quantum circuits, with particular attention to quantum memory devices. We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. These gates include the Fan-In gates defined by $|x\\rangle|b\\rangle\\mapsto |x\\rangle|b\\oplus f(x)\\rangle$ for $x\\in\\{0,1\\}^n$ and $b\\in\\{0,1\\}$, where $f$ is a Boolean function. The first of our constructions is based on computing the one-hot encoding of the control register $|x\\rangle$, while the second is based on Boolean analysis and exploits different representations of $f$ such as its Fourier expansion. Via these constructions, we obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices – Quantum Random Access Memory (QRAM) and Quantum Random Access Gate (QRAG) – of memory size $n$. The implementation based on one-hot encoding requires either $O(n\\log^{(d)}{n}\\log^{(d+1)}{n})$ ancillae and $O(n\\log^{(d)}{n})$ Fan-Out gates or $O(n\\log^{(d)}{n})$ ancillae and $16d-10$ Global Tunable gates, where $d$ is any positive integer and $\\log^{(d)}{n} = \\log\\cdots \\log{n}$ is the $d$-times iterated logarithm. On the other hand, the implementation based on Boolean analysis requires $8d-6$ Global Tunable gates at the expense of $O(n^{1/(1-2^{-d})})$ ancillae.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"35 1","pages":""},"PeriodicalIF":5.1000,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates\",\"authors\":\"Jonathan Allcock, Jinge Bao, Joao F. Doriguello, Alessandro Luongo, Miklos Santha\",\"doi\":\"10.22331/q-2024-11-20-1530\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We explore the power of the unbounded Fan-Out gate and the Global Tunable gates generated by Ising-type Hamiltonians in constructing constant-depth quantum circuits, with particular attention to quantum memory devices. We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. These gates include the Fan-In gates defined by $|x\\\\rangle|b\\\\rangle\\\\mapsto |x\\\\rangle|b\\\\oplus f(x)\\\\rangle$ for $x\\\\in\\\\{0,1\\\\}^n$ and $b\\\\in\\\\{0,1\\\\}$, where $f$ is a Boolean function. The first of our constructions is based on computing the one-hot encoding of the control register $|x\\\\rangle$, while the second is based on Boolean analysis and exploits different representations of $f$ such as its Fourier expansion. Via these constructions, we obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices – Quantum Random Access Memory (QRAM) and Quantum Random Access Gate (QRAG) – of memory size $n$. The implementation based on one-hot encoding requires either $O(n\\\\log^{(d)}{n}\\\\log^{(d+1)}{n})$ ancillae and $O(n\\\\log^{(d)}{n})$ Fan-Out gates or $O(n\\\\log^{(d)}{n})$ ancillae and $16d-10$ Global Tunable gates, where $d$ is any positive integer and $\\\\log^{(d)}{n} = \\\\log\\\\cdots \\\\log{n}$ is the $d$-times iterated logarithm. On the other hand, the implementation based on Boolean analysis requires $8d-6$ Global Tunable gates at the expense of $O(n^{1/(1-2^{-d})})$ ancillae.\",\"PeriodicalId\":20807,\"journal\":{\"name\":\"Quantum\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":5.1000,\"publicationDate\":\"2024-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.22331/q-2024-11-20-1530\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.22331/q-2024-11-20-1530","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
We explore the power of the unbounded Fan-Out gate and the Global Tunable gates generated by Ising-type Hamiltonians in constructing constant-depth quantum circuits, with particular attention to quantum memory devices. We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. These gates include the Fan-In gates defined by $|x\rangle|b\rangle\mapsto |x\rangle|b\oplus f(x)\rangle$ for $x\in\{0,1\}^n$ and $b\in\{0,1\}$, where $f$ is a Boolean function. The first of our constructions is based on computing the one-hot encoding of the control register $|x\rangle$, while the second is based on Boolean analysis and exploits different representations of $f$ such as its Fourier expansion. Via these constructions, we obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices – Quantum Random Access Memory (QRAM) and Quantum Random Access Gate (QRAG) – of memory size $n$. The implementation based on one-hot encoding requires either $O(n\log^{(d)}{n}\log^{(d+1)}{n})$ ancillae and $O(n\log^{(d)}{n})$ Fan-Out gates or $O(n\log^{(d)}{n})$ ancillae and $16d-10$ Global Tunable gates, where $d$ is any positive integer and $\log^{(d)}{n} = \log\cdots \log{n}$ is the $d$-times iterated logarithm. On the other hand, the implementation based on Boolean analysis requires $8d-6$ Global Tunable gates at the expense of $O(n^{1/(1-2^{-d})})$ ancillae.
QuantumPhysics and Astronomy-Physics and Astronomy (miscellaneous)
CiteScore
9.20
自引率
10.90%
发文量
241
审稿时长
16 weeks
期刊介绍:
Quantum is an open-access peer-reviewed journal for quantum science and related fields. Quantum is non-profit and community-run: an effort by researchers and for researchers to make science more open and publishing more transparent and efficient.