Related papers: Stabilizer rank and higher-order Fourier analysis
Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient…
A measurement-induced continuous-variable logical gate is able to prepare Schr\"odinger cat states if the gate uses a non-Gaussian resource state, such as cubic phase state [I. V. Sokolov, Phys. Lett. A 384, 126762 (2020)]. Our scheme…
We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…
Conventional coherent states (CSs) are defined in various ways. For example, CS is defined as an infinite Poissonian expansion in Fock states, as displaced vacuum state, or as an eigenket of annihilation operator. In the infinite…
High-dimensional quantum systems are a valuable resource for quantum information processing. They can be used to encode error-correctable logical qubits, which has been demonstrated using continuous-variable states in microwave cavities or…
In classical statistics, a well known paradigm consists in establishing asymptotic equivalence between an experiment of i.i.d. observations and a Gaussian shift experiment, with the aim of obtaining optimal estimators in the former…
We propose a non-commutative extension of the Pauli stabilizer formalism. The aim is to describe a class of many-body quantum states which is richer than the standard Pauli stabilizer states. In our framework, stabilizer operators are…
The rank of a tensor is analyzed in context of quantum entanglement. A pure quantum state $\bf v$ of a composite system consisting of $d$ subsystems with $n$ levels each is viewed as a vector in the $d$-fold tensor product of…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
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…
Magic-state resource theory is a powerful tool with applications in quantum error correction, many-body physics, and classical simulation of quantum dynamics. Despite its broad scope, finding tractable resource monotones has been…
Nonstabilizerness, also known as ``magic'', stands as a crucial resource for achieving a potential advantage in quantum computing. Its connection to many-body physical phenomena is poorly understood at present, mostly due to a lack of…
Ground states of quantum many-body systems are both entangled and possess a kind of quantum complexity as their preparation requires universal resources that go beyond the Clifford group and stabilizer states. These resources - sometimes…
We develop a toolbox for exact analysis of iterative algorithms on a class of high-dimensional nonconvex optimization problems with random data. While prior work has shown that low-dimensional statistics of (generalized) first-order methods…
Fortin and Reutenauer defined the non-commutative rank for a matrix with entries that are linear functions. The non-commutative rank is related to stability in invariant theory, non-commutative arithmetic circuits, and Edmonds' problem. We…
Characterizing quantum magic -- the resource enabling computational advantage beyond stabilizer circuits -- is subtle in qubit systems because established measures can give conflicting information about the same state. We introduce C(rho),…
We find an interesting relationship between multipartite bound entangled states and the stabilizer formalism. We prove that if a set of commuting operators from the generalized Pauli group on $n$ qudits satisfy certain constraints, then the…
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…
We introduce a quantum strategy from nonlocal games to improve the stabilizer approximation we proposed previously. The resulting approach turns out to be a qubit-by-qubit gauging procedure for standard stabilizers, which could involve…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…