Space-time optimized table lookup
Thomas H\"aner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken

TL;DR
This paper introduces a space-time optimized quantum circuit for table lookup operations within lattice-surgery surface code frameworks, enhancing efficiency for various quantum computing applications.
Contribution
It presents a novel, space-time optimized circuit design for table lookup in surface code quantum computing, abstracting implementation details for broader accessibility.
Findings
Reduces space-time resources for table lookup circuits
Applicable to cryptography and quantum chemistry
Accessible to non-experts in surface codes
Abstract
We describe a space-time optimized circuit for the table lookup subroutine from lattice-surgery surface code primitives respecting 2D grid connectivity. Table lookup circuits are ubiquitous in quantum computing, allowing the presented circuit to be used for applications ranging from cryptography to quantum chemistry. Surface code is the leading approach to scalable fault-tolerant quantum computing pursued by industry and academia. We abstract away surface code implementation details by using a minimal set of operations supported by the surface code via lattice-surgery. Our exposition is accessible to a reader not familiar with surface codes and fault-tolerant quantum computing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cryptography and Data Security · Quantum Computing Algorithms and Architecture
