Representation of the Fermionic Boundary Operator

• URL: http://arxiv.org/abs/2201.11510v2
• Date: Mon, 15 Aug 2022 16:02:03 GMT
• Title: Representation of the Fermionic Boundary Operator
• Authors: Ismail Yunus Akhalwaya, Yang-Hui He, Lior Horesh, Vishnu Jejjala, William Kirby, Kugendran Naidoo, Shashanka Ubaru
• Abstract summary: We consider the problem of representing the full boundary operator on a quantum computer. We first prove that the boundary operator has a special structure in the form of a complete sum of fermionic creation and annihilation operators. We then use the fact that these operators pairwise anticommute to produce an $O(n)$-depth circuit that exactly implements the boundary operator without any Trotterization or Taylor series approximation errors.
• Score: 10.522527427240352
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The boundary operator is a linear operator that acts on a collection of high-dimensional binary points (simplices) and maps them to their boundaries. This boundary map is one of the key components in numerous applications, including differential equations, machine learning, computational geometry, machine vision and control systems. We consider the problem of representing the full boundary operator on a quantum computer. We first prove that the boundary operator has a special structure in the form of a complete sum of fermionic creation and annihilation operators. We then use the fact that these operators pairwise anticommute to produce an $O(n)$-depth circuit that exactly implements the boundary operator without any Trotterization or Taylor series approximation errors. Having fewer errors reduces the number of shots required to obtain desired accuracies.

Related papers

• Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings [0.0]
  We introduce an algorithm that decomposes the exponential of an arbitrary tensor product of Weyl-Heisenberg operators into single- and two-qutrit gates.<n>We extend this approach to unitaries generated by Gell-Mann string (i.e., a tensor product of Gell-Mann matrices)<n>In particular, we generalize the Steiner-Gauss method, originally developed to reduce CNOT counts in qubit circuit, to optimize gate routing in qutrit-based systems.
  arXiv  Detail & Related papers  (2025-07-13T20:33:48Z)
• On Infinite Tensor Networks, Complementary Recovery and Type II Factors [39.58317527488534]
  We study local operator algebras at the boundary of infinite tensor networks. We decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network.
  arXiv  Detail & Related papers  (2025-03-31T18:00:09Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Explicit block encodings of boundary value problems for many-body elliptic operators [3.326871636198696]
  We systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators. We provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential.
  arXiv  Detail & Related papers  (2024-07-25T19:29:33Z)
• Operator Learning of Lipschitz Operators: An Information-Theoretic Perspective [2.375038919274297]
  This work addresses the complexity of neural operator approximations for the general class of Lipschitz continuous operators. Our main contribution establishes lower bounds on the metric entropy of Lipschitz operators in two approximation settings. It is shown that, regardless of the activation function used, neural operator architectures attaining an approximation accuracy $epsilon$ must have a size that is exponentially large in $epsilon-1$.
  arXiv  Detail & Related papers  (2024-06-26T23:36:46Z)
• Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets [0.0]
  We introduce a framework for the analysis of CX-only circuits and through its lens provide solution constructions for several different device topologies. We discuss how to exploit the framework for the decomposition of a particular, rather than general, diagonal operator.
  arXiv  Detail & Related papers  (2024-03-04T15:10:37Z)
• Zero Pixel Directional Boundary by Vector Transform [77.63061686394038]
  We re-interpret boundaries as 1-D surfaces and formulate a one-to-one vector transform function that allows for training of boundary prediction completely avoiding the class imbalance issue. Our problem formulation leads to the estimation of direction as well as richer contextual information of the boundary, and, if desired, the availability of zero-pixel thin boundaries also at training time.
  arXiv  Detail & Related papers  (2022-03-16T17:55:31Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Compressing Many-Body Fermion Operators Under Unitary Constraints [0.6445605125467573]
  We introduce a numerical algorithm for performing factorization that has an complexity no worse than single particle basis transformations of the two-body operators. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators.
  arXiv  Detail & Related papers  (2021-09-10T17:42:18Z)
• Neural Operator: Learning Maps Between Function Spaces [75.93843876663128]
  We propose a generalization of neural networks to learn operators, termed neural operators, that map between infinite dimensional function spaces. We prove a universal approximation theorem for our proposed neural operator, showing that it can approximate any given nonlinear continuous operator. An important application for neural operators is learning surrogate maps for the solution operators of partial differential equations.
  arXiv  Detail & Related papers  (2021-08-19T03:56:49Z)
• Real-space RG, error correction and Petz map [0.0]
  We study the error correction properties of the real-space renormalization group (RG) Second, we study the operator algebra exact quantum error correction for any von Neumann algebra.
  arXiv  Detail & Related papers  (2020-12-27T19:17:52Z)
• Scaling limits of lattice quantum fields by wavelets [62.997667081978825]
  The renormalization group is considered as an inductive system of scaling maps between lattice field algebras. We show that the inductive limit of free lattice ground states exists and the limit state extends to the familiar massive continuum free field.
  arXiv  Detail & Related papers  (2020-10-21T16:30:06Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)

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.