Related papers: Pseudomagic Quantum States
How can one certify that an unknown quantum state possesses magic without resorting to full state tomography? We address this question by introducing two thermodynamic witnesses that rely solely on energy and heat measurements. First, we…
Quantum entanglement and quantum nonstabilizerness are fundamental resources that characterize distinct aspects of a quantum state: entanglement reflects non-local correlations, while nonstabilizerness quantifies the deviation from…
Quantum technologies exploit entanglement to enhance various tasks beyond their classical limits including computation, communication and measurements. Quantum metrology aims to increase the precision of a measured quantity that is…
We consider finite macroscopic systems, i.e., systems of large but finite degrees of freedom, which we believe are poorly understood as compared with small systems and infinite systems. We focus on pure states that do not have the `cluster…
We propose the concept of pseudorandom states and study their constructions, properties, and applications. Under the assumption that quantum-secure one-way functions exist, we present concrete and efficient constructions of pseudorandom…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
The property of non-stabiliserness, or ``magic'', is of interest in quantum computing due to its role in developing fault-tolerant quantum algorithms with genuine computational advantage over classical counterparts. There has been much…
When dealing with macroscopic objects one usually observes quasiclassical phenomena, which can be described in terms of quasiclassical (or classical) equations of motion. Recent development of the theory of quantum computation is based on…
We study the non-stabilizerness (quantum magic) content of the Hubbard dimer, an analytically solvable, yet completely non-trivial, model of strongly correlated fermions. We can access zero- and finite-temperature properties as well as the…
Universal quantum computers require entanglement and non-stabilizerness, a resource known as \textit{quantum magic}. Here, we introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics, which, contrary to…
Nonlocal quantum correlation is at the heart of bizarre nature of quantum physics. While there are various classes of nonlocal quantum correlation, steerability of a quantum state by local measurements provides unique operational features.…
Spreading information in physical systems is a common phenomenon. However, when the information is quantum in nature, tracking, describing, and quantifying the information is a challenging task. Quantum information scrambling defines the…
The study of properties of randomly chosen quantum states has in recent years led to many insights into quantum entanglement. In this work, we study private quantum states from this point of view. Private quantum states are bipartite…
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…
We use Nuclear Magnetic Resonance (NMR) to experimentally generate a bound entangled (more precisely: pseudo bound entangled) state, i.e. a quantum state which is non-distillable but nevertheless entangled. Our quantum system consists of…
Quantum state preparation can be strikingly counterintuitive: the fastest route to a target state need not start from the apparently closest initial condition. We uncover such a quantum Mpemba effect in the dynamical generation of quantum…
Entanglement serves as a foundational pillar in quantum information theory, delineating the boundary between what is classical and what is quantum. The common assumption is that higher entanglement corresponds to a greater degree of…
While there is strong evidence for advantages of quantum over classical computation, the repertoire of computational primitives with proven or conjectured quantum advantage remains limited. A big challenge of quantum algorithmic design is a…
Pseudoentangled states are defined by their ability to hide their entanglement structure: they are indistinguishable from random states to any observer with polynomial resources, yet can have much less entanglement than random states.…
Magic, a key quantum resource beyond entanglement, remains poorly understood in terms of its structure and classification. In this paper, we demonstrate a striking connection between high-dimensional symmetric lattices and quantum magic…