Discovering optimal fermion-qubit mappings through algorithmic enumeration

• URL: http://arxiv.org/abs/2110.12792v6
• Date: Thu, 12 Oct 2023 12:42:11 GMT
• Title: Discovering optimal fermion-qubit mappings through algorithmic enumeration
• Authors: Mitchell Chiew, Sergii Strelchuk
• Abstract summary: Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. All fermion-qubit mappings must use a numbering scheme for the fermionic modes in order for translation to qubit operations. We make a distinction between the unordered labelling of fermions and the ordered labelling of the qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit interactions, leading to easy-to-simulate qubit Hamiltonians. All fermion-qubit mappings must use a numbering scheme for the fermionic modes in order for translation to qubit operations. We make a distinction between the unordered labelling of fermions and the ordered labelling of the qubits. This separation shines light on a new way to design fermion-qubit mappings by making use of the enumeration scheme for the fermionic modes. The purpose of this paper is to demonstrate that this concept permits notions of fermion-qubit mappings that are optimal with regard to any cost function one might choose. Our main example is the minimisation of the average number of Pauli matrices in the Jordan-Wigner transformations of Hamiltonians for fermions interacting in square lattice arrangements. In choosing the best ordering of fermionic modes for the Jordan-Wigner transformation, and unlike other popular modifications, our prescription does not cost additional resources such as ancilla qubits. We demonstrate how Mitchison and Durbin's enumeration pattern minimises the average Pauli weight of Jordan-Wigner transformations of systems interacting in square lattices. This leads to qubit Hamiltonians consisting of terms with average Pauli weights 13.9% shorter than previously known. By adding only two ancilla qubits we introduce a new class of fermion-qubit mappings, and reduce the average Pauli weight of Hamiltonian terms by 37.9% compared to previous methods. For $n$-mode fermionic systems in cellular arrangements, we find enumeration patterns which result in $n^{1/4}$ improvement in average Pauli weight over na\"ive schemes.

Related papers

• A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians [0.0]
  We propose a simple scheme to estimate fermionic observables and Hamiltonians relevant in quantum chemistry and correlated fermionic systems. Our approach is based on implementing a measurement that jointly measures noisy versions of any product of two or four Majorana operators in an $N$ mode fermionic system.
  arXiv  Detail & Related papers  (2024-02-29T15:04:34Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Ultrafast Hybrid Fermion-to-Qubit mapping [0.0]
  We present a family of locality-preserving fermion-to-qubit mappings that require fewer auxiliary qubits than all existing schemes known to date. One instance requires only 1.016 qubits-per-fermion compared to 1.25 for the best-known locality-preserving mapping.
  arXiv  Detail & Related papers  (2022-11-29T17:17:03Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• 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)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Jordan-Wigner transformation and qubits with nontrivial exchange rule [91.3755431537592]
  Well-known (spinless) fermionic qubits may need more subtle consideration in comparison with usual (spinful) fermions. considered method has some relation with construction of super-spaces, but it has some differences with standard definition of supersymmety sometimes used for generalizations of qubit model.
  arXiv  Detail & Related papers  (2021-03-08T09:31:03Z)
• Matrix Product Density Operators: when do they have a local parent Hamiltonian? [59.4615582291211]
  We study whether one can write a Matrix Product Density Operator (MPDO) as the Gibbs state of a quasi-local parent Hamiltonian. We conjecture this is the case for generic MPDO and give supporting evidences.
  arXiv  Detail & Related papers  (2020-10-28T00:30:07Z)
• Fermionic systems for quantum information people [0.0]
  We develop new tools for the treatment of fermionic systems. We consider variants of the notions of fermionic mode correlation and entanglement.
  arXiv  Detail & Related papers  (2020-06-04T18:18:05Z)
• A Compact Fermion to Qubit Mapping [0.4061135251278187]
  We present a novel fermion to qubit mapping which outperforms all previous local mappings in both the qubit to mode ratio, and the locality of mapped operators.
  arXiv  Detail & Related papers  (2020-03-15T22:23: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.