Related papers: Orthogonalization of partly unknown quantum states
We propose a way to measure the qubit state of an arbitrary sub-ensemble of atoms in an array without significantly disturbing the quantum information in the unmeasured atoms. The idea is to first site-selectively transfer atoms out of the…
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for…
We present some results from simulation of a network of nodes connected by c-NOT gates with nearest neighbors. Though initially we begin with pure states of varying boundary conditions, the updating with time quickly involves a complicated…
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…
The universal quantum homogeniser can transform a qubit from any state to any other state with arbitrary accuracy, using only unitary transformations to perform this task. Here we present an implementation of a finite quantum homogeniser…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
The principle of superposition is an intriguing feature of Quantum Mechanics, which is regularly exploited at various instances. A recent work [PRL \textbf{116}, 110403 (2016)] shows that the fundamentals of Quantum Mechanics restrict the…
State smoothing is a technique to estimate a state at a particular time, conditioned on information obtained both before (past) and after (future) that time. For a classical system, the smoothed state is a normalized product of the…
Superposition, arguably the most fundamental property of quantum mechanics, lies at the heart of quantum information science. However, how to create the superposition of any two unknown pure states remains as a daunting challenge. Recently,…
We give a polynomial time algorithm that, given copies of an unknown quantum state $\vert\psi\rangle=U\vert 0^n\rangle$ that is prepared by an unknown constant depth circuit $U$ on a finite-dimensional lattice, learns a constant depth…
We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum…
We propose two controlled remote state preparation protocols via partially entangled channels. One prepares a single-qubit state and the other prepares a two-qubit state. Different from other controlled remote state preparation schemes…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
We discuss the "partial" quantum cloning of the pure two-partite states, when the "part" of initial state related to the one qubit is copied only. The same approach gives the possibility to design the quantum copying machine for the mixed…
Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can…
Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning…
A general procedure for constructing coherent states, which are eigenstates of annihilation operators, related to quantum mechanical potential problems, is presented. These coherent states, by construction are not potential specific and…
As one of the most intriguing intrinsic properties of quantum world, quantum superposition provokes great interests in its own generation. Oszmaniec [Phys. Rev. Lett. 116, 110403 (2016)] have proven that though a universal quantum machine…