1,722 research outputs found
Six-qubit permutation-based decoherence-free orthogonal basis
There is a natural orthogonal basis of the 6-qubit decoherence-free (DF)
space robust against collective noise. Interestingly, most of the basis states
can be obtained from one another just permuting qubits. This property: (a) is
useful for encoding qubits in DF subspaces, (b) allows the implementation of
the Bennett-Brassard 1984 (BB84) protocol in DF subspaces just permuting
qubits, which completes a the method for quantum key distribution using DF
states proposed by Boileau et al. [Phys. Rev. Lett. 92, 017901 (2004)], and (c)
points out that there is only one 6-qubit DF state which is essentially new
(not obtained by permutations) and therefore constitutes an interesting
experimental challenge.Comment: REVTeX4, 5 page
Finite-precision measurement does not nullify the Kochen-Specker theorem
It is proven that any hidden variable theory of the type proposed by Meyer
[Phys. Rev. Lett. {\bf 83}, 3751 (1999)], Kent [{\em ibid.} {\bf 83}, 3755
(1999)], and Clifton and Kent [Proc. R. Soc. London, Ser. A {\bf 456}, 2101
(2000)] leads to experimentally testable predictions that are in contradiction
with those of quantum mechanics. Therefore, it is argued that the existence of
dense Kochen-Specker-colorable sets must not be interpreted as a nullification
of the physical impact of the Kochen-Specker theorem once the finite precision
of real measurements is taken into account.Comment: REVTeX4, 5 page
Two Party Non-Local Games
In this work we have introduced two party games with respective winning
conditions. One cannot win these games deterministically in the classical world
if they are not allowed to communicate at any stage of the game. Interestingly
we find out that in quantum world, these winning conditions can be achieved if
the players share an entangled state. We also introduced a game which is
impossible to win if the players are not allowed to communicate in classical
world (both probabilistically and deterministically), yet there exists a
perfect quantum strategy by following which, one can attain the winning
condition of the game.Comment: Accepted in International Journal of Theoretical Physic
Recommended from our members
Minimum Cell Connection in Line Segment Arrangements
We study the complexity of the following cell connection problems in segment arrangements. Given a set of straight-line segments in the plane and two points a and b in different cells of the induced arrangement:
[(i)] compute the minimum number of segments one needs to remove so that there is a path connecting a to b that does not intersect any of the remaining segments; [(ii)] compute the minimum number of segments one needs to remove so that the arrangement induced by the remaining segments has a single cell.
We show that problems (i) and (ii) are NP-hard and discuss some special, tractable cases. Most notably, we provide a near-linear-time algorithm for a variant of problem (i) where the path connecting a
to b must stay inside a given polygon P with a constant number of holes, the segments are contained in P, and the endpoints of the segments are on the boundary of P. The approach for this latter result uses homotopy of paths to group the segments into clusters with the property that either all segments in a cluster or none participate in an optimal solution
Computing the Girth of a Planar Graph in Linear Time
The girth of a graph is the minimum weight of all simple cycles of the graph.
We study the problem of determining the girth of an n-node unweighted
undirected planar graph. The first non-trivial algorithm for the problem, given
by Djidjev, runs in O(n^{5/4} log n) time. Chalermsook, Fakcharoenphol, and
Nanongkai reduced the running time to O(n log^2 n). Weimann and Yuster further
reduced the running time to O(n log n). In this paper, we solve the problem in
O(n) time.Comment: 20 pages, 7 figures, accepted to SIAM Journal on Computin
Greenberger-Horne-Zeilinger-like proof of Bell's theorem involving observers who do not share a reference frame
Vaidman described how a team of three players, each of them isolated in a
remote booth, could use a three-qubit Greenberger-Horne-Zeilinger state to
always win a game which would be impossible to always win without quantum
resources. However, Vaidman's method requires all three players to share a
common reference frame; it does not work if the adversary is allowed to
disorientate one player. Here we show how to always win the game, even if the
players do not share any reference frame. The introduced method uses a 12-qubit
state which is invariant under any transformation
(where , where is a
unitary operation on a single qubit) and requires only single-qubit
measurements. A number of further applications of this 12-qubit state are
described.Comment: REVTeX4, 6 pages, 1 figur
State-independent quantum violation of noncontextuality in four dimensional space using five observables and two settings
Recently, a striking experimental demonstration [G. Kirchmair \emph{et al.},
Nature, \textbf{460}, 494(2009)] of the state-independent quantum mechanical
violation of non-contextual realist models has been reported for any two-qubit
state using suitable choices of \emph{nine} product observables and \emph{six}
different measurement setups. In this report, a considerable simplification of
such a demonstration is achieved by formulating a scheme that requires only
\emph{five} product observables and \emph{two} different measurement setups. It
is also pointed out that the relevant empirical data already available in the
experiment by Kirchmair \emph{et al.} corroborate the violation of the NCR
models in accordance with our proof
Decoherence-Free Quantum Information Processing with Four-Photon Entangled States
Decoherence-free states protect quantum information from collective noise,
the predominant cause of decoherence in current implementations of quantum
communication and computation. Here we demonstrate that spontaneous parametric
down-conversion can be used to generate four-photon states which enable the
encoding of one qubit in a decoherence-free subspace. The immunity against
noise is verified by quantum state tomography of the encoded qubit. We show
that particular states of the encoded qubit can be distinguished by local
measurements on the four photons only.Comment: 4 pages, 4 eps figures, revtex
Parity proofs of the Kochen-Specker theorem based on the 24 rays of Peres
A diagrammatic representation is given of the 24 rays of Peres that makes it
easy to pick out all the 512 parity proofs of the Kochen-Specker theorem
contained in them. The origin of this representation in the four-dimensional
geometry of the rays is pointed out.Comment: 14 pages, 6 figures and 3 tables. Three references have been added.
Minor typos have been correcte
- …