Ternary tree transformations are equivalent to linear encodings of the Fock basis

• URL: http://arxiv.org/abs/2412.07578v1
• Date: Tue, 10 Dec 2024 15:14:02 GMT
• Title: Ternary tree transformations are equivalent to linear encodings of the Fock basis
• Authors: Mitchell Chiew, Brent Harrison, Sergii Strelchuk,
• Abstract summary: We propose a universal description of fermion-qubit mappings. We show that every product-preserving ternary tree transformation is equivalent to a linear encoding of the Fock basis.
• Score: 1.0884863227198973
• License:
• Abstract: We consider two approaches to designing fermion-qubit mappings: (1) ternary tree transformations, which use Pauli representations of the Majorana operators that correspond to root-to-leaf paths of a tree graph and (2) linear encodings of the Fock basis, such as the Jordan-Wigner and Bravyi-Kitaev transformations, which store linear binary transformations of the fermionic occupation number vectors in the computational basis of qubits. These approaches have emerged as distinct concepts, with little notational consistency between them. In this paper we propose a universal description of fermion-qubit mappings, which reveals the relationship between ternary tree transformations and linear encodings. Using our notation, we show that every product-preserving ternary tree transformation is equivalent to a linear encoding of the Fock basis.

Related papers

• Graph Transformers Dream of Electric Flow [72.06286909236827]
  We show that the linear Transformer, when applied to graph data, can implement algorithms that solve canonical problems. We present explicit weight configurations for implementing each such graph algorithm, and we bound the errors of the constructed Transformers by the errors of the underlying algorithms.
  arXiv  Detail & Related papers  (2024-10-22T05:11:45Z)
• A Sierpinski Triangle Fermion-to-Qubit Transform [0.876484595372461]
  We present a novel fermion-to-qubit encoding based on the recently discovered "Sierpinski tree" data structure. This encoding has the additional benefit of encoding the fermionic states as computational basis states.
  arXiv  Detail & Related papers  (2024-09-06T15:29:09Z)
• A metaplectic perspective of uncertainty principles in the Linear Canonical Transform domain [0.0]
  We derive Heisenberg uncertainty principles for pairs of Linear Canonical Transforms of a given function. We also propose a new quadratic phase-space distribution, which represents a signal along two intermediate directions in the time-frequency plane.
  arXiv  Detail & Related papers  (2024-05-17T09:26:48Z)
• Mutual transformations of arbitrary ternary qubit trees by Clifford gates [55.2480439325792]
  It is shown that ternary qubit trees with the same number of nodes can be transformed by the naturally defined sequence of Clifford gates into each other or into standard representation as 1D chain corresponding to Jordan-Wigner transform.
  arXiv  Detail & Related papers  (2024-04-25T15:54:32Z)
• Equivalence between fermion-to-qubit mappings in two spatial dimensions [5.173245989087371]
  We prove the existence of fermion-to-qubit mappings with qubit-fermion ratios $r=1+ frac12k$ for positive integers $k$. In particular, we discover a new super-compact encoding using 1.25 qubits per fermion on the square lattice.
  arXiv  Detail & Related papers  (2022-01-13T18:59:46Z)
• Symmetry-driven graph neural networks [1.713291434132985]
  We introduce two graph network architectures that are equivariant to several types of transformations affecting the node coordinates. We demonstrate these capabilities on a synthetic dataset composed of $n$-dimensional geometric objects.
  arXiv  Detail & Related papers  (2021-05-28T18:54:12Z)
• Self-Supervised Graph Representation Learning via Topology Transformations [61.870882736758624]
  We present the Topology Transformation Equivariant Representation learning, a general paradigm of self-supervised learning for node representations of graph data. In experiments, we apply the proposed model to the downstream node and graph classification tasks, and results show that the proposed method outperforms the state-of-the-art unsupervised approaches.
  arXiv  Detail & Related papers  (2021-05-25T06:11:03Z)
• On Path Integration of Grid Cells: Group Representation and Isotropic Scaling [135.0473739504851]
  We conduct theoretical analysis of a general representation model of path integration by grid cells. We learn hexagon grid patterns that share similar properties of the grid cells in the rodent brain. The learned model is capable of accurate long distance path integration.
  arXiv  Detail & Related papers  (2020-06-18T03:44:35Z)
• The Convolution Exponential and Generalized Sylvester Flows [82.18442368078804]
  This paper introduces a new method to build linear flows, by taking the exponential of a linear transformation. An important insight is that the exponential can be computed implicitly, which allows the use of convolutional layers. We show that the convolution exponential outperforms other linear transformations in generative flows on CIFAR10.
  arXiv  Detail & Related papers  (2020-06-02T19:43:36Z)
• Gauge Equivariant Mesh CNNs: Anisotropic convolutions on geometric graphs [81.12344211998635]
  A common approach to define convolutions on meshes is to interpret them as a graph and apply graph convolutional networks (GCNs) We propose Gauge Equivariant Mesh CNNs which generalize GCNs to apply anisotropic gauge equivariant kernels. Our experiments validate the significantly improved expressivity of the proposed model over conventional GCNs and other methods.
  arXiv  Detail & Related papers  (2020-03-11T17:21:15Z)

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.