Results 41 to 50 of about 93,203 (297)

Exact Gravity Duals for Simple Quantum Circuits

open access: yesSciPost Physics, 2022
Holographic complexity proposals have sparked interest in quantifying the cost of state preparation in quantum field theories and its possible dual gravitational manifestations. The most basic ingredient in defining complexity is the notion of a class of
Johanna Erdmenger, Mario Flory, Marius Gerbershagen, Michal P. Heller, Anna-Lena Weigel
doaj   +1 more source

Complexity of mixed Gaussian states from Fisher information geometry

open access: yesJournal of High Energy Physics, 2020
We study the circuit complexity for mixed bosonic Gaussian states in harmonic lattices in any number of dimensions. By employing the Fisher information geometry for the covariance matrices, we consider the optimal circuit connecting two states with ...
Giuseppe Di Giulio, Erik Tonni
doaj   +1 more source

Quantum key recovery attack on SIMON32/64

open access: yesCybersecurity, 2021
The quantum security of lightweight block ciphers is receiving more and more attention. However, the existing quantum attacks on lightweight block ciphers only focused on the quantum exhaustive search, while the quantum attacks combined with classical ...
Hui Liu, Li Yang
doaj   +1 more source

Circuit complexity for coherent-thermal states in bosonic string theory

open access: yesEuropean Physical Journal C: Particles and Fields, 2023
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.
Arshid Shabir   +5 more
doaj   +1 more source

Circuit Complexity in presence of a defect

open access: yes, 2022
We study circuit complexity for the ground state of a harmonic chainwith defect in 1+1 dimensions, choosing as a reference state, the ground state of the homogeneous chain.
Gentile, Francesco
core  

Relativized circuit complexity

open access: yes24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 1983
We compare the measures of sequential time modelled using Turing machines and of parallel size modelled using Boolean circuits. This is done by constructing oracles which show certain relationships between complexity classes. An oracle \(B\) is shown for which \(\Delta_ 2^{P,B}\) has \(2n+o(n)\) size circuits relative to B. On the other hand, we give a
openaire   +1 more source

Spatially embedded dynamics and complexity

open access: yes, 2010
To gain a deeper understanding of the impact of spatial embedding on the dynamics of complex systems we employ a measure of interaction complexity developed within neuroscience using the tools of statistical information theory. We apply this measure to a
Bullock, Seth, Buckley, Christopher L.
core   +1 more source

Circuit complexity of knot states in Chern-Simons theory

open access: yesJournal of High Energy Physics, 2019
We compute an upper bound on the circuit complexity of quantum states in 3d Chern-Simons theory corresponding to certain classes of knots. Specifically, we deal with states in the torus Hilbert space of Chern-Simons that are the knot complements on the 3-
Giancarlo Camilo   +3 more
doaj   +1 more source

Arithmetic Circuit Complexity of Division and Truncation [PDF]

open access: yes, 2021
Given polynomials f,g,h ∈ [x₁,…,x_n] such that f = g/h, where both g and h are computable by arithmetic circuits of size s, we show that f can be computed by a circuit of size poly(s,deg(h)).
Jindal, Gorav   +3 more
core   +1 more source

OrthoID: profiling dynamic proteomes through time and space using mutually orthogonal chemical tools

open access: yesNature Communications
Identifying proteins at organelle contact sites, such as mitochondria-associated endoplasmic reticulum membranes (MAM), is essential for understanding vital cellular processes, yet challenging due to their dynamic nature.
Ara Lee   +14 more
doaj   +1 more source

Home - About - Disclaimer - Privacy