arXiv subjects

Matej Pivoluska

Publications and source records attributed to Matej Pivoluska.

33 records · Page 2Linked to original sources

arXiv2021

Device-independent bounds from Cabello's nonlocality argument

Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. Except for demonstrating nonclassical signature of entangled states in question, they can also serve for device-independent self-testing of states, as shown, e.g., in Phys. Rev. Lett. 109, 180401 (2012). Here we develop and broaden these results to an extended version of Hardy's argument, often referred to as Cabello's nonlocality argument. We show that, as in the simpler case of Hardy's nonlocality argument, the maximum quantum value for Cabello's nonlocality is achieved by a pure two-qubit state and projective measurements that are unique up to local isometries. We also examine the properties of a more realistic case when small errors in the ideal constraints are accepted within the probabilities obtained and prove that also in this case the two-qubit state and measurements are sufficient for obtaining the maximum quantum violation of the classical bound.

quant-ph↗

arXiv2021

Semi-Device-Independent Random Number Generation with Flexible Assumptions

Our ability to trust that a random number is truly random is essential for fields as diverse as cryptography and fundamental tests of quantum mechanics. Existing solutions both come with drawbacks -- device-independent quantum random number generators (QRNGs) are highly impractical and standard semi-device-independent QRNGs are limited to a specific physical implementation and level of trust. Here we propose a new framework for semi-device-independent randomness certification, using a source of trusted vacuum in the form of a signal shutter. It employs a flexible set of assumptions and levels of trust, allowing it to be applied in a wide range of physical scenarios involving both quantum and classical entropy sources. We experimentally demonstrate our protocol with a photonic setup and generate secure random bits under three different assumptions with varying degrees of security and resulting data rates.

quant-ph↗

arXiv2021

Choice of mutually unbiased bases and outcome labelling affects measurement outcome secrecy

Mutually unbiased bases (MUBs) are a crucial ingredient for many protocols in quantum information processing. Measurements performed in these bases are unbiased to the maximally possible extent, which is used to prove randomness or secrecy of measurement results. In this work we show that certain properties of sets of MUBs crucially depend on their specific choice, including, somewhat surprisingly, measurement outcome labelling. If measurements are chosen in a coherent way, the secrecy of the result can be completely lost for specific sets of MUB measurements, while partially retained for others. This can potentially impact a broad spectrum of applications, where MUBs are utilized.

quant-ph↗

arXiv2021

Quantum key distribution overcoming extreme noise: simultaneous subspace coding using high-dimensional entanglement

High-dimensional entanglement promises to increase the information capacity of photons and is now routinely generated exploiting spatio-temporal degrees of freedom of single photons. A curious feature of these systems is the possibility to certify entanglement despite strong noise in the data. We show that it is also possible to exploit this noisy high-dimensional entanglement for quantum key distribution by introducing a protocol that uses mutliple subspaces of the high-dimensional system simultaneously. Our protocol can be used to establish a secret key even in extremely noisy experimental conditions, where qubit protocols fail. To show that, we analyze the performance of our protocol for noise models that apply to the two most commonly used sources of high-dimensional entanglement: time bins and spatial modes.

quant-ph↗

arXiv2020

High-Dimensional Pixel Entanglement: Efficient Generation and Certification

Photons offer the potential to carry large amounts of information in their spectral, spatial, and polarisation degrees of freedom. While state-of-the-art classical communication systems routinely aim to maximize this information-carrying capacity via wavelength and spatial-mode division multiplexing, quantum systems based on multi-mode entanglement usually suffer from low state quality, long measurement times, and limited encoding capacity. At the same time, entanglement certification methods often rely on assumptions that compromise security. Here we show the certification of photonic high-dimensional entanglement in the transverse position-momentum degree-of-freedom with a record quality, measurement speed, and entanglement dimensionality, without making any assumptions about the state or channels. Using a tailored macro-pixel basis, precise spatial-mode measurements, and a modified entanglement witness, we demonstrate state fidelities of up to 94.4% in a 19-dimensional state-space, entanglement in up to 55 local dimensions, and an entanglement-of-formation of up to 4 ebits. Furthermore, our measurement times show an improvement of more than two orders of magnitude over previous state-of-the-art demonstrations. Our results pave the way for noise-robust quantum networks that saturate the information-carrying capacity of single photons.

quant-ph↗

arXiv2020

Experimental creation of Multi-Photon High-Dimensional Layered Quantum States

Quantum entanglement is one of the most important resources in quantum information. In recent years, the research of quantum entanglement mainly focused on the increase in the number of entangled qubits or the high-dimensional entanglement of two particles. Compared with qubit states, multipartite high-dimensional entangled states have beneficial properties and are powerful for constructing quantum networks. However, there are few studies on multipartite high-dimensional quantum entanglement due to the difficulty of creating such states. In this paper, we experimentally prepared a multipartite high-dimensional state $|Ψ_{442}\rangle=\frac{1}{2}(|000\rangle+|110\rangle+|221\rangle+|331\rangle)$ by using the path mode of photons. We obtain the fidelity $F=0.854\pm0.007$ of the quantum state, which proves a real multipartite high-dimensional entangled state. Finally, we use this quantum state to demonstrate a layered quantum network in principle. Our work highlights another route towards complex quantum networks.

quant-ph↗

arXiv2019

Measurements in two bases are sufficient for certifying high-dimensional entanglement

High-dimensional encoding of quantum information provides a promising method of transcending current limitations in quantum communication. One of the central challenges in the pursuit of such an approach is the certification of high-dimensional entanglement. In particular, it is desirable to do so without resorting to inefficient full state tomography. Here, we show how carefully constructed measurements in two bases (one of which is not orthonormal) can be used to faithfully and efficiently certify bipartite high-dimensional states and their entanglement for any physical platform. To showcase the practicality of this approach under realistic conditions, we put it to the test for photons entangled in their orbital angular momentum. In our experimental setup, we are able to verify 9-dimensional entanglement for a pair of photons on a 11-dimensional subspace each, at present the highest amount certified without any assumptions on the state.

quant-ph↗

arXiv2017

Layered Quantum Key Distribution

We introduce a family of QKD protocols for distributing shared random keys within a network of $n$ users. The advantage of these protocols is that any possible key structure needed within the network, including broadcast keys shared among subsets of users, can be implemented by using a particular multi-partite high-dimensional quantum state. This approach is more efficient in the number of quantum channel uses than conventional quantum key distribution using bipartite links. Additionally, multi-partite high-dimensional quantum states are becoming readily available in quantum photonic labs, making the proposed protocols implementable using current technology.

quant-ph↗

arXiv2017

Loss of Information in Quantum Guessing Game

Incompatibility of certain measurements -- impossibility of obtaining deterministic outcomes simultaneously -- is a well known property of quantum mechanics. This feature can be utilized in many contexts, ranging from Bell inequalities to device dependent QKD protocols. Typically, in these applications the measurements are chosen from a predetermined set based on a classical random variable. One can naturally ask, whether the non-determinism of the outcomes is due to intrinsic hiding property of quantum mechanics, or rather by the fact that classical, incoherent information entered the system via the choice of the measurement. Authors of [NJP 19, 023038 (2017)] examined this question for a specific case of two mutually unbiased measurements on systems of different dimensions. They have somewhat surprisingly shown that in case of qubits, if the measurements are chosen coherently with the use of a controlled unitary, outcomes of both measurements can be guessed deterministically. Here we extend their analysis and show that specifically for qubits, measurement result for any set of measurements with any a-priori probability distribution can be faithfully guessed by a suitable state preparation and measurement. We also show that up to a small set of specific cases, this is not possible for higher dimensions. This result manifests a deep difference in properties of qubits and higher dimensional systems and suggests that these systems might offer higher security in specific cryptographic protocols. More fundamentally, the results show that the impossibility of predicting a result of a measurement is not caused solely by a loss of coherence between the choice of the measurement and the guessing procedure.

quant-ph↗

arXiv2016

1-out-of-2 Oblivious transfer using flawed Bit-string quantum protocol

Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. Common attribute of OT protocols is that one party (Alice) has to send a message to another party (Bob) and has to stay oblivious on whether Bob did receive the message. Specific (OT) protocols vary by exact definition of the task - in the all-or-nothing protocol Alice sends a single bit-string message, which Bob is able to read only with 50% probability, whereas in 1-out-of-2 OT protocol Bob reads one out of two messages sent by Alice. These two flavours of protocol are known to be equivalent. Recently a computationally secure all-or-nothing OT protocol based on quantum states was developed in [A. Souto et. al., PRA 91, 042306], which however cannot be reduced to 1-out-of-2 OT protocol by standard means. Here we present an elaborated reduction of this protocol which retains the security of the original.

quant-ph↗

arXiv2016

Tight bound on the classical value of generalized Clauser-Horne-Shimony-Holt games

Non-local games are an important part of quantum information processing. Recently there has been an increased interest in generalizing non-local games beyond the basic setup by considering games with multiple parties and/or with large alphabet inputs and outputs. In this paper we consider another interesting generalization -- games with non-uniform inputs. Here we derive a tight upper bound for the classical winning probability for a specific family of non-local games with non-uniform input distribution, known as $\mathrm{CHSH}_q(p)$ which was introduced recently in the context of relativistic bit-commitment protocols by [Chakraborty et. al., PRL 115, 250501, 2015].

quant-ph↗

arXiv2015

An explicit classical strategy for winning a $\mathrm{CHSH}_{q}$ game

A $\mathrm{CHSH}_{q}$ game is a generalization of the standard two player $\mathrm{CHSH}$ game, having $q$ different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a $\mathrm{CHSH}_{q}$ game, with $q$ being a prime. Our construction achieves a winning probability better than $\frac{1}{22}q^{-\frac{2}{3}}$, which is in contrast with the previously known constructive strategies achieving only the winning probability of $O(q^{-1})$.

quant-ph↗

arXiv2014

Device-independent randomness amplification with a single device

Expansion and amplification of weak randomness with untrusted quantum devices has recently become a very fruitful topic of research. Here we contribute with a procedure for amplifying a single weak random source using tri-partite GHZ-type entangled states. If the quality of the source reaches a fixed threshold $R=\frac{1}{4}\log_{2}(10)$, perfect random bits can be produced. This technique can be used to extract randomness from sources that can't be extracted neither classically, nor by existing procedures developed for Santha-Vazirani sources. Our protocol works with a single fault-free device decomposable into three non-communicating parts, that is repeatedly reused throughout the amplification process.

quant-ph↗

arXiv2014

Device-independent randomness extraction for arbitrarily weak min-entropy source

Expansion and amplification of weak randomness plays a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of the devices. We show here how to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy source in a device independent setting. To do this we use Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the random sequence $n$. Our protocol is robust, it can tolerate devices that malfunction with a probability dropping polynomially in $n$ at the cost of a minor increase of the number of devices used.

quant-ph↗

arXiv2012

Weak randomness completely trounces the security of QKD

In usual security proofs of quantum protocols the adversary (Eve) is expected to have full control over any quantum communication between any communicating parties (Alice and Bob). Eve is also expected to have full access to an authenticated classical channel between Alice and Bob. Unconditional security against any attack by Eve can be proved even in the realistic setting of device and channel imperfection. In this Letter we show that the security of QKD protocols is ruined if one allows Eve to possess a very limited access to the random sources used by Alice. Such knowledge should always be expected in realistic experimental conditions via different side channels.

quant-ph↗