Related papers: Krylov Spread Complexity of Quantum-Walks

Krylov Spread Complexity of Quantum-Walks

URL: http://arxiv.org/abs/2401.00526v2
Date: Tue, 3 Sep 2024 18:28:13 GMT
Title: Krylov Spread Complexity of Quantum-Walks
Authors: Bhilahari Jeevanesan,
Abstract summary: The paper sheds new light on the Krylov complexity measure by exploring it in the context of continuous-time quantum-walks on graphs. A close relationship between Krylov spread complexity and the concept of limiting-distributions for quantum-walks is established. Using a graph optimization algorithm, quantum-walk graphs are constructed that have minimal and maximal long-time average Krylov $bar C$-complexity.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Given the recent advances in quantum technology, the complexity of quantum states is an important notion. The idea of the Krylov spread complexity has come into focus recently with the goal of capturing this in a quantitative way. The present paper sheds new light on the Krylov complexity measure by exploring it in the context of continuous-time quantum-walks on graphs. A close relationship between Krylov spread complexity and the concept of limiting-distributions for quantum-walks is established. Moreover, using a graph optimization algorithm, quantum-walk graphs are constructed that have minimal and maximal long-time average Krylov $\bar C$-complexity. This reveals an empirical upper bound for the $\bar C$-complexity as a function of Hilbert space dimension and an exact lower bound.

Related papers

Krylov complexity as an order parameter for quantum chaotic-integrable transitions [0.0]
Krylov complexity has emerged as a new paradigm to characterize quantum chaos in many-body systems. Recent insights have revealed that in quantum chaotic systems Krylov state complexity exhibits a distinct peak during time evolution. We propose that this Krylov complexity peak (KCP) is a hallmark of quantum chaotic systems and suggest that its height could serve as an 'order parameter' for quantum chaos.
arXiv Detail & Related papers (2024-07-24T07:32:27Z)
Quantum Dynamics in Krylov Space: Methods and Applications [0.0]
The dynamics of quantum systems unfolds within a subspace of the state space or operator space, known as the Krylov space. This review presents the use of Krylov subspace methods to provide a compact and computationally efficient description of quantum evolution.
arXiv Detail & Related papers (2024-05-15T18:00:09Z)
Krylov complexity as an order parameter for deconfinement phase transitions at large $N$ [0.0]
Krylov complexity is an order parameter of confinement/deconfinement transitions in large $N$ quantum field theories. We show that Krylov complexity reflects the confinement/deconfinement phase transitions through the continuity of mass spectrum.
arXiv Detail & Related papers (2024-01-09T07:04:17Z)
Taming Quantum Time Complexity [45.867051459785976]
We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
arXiv Detail & Related papers (2023-11-27T14:45:19Z)
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)
Krylov Complexity of Fermionic and Bosonic Gaussian States [9.194828630186072]
This paper focuses on emphKrylov complexity, a specialized form of quantum complexity. It offers an unambiguous and intrinsically meaningful assessment of the spread of a quantum state over all possible bases.
arXiv Detail & Related papers (2023-09-19T07:32:04Z)
Krylov complexity in quantum field theory, and beyond [44.99833362998488]
We study Krylov complexity in various models of quantum field theory. We find that the exponential growth of Krylov complexity satisfies the conjectural inequality, which generalizes the Maldacena-Shenker-Stanford bound on chaos.
arXiv Detail & Related papers (2022-12-29T19:00:00Z)
Krylov Complexity in Open Quantum Systems [3.5895926924969404]
We show that Krylov complexity in open systems can be mapped to a non-hermitian tight-binding model in a half-infinite chain. Our work provides insights for discussing complexity, chaos, and holography for open quantum systems.
arXiv Detail & Related papers (2022-07-27T16:03:41Z)
Quantum Davidson Algorithm for Excited States [42.666709382892265]
We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
arXiv Detail & Related papers (2022-04-22T15:03:03Z)
Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z)
Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.