Related papers: Implementation of multipartite unitary operations …
Classical systems can be entangled. Entanglement is defined by coincidence correlations. Quantum entanglement experiments can be mimicked by a mechanical system with a single conserved variable and 77.8% conditional efficiency. Experiments…
We show that the entanglement of a $2\times 2$ bipartite state can be improved and maximized probabilistically through single-qubit operations only. An experiment is proposed and it is numerically simulated.
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of fermionic Gaussian circuits and Ising…
We study a class of weakly coupled Hamilton-Jacobi systems with a specific aim to perform a qualitative analysis in the spirit of weak KAM theory. Our main achievement is the definition of a family of related action functionals containing…
We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perform certain quantum operations. We prove that contrary to a…
The concepts of quantum correlation complexity and quantum communication complexity were recently proposed to quantify the minimum amount of resources needed in generating bipartite classical or quantum states in the single-shot setting.…
We study how multi-partite entanglement evolves under the paradigm of separable operations, which include the local operations and classical communication (LOCC) as a special case. We prove that the average "decay" of entanglement induced…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and…
We discuss the communication complexity of establishing a shared reference frame, in particular examining the case of aligning spatial axes via the exchange of spin-1/2 particles. Unlike previous work we allow for multiple rounds of…
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best…
Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for…
We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily…
We propose how to generate genuine multipartite entanglement of electron spin qubits in a chain of quantum dots using the naturally available single-qubit rotations and two-qubit Heisenberg exchange interaction in the system. We show that…
We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with…
We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the…
A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how…
We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors.…