Quantum simulation of fermionic systems using hybrid digital-analog quantum computing approach

• URL: http://arxiv.org/abs/2112.15158v5
• Date: Tue, 24 May 2022 15:03:05 GMT
• Title: Quantum simulation of fermionic systems using hybrid digital-analog quantum computing approach
• Authors: Nikita Guseynov and Walter Pogosov
• Abstract summary: We show how digital-analog approach can be applied to simulate the dynamics of fermionic systems. We find that an optimal connectivity topology of qubits for the digital-analog simulation of fermionic systems of arbitrary dimensionality is a chain for spinless fermions and a ladder for spin-1/2 particles.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider a hybrid digital-analog quantum computing approach, which allows implementing any quantum algorithm without standard two-qubit gates. This approach is based on the always-on interaction between qubits, which can provide an alternative to such gates. We show how digital-analog approach can be applied to simulate the dynamics of fermionic systems, in particular the Fermi-Hubbard model, using fermionic SWAP network and refocusing technique. We concentrate on the effects of connectivity topology, spread of interaction constants as well as on errors of entangling operations. We find that an optimal connectivity topology of qubits for the digital-analog simulation of fermionic systems of arbitrary dimensionality is a chain for spinless fermions and a ladder for spin-1/2 particles. Such a simple connectivity topology makes digital-analog approach attracting for the fermionic quantum simulation.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Realization of programmable Ising models in a trapped-ion quantum simulator [12.463019796364186]
  We present a programmable trapped-ion quantum simulator of an Ising model with all-to-all connectivity with up to four spins. We implement the spin-spin interactions by using the coupling of trapped ions to multiple collective motional modes. We confirm the programmed interaction geometry by observing the ground states of the corresponding models through quantum state tomography.
  arXiv  Detail & Related papers  (2023-11-08T18:02:47Z)
• Digital-analog quantum computing of fermion-boson models in superconducting circuits [1.1650821883155187]
  We propose a digital-analog quantum algorithm for simulating strongly-correlated fermion-boson interactions. We show the reduction in the circuit depth of the DAQC algorithm, a sequence of digital steps and analog blocks, outperforming the purely digital approach. Our proposal opens the door to computing complex systems for chemistry, materials, and high-energy physics.
  arXiv  Detail & Related papers  (2023-08-23T10:01:05Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Variational Quantum Eigensolver for SU($N$) Fermions [0.0]
  Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers. We apply the variational quantum eigensolver to study the ground-state properties of $N$-component fermions. Our approach lays out the basis for a current-based quantum simulator of many-body systems.
  arXiv  Detail & Related papers  (2021-06-29T16:39:30Z)
• Digital-analog quantum simulation of fermionic models [0.0]
  We introduce a digital-analog quantum algorithm to simulate a wide class of fermionic Hamiltonians. These methods allow quantum algorithms to run beyond digital versions via an efficient use of coherence time.
  arXiv  Detail & Related papers  (2021-03-29T15:25:23Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

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.