اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMana in Haar-random states
157
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Mana is a measure of the amount of non-Clifford resources required to create a state; the mana of a mixed state on $ell$ qudits bounded by $le frac 1 2 (ell ln d - S_2)$; $S_2$ the states second Renyi entropy. We compute the mana of Haar-random pure and mixed states and find that the mana is nearly logarithmic in Hilbert space dimension: that is, extensive in number of qudits and logarithmic in qudit dimension. In particular, the average mana of states with less-than-maximal entropy falls short of that maximum by $ln pi/2$. We then connect this result to recent work on near-Clifford approximate $t$-designs; in doing so we point out that mana is a useful measure of non-Clifford resources precisely because it is not differentiable.
قيم البحث
اقرأ أيضاً
Classical chimera states are paradigmatic examples of partial synchronization patterns emerging in nonlinear dynamics. These states are characterized by the spatial coexistence of two dramatically different dynamical behaviors, i.e., synchronized and
desynchronized dynamics. Our aim in this contribution is to discuss signatures of chimera states in quantum mechanics. We study a network with a ring topology consisting of N coupled quantum Van der Pol oscillators. We describe the emergence of chimera-like quantum correlations in the covariance matrix. Further, we establish the connection of chimera states to quantum information theory by describing the quantum mutual information for a bipartite state of the network.
We investigate the entanglement of the ferromagnetic XY model in a random magnetic field at zero temperature and in the uniform magnetic field at finite temperatures. We use the concurrence to quantify the entanglement. We find that, in the ferromagn
etic region of the uniform magnetic field $h$, all the concurrences are textit{generated} by the random magnetic field and by the thermal fluctuation. In one particular region of $h$, the next-nearest neighbor concurrence is generated by the random field but not at finite temperatures. We also find that the qualitative behavior of the maximum point of the entanglement in the random magnetic field depends on whether the variance of its distribution function is finite or not.
The task of classifying the entanglement properties of a multipartite quantum state poses a remarkable challenge due to the exponentially increasing number of ways in which quantum systems can share quantum correlations. Tackling such challenge requi
res a combination of sophisticated theoretical and computational techniques. In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS), whose entanglement properties can be deduced via a constrained, reinforcement learning procedure. In this way, Separable Neural Network States (SNNS) can be used to build entanglement witnesses for any target state.
We introduce structured random matrix ensembles, constructed to model many-body quantum systems with local interactions. These ensembles are employed to study equilibration of isolated many-body quantum systems, showing that rather complex matrix str
uctures, well beyond Wigners full or banded random matrices, are required to faithfully model equilibration times. Viewing the random matrices as connectivities of graphs, we analyse the resulting network of classical oscillators in Hilbert space with tools from network theory. One of these tools, called the maximum flow value, is found to be an excellent proxy for equilibration times. Since maximum flow values are less expensive to compute, they give access to approximate equilibration times for system sizes beyond those accessible by exact diagonalisation.
The rapid development of quantum computing technologies already made it possible to manipulate a collective state of several dozen of qubits. This success poses a strong demand on efficient and reliable methods for characterization and verification o
f large-scale many-body quantum states. Traditional methods, such as quantum tomography, which require storing and operating wave functions on classical computers, become problematic to use in the regime of large number of degrees of freedom. In this paper, we propose a numerically cheap procedure to describe and distinguish quantum states which is based on a limited number of simple projective measurements in at least two different bases and computing inter-scale dissimilarities of the resulting bit-string patterns via coarse-graining. The information one obtains through this procedure can be viewed as a hash function of quantum state -- a simple set of numbers which is specific for a concrete many-body wave function and can be used for certification. By studying a number of archetypal examples, we show that it is enough to characterize quantum states with different structure of entanglement, including the chaotic quantum states. The connection of the dissimilarity to standard measures of quantum correlations such as von Neumann entropy is discussed. We also demonstrate that our approach can be employed to detect phase transitions of different nature in many-body quantum magnetic systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
