Ultrafast Hybrid Fermion-to-Qubit mapping

• URL: http://arxiv.org/abs/2211.16389v2
• Date: Thu, 22 Jun 2023 22:42:06 GMT
• Title: Ultrafast Hybrid Fermion-to-Qubit mapping
• Authors: Oliver O'Brien, Sergii Strelchuk
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fermion-to-qubit mappings play a crucial role in representing fermionic interactions on a quantum computer. Efficient mappings translate fermionic modes of a system to qubit interactions with a high degree of locality while using few auxiliary resources. 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 by Y.-A. Chen and Y. Xu [PRX Quantum 4, 010326 (2023)]. Our family of mappings (parameterised by integer $n$) establishes a direct trade-off between the number of auxiliary qubits ($\frac{1}{n^2}$) and the circuit length ($O(\log n)$). Furthermore, we present a non-local variant that combines the strengths of the Jordan-Wigner and Bravyi-Kitaev mappings to give 98\% shorter circuits than the Jordan-Wigner mapping. This is achieved by applying seemly incompatible mappings at different scales, making it possible for their respective strengths to complement each other.

Related papers

• Ternary Tree Fermion-to-Qubit Mapping with Hamiltonian Aware Optimization [2.5646244842280987]
  This paper introduces the Hamiltonian-Aware Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. Evaluations and simulations of various Fermionic systems demonstrate a significant reduction in both Pauli weight and circuit complexity.
  arXiv  Detail & Related papers  (2024-09-03T15:59:36Z)
• Modular quantum processor with an all-to-all reconfigurable router [34.39074227074929]
  We propose a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We demonstrate reconfigurable controlled-Z gates across all qubit pairs, with a benchmarked average fidelity of $96.00%pm0.08%$. We also generate multi-qubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of $88.15%pm0.24%$ and $75.18%pm0.11%$, respectively.
  arXiv  Detail & Related papers  (2024-07-29T16:02:03Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Neural-network quantum states for ultra-cold Fermi gases [49.725105678823915]
  This work introduces a novel Pfaffian-Jastrow neural-network quantum state that includes backflow transformation based on message-passing architecture. We observe the emergence of strong pairing correlations through the opposite-spin pair distribution functions. Our findings suggest that neural-network quantum states provide a promising strategy for studying ultra-cold Fermi gases.
  arXiv  Detail & Related papers  (2023-05-15T17:46:09Z)
• A hybrid quantum algorithm to detect conical intersections [39.58317527488534]
  We show that for real molecular Hamiltonians, the Berry phase can be obtained by tracing a local optimum of a variational ansatz along the chosen path. We demonstrate numerically the application of our algorithm on small toy models of the formaldimine molecule.
  arXiv  Detail & Related papers  (2023-04-12T18:00:01Z)
• 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)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• 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)
• 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)
• 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)
• 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.