Robustly learning the Hamiltonian dynamics of a superconducting quantum processor

• URL: http://arxiv.org/abs/2108.08319v3
• Date: Fri, 28 Jun 2024 13:40:56 GMT
• Title: Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
• Authors: Dominik Hangleiter, Ingo Roth, Jonas Fuksa, Jens Eisert, Pedram Roushan,
• Abstract summary: We robustly estimate the free Hamiltonian parameters of bosonic excitations in a superconducting-qubit analog quantum simulator. Our results constitute an accurate implementation of a dynamical quantum simulation.
• Score: 0.5564835829075486
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The required precision to perform quantum simulations beyond the capabilities of classical computers imposes major experimental and theoretical challenges. The key to solving these issues are precise means of characterizing analog quantum simulators. Here, we robustly estimate the free Hamiltonian parameters of bosonic excitations in a superconducting-qubit analog quantum simulator from measured time-series of single-mode canonical coordinates. We achieve high levels of precision in estimating the Hamiltonian parameters by exploiting a priori knowledge, making it robust against noise and state-preparation and measurement (SPAM) errors. Importantly, we are also able to obtain tomographic information about those SPAM errors from the same data, crucial for the experimental applicability of Hamiltonian learning in dynamical quantum-quench experiments. Our learning algorithm is scalable both in terms of the required amounts of data and post-processing. To achieve this, we develop a new super-resolution technique coined tensorESPRIT for frequency extraction from matrix time-series. The algorithm then combines tensorESPRIT with constrained manifold optimization for the eigenspace reconstruction with pre- and post-processing stages. For up to 14 coupled superconducting qubits on two Sycamore processors, we identify the Hamiltonian parameters -- verifying the implementation on one of them up to sub-MHz precision -- and construct a spatial implementation error map for a grid of 27 qubits. Our results constitute an accurate implementation of a dynamical quantum simulation that is characterized using a new diagnostic toolkit for understanding, calibrating, and improving analog quantum processors.

Related papers

• 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)
• 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)
• Accurate harmonic vibrational frequencies for diatomic molecules via quantum computing [0.0]
  We propose a promising qubit-efficient quantum computational approach to calculate the harmonic vibrational frequencies of a set of neutral closed-shell diatomic molecules. We show that the variational quantum circuit with the chemistry-inspired UCCSD ansatz can achieve the same accuracy as the exact diagonalization method.
  arXiv  Detail & Related papers  (2023-12-19T16:44:49Z)
• Programmable Simulations of Molecules and Materials with Reconfigurable Quantum Processors [0.3320294284424914]
  We introduce a simulation framework for strongly correlated quantum systems that can be represented by model spin Hamiltonians. Our approach leverages reconfigurable qubit architectures to programmably simulate real-time dynamics. We show how this method can be used to compute key properties of a polynuclear transition-metal catalyst and 2D magnetic materials.
  arXiv  Detail & Related papers  (2023-12-04T19:00:01Z)
• Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
  We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. Our results are the first step in the experimental realization of QSP-based quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-09T19:00:17Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Characterization and Verification of Trotterized Digital Quantum Simulation via Hamiltonian and Liouvillian Learning [0.0]
  We propose Floquet Hamiltonian learning to reconstruct the experimentally realized Floquet Hamiltonian order-by-order. We show that our protocol provides the basis for feedback-loop design and calibration of new types of quantum gates.
  arXiv  Detail & Related papers  (2022-03-29T18:29:01Z)
• 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-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Scalable Hamiltonian learning for large-scale out-of-equilibrium quantum dynamics [0.0]
  We present a scalable algorithm based on neural networks for Hamiltonian tomography in out-of-equilibrium quantum systems. Specifically, we show that our algorithm is able to reconstruct the Hamiltonian of an arbitrary size quasi-1D bosonic system.
  arXiv  Detail & Related papers  (2021-03-01T19:00: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.