Minimizing state preparation times in pulse-level variational molecular simulations

• URL: http://arxiv.org/abs/2203.06818v1
• Date: Mon, 14 Mar 2022 02:19:06 GMT
• Title: Minimizing state preparation times in pulse-level variational molecular simulations
• Authors: Ayush Asthana, Chenxu Liu, Oinam Romesh Meitei, Sophia E. Economou, Edwin Barnes, Nicholas J. Mayhall
• Abstract summary: A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue. We find the shortest possible pulses for ctrl-VQE to prepare target molecular wavefunctions for a given device Hamiltonian describing coupled transmon qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum simulation on NISQ devices is severely limited by short coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, we find the shortest possible pulses for ctrl-VQE to prepare target molecular wavefunctions for a given device Hamiltonian describing coupled transmon qubits. We find that the time-optimal pulses that do this have a bang-bang form consistent with Pontryagin's maximum principle. We further investigate how the minimal state preparation time is impacted by truncating the transmons to two versus more levels. We find that leakage outside the computational subspace (something that is usually considered problematic) speeds up the state preparation, further reducing device coherence-time demands. This speedup is due to an enlarged solution space of target wavefunctions and to the appearance of additional channels connecting initial and target states.

Related papers

• Quantum speed limit in quantum sensing [0.0]
  We show that the best possible time resolution is closely related to the quantum speed limit (QSL) Practical implementation is discussed based on the example of the spin-1 qutrit of a nitrogen-vacancy center in diamond.
  arXiv  Detail & Related papers  (2024-06-26T13:44:43Z)
• Optimal Control of Spin Qudits Subject to Decoherence Using Amplitude-and-Frequency-Constrained Pulses [44.99833362998488]
  We introduce a formulation that allows us to bound the maximum amplitude and frequency of the signals. The pulses we obtain consistently enhance operation fidelities compared to those achieved with Schr"odinger's equation.
  arXiv  Detail & Related papers  (2024-03-23T10:10:38Z)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Pulse-controlled qubit in semiconductor double quantum dots [57.916342809977785]
  We present a numerically-optimized multipulse framework for the quantum control of a single-electron charge qubit. A novel control scheme manipulates the qubit adiabatically, while also retaining high speed and ability to perform a general single-qubit rotation.
  arXiv  Detail & Related papers  (2023-03-08T19:00:02Z)
• 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)
• 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)
• Simulation of adiabatic quantum computing for molecular ground states [0.0]
  We explore a novel approach for simulating the time dynamics of Adiabatic state preparation (ASP) We use this new approach to simulate ASP for sets of small molecular systems and Hubbard models. We find that the required state preparation times do not show an immediate exponential wall that would preclude an efficient run of ASP on actual hardware.
  arXiv  Detail & Related papers  (2021-03-22T17:59:08Z)
• Long-time simulations with high fidelity on quantum hardware [1.8909337252764988]
  We show that it is possible to implement long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on the Rigetti and IBM quantum computers. This is a factor of 150 longer than is possible using the iterated Trotter method.
  arXiv  Detail & Related papers  (2021-02-08T16:18:50Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Gate-free state preparation for fast variational quantum eigensolver simulations: ctrl-VQE [0.0]
  VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine. As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
  arXiv  Detail & Related papers  (2020-08-10T17:53:09Z)

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.