Continuous Coherent Quantum Feedback with Time Delays: Tensor Network Solution

• URL: http://arxiv.org/abs/2311.07302v1
• Date: Mon, 13 Nov 2023 12:46:58 GMT
• Title: Continuous Coherent Quantum Feedback with Time Delays: Tensor Network Solution
• Authors: Kseniia Vodenkova, Hannes Pichler
• Abstract summary: We develop a novel method to solve problems involving quantum optical systems coupled to coherent quantum feedback loops featuring time delays. Our method is based on exact mappings of such non-Markovian problems to equivalent Markovian driven dissipative quantum many-body problems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In this paper we develop a novel method to solve problems involving quantum optical systems coupled to coherent quantum feedback loops featuring time delays. Our method is based on exact mappings of such non-Markovian problems to equivalent Markovian driven dissipative quantum many-body problems. In this work we show that the resulting Markovian quantum many-body problems can be solved (numerically) exactly and efficiently using tensor network methods for a series of paradigmatic examples, consisting of driven quantum systems coupled to waveguides at several distant points. In particular, we show that our method allows solving problems in so far inaccessible regimes, including problems with arbitrary long time delays and arbitrary numbers of excitations in the delay lines. We obtain solutions for the full real-time dynamics as well as the steady state in all these regimes. Finally, motivated by our results, we develop a novel mean-field approach, which allows us to find the solution semi-analytically and identify parameter regimes where this approximation is in excellent agreement with our exact tensor network results.

Related papers

• A Greedy Quantum Route-Generation Algorithm [0.0]
  We propose a greedy algorithm that generates routes by using information from all samples obtained from the quantum computer. By noticing the relationship between qubits in our formulation as a directed acyclic graph (DAG), we designed an algorithm that adaptively constructs a feasible solution.
  arXiv  Detail & Related papers  (2024-05-05T21:20:46Z)
• Simulating adiabatic quantum computation with a variational approach [0.0]
  We present here a variational approach to substantially alleviate this problem in many situations of interest. We demonstrate that accurate results can be obtained in a variety of problems, ranging from the description of defect generation through a dynamical phase transition in 1D to the complex dynamics of frustrated spin-glass problems both on fully-connected and Chimera graphs.
  arXiv  Detail & Related papers  (2024-03-08T08:31:48Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Embedding of Time-Delayed Quantum Feedback in a Nonreciprocal Array [0.0]
  Time-delayed quantum feedback is a fast and efficient method to control and stabilize few and many-body quantum systems. Here, we present a method of encoding time-delayed quantum feedback into a chain of nonreciprocally coupled auxiliary oscillators. Our approach serves as a novel method of introducing time-delayed quantum feedback and provides the advantage of large tunability.
  arXiv  Detail & Related papers  (2022-04-05T17:18:00Z)
• Recovering models of open quantum systems from data via polynomial optimization: Towards globally convergent quantum system identification [4.25234252803357]
  Current quantum devices suffer imperfections as a result of fabrication, as well as noise and dissipation as a result of coupling to their immediate environments. An alternative is to extract such models from time-series measurements of their behavior. Recent advances in optimization have provided globally convergent solvers for this class of problems. We include an overview of the state-of-the-art algorithms, bounds, and convergence rates, and illustrate the use of this approach to modeling open quantum systems.
  arXiv  Detail & Related papers  (2022-03-31T16:38:08Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• 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)
• Theoretical survey of unconventional quantum annealing methods applied to adifficult trial problem [2.2209333405427585]
  We consider a range of unconventional modifications to Quantum Annealing (QA) In this problem, inspired by "transverse field chaos" in larger systems, classical and quantum methods are steered toward a false local minimum. We numerically study this problem by using a variety of new methods from the literature.
  arXiv  Detail & Related papers  (2020-11-12T05:54:57Z)

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.