相关论文: Efficient quantum algorithms for stabilizer entrop…

We investigate the problem of evaluating the output probabilities of Clifford circuits with nonstabilizer product input states. First, we consider the case when the input state is mixed, and give an efficient classical algorithm to…

We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…

The characterization of nonstabilizerness is fruitful due to its application in gate synthesis and classical simulation. In particular, the resource monotone called the stabilizer extent is a useful tool to estimate the simulation cost…

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…

Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient…

Stabilizer entropies (SE) measure deviations from stabilizer resources and as such are a fundamental ingredient for quantum advantage. In particular, the interplay of SE and entanglement is at the root of the complexity of classically…

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…

Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…

In this paper we continue to explore "hybrid" quantum circuit models in one-dimension with both unitary and measurement gates, focussing on the entanglement properties of wavefunction trajectories at long times, in the steady state. We…

Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work,…

Magic-state resource theory is a fundamental framework with far-reaching applications in quantum error correction and the classical simulation of quantum systems. Recent advances have significantly deepened our understanding of magic as a…

Classical simulation of quantum circuits plays a crucial role in validating quantum hardware and delineating the boundaries of quantum advantage. Among the most effective simulation techniques are those based on the stabilizer extent, which…

Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed in order to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the…

We study the non-stabilizer resources required to achieve informational completeness in single-setting quantum state estimation scenarios. We consider fixed-basis projective measurements preceded by quantum circuits acting on $n$-qubit…

Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of…

Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…

Finding ways to quantify magic is an important problem in quantum information theory. Recently Leone, Oliviero and Hamma introduced a class of magic measures for qubits, the stabilizer entropies of order $\alpha$, to aid in studying…

We introduce a novel measure for the quantum property of nonstabilizerness - commonly known as "magic" - by considering the R\'enyi entropy of the probability distribution associated to a pure quantum state given by the square of the…

We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…

We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension $d$. Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results…