Related papers: Quantifying dynamical magic with completely stabil…
The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a…
The guesswork of a classical-quantum channel quantifies the cost incurred in guessing the state transmitted by the channel when only one state can be queried at a time, maximized over any classical pre-processing and minimized over any…
Magic state distillation (MSD) is a purification protocol that plays a central role in fault tolerant quantum computation. Repeated iteration of the steps of a MSD protocol, generates pure single non-stabilizer states, or magic states, from…
We introduce a general formalism, based on the stochastic formulation of quantum mechanics, to obtain localized quasi-classical wave packets as dynamically controlled systems, for arbitrary anharmonic potentials. The control is in general…
Quantum machine learning uses principles from quantum mechanics to process data, offering potential advances in speed and performance. However, previous work has shown that these models are susceptible to attacks that manipulate input data…
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…
A set of stabilizer operations augmented by some special initial states known as 'magic states', gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations…
In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter…
The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a…
Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both…
Magic is a non-classical resource whose efficient manipulation is fundamental to advancing efficient and scalable fault-tolerant quantum computing. Quantum advantage is possible only if both magic and entanglement are present. Of particular…
We discover that quantum dynamical tunneling, occurring between phase space regions in a classically forbidden way, can break conserved quantities in pseudointegrable systems. We rigorously prove that a conserved quantity in a class of…
We prove that deciding whether a classical-quantum (C-Q) channel can exactly preserve a single classical bit is QCMA-complete. This "bit-preservation" problem is a special case of orthogonality-constrained optimization tasks over C-Q…
Recent advances in quantum hardware are bringing fault-tolerant quantum computing (FTQC) closer to reality. In the early stage of FTQC, however, the numbers of available logical qubits and high-fidelity $T$ gates remain limited, making it…
We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute…
We develop a mathematically rigorous framework for simulating \emph{multiscale physical systems} using quantum computational resources, by translating the \emph{language of asymptotic-preserving (AP) schemes} into the formalism of quantum…
We develop a general framework to assess capabilities and limitations of the Gaussian toolbox in continuous variable quantum information theory. Our framework allows us to characterize the structure and properties of quantum resource…
In this work, we investigate the behavior of quantum entropy under quantum convolution and its application in quantifying magic. We first establish an entropic, quantum central limit theorem (q-CLT), where the rate of convergence is bounded…
We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…
We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approach in which errors are prevented and…