Related papers: Entanglement Is Not Necessary for Perfect Discrimi…
Here, we numerically simulate probabilistic elementary entangling operations between rail-encoded photons for the purpose of scalable universal quantum computation or communication. We propose grouping logical qubits into single-photon…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state $\vert \Psi \rangle$ onto an optimal quantum circuit $\hat{\mathcal{C}}$ with a finite number of single- and two-qubit quantum gates. The proposed…
The requirement that the quantum partition function be invariant under a renormalization group transformation results in a wide class of exact renormalization group equations, differing in the form of the kernel. Physical quantities should…
It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning…
We study the entanglement of unitary operators on $d_1\times d_2$ quantum systems. This quantity is closely related to the entangling power of the associated quantum evolutions. The entanglement of a class of unitary operators is quantified…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
A fundamental problem in quantum information is to explore what kind of quantum correlations is responsible for successful completion of a quantum information procedure. Here we study the roles of entanglement, discord, and dissonance…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce…
We study the entanglement detection by using mutually unbiased measurements and provide a quantum separability criterion that can be experimentally implemented for arbitrary $d$-dimensional bipartite systems. We show that this criterion is…
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits…
Purification schemes for multi-particle entangled states cannot be treated as straightforward extensions of those for two particles because of the lack of symmetry they possess. We propose purification protocols for a wide range of mixed…
Electron transport in realistic physical and chemical systems often involves the non-trivial exchange of energy with a large environment, requiring the definition and treatment of open quantum systems. Because the time evolution of an open…
The problem of the estimation of multiple phases (or of commuting unitaries) is considered. This is a sub-model of the estimation of a completely unknown unitary operation where it has been shown in recent works that there are considerable…
We address quantum decision theory as a convenient framework to analyze process discrimination and estimation in qubit systems. In particular we discuss the following problems: i) how to discriminate whether or not a given unitary…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
We show that the various intermediate states appearing in the process of one-way computation at a given step of measurement are all equivalent modulo local unitary transformations. This implies, in particular, that all those intermediate…
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to…