相关论文: Quantifying magic via quantum $(\alpha,\beta)$ Jen…

Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error…

The nonstabilizerness of quantum states is a necessary resource for universal quantum computation, yet its characterization is notoriously demanding. Quantifying nonstabilizerness typically requires an exponential number of measurements and…

By constructing the quantum state in high-dimensional probability tensor, we find the quantum magic square(QMS) may stand as an ideal means of characterizing the non-local phenomena, i.e. the separability, entanglement, two/one-way…

Quantifying entanglement is a work in progress which is important for the active field of quantum information and computation. A measure of bipartite pure state entanglement is proposed here, named entanglement coherence, which is…

The concept of quantum phase space offers a view on quantum mechanics, which is different from the standard Hilbert space approach, but which more closely resembles the classical phase space. Due to the properties of quantum mechanics there…

We present a novel quantum Monte Carlo method for evaluating the $\alpha$-stabilizer R\'enyi entropy (SRE) for any integer $\alpha\ge 2$. By interpreting $\alpha$-SRE as partition function ratios, we eliminate the sign problem in the…

Although the similarity between non-stabilizer states -- also known as magic states -- in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two…

Magic is a non-classical resource whose efficient manipulation is fundamental to advancing efficient and scalable fault-tolerant quantum computing. Quantum advantage is possible only if both magic and entanglement are present. Of particular…

In a recent paper, the generalization of the Jensen Shannon divergence (JSD) in the context of quantum theory has been studied (Phys. Rev. A 72, 052310 (2005)). This distance between quantum states has shown to verify several of the…

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…

Quantum computers promise to solve computational problems significantly faster than classical computers. These 'speed-ups' are achieved by utilizing a resource known as magic. Measuring the amount of magic used by a device allows us to…

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…

Quantum magic, or nonstabilizerness, provides a crucial characterization of quantum systems, regarding the classical simulability with stabilizer states. In this work, we propose a novel and efficient algorithm for computing stabilizer…

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…

Entanglement and magic are among the most fundamental properties unique to quantum systems. Each quantity captures a different aspect of non-classical behavior, and each can be regarded as a resource within its own operational setting.…

We discuss quantum speed limits (QSLs) for finite-dimensional quantum systems undergoing general physical processes. These QSLs were obtained using two families of entropic measures, namely the square root of the Jensen-Shannon divergence,…

We propose a method for classical simulation of finite-dimensional quantum systems, based on sampling from a quasiprobability distribution, i.e., a generalized Wigner function. Our construction applies to all finite dimensions, with the…

We develop classical simulation algorithms for adaptive quantum circuits that produce states with low levels of ``magic'' (i.e., non-stabilizerness). These algorithms are particularly well-suited to circuits with high rates of Pauli…

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…

We introduce Magic Secret Sharing (MSS), a quantum cryptographic primitive in which the secret is the computational capability of a quantum state rather than its classical description. In the resource theory of magic, non-stabilizer states…