Catalysts open up new reaction pathways that can speed up chemical reactions while not
consuming the catalyst. A similar phenomenon has been discovered in quantum information …

We introduce the framework of general probabilistic theories (GPTs for short). GPTs are a
class of operational theories that generalize both finite-dimensional classical and quantum …

Variational quantum algorithms are promising applications of noisy intermediate-scale
quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and …

Consumption of magic states promotes the stabilizer model of computation to universal
quantum computation. Here, we propose three different classical algorithms for simulating …

Non-stabilizerness–commonly known as magic–measures the extent to which a quantum
state deviates from stabilizer states and is a fundamental resource for achieving universal …

The task of learning a probability distribution from samples is ubiquitous across the natural
sciences. The output distributions of local quantum circuits are of central importance in both …

We propose efficient algorithms for classically simulating fermionic linear optics operations
applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for …

The development of a framework for quantifying 'non-stabilizerness' of quantum operations
is motivated by the magic state model of fault-tolerant quantum computation and by the need …

Entanglement is one of the physical properties of quantum systems responsible for the
computational hardness of simulating quantum systems. But while the runtime of specific …

In this paper we extend the resource theory of magic states to the channel domain by
considering completely stabilizer-preserving operations (CSPOs) as free. We introduce and …