Related papers: Entanglement Is Not Necessary for Perfect Discrimi…
Collective operations on a network of spatially-separated quantum systems can be carried out using local quantum (LQ) operations, classical communication (CC) and shared entanglement (SE). Such operations can also be used to communicate…
We study discrimination of m quantum measurements in the scenario when the unknown measurement with n outcomes can be used only once. We show that ancilla-assisted discrimination procedures provide a nontrivial advantage over simple…
According to the Gottesman-Knill theorem, quantum algorithms which utilise only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states,…
We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…
Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We study when a physical operation can produce entanglement between two systems initially disentangled. The formalism we develop allows to show that one can perform certain non-local operations with unit probability by performing local…
Entanglement is often regarded as an inherently quantum feature. We show that this does not have to be the case: under restricted operational access, classical correlations can appear nonseparable when expressed in the formalism of quantum…
We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
A general class of authentication schemes for arbitrary quantum messages is proposed. The class is based on the use of sets of unitary quantum operations in both transmission and reception, and on appending a quantum tag to the quantum…
We investigate the detection of entanglement in $n$-partite quantum states. We obtain practical separability criteria to identify genuinely entangled and non-separable mixed quantum states. No numerical optimization or eigenvalue evaluation…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…
For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…
Among the intriguing features of quantum theory, the problem of distinguishing quantum channels is of fundamental interest. In this paper, we focus on the single-shot discrimination of two noisy quantum channels using two distinct classes…
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of…
We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of…
Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…