Optimization of path-integral tensor-multiplication schemes in open quantum systems

• URL: http://arxiv.org/abs/2502.15136v2
• Date: Fri, 22 Aug 2025 16:42:29 GMT
• Title: Optimization of path-integral tensor-multiplication schemes in open quantum systems
• Authors: L. M. J. Hall, A. Gisdakis, E. A. Muljarov,
• Abstract summary: Path-integral techniques are used in open quantum systems to provide an exact solution for the non-Markovian dynamics.<n>Here we provide a general optimization of tensor multiplication schemes for systems with pair correlations and finite memory times.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Path-integral techniques are a powerful tool used in open quantum systems to provide an exact solution for the non-Markovian dynamics. However, the exponential scaling of the tensor size with quantum memory length of these techniques limits the applicability when applied to systems with long memory times. Here we provide a general optimization of tensor multiplication schemes for systems with pair correlations and finite memory times. This optimization effectively reduces the tensor sizes by using a matrix representation of tensors combined with singular value decomposition to filter out negligible contributions. This approach dramatically reduces both computational time and memory usage of the traditional tensor-multiplication schemes. Calculations that would require over 50 million GB of RAM in the original approach are now available on standard computers, allowing access to new regimes and more complex systems. While more memory-efficient representations exist, this approach enables an extrapolation scheme that other techniques do not offer. As a demonstration, we apply it to the Trotter decomposition with linked cluster expansion technique, and use it to investigate a quantum dot-microcavity system at larger coupling strengths than previously achieved. We also apply the optimization in a case where the memory time is very long -- specifically in a system containing two spatially separated quantum dots in a common phonon bath.

Related papers

• Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits [72.41778531863143]
  We use path integral techniques to predict the switching rate in a single-mode bistable open quantum system.<n>Our results open new avenues for exploring switching phenomena in multistable single- and many-body open quantum systems.
  arXiv  Detail & Related papers  (2025-07-24T18:01:36Z)
• Distributed Tensor Network Library for Quantum Computing Emulation [0.0]
  HPC tensor network packages tackle this issue with a procedure called circuit slicing.<n>We present a novel alternative approach, where individual tensors are both broadcast and scattered.<n>We showcase its capabilities on ARCHER2, by emulating two well-known algorithms.
  arXiv  Detail & Related papers  (2025-05-09T15:17:42Z)
• Tensor-GaLore: Memory-Efficient Training via Gradient Tensor Decomposition [93.98343072306619]
  We present Navier-GaLore, a novel method for efficient training of neural networks with higher-order tensor weights.<n>Across various PDE tasks, Navier-GaLore achieves substantial memory savings, reducing memory usage by up to 75%.
  arXiv  Detail & Related papers  (2025-01-04T20:51:51Z)
• Memory-Efficient 4-bit Preconditioned Stochastic Optimization [53.422307389223626]
  We introduce 4-bit quantization for Shampoo's preconditioners.<n>To our knowledge, this is the first quantization approach applied to Cholesky factors of preconditioners.<n>We demonstrate that combining Cholesky quantization with error feedback enhances memory efficiency and algorithm performance.
  arXiv  Detail & Related papers  (2024-12-14T03:32:54Z)
• Memory-Augmented Hybrid Quantum Reservoir Computing [0.0]
  We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array.
  arXiv  Detail & Related papers  (2024-09-15T22:44:09Z)
• Quantum Circuit Optimization using Differentiable Programming of Tensor Network States [0.0]
  The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.
  arXiv  Detail & Related papers  (2024-08-22T17:48:53Z)
• Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression [87.5604418100301]
  Key-value( KV) caching is an important technique to accelerate the inference of large language models. Existing methods often compromise precision or require extra data for calibration. We introduce textbfDecoQuant, a novel data-free low-bit quantization technique based on tensor decomposition methods.
  arXiv  Detail & Related papers  (2024-05-21T08:35:10Z)
• Tensor networks based quantum optimization algorithm [0.0]
  In optimization, one of the well-known classical algorithms is power iterations. We propose a quantum realiziation to circumvent this pitfall. Our methodology becomes instance agnostic and thus allows one to address black-box optimization within the framework of quantum computing.
  arXiv  Detail & Related papers  (2024-04-23T13:49:11Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Sublinear scaling in non-Markovian open quantum systems simulations [0.0]
  We introduce a numerically exact algorithm to calculate process tensors. Our approach requires only $mathcalO(nlog n)$ singular value decompositions for environments with infinite memory.
  arXiv  Detail & Related papers  (2023-04-11T15:40:33Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Overcoming exponential scaling with system size in Trotter-Suzuki implementations of constrained Hamiltonians: 2+1 U(1) lattice gauge theories [1.5675763601034223]
  For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. quantum computers have been shown to allow for simulations of some of these systems using resources that scale exponentially with the system size. This work identifies a term in the Hamiltonian of a class of constrained systems that naively requires quantum resources that scale exponentially in the system size.
  arXiv  Detail & Related papers  (2022-08-05T18:00:52Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Neuromorphic computing with a single qudit [0.0]
  Reservoir computing is an alternative to high-fidelity control of many-body quantum systems. Here, we consider a reservoir comprised of a single qudit ($d$-dimensional quantum system) We demonstrate a robust performance advantage compared to an analogous classical system.
  arXiv  Detail & Related papers  (2021-01-27T22:35:22Z)
• Continuous and time-discrete non-Markovian system-reservoir interactions: Dissipative coherent quantum feedback in Liouville space [62.997667081978825]
  We investigate a quantum system simultaneously exposed to two structured reservoirs. We employ a numerically exact quasi-2D tensor network combining both diagonal and off-diagonal system-reservoir interactions with a twofold memory for continuous and discrete retardation effects. As a possible example, we study the non-Markovian interplay between discrete photonic feedback and structured acoustic phononovian modes, resulting in emerging inter-reservoir correlations and long-living population trapping within an initially-excited two-level system.
  arXiv  Detail & Related papers  (2020-11-10T12:38:35Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36: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.