Quantum Simulations of SO(5) Many-Fermion Systems using Qudits

• URL: http://arxiv.org/abs/2305.11941v2
• Date: Fri, 29 Dec 2023 20:02:44 GMT
• Title: Quantum Simulations of SO(5) Many-Fermion Systems using Qudits
• Authors: Marc Illa, Caroline E. P. Robin and Martin J. Savage
• Abstract summary: We explore the potential utility of quantum computers with arrays of qudits in simulating interacting fermionic systems. We find advantages in using qudits, specifically in lowering the required quantum resources. A previously unrecognized sign problem has been identified from Trotterization errors in time evolving high-energy excitations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The structure and dynamics of quantum many-body systems are the result of a delicate interplay between underlying interactions, which leads to intricate entanglement structures. Despite this apparent complexity, symmetries emerge and have long been used to determine the relevant degrees of freedom and simplify classical descriptions of these systems. In this work, we explore the potential utility of quantum computers with arrays of qudits in simulating interacting fermionic systems, when the qudits can naturally map these relevant degrees of freedom. The Agassi model of fermions is based on an underlying $so(5)$ algebra, and the systems it describes can be partitioned into pairs of modes with five basis states, which naturally embed in arrays of $d=5$ qudits (qu5its). Classical noiseless simulations of the time evolution of systems of fermions embedded in up to twelve qu5its are performed using Google's cirq software. The resource requirements of the qu5it circuits are analyzed and compared with two different mappings to qubit systems, a physics-aware Jordan-Wigner mapping and a state-to-state mapping. We find advantages in using qudits, specifically in lowering the required quantum resources and reducing anticipated errors that take the simulation out of the physical space. A previously unrecognized sign problem has been identified from Trotterization errors in time evolving high-energy excitations. This has implications for quantum simulations in high-energy and nuclear physics, specifically of fragmentation and highly inelastic, multi-channel processes.

Related papers

• Toward hybrid quantum simulations with qubits and qumodes on trapped-ion platforms [0.0]
  We explore the feasibility of hybrid quantum computing using both discrete (qubit) and continuous (qumode) variables on trapped-ion platforms. We show that high-fidelity hybrid gates and measurement operations can be achieved for existing trapped-ion quantum platforms.
  arXiv  Detail & Related papers  (2024-10-09T18:01:15Z)
• Solving Free Fermion Problems on a Quantum Computer [0.0]
  We present several noninteracting fermion problems that can be solved by a quantum algorithm with exponentially-improved, poly log$(N)$ cost. We show that our simulation algorithm generalizes to other promising targets, including free boson systems.
  arXiv  Detail & Related papers  (2024-09-06T18:25:03Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Reaction dynamics with qubit-efficient momentum-space mapping [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We consider a qubit-efficient mapping on a lattice, which can be efficiently performed using momentum-space basis states.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Quantum simulation of Fermi-Hubbard model based on transmon qudit interaction [0.0]
  We introduce a novel quantum simulation approach utilizing qudits to overcome such complexities. We first demonstrate a Qudit Fermionic Mapping (QFM) that reduces the encoding cost associated with the qubit-based approach. We then describe the unitary evolution of the mapped Hamiltonian by interpreting the resulting Majorana operators in terms of physical single- and two-qudit gates.
  arXiv  Detail & Related papers  (2024-02-02T09:10:40Z)
• Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor [0.47191037525744733]
  We show how to construct efficient quantum circuits to implement time evolution for the Heisenberg model. We also give an empirical demonstration on small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve.
  arXiv  Detail & Related papers  (2024-01-05T18:57:34Z)
• Simulating Majorana zero modes on a noisy quantum processor [0.0]
  We use a noisy superconducting quantum processor to prepare Majorana zero modes as eigenstates of the Kitaev chain Hamiltonian. Our work builds on previous experiments with non-interacting fermionic systems.
  arXiv  Detail & Related papers  (2022-06-01T15:20:06Z)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Probing quantum information propagation with out-of-time-ordered correlators [41.12790913835594]
  Small-scale quantum information processors hold the promise to efficiently emulate many-body quantum systems. Here, we demonstrate the measurement of out-of-time-ordered correlators (OTOCs) A central requirement for our experiments is the ability to coherently reverse time evolution.
  arXiv  Detail & Related papers  (2021-02-23T15:29:08Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.