Space-time optimized table lookup

• URL: http://arxiv.org/abs/2211.01133v1
• Date: Wed, 2 Nov 2022 14:10:40 GMT
• Title: Space-time optimized table lookup
• Authors: Thomas H\"aner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken
• Abstract summary: 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.
• Score: 3.961270923919885
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Lattice Surgery Compilation Beyond the Surface Code [44.47912078290474]
  We consider lattice surgery compilation for topological codes beyond the surface code. We explore specific substrates and codes, including the color code and the folded surface code. For the color code, we present numerical simulations analyzing how design choices at the microscopic and macroscopic levels affect the depth of compiled logical $mathrmCNOT+mathrmT$ circuits.
  arXiv  Detail & Related papers  (2025-04-14T18:00:06Z)
• Quantum resource estimates for computing binary elliptic curve discrete logarithms [0.0]
  We adopt a windowed approach to design our circuit implementation of Shor's algorithm. We provide exact logical gate and qubit counts of our algorithm for cryptographically relevant binary field sizes. We estimate the hardware footprint and runtime of our algorithm executed on surface-code matter-based quantum computers.
  arXiv  Detail & Related papers  (2025-03-04T20:18:50Z)
• Diamond Circuits for Surface Codes [0.36556493054302697]
  We present and benchmark an interesting circuit family which we call diamond circuits. They use a mid-cycle construction built around the subsystem surface code to implement a surface code on a Lieb or "Heavy-Square" lattice. These circuits could be useful in regimes where quantum computers are limited by frequency collisions or number of control lines.
  arXiv  Detail & Related papers  (2025-02-14T18:33:43Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Wire Codes [0.0]
  We introduce a recipe to transform any quantum stabilizer code into a subsystem code with related code parameters that has weight and degree three. We call the subsystem codes produced by our recipe "wire codes" Our results constitute a general method to construct low-overhead subsystem codes on general graphs.
  arXiv  Detail & Related papers  (2024-10-14T06:27:09Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• Matching Generalized-Bicycle Codes to Neutral Atoms for Low-Overhead Fault-Tolerance [7.718509743812828]
  We present a protocol for implementing a restricted set of space-efficient quantum error correcting codes in atom arrays. This protocol enables generalized-bicycle codes that require up to 10x fewer physical qubits than surface codes. We also evaluate a proof-of-concept quantum memory hier- archy where generalized-bicycle codes are used in conjunction with surface codes for general computation.
  arXiv  Detail & Related papers  (2023-11-28T17:31:08Z)
• Encoder Circuit For Surface Code using Measurement-Based Quantum Computing Model [0.17188280334580192]
  Surface codes are one of the most important topological stabilizer codes in the theory of quantum error correction. We provide an efficient way to obtain surface codes through Measurement-based quantum computation (MBQC) using cluster state as the resource state. The obtained surface codes can be used practically as an encoder circuit to encode one logical qubit.
  arXiv  Detail & Related papers  (2023-06-17T06:07:53Z)
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics [0.09960584843614038]
  We design time-dynamic QEC circuits directly instead of designing static QEC codes to decompose into circuits. We present new circuits that can embed on a hexagonal grid instead of a square grid. All these constructions use no additional entangling gate layers and display essentially the same logical performance.
  arXiv  Detail & Related papers  (2023-02-04T16:35:42Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.