Related papers: Weighting gates in circuit complexity and holograp…
Using the ``complexity equals action''(CA) conjecture, for an ordinary charged system, it has been shown that the late-time complexity growth rate is given by a difference between the value of $\Phi_{H}Q+\Omega_H J$ on the inner and outer…
We investigate holographic complexity in Einstein-Maxwell theory with a non-minimal coupling of the form $R^2F_{\mu\nu}F^{\mu\nu}$ within the complexity=anything framework. A perturbative AdS black brane solution is constructed to first…
Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends…
Parameterized quantum circuits play an essential role in the performance of many variational hybrid quantum-classical (HQC) algorithms. One challenge in implementing such algorithms is to choose an effective circuit that well represents the…
We study circuit complexity for spatial regions in holographic field theories. We study analogues based on the entanglement wedge of the bulk quantities appearing in the "complexity = volume" and "complexity = action" conjectures. We…
In this paper, we determine the electromagnetic effects on the complexity factor of radiating anisotropic cylindrical geometry in the background of $f(G,\mathcal{T})$ theory. The self-gravitating objects possessing inhomogeneous energy…
We investigate the potential of bio-inspired evolutionary algorithms for designing quantum circuits with specific goals, focusing on two particular tasks. The first one is motivated by the ideas of Artificial Life that are used to reproduce…
We consider the effects of higher curvature terms on a holographic dual description of boundary conformal field theory. Specifically, we consider three-dimensional gravity with a specific combination of Ricci tensor square and curvature…
Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in $\mathcal{Z}_2$ Even Effective Field Theories ($\mathcal{Z}_2$ EEFTs). We consider a massive…
Quantum operations on pure states can be fully represented by unitary matrices. Variational quantum circuits, also known as quantum neural networks, embed data and trainable parameters into gate-based operations and optimize the parameters…
Quantum computing (QC) promises theoretical advantages, benefiting computational problems that would not be efficiently classically simulatable. However, much of this theoretical speedup depends on the quantum circuit design solving the…
In the rapidly evolving field of quantum computing, quantifying circuit complexity remains a critical challenge. This paper introduces Character Complexity, a novel measure that bridges Group-theoretic concepts with practical quantum…
The entanglement entropy of three-dimensional conformal field theories contains a universal contribution coming from corners in the entangling surface. We study these contributions in a holographic framework and, in particular, we consider…
We discuss the interpretation of path integral optimization as a uniformization problem in even dimensions. This perspective allows for a systematical construction of the higher-dimensional path integral complexity in holographic conformal…
This paper describes about relation between circuit complexity and accept inputs structure in Hamming space by using almost all monotone circuit that emulate deterministic Turing machine (DTM). Circuit family that emulate DTM are almost all…
We discuss the relation between coarse-graining and the holographic principle in the framework of loop quantum gravity and ask the following question: when we coarse-grain arbitrary spin network states of quantum geometry, are we…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
Current experimental quantum computing devices are limited by noise, mainly originating from entangling gates. If an efficient gate sequence for an operation is unknown, one often employs layered parameterized quantum circuits, especially…