Benchmarking quantum chaos from geometric complexity

• URL: http://arxiv.org/abs/2410.18754v1
• Date: Thu, 24 Oct 2024 14:04:58 GMT
• Title: Benchmarking quantum chaos from geometric complexity
• Authors: Arpan Bhattacharyya, Suddhasattwa Brahma, Satyaki Chowdhury, Xiancong Luo,
• Abstract summary: We consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems. Within some limitations, geometric complexity can indeed be a good indicator of quantum chaos.
• Score: 0.23436632098950458
• License:
• Abstract: Recent studies have shown that there is a strong interplay between quantum complexity and quantum chaos. In this work, we consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems to benchmark the quantum chaos in a well-known oscillator model. In particular, we study the circuit complexity for the unitary time-evolution operator of a non-Gaussian bosonic quantum mechanical system. Our results indicate that, within some limitations, geometric complexity can indeed be a good indicator of quantum chaos.

Related papers

• Simulating quantum chaos without chaos [1.7942265700058988]
  We introduce a novel class of quantum Hamiltonians that fundamentally challenges the conventional understanding of quantum chaos. Our ensemble is computationally indistinguishable from the Gaussian unitary ensemble (GUE) of strongly-interacting Hamiltonians. This stark contrast between efficient computational indistinguishability and traditional chaos indicators calls into question fundamental assumptions about the nature of quantum chaos.
  arXiv  Detail & Related papers  (2024-10-23T18:01:50Z)
• 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)
• Character Complexity: A Novel Measure for Quantum Circuit Analysis [0.0]
  This paper introduces Character Complexity, a novel measure that bridges Group-theoretic concepts with practical quantum computing concerns. I prove several key properties of character complexity and establish a surprising connection to the classical simulability of quantum circuits. I present innovative visualization methods for character complexity, providing intuitive insights into the structure of quantum circuits.
  arXiv  Detail & Related papers  (2024-08-19T01:58:54Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• On the sampling complexity of open quantum systems [0.0]
  We show how the complexity of the underlying quantum process corresponds to the complexity of the associated family of master equations for the dynamics. Our results pave the way for studying open quantum systems from a complexity-theoretic perspective.
  arXiv  Detail & Related papers  (2022-09-22T09:09:28Z)
• Saturation and recurrence of quantum complexity in random local quantum dynamics [5.803309695504831]
  Quantum complexity is a measure of the minimal number of elementary operations required to prepare a given state or unitary channel. Brown and Susskind conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating at a maximal value, and remaining maximally complex until undergoing recurrences at doubly-exponential times.
  arXiv  Detail & Related papers  (2022-05-19T17:42:31Z)
• Sensing quantum chaos through the non-unitary geometric phase [62.997667081978825]
  We propose a decoherent mechanism for sensing quantum chaos. The chaotic nature of a many-body quantum system is sensed by studying the implications that the system produces in the long-time dynamics of a probe coupled to it.
  arXiv  Detail & Related papers  (2021-04-13T17:24:08Z)
• 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)
• Complexity from the Reduced Density Matrix: a new Diagnostic for Chaos [0.0]
  We take a stride to analyze open quantum systems by using complexity. We propose a new diagnostic of quantum chaos from complexity based on the reduced density matrix.
  arXiv  Detail & Related papers  (2020-11-09T19:33:57Z)
• Quantum Non-equilibrium Many-Body Spin-Photon Systems [91.3755431537592]
  dissertation concerns the quantum dynamics of strongly-correlated quantum systems in out-of-equilibrium states. Our main results can be summarized in three parts: Signature of Critical Dynamics, Driven Dicke Model as a Test-bed of Ultra-Strong Coupling, and Beyond the Kibble-Zurek Mechanism.
  arXiv  Detail & Related papers  (2020-07-23T19:05:56Z)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)

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.