Clifford-Dressed Variational Principles for Precise Loschmidt Echoes

• URL: http://arxiv.org/abs/2502.01872v1
• Date: Mon, 03 Feb 2025 22:43:32 GMT
• Title: Clifford-Dressed Variational Principles for Precise Loschmidt Echoes
• Authors: Antonio Francesco Mello, Alessandro Santini, Mario Collura,
• Abstract summary: We extend the recently introduced Clifford dressed Time-Dependent Variational Principle (TDVP) to efficiently compute many-body wavefunction amplitudes in the computational basis. By incorporating Clifford disentangling gates during TDVP evolution, our method effectively controls entanglement growth while keeping the computation of these amplitudes accessible.
• Score: 44.99833362998488
• License:
• Abstract: We extend the recently introduced Clifford dressed Time-Dependent Variational Principle (TDVP) to efficiently compute many-body wavefunction amplitudes in the computational basis. This advancement enhances the study of Loschmidt echoes, which generally require accurate calculations of the overlap between the evolved state and the initial wavefunction. By incorporating Clifford disentangling gates during TDVP evolution, our method effectively controls entanglement growth while keeping the computation of these amplitudes accessible. Specifically, it reduces the problem to evaluating the overlap between a Matrix Product State (MPS) and a stabilizer state, a task that remains computationally feasible within the proposed framework. To demonstrate the effectiveness of this approach, we first benchmark it on the one-dimensional transverse-field Ising model. We then apply it to more challenging scenarios, including a non-integrable next-to-nearest-neighbor Ising chain and a two-dimensional Ising model. Our results highlight the versatility and efficiency of the Clifford-augmented MPS, showcasing its capability to go beyond the evaluation of simple expectation values. This makes it a powerful tool for exploring various aspects of many-body quantum dynamics.

Related papers

• Augmenting Finite Temperature Tensor Network with Clifford Circuits [0.49157446832511503]
  Recent studies have highlighted the combination of network methods and the stabilizer formalism as a very effective framework for simulating quantum many-body systems. In this work, we adapt this paradigm for finite temperature simulations in the framework of Time-Dependent Variational Principle. Our numerical results demonstrate that Clifford circuits can significantly improve the efficiency and accuracy of finite temperature simulations.
  arXiv  Detail & Related papers  (2024-10-21T07:30:59Z)
• Clifford Circuits Augmented Time-Dependent Variational Principle [0.49157446832511503]
  Recently proposed Clifford Circuits Augmented Matrix Product States (CA-MPS) seamlessly augments Density Matrix Renormalization Group with Clifford circuits. We generalize CA-MPS to the framework of Time-Dependent Variational Principle (TDVP) for time evolution simulations. We show that the Clifford circuits augmented TDVP method can reduce the entanglement entropy in the time evolution process.
  arXiv  Detail & Related papers  (2024-07-03T15:34:15Z)
• Clifford Dressed Time-Dependent Variational Principle [39.58317527488534]
  We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) By leveraging the Clifford group, we introduce a Clifford dressed single-site 1-TDVP scheme. We validate the new algorithm numerically using various quantum many-body models, including both integrable and non-integrable systems.
  arXiv  Detail & Related papers  (2024-07-01T18:04:25Z)
• Optimising the relative entropy under semi definite constraints -- A new tool for estimating key rates in QKD [0.0]
  Finding the minimal relative entropy of two quantum states under semi definite constraints is a pivotal problem. We provide a method that addresses this optimisation. We build on a recently introduced integral representation of quantum relative entropy by P.E. Frenkel.
  arXiv  Detail & Related papers  (2024-04-25T20:19:47Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• Non-stationary Reinforcement Learning under General Function Approximation [60.430936031067006]
  We first propose a new complexity metric called dynamic Bellman Eluder (DBE) dimension for non-stationary MDPs. Based on the proposed complexity metric, we propose a novel confidence-set based model-free algorithm called SW-OPEA. We show that SW-OPEA is provably efficient as long as the variation budget is not significantly large.
  arXiv  Detail & Related papers  (2023-06-01T16:19:37Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Quantum State Transfer Optimization: Balancing Fidelity and Energy Consumption using Pontryagin Maximum Principle [1.0819408603463425]
  We aim to navigate a quantum system from an initial state to a desired state while adhering to the principles of the Liouville-von Neumann equation. We derive optimality conditions in the form of the Pontryagin Principle (PMP) for the matrix-valued dynamics associated with this problem. We present a time-discretized computational scheme designed to solve the optimal control problem.
  arXiv  Detail & Related papers  (2023-01-30T12:53:48Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38: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.