Related papers: The Prime state and its quantum relatives
Most states in the Hilbert space are maximally entangled. This fact has proven useful to investigate - among other things - the foundations of statistical mechanics. Unfortunately, most states in the Hilbert space of a quantum many body…
A general method in constructing a complete set of wave functions for multipartite identical qubits is presented based on the irreducible representations of the permutation group and the nth rank tensors. Particular examples for n =2, 3,…
For a system of N identical particles in a random pure state, there is a threshold k_0 = k_0(N) ~ N/5 such that two subsystems of k particles each typically share entanglement if k > k_0, and typically do not share entanglement if k < k_0.…
We state a quantum version of Bayes's rule for statistical inference and give a simple general derivation within the framework of generalized measurements. The rule can be applied to measurements on N copies of a system if the initial state…
The n-qubit real equally weighted states are employed in some quantum algorithms including Deutsch-Jozsa, Grover, Simon, and so on. We qualitatively investigate the entanglement properties of n-qubit real equally weighted states. Firstly,…
Problem of classification of all the set of entangled states is considered. Invariance of entangled states relative to transformations from a group of symmetry of qubit space leads to classification of all states of the system through…
We investigate the intermediate permutational symmetries of a system of qubits, that lie in between the perfect symmetric and antisymmetric cases. We prove that, on average, pure states of qubits picked at random with respect to the uniform…
We study the entanglement of a pure state of a composite quantum system consisting of several subsystems with $d$ levels each. It can be described by the R\'enyi-Ingarden-Urbanik entropy $S_q$ of a decomposition of the state in a product…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
We study entanglement-related properties of random quantum states which are unitarily invariant, in the sense that their distribution is left unchanged by conjugation with arbitrary unitary operators. In the large matrix size limit, the…
In quantum systems, entanglement corresponds to nonclassical correlation of nonlocal observables. Thus, entanglement (or, to the contrary, separability) of a given quantum state is not uniquely determined by properties of the state, but may…
Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation…
The initial state creation is a starting point of many quantum algorithms and usually is considered as a separate subroutine not included into the algorithm itself. There are many algorithms aimed on creation of special class of states. Our…
This is a review of the geometry of quantum states using elementary methods and pictures. Quantum states are represented by a convex body, often in high dimensions. In the case of n-qubits, the dimension is exponentially large in n. The…
When a quantum pure state is drawn uniformly at random from a Hilbert space, the state is typically highly entangled. This property of a random state is known as generic entanglement of quantum states and has been long investigated from…
Consider the question: what statistical ensemble corresponds to minimal prior knowledge about a quantum system ? For the case where the system is in fact known to be in a pure state there is an obvious answer, corresponding to the unique…
A new scheme of quantum coding is presented. The scheme concerns the quantum states to which Schumacher's compression does not apply. It is shown that two qubits can be encoded in a single qutrit in such a way that one can faithfully…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a…