Related papers: Implementation of multipartite unitary operations …
The general class of Gaussian Schmidt-number witness operators for bipartite systems is studied. It is shown that any member of this class is reducible to a convex combination of two types of Gaussian operators using local operations and…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer.…
We present a proposal for the realization of entanglement Hamiltonians in one-dimensional critical spin systems with strongly interacting cold atoms. Our approach is based on the notion that the entanglement spectrum of such systems can be…
We present percolation strategies based on multipartite measurements to propagate entanglement in quantum networks. We consider networks spanned on regular lattices whose bonds correspond to pure but non-maximally entangled pairs of qubits,…
We construct the protocols to achieve probabilistic and deterministic entanglement transformations for bipartite pure states by means of local operations and classical communication. A new condition on pure contraction transformations is…
For a multipartite system, we sort out all possible entanglements, each of which is among a set of subsystems. Each entanglement can be measured by a generalized relative entropy of entanglement, which is conserved on average under…
Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task that is generally intractable with classical computers. The hardness lies at the ubiquitous anti-commutative relations of quantum…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…
One limitation of the variational quantum eigensolver algorithm is the large number of measurement steps required to estimate different terms in the Hamiltonian of interest. Unitary partitioning reduces this overhead by transforming the…
We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantum state. We prove linear lower bounds for…
We solve the problem of the optimal cloning of pure entangled two-qubit states with a fixed degree of entanglement using local operations and classical communication. We show, that amazingly, classical communication between the parties can…
We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local quantum operation and classical communication.…
In the last years, we have been witnessing a tremendous push to demonstrate that quantum computers can solve classically intractable problems. This effort, initially focused on the hardware, progressively included the simplification of the…
The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics, which corresponds to an underlying Hamiltonian that governs the…
A unitary interaction coupling two parties enables quantum communication in both the forward and backward directions. Each communication capacity can be thought of as a tradeoff between the achievable rates of specific types of forward and…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
We introduce new entanglement monotones which generalize, to the case of many parties, those which give rise to the majorization-based partial ordering of bipartite states' entanglement. We give some examples of restrictions they impose on…
In protocols of distributed quantum information processing, a network of bilateral entanglement is a key resource for efficient communication and computation. We propose a model, efficient both in finite and infinite Hilbert spaces, that…