Quantum circuit and mapping algorithms for wavepacket dynamics: case study of anharmonic hydrogen bonds in protonated and hydroxide water clusters

• URL: http://arxiv.org/abs/2412.03763v1
• Date: Wed, 04 Dec 2024 23:01:24 GMT
• Title: Quantum circuit and mapping algorithms for wavepacket dynamics: case study of anharmonic hydrogen bonds in protonated and hydroxide water clusters
• Authors: Debadrita Saha, Philip Richerme, Srinivasan S. Iyengar,
• Abstract summary: We present two algorithms that will form the basis for performing quantum nuclear dynamics in arbitrary dimensions. One algorithm is exact for three qubits, and when implemented, the dynamics of the spin states emulate those of the nuclear wavepacket. The other algorithm is more robust and is exact for any number of qubits, at the cost of increased circuit complexity.
• Score: 0.0
• License:
• Abstract: The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here we present two algorithms that, in conjunction with other methods developed by us, will form the basis for performing quantum nuclear dynamics in arbitrary dimensions. For one algorithm, we present a direct map between the Born-Oppenheimer Hamiltonian describing the wavepacket time-evolution and the control parameters of a spin-lattice Hamiltonian that describes the dynamics of qubit states in an ion-trap quantum computer. This map is exact for three qubits, and when implemented, the dynamics of the spin states emulate those of the nuclear wavepacket. However, this map becomes approximate as the number of qubits grow. In a second algorithm we present a general quantum circuit decomposition formalism for such problems using a method called the Quantum Shannon Decomposition. This algorithm is more robust and is exact for any number of qubits, at the cost of increased circuit complexity. The resultant circuit is implemented on IBM's quantum simulator (QASM) for 3-7 qubits. In both cases the wavepacket dynamics is found to be in good agreement with the classical result and the corresponding vibrational frequencies obtained from the wavepacket density time-evolution, are in agreement to within a few tenths of a wavenumbers.

Related papers

• Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer [0.0]
  In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution. We show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique.
  arXiv  Detail & Related papers  (2024-02-01T18:30:10Z)
• Quantum information processing with superconducting circuits: realizing and characterizing quantum gates and algorithms in open quantum systems [0.0]
  This thesis focuses on quantum information processing using the superconducting device. For the realization of quantum gates and algorithms, a one-step approach is used. We suggest faster and more efficient schemes for realizing $X$-rotation and entangling gates for two and three qubits.
  arXiv  Detail & Related papers  (2024-01-14T14:31:17Z)
• A noise-limiting quantum algorithm using mid-circuit measurements for dynamical correlations at infinite temperature [0.0]
  We introduce a quantum channel built out of mid-circuit measurements and feed-forward. In the presence of a depolarizing channel it still displays a meaningful, non-zero signal in the large depth limit. We showcase the noise resilience of this quantum channel on Quantinuum's H1-1 ion-trap quantum computer.
  arXiv  Detail & Related papers  (2024-01-04T11:25:04Z)
• Quantum computing with subwavelength atomic arrays [1.1674893622721483]
  Three-level quantum emitters embedded in a two-dimensional atomic array serve as a platform for quantum computation. We design and simulate a set of universal quantum gates consisting of the $sqrttextiSWAP$ and single-qubit rotations. These findings establish subwavelength emitter arrays as an alternative platform for quantum computation and quantum simulation.
  arXiv  Detail & Related papers  (2023-06-14T14:59:25Z)
• Variational waveguide QED simulators [58.720142291102135]
  Waveguide QED simulators are made by quantum emitters interacting with one-dimensional photonic band-gap materials. Here, we demonstrate how these interactions can be a resource to develop more efficient variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-02-03T18:55:08Z)
• 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)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Linear and continuous variable spin-wave processing using a cavity-coupled atomic ensemble [0.0]
  We conduct a theoretical analysis of methods to create a high-capacity universal quantum processor and network node. We describe how to establish linear quantum processing using a scheme in a rubidium-atom system. We propose to use the spin-wave processor for continuous-variable quantum information processing.
  arXiv  Detail & Related papers  (2021-09-30T16:24:44Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• 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.