Abstracts
Poster Abstracts | Talk Abstracts
Quantum Resources Required to Block-Encode a Matrix of Classical Data
Presenting Author: Alexander Dalzell, Amazon Web Services
Contributing Author(s): B. David Clader, Nikitas Stamatopoulos, Grant Salton, Mario Berta, William J. Zeng
We provide modular circuit-level implementations and resource estimates for several methods of block-encoding a dense N×N matrix of classical data to precision ϵ; the minimal-depth method achieves a T-depth of O(log(N/ϵ)), while the minimal-count method achieves a T-count of O(Nlog(1/ϵ)). We examine resource tradeoffs between the different approaches, and we explore implementations of two separate models of quantum random access memory (QRAM). As part of this analysis, we provide a novel state preparation routine with T-depth O(log(N/ϵ)), improving on previous constructions with scaling O(log^2(N/ϵ)). Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
Read this article online: https://arxiv.org/abs/2206.03505
- Home
- Register for Workshop
- Program
- Submit Your Abstract
- Instructions for Presenters
- Location
- Subscribe to the SQuInT Mailing List
- Code of Conduct
- Past SQuInT Meetings
SQuInT Chief Organizer
Akimasa Miyake, Associate Professor
amiyake@unm.edu
SQuInT Co-Organizer
Hartmut Haeffner, Associate Professor, UC Berkeley
hhaeffner@berkeley.edu
SQuInT Administrator
Dwight Zier
d29zier@unm.edu
505 277-1850
SQuInT Program Committee
Alberto Alonso, Postdoc, UC Berkeley
Philip Blocher, Postdoc, UNM
Neha Yadav, Postdoc, UC Berkeley
Cunlu Zhou, Postdoc, UNM
SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director
ideutsch@unm.edu