相关论文: Many-body quantum magic
Entanglement is a key resource of quantum science for tasks that require it to be shared among participants. Within atomic, condensed matter and photonic many-body systems the distribution and sharing of entanglement is of particular…
We introduce and discuss the concept of \textit{arrangement}, traditionally found in the context of chemical reactions and few-body rearrangement collisions, in the general context of an $N$-body quantum system. We show that the ability for…
Boundary time crystals exhibit measurement-induced phase transitions in their steady-state entanglement, with critical behavior that depends on the particular unraveling of the Lindblad dynamics. In this work, we investigate another key…
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection…
Universal quantum computers are potentially an ideal setting for simulating many-body quantum dynamics that is out of reach for classical digital computers. We use state-of-the-art IBM quantum computers to study paradigmatic examples of…
Stabilizer R\'enyi entropies (SREs) probe the non-stabilizerness (or magic) of many-body systems and quantum computers. Here, we introduce the mutual von-Neumann SRE and magic capacity, which can be efficiently computed in time $O(N\chi^3)$…
We review various bounds concerning out-of-equilibrium dynamics in few-level and many-body quantum systems. We primarily focus on closed quantum systems but will also mention some related results for open quantum systems and classical…
We present an overview of our studies on the nonequilibrium dynamics of quantum systems that have many interacting particles. Our emphasis is on systems that show strong level repulsion, referred to as chaotic systems. We discuss how full…
The challenge posed by the many-body problem in quantum physics originates from the difficulty of describing the non-trivial correlations encoded in the exponential complexity of the many-body wave function. Here we demonstrate that…
We introduce novel schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in [Phys. Rev. Lett. 98, 220503 (2007), quant-ph/0609149]. Our method makes use of…
Suppose we have an unknown multipartite quantum state, how can we experimentally find out whether it is genuine multipartite entangled or not? Recall that even for a bipartite quantum state whose density matrix is known, it is already…
The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones…
Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Yet, it is hard to evaluate it, due to the complex structures of quantum states. Here, we introduce a generic method to quantify the k…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states -- the secret sauce to…
Controllable systems relying on quantum behavior to simulate distinctly quantum models so far rely on increasingly challenging classical computing to verify their results. We develop a general protocol for confirming that an arbitrary…
Efficient representation of quantum many-body states on classical computers is a problem of enormous practical interest. An ideal representation of a quantum state combines a succinct characterization informed by the system's structure and…
We investigate quantum states that posses both maximum entanglement and maximum discord between the pertinent parties. Since entanglement (discord) is defined only for bipartite (two qubit) systems, we shall introduce an appropriate sum…