Related papers: Quantum Information Masking of Hadamard Sets
Binary quantum information can be fault tolerantly encoded in states defined in infinite dimensional Hilbert spaces. Such states define a computational basis, and permit a perfect equivalence between continuous and discrete universal…
A formalism for the construction of some classes of Gazeau$-$Klauder squeezed states, corresponding to arbitrary solvable quantum systems with a known discrete spectrum, are introduced. As some physical applications, the proposed structure…
The manifold of pure quantum states is a complex projective space endowed with the unitary-invariant geometry of Fubini and Study. According to the principles of geometric quantum mechanics, the detailed physical characteristics of a given…
We provide various schemes for the splitting up of Quantum information into parts using the four and five partite cluster states. Explicit protocols for the Quantum information splitting (QIS) of single and two qubit states are illustrated.…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
We introduce the problem of unsupervised classification of quantum data, namely, of systems whose quantum states are unknown. We derive the optimal single-shot protocol for the binary case, where the states in a disordered input array are…
It is a fundamental, but still elusive question whether the schemes based on quantum mechanics, in particular on quantum entanglement, can be used for classical information processing and machine learning. Even partial answer to this…
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit…
In some cases the state of a quantum system with a large number of subsystems can be approximated efficiently by the density matrix renormalization group, which makes use of redundancies in the description of the state. Here we show that…
The number of parameters describing a quantum state is well known to grow exponentially with the number of particles. This scaling clearly limits our ability to do tomography to systems with no more than a few qubits and has been used to…
We consider the problem of determining the mixed quantum state of a large but finite number of identically prepared quantum systems from data obtained in a sequence of ideal (von Neumann) measurements, each performed on an individual copy…
We investigate quantum state discrimination with confidentiality. $N$ observers share a given quantum state belonging to a finite set of known states. The observers want to determine the state as accurately as possible and send a…
We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise…
We study quantum tomography from a continuous measurement record obtained by measuring expectation values of a set of Hermitian operators obtained from unitary evolution of an initial observable. For this purpose, we consider the…
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the…
It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is {\em impossible} to do so if the transformation is anti-linear and…
We introduce the quantum fractional Hadamard transform with continuous variables. It is found that the corresponding quantum fractional Hadamard operator can be decomposed into a single-mode fractional operator and two single-mode squeezing…
We discuss the concept of connection states (or connection matrices) that describe posterior ensembles, post-selected according to the outcomes of a quantum measurement. Connection matrices allow one to obtain results of any weak and some…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…