Related papers: Symmetric functions of qubits in an unknown basis
This paper introduces and analyzes symmetric and anti-symmetric quantum binary functions. Generally, such functions uniquely convert a given computational basis state into a different basis state, but with either a plus or a minus sign.…
Procedures are given below to construct symmetric and anti-symmetric quantum functions. If hidden in an oracle, such functions can be identified exactly, without iterative interrogation. This is another example of quantum search. The…
We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…
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…
Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
Symmetric quantum states are fascinating objects. They correspond to multipartite systems that remain invariant under particle permutations. This symmetry is reflected in their compact mathematical characterisation but also in their unique…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
We analyse the reconstruction of an unknown pure qubit state. We derive the optimal guess that can be inferred from any set of measurements on N identical copies of the system with the fidelity as a figure of merit. We study in detail the…
We introduce and analyze a task that we call symmetrization, in which a state of a quantum system, associated with a symmetry group, is transformed by a random unitary operation to a symmetric state. Each element of the unitary ensemble is…
The quantum analogue of the equality function, known as the quantum state identity problem, is the task of deciding whether $n$ unknown quantum states are equal or unequal, given the promise that all states are either pairwise orthogonal or…
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined…
We study the estimation of the overlap between two unknown pure quantum states of a finite dimensional system, given $M$ and $N$ copies of each type. This is a fundamental primitive in quantum information processing that is commonly…
We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys.…
We discuss how to reconstruct quantum theory from operational postulates. In particular, the following postulates are consistent only with for classical probability theory and quantum theory. Logical Sharpness: There is a one-to-one map…
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning…
We show that any sequence of measurements on a permutationally-symmetric (pure or mixed) multi-qubit string leaves the unmeasured qubit substring also permutationally-symmetric. In addition, we show that the measurement probabilities for an…
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach…
We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements…
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,…