Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits

• URL: http://arxiv.org/abs/2507.18714v1
• Date: Thu, 24 Jul 2025 18:01:36 GMT
• Title: Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits
• Authors: Léon Carde, Ronan Gautier, Nicolas Didier, Alexandru Petrescu, Joachim Cohen, Alexander McDonald,
• Abstract summary: 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.
• Score: 72.41778531863143
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we use path integral techniques to predict the switching rate in a single-mode bistable open quantum system. While analytical expressions are well-known to be accessible for systems subject to Gaussian noise obeying classical detailed balance, we generalize this approach to a class of quantum systems, those which satisfy the recently-introduced hidden time-reversal symmetry [1]. In particular, in the context of quantum computing, we deliver precise estimates of bit-flip error rates in cat-qubit architectures, circumventing the need for costly numerical simulations. Our results open new avenues for exploring switching phenomena in multistable single- and many-body open quantum systems.

Related papers

• Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
  We study a class of maximally chaotic circuits known as dual unitary circuits. We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators. We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
  arXiv  Detail & Related papers  (2024-11-01T17:57:13Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Dissipative Search via Lindbladians [0.0]
  We analyze a purely dissipative quantum random walk on an unstructured classical search space.<n>We show that certain jump operators make the quantum process replicate a classical one, while others yield differences between open quantum (OQRW) and classical random walks.<n>We also clarify a previously observed quadratic speedup, demonstrating that OQRWs are no more efficient than classical search.
  arXiv  Detail & Related papers  (2024-07-16T14:39:18Z)
• Stochastic simulation of dissipative quantum oscillators [0.0]
  We use the paradigmatic case of a dissipative oscillator to give a pedagogic introduction into the modelling of open quantum systems. We use quasiclassical methods that use a 'quantum' noise spectrum to capture the influence of the environment on the system. Such methods have the potential to offer insights into the impact of the quantum nature of the environment on the dynamics of the system of interest whilst still being computationally tractable.
  arXiv  Detail & Related papers  (2024-06-07T15:49:50Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Embedding memory-efficient stochastic simulators as quantum trajectories [0.0]
  We show how continuous-time quantum simulators can be embedded in open quantum systems. We further show how such an embedding can be made exploiting for discrete-time processes.
  arXiv  Detail & Related papers  (2024-02-07T09:54: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)
• Accelerating Quantum Relaxation via Temporary Reset: A Mpemba-Inspired Approach [0.0]
  We introduce a universal quantum reset protocol that enables exponential acceleration of relaxation in general Markovian open quantum systems.<n>The protocol induces a quantum Mpemba effect, wherein systems farther from equilibrium can relax faster than those closer to it.<n>This framework provides a versatile and experimentally feasible tool for controlling quantum relaxation timescales.
  arXiv  Detail & Related papers  (2022-12-21T16:31:27Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Variational Quantum Algorithms for Steady States of Open Quantum Systems [2.740982822457262]
  We propose a variational quantum algorithm to find the steady state of open quantum systems. The fidelity between the optimal mixed state and the true steady state is over 99%. This algorithm is derived from the natural idea of expressing mixed states with purification.
  arXiv  Detail & Related papers  (2020-01-08T14:47:36Z)

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.