Related papers: A complete characterisation of All-versus-Nothing …
Quantum discord refers to an important aspect of quantum correlations for bipartite quantum systems. In our earlier works we have shown that corresponding to every graph (combinatorial) there are quantum states whose properties are…
The positivity of quantum discord is shown to be equivalent to the strong subadditivity of von-Neumann entropy. This leads us to a necessary and sufficient condition characterizing the set of states with zero quantum discord. This also…
Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…
Absolutely separable states $\varrho$ remain separable under arbitrary unitary transformations $U \varrho U^{\dag}$. By example of a three qubit system we show that in multipartite scenario neither full separability implies bipartite…
We study the automorphisms of binary stabilizer codes and states. We prove that they almost always form a solvable group, and thereby shed new light on the fact that there is no universal set of transversal gates. We also determine the…
A new class of quantum states is introduced by demanding that the computational measurement statistics approach the Boltzmann distribution of higher-order strongly coupled Ising models. The states, referred to as $n$-coupled states, are…
It is shown that by eliminating duality theory of vector spaces from a recent proof of Kouba (O. Kouba, A duality based proof of the Combinatorial Nullstellensatz. Electron. J. Combin. 16 (2009), #N9) one obtains a direct proof of the…
We show that the space of density matrices for n-qubit states, considered as a (2^n)^2 dimensional real vector space, has a basis consisting of density matrices of stabilizer states. We describe an application of this result to automated…
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely…
Three basic properties (eigenstate, orbit and intelligence) of the canonical squeezed states (SS) are extended to the case of arbitrary n observables. The SS for n observables X_i can be constructed as eigenstates of their linear complex…
We study the stabilities of quantum states of macroscopic systems, against noises, against perturbations from environments, and against local measurements. We show that the stabilities are closely related to the cluster property, which…
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is…
Separability from the spectrum is a significant and ongoing research topic in quantum entanglement. In this study, we investigate properties related to absolute separability from the spectrum in qudits-qudits states in the bipartite states…
According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the…
We study the non-stabilizer resources required to achieve informational completeness in single-setting quantum state estimation scenarios. We consider fixed-basis projective measurements preceded by quantum circuits acting on $n$-qubit…
Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
In quantum theory, bound states are described by eigenvalue equations, which usually cannot be solved exactly. However, some simple general theorems allow to derive rigorous statements about the corresponding solutions, that is, energy…
Contextuality, a generalization of non-locality, has been proposed as the resource that provides the computational speed-up for quantum computation. For universal quantum computation using qudits, of odd-prime dimension, contextuality has…
Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by so-called argumentation frameworks (AFs) and the reasoning…