Sublinear scaling in non-Markovian open quantum systems simulations

• URL: http://arxiv.org/abs/2304.05291v2
• Date: Fri, 11 Aug 2023 13:19:48 GMT
• Title: Sublinear scaling in non-Markovian open quantum systems simulations
• Authors: Moritz Cygorek, Jonathan Keeling, Brendon W. Lovett, Erik M. Gauger
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: While several numerical techniques are available for predicting the dynamics of non-Markovian open quantum systems, most struggle with simulations for very long memory and propagation times, e.g., due to superlinear scaling with the number of time steps $n$. Here, we introduce a numerically exact algorithm to calculate process tensors -- compact representations of environmental influences -- which provides a scaling advantage over previous algorithms by leveraging self-similarity of the tensor networks that represent Gaussian environments. Based on a divide-and-conquer strategy, our approach requires only $\mathcal{O}(n\log n)$ singular value decompositions for environments with infinite memory. Where the memory can be truncated after $n_c$ time steps, a scaling $\mathcal{O}(n_c\log n_c)$ is found, which is independent of $n$. This improved scaling is enabled by identifying process tensors with repeatable blocks. To demonstrate the power and utility of our approach we provide three examples. (1) We calculate the fluorescence spectra of a quantum dot under both strong driving and strong dot-phonon couplings, a task requiring simulations over millions of time steps, which we are able to perform in minutes. (2) We efficiently find process tensors describing superradiance of multiple emitters. (3) We explore the limits of our algorithm by considering coherence decay with a very strongly coupled environment. The algorithm we present here not only significantly extends the scope of numerically exact techniques to open quantum systems with long memory times, but also has fundamental implications for simulation complexity.

Related papers

• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization [33.12181620473604]
  Variational Quantum algorithms have established their potential to provide computational advantage in the realm of optimization. These algorithms suffer from classically intractable gradients limiting the scalability. This work proposes a classical gradient method which utilizes the parameter shift rule but computes the expected values from the circuits using a tensor ring approximation.
  arXiv  Detail & Related papers  (2023-07-08T03:14:28Z)
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian [0.5097809301149342]
  We show that a na"ive partitioning and low-order splitting formula can yield, through our divide and conquer formalism, superior scaling to qubitization for large $Lambda$. We also give new algorithmic and circuit level techniques for gate optimization including a new way of implementing a group of multi-controlled-X gates.
  arXiv  Detail & Related papers  (2023-06-19T23:20:30Z)
• A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo [4.134846879110833]
  We introduce a new analog'' quantum representation of processes, in which the value of the process at time t is stored in the amplitude of the quantum state. We show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $textpolylog(T)$, which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time $O(textpolylog(Tepsilon
  arXiv  Detail & Related papers  (2023-03-12T17:54:38Z)
• Algorithmic Shadow Spectroscopy [0.0]
  We present a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) We demonstrate that our method is intuitively easy to use in practice, robust against gate noise, to a new type of algorithmic error mitigation technique, and uses orders of magnitude fewer number of shots than typical near-term quantum algorithms -- as low as 10 shots per timestep is sufficient.
  arXiv  Detail & Related papers  (2022-12-21T14:23:48Z)
• Algorithms for perturbative analysis and simulation of quantum dynamics [0.0]
  We develop general purpose algorithms for computing and utilizing both the Dyson series and Magnus expansion. We demonstrate how to use these tools to approximate fidelity in a region of model parameter space. We show how the pre-computation step can be phrased as a multivariable expansion problem with fewer terms than in the original method.
  arXiv  Detail & Related papers  (2022-10-20T21:07:47Z)
• Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit [36.17720004582283]
  This work conducts such an exploration through the lens of learning $k$-sparse parities of $n$ bits. We find that neural networks exhibit surprising phase transitions when scaling up dataset size and running time.
  arXiv  Detail & Related papers  (2022-07-18T17:55:05Z)
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization [0.18374319565577155]
  We analyze and optimize the resources required to implement two first quantized quantum algorithms for chemistry. We demonstrate that our qubitized algorithm often requires much less surface code spacetime volume for simulating millions of plane waves than the best second quantized algorithms.
  arXiv  Detail & Related papers  (2021-05-26T18:06:33Z)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20: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.