Information gain when measuring an unknown qubit
نویسندگان
چکیده
منابع مشابه
Protocol for Counterfactually Transporting an Unknown Qubit
Quantum teleportation circumvents the uncertainty principle using dual channels: a quantum one consisting of previously-shared entanglement, and a classical one, together allowing the disembodied transport of an unknown quantum state over distance. It has recently been shown that a classical bit can be counterfactually communicated between two parties in empty space, “Alice” and “Bob.” Here, by...
متن کاملQuantum Cobweb: Multiparty Entangling of an unknown Qubit
Entangling an unknown qubit with one type of reference state is generally impossible. We introduce a new class of states called zero sum amplitude (ZSA) multipartite, pure entangled states for qubits and study their salient features. Using shared-ZSA state, local operation and classical communication we give a protocol for creating multipartite entangled states of an unknown quantum state with ...
متن کاملAddendum: Protocol for Counterfactually Transporting an Unknown Qubit
We give a simpler, more precise formulation for Equations (1–3) in Salih [1], and consequently for transport fidelity, Equation (15). This does not affect the validity of the protocol nor the scientific conclusions of the paper. The fidelity of counterfactual transport for finite inner and outer cycles is re-evaluated and plotted in Figure 1 below. First, the revised Equations (1–3) from Salih ...
متن کاملMeasuring the parity of an N-qubit state.
We present a scheme for a projective measurement of the parity operator Pz = Product(N)i=1 sigma(i)z of N qubits. Our protocol uses a single ancillary qubit, or a probe qubit, and involves manipulations of the total spin of the N qubits without requiring individual addressing. We illustrate our protocol in terms of an experimental implementation with atomic ions in a two-zone linear Paul trap, ...
متن کاملMeasuring the expected gain of communicating constraint information
In this paper we investigate methods for measuring the expected utility from communicating information in multi-agent planning and scheduling problems. We consider an environment where human teammates can potentially add information to relax constraint information. As these problems are NP-complete, no polynomial algorithms exist for evaluating the impact of either adding or relaxing a certain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Physics
سال: 2017
ISSN: 0143-0807,1361-6404
DOI: 10.1088/1361-6404/aa94e4