Results 1 - 10 of 5659
Results 1 - 10 of 5659. Search took: 0.027 seconds
|Sort by: date | relevance|
[en] We describe an experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a two-bit Boolean function in the framework of one-way quantum computation. For this purpose, a two-photon six-qubit cluster state was engineered. Its peculiar topological structure is the basis of the original measurement pattern allowing the algorithm realization. The good agreement of the experimental results with the theoretical predictions, obtained at ∼1 kHz success rate, demonstrates the correct implementation of the algorithm.
[en] We propose the notion of quantum coherence for superpositions over states which are not necessarily mutually orthogonal. This anticipatedly leads to a resource theory of non-orthogonal coherence. We characterize free states and free operations in this theory, and connect the latter with free operations in the resource theory of quantum coherence for orthogonal bases. We show that the concept of non-orthogonal coherence naturally furnishes us with a wave-particle duality in quantum double-slit experiments where the channels beyond the slits are leaky between them. Furthermore, we demonstrate existence of a unique maximally coherent qubit state corresponding to any given purity. In addition, and in contradistinction with the case of orthogonal bases, there appears a non-trivial minimally coherent qubit state for a given purity. We also study the behavior of quantum coherence for some typical configurations of non-orthogonal bases which have no analogs for orthogonal bases. We further investigate the problem of determining the energy cost of creating non-orthogonal coherence, and find that it scales linearly with the non-orthogonal coherence created. (paper)
[en] We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator does not depend on the state to be transferred. We show that perfect state transfer over an arbitrary distance can be achieved only if the walk is driven by an identity or a flip coin operator. Other biased coin operators and the Hadamard coin allow perfect state transfer over finite distances only. Furthermore, we show that quantum walks ending with a perfect state transfer are periodic. (paper)
[en] This paper proposes an efficient semi-quantum private comparison protocol (SQPC) using single photons, which allows two classical participants to securely compare the equality of their secret with the help of an almost-dishonest third party. Because of the use of single photons, the SQPC is more practical and the qubit efficiency of the proposed protocol is higher than the existing semi-quantum private comparison protocols. Moreover, the proposed protocol can resist several well-known attacks including outsider and insider’s attacks.
[en] Positive-operator-value measurement (POVM) is the most general class of quantum measurement. We propose a scheme to deterministically implement arbitrary POVMs of single atomic qubit via cavity QED catalysed by only one ancilla atomic qubit. By appropriately entangling two atomic qubits and sequentially measuring the ancilla qubit, any POVM can be implemented step by step. As an application of our scheme, the realization of a specific POVM for optimal unambiguous discrimination (OUD) between two nonorthogonal states is given. (authors)
[en] All-versus-nothing (AVN) proofs show the conflict between Einstein, Podolsky, and Rosen's elements of reality and the perfect correlations of some quantum states. Given an n-qubit state distributed between m parties, we provide a method with which to decide whether this distribution allows an m-partite AVN proof specific for this state using only single-qubit measurements. We apply this method to some recently obtained n-qubit m-particle states. In addition, we provide all inequivalent AVN proofs with less than nine qubits and a minimum number of parties.
[en] We present a quantum approach to a signaling game; a special kind of extensive game of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of some fixed initial state and the payoff function is given by a measurement on the resulting final state. We show that the quantum game induced by our scheme coincides with a signaling game as a special case and outputs nonclassical results in general. As an example, we consider a quantum extension of the signaling game in which the chance move is a three-parameter unitary operator whereas the players' actions are equivalent to classical ones. In this case, we study the game in terms of Nash equilibria and refine the pure Nash equilibria adapting to the quantum game the notion of a weak perfect Bayesian equilibrium. (paper)
[en] The coexistence relation of quantum effects is a fundamental structure, describing those pairs of experimental events that can be implemented in a single setup. Only in the simplest case of qubit effects is an analytic characterization of coexistent pairs known. We generalize the qubit coexistence characterization to all pairs of effects in arbitrary dimensions that belong to the von Neumann algebra generated by two projections. We demonstrate the presented mathematical machinery by several examples, and show that it covers physically relevant classes of effect pairs. (paper)
[en] A protocol for quantum private comparison of equality (QPCE) is proposed based on five-particle cluster state with the help of a semi-honest third party (TP). In our protocol, TP is allowed to misbehave on its own but can not conspire with either of two parties. Compared with most two-user QPCE protocols, our protocol not only can compare two groups of private information (each group has two users) in one execution, but also compare just two private information. Compared with the multi-user QPCE protocol proposed, our protocol is safer with more reasonable assumptions of TP. The qubit efficiency is computed and analyzed. Our protocol can also be generalized to the case of 2N participants with one TP. The 2N-participant protocol can compare two groups (each group has N private information) in one execution or just N private information. (paper)