اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCircuit complexity for generalised coherent states in thermal field dynamics
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this work, we study the circuit complexity for generalized coherent states in thermal systems by adopting the covariance matrix approach. We focus on the coherent thermal (CT) state, which is non-Gaussian and has a nonvanishing one-point function. We find that even though the CT state cannot be fully determined by the symmetric two-point function, the circuit complexity can still be computed in the framework of the covariance matrix formalism by properly enlarging the covariance matrix. Now the group generated by the unitary is the semiproduct of translation and the symplectic group. If the reference state is Gaussian, the optimal geodesic is still be generated by a horizontal generator such that the circuit complexity can be read from the generalized covariance matrix associated to the target state by taking the cost function to be $F_2$. For a single harmonic oscillator, we discuss carefully the complexity and its formation in the cases that the reference states are Gaussian and the target space is excited by a single mode or double modes. We show that the study can be extended to the free scalar field theory.
قيم البحث
اقرأ أيضاً
We propose a modification to Nielsens circuit complexity for Hamiltonian simulation using the Suzuki-Trotter (ST) method, which provides a network like structure for the quantum circuit. This leads to an optimized gate counting linear in the geodesic
distance and spatial volume, unlike in the original proposal. The optimized ST iteration order is correlated with the error tolerance and plays the role of an anti-de Sitter (AdS) radial coordinate. The density of gates is shown to be monotonic with the tolerance and a holographic interpretation using path-integral optimization is given.
Computation of circuit complexity has gained much attention in the Theoretical Physics community in recent times to gain insights about the chaotic features and random fluctuations of fields in the quantum regime. Recent studies of circuit complexity
take inspiration from the geometric approach of Nielsen, which itself is based on the idea of optimal quantum control in which a cost function is introduced for the various possible path to determine the optimum circuit. In this paper, we study the relationship between the circuit complexity and Morse theory within the framework of algebraic topology using which we study circuit complexity in supersymmetric quantum field theory describing both simple and inverted harmonic oscillators up to higher orders of quantum corrections. The expression of circuit complexity in quantum regime would then be given by the Hessian of the Morse function in supersymmetric quantum field theory, and try to draw conclusion from their graphical behaviour. We also provide a technical proof of the well known universal connecting relation between quantum chaos and circuit complexity of the supersymmetric quantum field theories, using the general description of Morse theory.
We consider the circuit complexity of free bosons, or equivalently free fermions, in 1+1 dimensions. Motivated by the results of [1] and [2, 3] who found different behavior in the complexity of free bosons and fermions, in any dimension, we consider
the 1+1 dimensional case where, thanks to the bosonisation equivalence, we can consider the same state from both the bosonic and the fermionic perspectives. In this way the discrepancy can be attributed to a different choice of the set of gates allowed in the circuit. We study the effect in two classes of states: i) bosonic-coherent / fermionic-gaussian states; ii) states that are both bosonic- and fermionic-gaussian. We consider the complexity relative to the ground state. In the first class, the different results can be reconciled admitting a mode-dependent cost function in one of the descriptions. The differences in the second class are more important, in terms of the cutoff-dependence and the overall behavior of the complexity.
Recently in various theoretical works, path-breaking progress has been made in recovering the well-known Page Curve of an evaporating black hole with Quantum Extremal Islands, proposed to solve the long-standing black hole information loss problem re
lated to the unitarity issue. Motivated by this concept, in this paper, we study cosmological circuit complexity in the presence (or absence) of Quantum Extremal Islands in the negative (or positive) Cosmological Constant with radiation in the background of Friedmann-Lema$hat{i}$tre-Robertson-Walker (FLRW) space-time i.e the presence and absence of islands in anti-de Sitter and the de Sitter spacetime having SO(2, 3) and SO(1, 4) isometries respectively. Without using any explicit details of any gravity model, we study the behaviour of the circuit complexity function with respect to the dynamical cosmological solution for the scale factors for the above-mentioned two situations in FLRW space-time using squeezed state formalism. By studying the cosmological circuit complexity, Out-of-Time Ordered Correlators, and entanglement entropy of the modes of the squeezed state, in different parameter spaces, we conclude the non-universality of these measures. Their remarkably different features in the different parameter spaces suggest their dependence on the parameters of the model under consideration.
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to be prepared
. Such expectation values can be estimated by performing projective measurements on $O(M^3 log(M/delta)/epsilon^2)$ copies of the state, where $M$ is the dimension of an associated Lie algebra, $epsilon$ is a precision parameter, and $1-delta$ is the required confidence level. The method can be implemented on a classical computer and runs in time $O(M^4 log(M/epsilon))$. It provides $O(M log(M/epsilon))$ simple unitaries that form the sequence. The number of all computational resources is then polynomial in $M$, making the whole procedure very efficient in those cases where $M$ is significantly smaller than the Hilbert space dimension. When the algebra of relevant observables is determined by some Pauli matrices, each simple unitary may be easily decomposed into two-qubit gates. We discuss applications to quantum state tomography and classical simulations of quantum circuits.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
