Related papers: The non-stabilizerness cost of quantum state estim…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
Nonstabilizerness, or magic, is a necessary resource for quantum advantage beyond the classically simulatable Clifford framework. Recent works have begun to chart the structure of magic in many-body states, introducing the concepts of…
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…
Recently, cat states have been used to heuristically improve the runtime of a classical simulator of quantum circuits based on the diagrammatic ZX-calculus. Here we investigate the use of cat-state injection within the quantum circuit…
The physical problem behind informationally complete (IC) measurements is determining an unknown state statistically by measurement outcomes, known as state tomography. It is of central importance in quantum information processing such as…
This paper studies the resilient control of networked systems in the presence of cyber attacks. In particular, we consider the state feedback stabilization problem for nonlinear systems when the state measurement is sent to the controller…
We investigate the role of information in active feedback control of quantum many-body systems using reinforcement learning. Active feedback breaks detailed balance, enabling the engineering of steady states and dynamical phases of matter…
The difficulty of an optimization task in quantum information science depends on the proper mathematical expression of the physical target. Here we demonstrate the power of optimization functionals targeting an arbitrary perfect two-qubit…
To maximize average information gain for a classical measurement, all outcomes of an observation must be equally likely. The condition of equally likely outcomes may be enforced in quantum theory by ensuring that one's state $\rho$ is…
This paper introduces a notion of data informativity for stabilization tailored to continuous-time signals and systems. We establish results comparable to those known for discrete-time systems with sampled data. We justify that additional…
Projective measurements are a powerful tool for manipulating quantum states. In particular, a set of qubits can be entangled by measurement of a joint property such as qubit parity. These joint measurements do not require a direct…
A measurement is deemed successful, if one can maximize the information gain by the measurement apparatus. Here, we ask if quantum coherence of the system imposes a limitation on the information gain during quantum measurement. First, we…
The goal of self-testing is to characterize an a priori unknown quantum system based solely on measurement statistics, i.e. using an uncharacterized measurement device. Here we develop self-testing methods for quantum prepare-and-measure…
We demonstrate that the concept of information offers a more complete description of complementarity than the traditional approach based on observables. We present the first experimental test of information complementarity for two-qubit…
Quantum computation has been growing rapidly in both theory and experiments. In particular, quantum computing devices with a large number of qubits have been developed by IBM, Google, IonQ, and others. The current quantum computing devices…
We show that states obtained from deep random Clifford circuits doped with non-Clifford phase gates (including T-gates and $\sqrt{\mathrm{T}}$-gates) can be disentangled completely, provided the number of non-Clifford gates is smaller or…
We investigate the information provided about a specified distributed apparatus of n units in the measurement of a quantum state. It is shown that, in contrast to such measurement of a classical state, which is bounded by log (n+1) bits,…
The $n$-qubit stabilizer states are those left invariant by a $2^n$-element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically--motivated generating set,…
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of…
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or…