Perturbative quantum simulation

• URL: http://arxiv.org/abs/2106.05938v2
• Date: Wed, 28 Sep 2022 15:16:20 GMT
• Title: Perturbative quantum simulation
• Authors: Jinzhao Sun, Suguru Endo, Huiping Lin, Patrick Hayden, Vlatko Vedral, and Xiao Yuan
• Abstract summary: We introduce perturbative quantum simulation, which combines the complementary strengths of the two approaches. The use of a quantum processor eliminates the need to identify a solvable unperturbed Hamiltonian. We numerically benchmark the method for interacting bosons, fermions, and quantum spins in different topologies.
• Score: 2.309018557701645
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Approximation based on perturbation theory is the foundation for most of the quantitative predictions of quantum mechanics, whether in quantum many-body physics, chemistry, quantum field theory or other domains. Quantum computing provides an alternative to the perturbation paradigm, yet state-of-the-art quantum processors with tens of noisy qubits are of limited practical utility. Here, we introduce perturbative quantum simulation, which combines the complementary strengths of the two approaches, enabling the solution of large practical quantum problems using limited noisy intermediate-scale quantum hardware. The use of a quantum processor eliminates the need to identify a solvable unperturbed Hamiltonian, while the introduction of perturbative coupling permits the quantum processor to simulate systems larger than the available number of physical qubits. We present an explicit perturbative expansion that mimics the Dyson series expansion and involves only local unitary operations, and show its optimality over other expansions under certain conditions. We numerically benchmark the method for interacting bosons, fermions, and quantum spins in different topologies, and study different physical phenomena, such as information propagation, charge-spin separation, and magnetism, on systems of up to $48$ qubits only using an $8+1$ qubit quantum hardware. We experimentally demonstrate our scheme on the IBM quantum cloud, verifying its noise robustness and illustrating its potential for benchmarking large quantum processors with smaller ones.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Simulating 2D lattice gauge theories on a qudit quantum computer [2.2246996966725305]
  We present a quantum computation of the properties of the basic building block of two-dimensional lattice quantum electrodynamics. This is made possible by the use of a trapped-ion qudit quantum processor. Qudits are ideally suited for describing gauge fields, which are naturally high-dimensional.
  arXiv  Detail & Related papers  (2023-10-18T17:06:35Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Quantum Neuronal Sensing of Quantum Many-Body States on a 61-Qubit Programmable Superconducting Processor [17.470012490921192]
  Classifying many-body quantum states with distinct properties and phases of matter is one of the most fundamental tasks in quantum many-body physics. Here, we propose a new approach called quantum neuronal sensing. We show that our scheme can efficiently classify two different types of many-body phenomena.
  arXiv  Detail & Related papers  (2022-01-16T03:20:04Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• Towards Quantum Simulations in Particle Physics and Beyond on Noisy Intermediate-Scale Quantum Devices [1.7242431149740054]
  We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high energy physics. The first method is the dimensional expressivity analysis of quantum circuits, which allows for constructing minimal but maximally expressive quantum circuits. The second method is an efficient mitigation of readout errors on quantum devices.
  arXiv  Detail & Related papers  (2021-10-07T22:13:37Z)
• Numerical hardware-efficient variational quantum simulation of a soliton solution [0.0]
  We discuss the capabilities of quantum algorithms with special attention paid to a hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys the homogeneity of magnetic ordering. We argue that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure.
  arXiv  Detail & Related papers  (2021-05-13T11:58:18Z)
• 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)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)

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.