Searcharxiv⌕ Search

arXiv subjects

Piotr Badziag

Publications and source records attributed to Piotr Badziag.

16 recordsLinked to original sources
arXiv2014

Experimental Tests of Classical and Quantum Dimensions

We report on an experimental test of classical and quantum dimension. We have used a dimension witness which can distinguish between quantum and classical systems of dimension 2,3 and 4 and performed the experiment for all five cases. The witness we have chosen is a base of semi-device independent cryptographic and randomness expansion protocols. Therefore, the part of the experiment, in which qubits were used, is a realization of these protocols. In our work we also present an analytic method for finding the maximal quantum value of the witness along with corresponding measurements and preparations. This method is quite general and can be applied to any linear dimension witness.

quant-ph↗
arXiv2014

Kochen-Specker set with seven contexts

The Kochen-Specker (KS) theorem is a central result in quantum theory and has applications in quantum information. Its proof requires several yes-no tests that can be grouped in contexts or subsets of jointly measurable tests. Arguably, the best measure of simplicity of a KS set is the number of contexts. The smaller this number is, the smaller the number of experiments needed to reveal the conflict between quantum theory and noncontextual theories and to get a quantum vs classical outperformance. The original KS set had 132 contexts. Here we introduce a KS set with seven contexts and prove that this is the simplest KS set that admits a symmetric parity proof.

quant-ph↗
arXiv2013

Bound entangled states with extremal properties

Following recent work of Beigi and Shor, we investigate PPT states that are "heavily entangled." We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least 1/4. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of 2-ε from the separable states, we need a dimension of 2^{poly(\log(1/ε))}, as opposed to 2^{poly(1/ε)} given by the construction of Beigi and Shor. We do so by exploiting the so called {\it private states}, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.

quant-ph↗
arXiv2013

Simple Hardy-like proof of quantum contextuality

Contextuality and nonlocality are two fundamental properties of nature. Hardy's proof is considered the simplest proof of nonlocality and can also be seen as a particular violation of the simplest Bell inequality. A fundamental question is: Which is the simplest proof of contextuality? We show that there is a Hardy-like proof of contextuality that can also be seen as a particular violation of the simplest noncontextuality inequality. Interestingly, this new proof connects this inequality with the proof of the Kochen-Specker theorem, providing the missing link between these two fundamental results, and can be extended to an arbitrary odd number $n$ of settings, an extension that can be seen as a particular violation of the $n$-cycle inequality.

quant-ph↗
arXiv2013

Bell inequalities for the simplest exclusivity graph

Which is the simplest logical structure for which there is quantum nonlocality? We show that there are only three bipartite Bell inequalities with quantum violation associated with the simplest graph of relationships of exclusivity with a quantum-classical gap. These are the most elementary logical Bell inequalities. We show that the quantum violation of some well-known Bell inequalities is related to them. We test the three Bell inequalities with pairs of polarization-entangled photons and report violations in good agreement with the quantum predictions. Unlike other experiments testing noncontextuality inequalities with pentagonal exclusivity, the ones reported here are free of the compatibility loophole.

quant-ph↗
arXiv2011

Experimental Device-independent Tests of Classical and Quantum Dimensions

A fundamental resource in any communication and computation task is the amount of information that can be transmitted and processed. Information encoded in a classical system is limited by the dimension d_c of the system, i.e., the number of distinguishable states. A system with d_c=2^n classical states can carry n bits of classical information. Information encoded in a quantum system is limited by the dimension d_q of the Hilbert space of the system, i.e., the number of perfectly distinguishable quantum states. A system with d_q=2^n perfectly distinguishable quantum states can carry n qubits of quantum information. Physical systems of higher dimensions may enable more efficient and powerful information processing protocols. The dimension is fundamental in quantum cryptography and random number generation, where the security of many schemes crucially relies on the system's dimension. From a fundamental perspective, the dimension can be used to quantify the non-classicality of correlations, since classical simulation of correlations produced by a quantum system of dimension d_q may require a classical system of dimension d_c >> d_q. For all these reasons, a fundamental problem in information theory is to assess the (classical or quantum) dimension of a physical system in a "device-independent" scenario, i.e., without referring to the system's specifications, which may be under control of a dishonest supplier, eavesdropper or saboteur. In this contribution we report experiments realizing this goal for systems emitted by a black box. Our results indicate that dimension witnesses utilized in the experiments may become a powerful tool for testing systems provided by unreliable sources.

quant-ph↗
arXiv2009

Pentagrams and paradoxes

Klyachko and coworkers consider an orthogonality graph in the form of a pentagram, and in this way derive a Kochen-Specker inequality for spin 1 systems. In some low-dimensional situations Hilbert spaces are naturally organised, by a magical choice of basis, into SO(N) orbits. Combining these ideas some very elegant results emerge. We give a careful discussion of the pentagram operator, and then show how the pentagram underlies a number of other quantum "paradoxes", such as that of Hardy.

quant-ph↗
arXiv2009

Universality of state-independent violation of correlation inequalities for noncontextual theories

We show that the state-independent violation of inequalities for noncontextual hidden variable theories introduced in [Phys. Rev. Lett. 101, 210401 (2008)] is universal, i.e., occurs for any quantum mechanical system in which noncontextuality is meaningful. We describe a method to obtain state-independent violations for any system of dimension d > 2. This universality proves that, according to quantum mechanics, there are no "classical" states.

quant-ph↗
arXiv2008

CHSH type Bell inequalities involving a party with two or three local binary settings

We construct a simple algorithm to generate any CHSH type Bell inequality involving a party with two local binary measurements from two CHSH type inequalities without this party. The algorithm readily generalizes to situations, where the additional observer uses three measurement settings. There, each inequality involving the additional party is constructed from three inequalities with this party excluded. With this generalization at hand, we construct and analyze new symmetric inequalities for four observers and three experimental settings per observer.

quant-ph↗
arXiv2008

Extending Bell inequalities to more parties

We describe a method of extending Bell inequalities from $n$ to $n+1$ parties and formulate sufficient conditions for our method to produce tight inequalities from tight inequalities. The method is non trivial in the sense that the inequalities produced by it, when applied to entangled quantum states may be violated stronger than the original inequalities. In other words, the method is capable of generating inequalities which are more powerfull indicators of non-classical correlations than the original inequalities.

quant-ph↗
arXiv2007

All tight multipartite Bell correlation inequalities for an arbitrary number of dichotomic observables per observer

Derivation of the full set of Bell inequalities involving correlation functions, for two parties, with binary observables, and N possible local settings is not as easy as it seemed. The proof of v1 is wrong. Additionaly one can find a counterexample, which will be presented soon. Thus our thesis is dead. Still the series of Bell inequalities discussed in the manuscript (v1) form a necessary condition for local realism, and are tight. They are tight and complete (sufficient) only for N=3 settings per observer (as shown in quant-ph/0611086, fortunately using an entirely different approach).

quant-ph↗
arXiv2005

Towards efficient algorithm deciding separability of distributed quantum states

It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly exponentially with the state's rank. Nevertheless, we argue that for generic states, analysis of concurrence matrices essentially reduces the task of solving separability problem in $m \times n$ dimensions to solving a set of linear equations in about $\binom{mn+D-1}{D}$ variables, where $D$ decreases with $mn$ and for large $mn$ it should not exceed 4. Moreover, the same method is also applicable to multipartite states where it is at least equally efficient.

quant-ph↗
arXiv2003

Locally accessible information: How much can the parties gain by cooperating?

We investigate measurements of bipartite ensembles restricted to local operations and classical communication and find a universal Holevo-like upper bound on the locally accessible information. We analyze our bound and exhibit a class of states which saturate it. Finally, we link the bound to the problem of quantification of the nonlocality of the operations necessary to extract locally unaccessible information.

quant-ph↗
arXiv2001

Concurrence in arbitrary dimensions

We argue that a complete characterisation of quantum correlations in bipartite systems of many dimensions may require a quantity which, even for pure states, does not reduce to a single number. Subsequently, we introduce multi-dimensional generalizations of concurrence and find evidence that they may provide useful tools for the analysis of quantum correlations in mixed bipartite states. We also introudce {\it biconcurrence} that leads to a necessary and sufficient condition for separability.

quant-ph↗
arXiv1999

Local environment can enhance fidelity of quantum teleportation

We show how an interaction with the environment can enhance fidelity of quantum teleportation. To this end, we present examples of states which cannot be made useful for teleportation by any local unitary transformations; nevertheless, after being subjected to a dissipative interaction with the local environment, the states allow for teleportation with genuinely quantum fidelity. The surprising fact here is that the necessary interaction does not require any intelligent action from the parties sharing the states. In passing, we produce some general results regarding optimization of teleportation fidelity by local action. We show that bistochastic processes cannot improve fidelity of two-qubit states. We also show that in order to have their fidelity improvable by a local process, the bipartite states must violate the so-called reduction criterion of separability.

quant-ph↗