Related papers: Quantifying magic for multi-qubit operations
Expectation values of observables are routinely estimated using so-called classical shadows$\unicode{x2014}$the outcomes of randomized bases measurements on a repeatedly prepared quantum state. In order to trust the accuracy of shadow…
Understanding whether uniquely quantum features can provide concrete advantages in thermodynamic processes is a central objective of quantum thermodynamics. A key challenge is quantifying how different forms of non-classicality can be…
In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we find that many gate optimisation problems for approximately…
Development of robust quantum control has been challenging and there are numerous obstacles to applying classical robust control to quantum system including bilinearity, marginal stability, state preparation errors, nonlinear figures of…
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms,…
Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such as oracles…
Magic is a property of a quantum state that characterizes its deviation from a stabilizer state, serving as a useful resource for achieving universal quantum computation e.g., within schemes that use Clifford operations. In this work, we…
Boundary time crystals exhibit measurement-induced phase transitions in their steady-state entanglement, with critical behavior that depends on the particular unraveling of the Lindblad dynamics. In this work, we investigate another key…
Scalable realisation of quantum computing is reliant on the development of fault tolerant devices. Analysis of quantum error correction protocols typically considers incoherent noise models or noise-free syndrome measurements. While this is…
As the hardware technology for quantum computing advances, its possible applications are actively searched and developed. However, such applications still suffer from the noise on quantum devices, in particular when using two-qubit gates…
We study the classical simulation complexity in both the weak and strong senses, of matchgate (MG) computations supplemented with all combinations of settings involving inclusion of intermediate adaptive or nonadaptive computational basis…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
Unraveling the secrets of how much nonstabilizerness a quantum dynamic can generate is crucial for harnessing the power of magic states, the essential resources for achieving quantum advantage and realizing fault-tolerant quantum…
We develop a notion of quantum channels that can make states useless for universal quantum computation by destroying their magic (non-stabilizerness) - we refer to them as magic-breaking channels. We establish the properties of these…
The diverse range of resources which underlie the utility of quantum states in practical tasks motivates the development of universally applicable methods to measure and compare resources of different types. However, many of such approaches…
Several important models of machine learning algorithms have been successfully generalized to the quantum world, with potential speedup to training classical classifiers and applications to data analytics in quantum physics that can be…
Universal quantum computers require entanglement and non-stabilizerness, a resource known as \textit{quantum magic}. Here, we introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics, which, contrary to…
We study a non-stabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer R\'enyi entropy analog in operator space is a good magic monotone satisfying the usual conditions while…
Magic describes the distance of a quantum state to its closest stabilizer state. It is -- like entanglement -- a necessary resource for a potential quantum advantage over classical computing. We study magic, quantified by stabilizer…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…