Related papers: Improved bounds for testing low stabilizer complex…
We consider the problem of Clifford testing, which asks whether a black-box $n$-qubit unitary is a Clifford unitary or at least $\varepsilon$-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this…
Exploring quantum phenomena beyond predictions of any classical model has fundamental importance to understand the boundary of classical and quantum descriptions of nature. As a typical property that a quantum system behaves distinctively…
The characterization of nonstabilizerness is fruitful due to its application in gate synthesis and classical simulation. In particular, the resource monotone called the stabilizer extent is a useful tool to estimate the simulation cost…
Quantum noise constitutes a fundamental obstacle to realizing practical quantum technologies. To address the pivotal challenge of identifying quantum systems least affected by noise, we introduce the purest quantum state identification,…
Characterizing increasingly complex quantum systems is a central task in quantum information science, yet experimental costs often scale prohibitively with system size. Certifying key properties using simple local measurements is highly…
The quantum stabilizer formalism became foundational for understanding error correction soon after the realization of the first useful quantum error correction codes. Stabilizers provide a way to describe sets of quantum states which are…
Estimating the fidelity between a desired target quantum state and an actual prepared state is essential for assessing the success of experiments. For pure target states, we use functional representations that can be measured directly and…
There are well known necessary and sufficient conditions for a quantum code to correct a set of errors. We study weaker conditions under which a quantum code may correct errors with probabilities that may be less than one. We work with…
In this work, we present number-theoretic and algebraic-geometric techniques for bounding the stabilizer rank of quantum states. First, we refine a number-theoretic theorem of Moulton to exhibit an explicit sequence of product states with…
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…
High-fidelity logical magic states are a critical resource for fault-tolerant quantum computation, enabling non-Clifford logical operations through state injection. However, benchmarking these states presents significant challenges: one…
We define a new quantifier of classicality for a quantum state, the Roughness, which is given by the $\mathcal{L}^2 (\R^2)$ distance between Wigner and Husimi functions. We show that the Roughness is bounded and therefore it is a useful…
The determination of the state fidelity and the detection of entanglement are fundamental problems in quantum information experiments. We investigate how these goals can be achieved with a minimal effort. We show that the fidelity of GHZ…
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al.,…
Assessing the quality of an ensemble of noisy entangled states is a central task in quantum information processing. Usually this is done by measuring and hence destroying multiple copies, from which state tomography or fidelity estimation…
It is a fundamental property of quantum mechanics that information is lost as a result of performing measurements. Indeed, with every quantum measurement one can associate a number -- its POVM norm constant -- that quantifies how much the…
This paper investigates symmetric composite binary quantum hypothesis testing (QHT), where the goal is to determine which of two uncertainty sets contains an unknown quantum state. While asymptotic error exponents for this problem are…
Digital controller design for nonlinear systems may be complicated by the fact that an exact discrete-time plant model is not known. One existing approach employs approximate discrete-time models for stability analysis and control design,…
Preparing and certifying bound entangled states in the laboratory is an intrinsically hard task, due to both the fact that they typically form narrow regions in the state space, and that a certificate requires a tomographic reconstruction…
$k$-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of $k$-uniform states, at scale, faces major obstacles:…