On the locality of qubit encodings of local fermionic modes

• URL: http://arxiv.org/abs/2401.10077v1
• Date: Thu, 18 Jan 2024 15:46:00 GMT
• Title: On the locality of qubit encodings of local fermionic modes
• Authors: Tommaso Guaita
• Abstract summary: known mappings that encode fermionic modes into a bosonic qubit system are non-local transformations. We show that, in case of exact encodings, a fully local mapping is possible if and only if the locality graph is a tree.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Known mappings that encode fermionic modes into a bosonic qubit system are non-local transformations. In this paper we establish that this must necessarily be the case, if the locality graph is complex enough (for example for regular 2$d$ lattices). In particular we show that, in case of exact encodings, a fully local mapping is possible if and only if the locality graph is a tree. If instead we allow ourselves to also consider operators that only act fermionically on a subspace of the qubit Hilbert space, then we show that this subspace must be composed of long range entangled states, if the locality graph contains at least two overlapping cycles. This implies, for instance, that on 2$d$ lattices there exist states that are simple from the fermionic point of view, while in any encoding require a circuit of depth at least proportional to the system size to be prepared.

Related papers

• Succinct Fermion Data Structures [0.0]
  Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. We present two new second-quantized fermion encodings of $F$ fermions in $M$ modes.
  arXiv  Detail & Related papers  (2024-10-05T03:16:36Z)
• Nonlocality under Computational Assumptions [51.020610614131186]
  A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
  arXiv  Detail & Related papers  (2023-03-03T16:53:30Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• LCPFormer: Towards Effective 3D Point Cloud Analysis via Local Context Propagation in Transformers [60.51925353387151]
  We propose a novel module named Local Context Propagation (LCP) to exploit the message passing between neighboring local regions. We use the overlap points of adjacent local regions as intermediaries, then re-weight the features of these shared points from different local regions before passing them to the next layers. The proposed method is applicable to different tasks and outperforms various transformer-based methods in benchmarks including 3D shape classification and dense prediction tasks.
  arXiv  Detail & Related papers  (2022-10-23T15:43:01Z)
• Geometric Graph Representation Learning via Maximizing Rate Reduction [73.6044873825311]
  Learning node representations benefits various downstream tasks in graph analysis such as community detection and node classification. We propose Geometric Graph Representation Learning (G2R) to learn node representations in an unsupervised manner. G2R maps nodes in distinct groups into different subspaces, while each subspace is compact and different subspaces are dispersed.
  arXiv  Detail & Related papers  (2022-02-13T07:46:24Z)
• 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)
• Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
  A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold. We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent. A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
  arXiv  Detail & Related papers  (2021-06-10T19:54:19Z)
• Custom fermionic codes for quantum simulation [0.0]
  We show that locality may in fact be too strict of a condition and the size of operators can be reduced by encoding the system quasi-locally. We give examples relevant to lattice models of condensed matter and systems relevant to quantum gravity such as SYK models.
  arXiv  Detail & Related papers  (2020-09-24T17:59:14Z)
• node2coords: Graph Representation Learning with Wasserstein Barycenters [59.07120857271367]
  We introduce node2coords, a representation learning algorithm for graphs. It learns simultaneously a low-dimensional space and coordinates for the nodes in that space. Experimental results demonstrate that the representations learned with node2coords are interpretable.
  arXiv  Detail & Related papers  (2020-07-31T13:14:25Z)
• Mitigating Errors in Local Fermionic Encodings [6.0409040218619685]
  We show that fermionic encodings with low-weight representations of local fermionic operators can still exhibit error mitigating properties. In particular when undetectable errors correspond to "natural" fermionic noise. This suggests that even when employing low-weight fermionic encodings, error rates can be suppressed in a similar fashion to high distance codes.
  arXiv  Detail & Related papers  (2020-03-16T11:31:43Z)
• Optimal local unitary encoding circuits for the surface code [0.2770822269241973]
  The surface code is a leading candidate quantum error correcting code, owing to its high threshold. We present an optimal local unitary encoding circuit for the planar surface code. We also show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping.
  arXiv  Detail & Related papers  (2020-02-02T11:09:46Z)

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.