相关论文: A complete characterisation of All-versus-Nothing …

One fascinating way of revealing the quantum nonlocality is the all-versus-nothing test due to Greenberger, Horne, and Zeilinger (GHZ) known as GHZ paradox. So far genuine multipartite and multilevel GHZ paradoxes are known to exist only in…

We study the properties of {\bf exact} (all level $k$) quantum coherent states in the context of string theory on a group manifold (WZWN models). Coherent states of WZWN models may help to solve the unitarity problem: Having positive norm,…

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…

Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…

The Pauli groups are ubiquitous in quantum information theory because of their usefulness in describing quantum states and operations and their readily understood symmetry properties. In addition, the most well-understood quantum error…

We introduce a notion of universal preparability for a state of a system, more precisely: for a normal state on a von Neumann algebra. It describes a situation where from an arbitrary initial state it is possible to prepare a target state…

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs…

The most well-known tool for studying contextuality in quantum computation is the n-qubit stabilizer state tableau representation. We provide an extension that describes not only the quantum state, but is also outcome deterministic. The…

We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in…

We present a summarizing account of a series of investigations whose central topic is to address the question whether atomic stabilization exists in an analytical way. We provide new aspects on several issues of the matter in the…

We revisit the Pauli-Clifford connection to introduce a real, grade-preserving algebraic framework for $n$-qubit quantum computation based on the tensor product $C\ell_{2,0}(\mathbb{R})^{\otimes n}$. In this setting, the bivector $J =…

We describe the symmetry group of the stabilizer polytope for any number $n$ of systems and any prime local dimension $d$. In the qubit case, the symmetry group coincides with the linear and anti-linear Clifford operations. In the case of…

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…

Stabilizer simulation can efficiently simulate an important class of quantum circuits consisting exclusively of Clifford gates. However, all existing extensions of this simulation to arbitrary quantum circuits including non-Clifford gates…

We show that qubit stabilizer states can be represented by non-negative quasi-probability distributions associated with a Wigner-Weyl-Moyal formalism where Clifford gates are positive state-independent maps. This is accomplished by…

In this sequence of papers, noncommutative analysis is used to give a consistent axiomatic approach to a unified conceptual foundation of classical and quantum physics. The present Part I defines the concepts of observables, states and…

We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…

Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…

We show that every uniform state on the sphere is essentially a superposition of regular graphs. In addition, we develop a graph-based ansatz to construct trial FHQ ground states sharing the local properties of Jack polynomials. In…

We define a quantum learning task called agnostic tomography, where given copies of an arbitrary state $\rho$ and a class of quantum states $\mathcal{C}$, the goal is to output a succinct description of a state that approximates $\rho$ at…