Hamiltonian learning for 300 trapped ion qubits with long-range couplings

• URL: http://arxiv.org/abs/2408.03801v1
• Date: Wed, 7 Aug 2024 14:26:09 GMT
• Title: Hamiltonian learning for 300 trapped ion qubits with long-range couplings
• Authors: S. -A. Guo, Y. -K. Wu, J. Ye, L. Zhang, Y. Wang, W. -Q. Lian, R. Yao, Y. -L. Xu, C. Zhang, Y. -Z. Xu, B. -X. Qi, P. -Y. Hou, L. He, Z. -C. Zhou, L. -M. Duan,
• Abstract summary: We demonstrate the Hamiltonian learning of a two-dimensional ion trap quantum simulator with 300 qubits. We employ global manipulations and single-qubit-resolved state detection to efficiently learn the all-to-all-coupled Ising model Hamiltonian.
• Score: 0.1987856300421432
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum simulators with hundreds of qubits and engineerable Hamiltonians have the potential to explore quantum many-body models that are intractable for classical computers. However, learning the simulated Hamiltonian, a prerequisite for any applications of a quantum simulator, remains an outstanding challenge due to the fast increasing time cost with the qubit number and the lack of high-fidelity universal gate operations in the noisy intermediate-scale quantum era. Here we demonstrate the Hamiltonian learning of a two-dimensional ion trap quantum simulator with 300 qubits. We employ global manipulations and single-qubit-resolved state detection to efficiently learn the all-to-all-coupled Ising model Hamiltonian, with the required quantum resources scaling at most linearly with the qubit number. Our work paves the way for wide applications of large-scale ion trap quantum simulators.

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)
• Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding [9.219297088819634]
  Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian. In this paper, we propose a technique named Hamiltonian embedding. This technique simulates a desired sparse Hamiltonian by embedding it into the evolution of a larger and more structured quantum system.
  arXiv  Detail & Related papers  (2024-01-16T18:19:29Z)
• A Site-Resolved 2D Quantum Simulator with Hundreds of Trapped Ions [0.18563999711877635]
  We report the stable trapping of 512 ions in a 2D Wigner crystal and the sideband cooling of their transverse motion. We demonstrate the quantum simulation of long-range quantum Ising models with tunable coupling strengths and patterns, with or without frustration, using 300 ions. Our work paves the way for simulating classically intractable quantum dynamics and for running NISQ algorithms using 2D ion trap quantum simulators.
  arXiv  Detail & Related papers  (2023-11-28T19:00:39Z)
• 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)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• 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)
• A quantum hamiltonian simulation benchmark [1.5301252700705212]
  Hamiltonian simulation is one of the most important problems in quantum computation. We propose a drastically simplified quantum circuit that uses only one ancilla qubit and no multi-qubit controlled gates.
  arXiv  Detail & Related papers  (2021-08-08T22:16:30Z)
• 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)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Noisy intermediate scale quantum simulation of time dependent Hamiltonians [0.0]
  We extend the quantum assisted simulator to simulate the dynamics of a class of time-dependent Hamiltonians. Our results indicate that quantum assisted simulator is a promising algorithm for current term quantum hardware.
  arXiv  Detail & Related papers  (2021-01-19T15:20:03Z)
• Fully-programmable universal quantum simulator with a one-dimensional quantum processor [0.0]
  Current quantum devices execute specific tasks that are hard for classical computers. It is desirable to reconfigure the connectivity of the device, which for superconducting quantum processors is determined at fabrication. Here we periodically drive a one-dimensional chain to engineer effective Hamiltonians that simulate arbitrary connectivities.
  arXiv  Detail & Related papers  (2020-09-02T05:10:21Z)

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.