Optimal fermion-qubit mappings via quadratic assignment

• URL: http://arxiv.org/abs/2504.21636v1
• Date: Wed, 30 Apr 2025 13:37:33 GMT
• Title: Optimal fermion-qubit mappings via quadratic assignment
• Authors: Mitchell Chiew, Cameron Ibrahim, Ilya Safro, Sergii Strelchuk,
• Abstract summary: Simulation of fermionic systems is one of the most promising applications of quantum computers.<n>A burgeoning supply of fermion-qubit mappings has arisen over the past twenty years to address the limited resources of early quantum technology.<n>We present two computational approaches to the construction of general mappings while working with a limited number of qubits.
• Score: 0.6921172267850055
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation algorithm, fermion-qubit mappings translate the fermionic interactions to the operators and states of quantum computers. This translation is highly non-trivial: a burgeoning supply of fermion-qubit mappings has arisen over the past twenty years to address the limited resources of early quantum technology. Previous literature has presented a dichotomy between ancilla-free fermion-qubit mappings, which minimise qubit count, and local encodings, which minimise gate complexity. We present two computational approaches to the construction of general mappings while working with a limited number of qubits, striking a balance between the low-qubit and low-gate demands of present quantum technology. The first method frames the order of fermionic labels as an instance of the quadratic assignment problem to minimize the total and maximum Pauli weights in a problem Hamiltonian. We compare the order-optimized performance of several common ancilla-free mappings on systems of size up to 225 fermionic modes. The second method is a computational approach to incrementally add ancilla qubits to Jordan--Wigner transformations and further reduce the Pauli weights. By adding up to 10 ancilla qubits, we were able to reduce the total Pauli weight by as much as 67% in Jordan--Wigner transformations of fermionic systems with up to 64 modes, outperforming the previous state-of-the-art ancilla-free mappings. Reproducibility: source code and data are available at https://github.com/cameton/QCE_QubitAssignment

Related papers

• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings [3.1981483719988235]
  Simulation of interacting fermionic Hamiltonians is one of the most promising applications of quantum computers. Fermion-to-qubit mappings encode non-local fermionic degrees of freedom in local qubit degrees of freedom.
  arXiv  Detail & Related papers  (2025-02-17T15:44:23Z)
• Distributed quantum error correction based on hyperbolic Floquet codes [39.58317527488534]
  We show that distributed hyperbolic Floquet codes offer good performance under local and non-local circuit-level noise.<n>This shows that distributed quantum error correction is not only possible but efficiently realisable.
  arXiv  Detail & Related papers  (2025-01-23T19:00:07Z)
• Fermion-qubit fault-tolerant quantum computing [39.58317527488534]
  We introduce fermion-qubit fault-tolerant quantum computing, a framework which removes this overhead altogether. We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates. Our framework opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• A recipe for local simulation of strongly-correlated fermionic matter on quantum computers: the 2D Fermi-Hubbard model [0.0]
  We provide a step-by-step recipe for simulating the paradigmatic two-dimensional Fermi-Hubbard model on a quantum computer using only local operations. We provide a detailed recipe for an end-to-end simulation including embedding on a physical device.
  arXiv  Detail & Related papers  (2024-08-26T18:00:07Z)
• Fermionic anyons: entanglement and quantum computation from a resource-theoretic perspective [39.58317527488534]
  We develop a framework to characterize the separability of a specific type of one-dimensional quasiparticle known as a fermionic anyon. We map this notion of fermionic-anyon separability to the free resources of matchgate circuits. We also identify how entanglement between two qubits encoded in a dual-rail manner, as standard for matchgate circuits, corresponds to the notion of entanglement between fermionic anyons.
  arXiv  Detail & Related papers  (2023-06-01T15:25:19Z)
• The Bonsai algorithm: grow your own fermion-to-qubit mapping [0.7049738935364298]
  We present a formalism to design flexible fermion-to-qubit mappings from ternary trees. We introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space. We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers.
  arXiv  Detail & Related papers  (2022-12-19T18:53:08Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Discovering optimal fermion-qubit mappings through algorithmic enumeration [0.0]
  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.
  arXiv  Detail & Related papers  (2021-10-25T10:44:37Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)

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.