Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates

Published 16 Aug 2023 in quant-ph, cs.CC, and cs.ET | (2308.08539v3)

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⟩∣b⟩↦∣x⟩∣b⊕f(x)⟩|x\rangle|b\rangle\mapsto |x\rangle|b\oplus f(x)\rangle for x∈{0,1}nx\in\{0,1\}^n and b∈{0,1}b\in\{0,1\}, where ff is a Boolean function. The first of our constructions is based on computing the one-hot encoding of the control register ∣x⟩|x\rangle, while the second is based on Boolean analysis and exploits different representations of ff 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 nn. The implementation based on one-hot encoding requires either O(nlog⁡(d)nlog⁡(d+1)n)O(n\log^{(d)}{n}\log^{(d+1)}{n}) ancillae and O(nlog⁡(d)n)O(n\log^{(d)}{n}) Fan-Out gates or O(nlog⁡(d)n)O(n\log^{(d)}{n}) ancillae and $16d-10$ Global Tunable gates, where dd is any positive integer and log⁡(d)n=log⁡⋯log⁡n\log^{(d)}{n} = \log\cdots \log{n} is the dd-times iterated logarithm. On the other hand, the implementation based on Boolean analysis requires $8d-6$ Global Tunable gates at the expense of O(n1/(1−2−d))O(n^{1/(1-2^{-d})}) ancillae.

Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.