Related papers: Quantifying the magic of quantum channels
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
Magic states play an important role in fault-tolerant quantum computation, and so the quantification of magic for quantum states is of great significance. In this work, we propose two new magic quantifiers by introducing two versions of…
The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the…
The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice)…
We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a…
Magic (non-stabilizerness) is a key resource for achieving universal fault-tolerant quantum computation beyond classical computation. While previous studies have primarily focused on magic in single systems, its interactions and…
Quantum magic, which accounts for the non-stabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. We investigate the generation and evolution of quantum magic in discrete-time…
We investigate the dynamics of nonstabilizerness - also known as `magic' - in monitored quantum circuits composed of random Clifford unitaries and local projective measurements. For measurements in the computational basis, we derive an…
Identifying the boundary between classical and quantum computation is a central challenge in quantum information. In multi-qubit systems, entanglement and magic are the key resources underlying genuinely quantum behaviour. While…
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 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 study the effect of quantum memory in magic squares game when played in quantum domain. We consider different noisy quantum channels and analyze their influence on the magic squares quantum pseudo-telepathy game. We show that the…
We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context.…
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements…
In the resource theory of non-stabilizerness, we prove that stabilizer operations cannot replicate or broadcast the "magic" resource of all quantum states in an arbitrary finite dimension. Moreover, we show that even in unrestricted…
It is generally considered that the signal output by a quantum circuit is attenuated exponentially fast in the number of gates. This letter explores how algorithms using mid-circuit measurements and classical conditioning as computational…
Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the…
Demonstrating quantum supremacy, a complexity-guaranteed quantum advantage against over the best classical algorithms by using less universal quantum devices, is an important near-term milestone for quantum information processing. Here we…
Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups. We introduce an efficient classical framework for computing stabilizer R\'enyi entropies and stabilizer…