Circuit Complexity for Coherent-Thermal States in Bosonic String Theory
- URL: http://arxiv.org/abs/2202.08663v2
- Date: Mon, 28 Aug 2023 08:44:58 GMT
- Title: Circuit Complexity for Coherent-Thermal States in Bosonic String Theory
- Authors: Arshid Shabir, Sanjib Dey, Salman Sajad Wani, Suhail Lone, Seemin
Rubab, Mir Faizal
- Abstract summary: We first construct thermofield double states for bosonic string theory in the light-cone gauge.
We then obtain a coherent-thermal string state and a thermal-coherent string state.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we first construct thermofield double states for bosonic
string theory in the light-cone gauge. We then obtain a coherent-thermal string
state and a thermal-coherent string state. We use the covariance matrix
approach to calculate the circuit complexity of coherent-thermal string states.
In this approach, we generate the optimal geodesics by a horizontal string
generator, and then obtain the circuit complexity using the length of the
minimal geodesics in the group manifold.
Related papers
- Low-overhead non-Clifford topological fault-tolerant circuits for all non-chiral abelian topological phases [0.7873629568804646]
Family of explicit geometrically local circuits realizing any abelian non-chiral topological phase as an actively error-corrected fault-tolerant memory.
circuits are constructed from measuring 1-form symmetries in discrete fixed-point path integrals.
We prove fault tolerance under arbitrary local (including non-Pauli) noise for a very general class of topological circuits that we call 1-form symmetric fixed-point circuits.
arXiv Detail & Related papers (2024-03-18T18:00:00Z) - Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and
Optimal Algorithms [64.10576998630981]
We show the first tight characterization of the optimal Hessian-dependent sample complexity.
A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances.
The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
arXiv Detail & Related papers (2023-06-21T17:03:22Z) - Heat-based circuits using quantum rectification [0.0]
Heat-based circuitry has become ever more relevant due to a lower power expense to process logic bits of information.
In heat-based circuits, computations are performed by driving heat currents through a circuit using a temperature difference.
We demonstrate the required functionality of each circuit for use as heat-based analogues of standard electronic components.
arXiv Detail & Related papers (2022-09-13T18:00:00Z) - Circuit Complexity in an interacting quenched Quantum Field Theory [0.0]
We explore the effects of a quantum quench on the circuit complexity for a quenched quantum field theory having weakly coupled quartic interaction.
We show the analytical computation of circuit complexity for the quenched and interacting field theory.
arXiv Detail & Related papers (2022-09-07T18:00:03Z) - A Complete Equational Theory for Quantum Circuits [58.720142291102135]
We introduce the first complete equational theory for quantum circuits.
Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
arXiv Detail & Related papers (2022-06-21T17:56:31Z) - Photoinduced prethermal order parameter dynamics in the two-dimensional
large-$N$ Hubbard-Heisenberg model [77.34726150561087]
We study the microscopic dynamics of competing ordered phases in a two-dimensional correlated electron model.
We simulate the light-induced transition between two competing phases.
arXiv Detail & Related papers (2022-05-13T13:13:31Z) - Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
Kitaev's quantum double model based on a finite group $G$.
We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
arXiv Detail & Related papers (2022-05-04T08:10:36Z) - LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits.
Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
arXiv Detail & Related papers (2022-04-25T16:59:26Z) - Complexity for Conformal Field Theories in General Dimensions [0.0]
We study circuit complexity for conformal field theory states in arbitrary dimensions.
Our circuits start from a primary state and move along a unitary representation of the Lorentzian conformal group.
arXiv Detail & Related papers (2021-03-11T19:36:23Z) - Hardware-Encoding Grid States in a Non-Reciprocal Superconducting
Circuit [62.997667081978825]
We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code.
We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
arXiv Detail & Related papers (2020-02-18T16:45:09Z)
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.