Related papers: A complete characterisation of All-versus-Nothing …
The name graph state is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
Absolutely stabilizer states are those that remain convex mixtures of stabilizer states after conjugation by any unitary. Here we give a characterization of such states for multiple qudits of all prime dimensions by introducing a polytope…
We prove a myriad of results related to the stabilizer in an algebraic group $G$ of a generic vector in a representation $V$ of $G$ over an algebraically closed field $k$. Our results are on the level of group schemes, which carries more…
Quantum contextuality, as proved by Kochen and Specker, and also by Bell, should manifest itself in any state in any system with more than two distinguishable states and recently has been experimentally verified on various physical systems.…
We prove a general reduction theorem for stabilizer absolutely maximally entangled states in composite local dimension. If a stabilizer $\mathrm{AME}(n,D)$ state exists and $D=\prod_{i=1}^m q_i$ is the prime-power factorization of $D$, then…
Diagrammatic techniques for reasoning about monoidal categories provide an intuitive understanding of the symmetries and connections of interacting computational processes. In the context of categorical quantum mechanics, Coecke and…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
Nonstabilizerness, also known as magic, plays a central role in universal quantum computation. Hypergraph states are nonstabilizer generalizations of graph states and constitute a key class of quantum states in various areas of quantum…
A recent proof of Bell's theorem without inequalities [A. Cabello, Phys. Rev. Lett. 86, 1911 (2001)] is formulated as a Greenberger-Horne-Zeilinger-like proof involving just two observers. On one hand, this new approach allows us to derive…
A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism.…
The Nelson model, describing a quantum mechanical particle linearly coupled to a bosonic field, exhibits the infrared problem in the sense that no ground state exists at arbitrary total momentum. However, passing to a non-Fock…
The Quantum Lov\'asz Local Lemma (QLLL) [AKS12] establishes non-constructively that any quantum system constrained by a local Hamiltonian has a zero-energy ground state, if the local Hamiltonian terms overlap only in a certain restricted…
We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…
Using an Environmentally Friendly Renormalization Group we derive an ab initio universal scaling form for the equation of state for the O(N) model, y=f(x), that exhibits all required analyticity properties in the limits $x\to 0$,…
Quantum discord quantifies non-classical correlations in a quantum system including those not captured by entanglement. Thus, only states with zero discord exhibit strictly classical correlations. We prove that these states are negligible…
The Kochen-Specker theorem has been discussed intensely ever since its original proof in 1967. It is one of the central no-go theorems of quantum theory, showing the non-existence of a certain kind of hidden states models. In this paper, we…
The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics, meaning any pure state, unitary operation and post-selected pure projective…
We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…
The notion of state vector is, in quantum mechanics, as central as it is problematic, as illustrates the wealth of publications about the sub- jects, including in particular the many attempts to obtain an acceptable interpretation of…