Topological and geometric patterns in optimal bang-bang protocols for variational quantum algorithms: application to the $XXZ$ model on the square lattice

• URL: http://arxiv.org/abs/2012.05476v3
• Date: Mon, 6 Dec 2021 23:32:53 GMT
• Title: Topological and geometric patterns in optimal bang-bang protocols for variational quantum algorithms: application to the $XXZ$ model on the square lattice
• Authors: Matthew T. Scoggins and Armin Rahmani
• Abstract summary: We find optimal protocols for transformations between the ground states of the square-lattice XXZ model for finite systems sizes. We identify the minimum time needed for reaching an acceptable error for different system sizes. We find that protocols within one phase are indeed geometrically correlated.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we address the challenge of uncovering patterns in variational optimal protocols for taking the system to ground states of many-body Hamiltonians, using variational quantum algorithms. We develop highly optimized classical Monte Carlo (MC) algorithms to find the optimal protocols for transformations between the ground states of the square-lattice XXZ model for finite systems sizes. The MC method obtains optimal bang-bang protocols, as predicted by Pontryagin's minimum principle. We identify the minimum time needed for reaching an acceptable error for different system sizes as a function of the initial and target states and uncover correlations between the total time and the wave-function overlap. We determine a dynamical phase diagram for the optimal protocols, with different phases characterized by a topological number, namely the number of on-pulses. Bifurcation transitions as a function of initial and final states, associated with new jumps in the optimal protocols, demarcate these different phases. The number of pulses correlates with the total evolution time. In addition to identifying the topological characteristic above, i.e., the number of pulses, we introduce a correlation function to characterize bang-bang protocols' quantitative geometric similarities. We find that protocols within one phase are indeed geometrically correlated. Identifying and extrapolating patterns in these protocols may inform efficient large-scale simulations on quantum devices.

Related papers

• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Counterdiabatic optimized driving in quantum phase sensitive models [0.0]
  State preparation plays a pivotal role in numerous quantum algorithms, including quantum phase estimation. This paper extends and benchmarks counterdiabatic driving protocols across three one-dimensional spin systems characterized by phase transitions.
  arXiv  Detail & Related papers  (2023-11-07T19:00:22Z)
• Finding, mapping and classifying optimal protocols for two-qubit entangling gates [0.0]
  We consider trapped neutral atoms excited to Rydberg states by different pulse sequences as an example of a flexible platform. We characterize in detail the features of the solutions in parameter space, showing some correlations among the set of parameters.
  arXiv  Detail & Related papers  (2023-04-27T16:48:22Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Search for optimal driving in finite quantum systems with precursors of criticality [0.0]
  We design a hierarchy of quantum state preparation protocols that systematically increase the fidelity at very long driving times. We test these and other protocols, including those based on the geometric analysis of the parameter space, in a single-qubit system and in a fully connected multi-qubit system.
  arXiv  Detail & Related papers  (2022-10-13T13:39:51Z)
• Efficient and robust estimation of many-qubit Hamiltonians [0.0]
  Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in development of quantum technologies. We propose an efficient protocol for characterizing the underlying Hamiltonian dynamics and the noise of a multi-qubit device. This protocol can be used to parallelize to learn the Hamiltonian, rendering it applicable for the characterization of both current and future quantum devices.
  arXiv  Detail & Related papers  (2022-05-19T13:52:32Z)
• General Hamiltonian Representation of ML Detection Relying on the Quantum Approximate Optimization Algorithm [74.6114458993128]
  The quantum approximate optimization algorithm (QAOA) conceived for solving optimization problems can be run on the existing noisy intermediate-scale quantum (NISQ) devices. We solve the maximum likelihood (ML) detection problem for general constellations by appropriately adapting the QAOA. In particular, for an M-ary Gray-mapped quadrature amplitude modulation (MQAM) constellation, we show that the specific qubits encoding the in-phase components and those encoding the quadrature components are independent in the quantum system of interest.
  arXiv  Detail & Related papers  (2022-04-11T14:11:24Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Behavior of Analog Quantum Algorithms [0.0]
  We show that different analog quantum algorithms can emulate the optimal protocol under different limits and approximations. We present a new algorithm for better approximating the optimal protocol using the analytic and numeric insights from the rest of the paper.
  arXiv  Detail & Related papers  (2021-07-02T18:00:07Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Planning in Markov Decision Processes with Gap-Dependent Sample Complexity [48.98199700043158]
  We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process. We prove an upper bound on the number of calls to the generative models needed for MDP-GapE to identify a near-optimal action with high probability.
  arXiv  Detail & Related papers  (2020-06-10T15:05:51Z)

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.