2
talks
0
committee roles
0
leadership roles
2024–2024
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| On the quantum time complexity of divide and conquer | QIP 2024 | regular | ▸Jonathan Allcock, Aleksandrs Belovs, Troy Lee, Miklos Santha |
|
Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits ↗
|
TQC 2024 | regular | ▸Jonathan Allcock, Joao F. Doriguello, Alessandro Luongo, Miklos Santha |
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)> 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>, 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(n)łogłog(n)) ancillae and O(n log(n)) Fan-Out gates or O(n log(n)) ancillae and 6 Global Tunable gates. On the other hand, the implementation based on Boolean analysis requires only 2 Global Tunable gates at the expense of O(n^2) ancillae. |
|||
Collaborators
| Co-author | Joint talks |
|---|---|
| Jonathan Allcock | 2 |
| Miklos Santha | 2 |
| Aleksandrs Belovs | 1 |
| Alessandro Luongo | 1 |
| Joao F. Doriguello | 1 |
| Troy Lee | 1 |