Related papers: Disentangling magic states with classically simula…
Determining the quantum-classical boundary between quantum circuits which can be efficiently simulated classically and those which cannot remains a fundamental question. One approach to classical simulation is to represent the output of a…
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…
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum…
The Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability. Nevertheless, its application in qubit systems faces limitations due to negativity induced…
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic…
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…
In this paper, we present a learning algorithm aimed at learning states obtained from computational basis states by Clifford circuits doped with a finite number $t$ of $T$-gates. The algorithm learns an exact tomographic description of…
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the architecture, the computational space, magic states can then…
The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range…
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 classical simulation of highly-entangling quantum dynamics is conjectured to be generically hard. Thus, recently discovered measurement-induced transitions between highly entangling and low-entanglement dynamics are phase transitions in…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
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…
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…
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of $T$ gates or stabilizer rank, to…
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabilizer states explicitly. These algorithms outperform previous…
Building upon [arXiv:2509.01224], we present a few methods on how to simulate the non-Clifford $d=5$ magic state cultivation circuits [arXiv:2409.17595] with a sum of $\approx 8$ Clifford ZX-diagrams on average, at $0.1\%$ noise. Compared…
We introduce the notion of dismagicker: non-Clifford unitary gate designed to reduce the non-stabilizerness (also called magic) of quantum many-body states. Although both entanglement and non-stabilizerness are fundamental quantum…