Searcharxiv⌕ Search

arXiv subjects

Piotr Mironowicz

Publications and source records attributed to Piotr Mironowicz.

At least 37 records · Page 2Linked to original sources
arXiv2022

Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks

Rendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, meet without pre-agreement on the meeting point. This problem has been extensively studied in classical computer science and has vivid importance to modern applications like coordinating a fleet of drones in an enemy's territory. Quantum non-locality, like Bell inequality violation, has shown that in many cases quantum entanglement allows for improved coordination of two separated parties compared to classical sources. The non-signaling correlations in many cases even strengthened such phenomena. In this work, we analyze, how Bell non-locality can be used by asymmetric location-aware agents trying to rendezvous on a finite network with a limited number of steps. We provide the optimal solution to this problem for both agents using quantum resources, and agents with only ``classical'' computing power. Our results show that for cubic graphs and cycles it is possible to gain an advantage by allowing the agents to use assistance of entangled quantum states.

quant-ph↗
arXiv2022

Quantum security and theory of decoherence

We sketch a relation between two crucial, yet independent, fields in quantum information research, viz. quantum decoherence and quantum cryptography. We investigate here how the standard cryptographic assumption of shielded laboratory, stating that data generated by a secure quantum device remain private unless explicitly published, is disturbed by the einselection mechanism of quantum Darwinism explaining the measurement process by interaction with the external environment. We illustrate the idea with a paradigmatic example of a quantum random number generator compromised by an analog of the Van Eck phreaking. In particular, we derive a trade-off relation between eavesdropper's guessing probability $P_{guess}$ and the collective decoherence factor $Γ$ of the simple form $P_{guess} + Γ\geq 1$.

quant-ph↗
arXiv2022

Non-perfect propagation of information to noisy environment with self-evolution

We study the non-perfect propagation of information to evolving low-dimensional environment that includes self-evolution as well as noisy initial states and analyze interrelations between the degree of objectivization and environment parameters. In particular, we consider an analytical model of three interacting qubits and derive its objectivity parameters. The numerical analysis shows that the quality of the spectrum broadcast structure formed during the interaction may exhibit non-monotonicity both in the speed of self-dynamics of the environment as well as its mixedness. The former effect is particularly strong, showing that -- considering part of the environment as a measurement apparatus -- an increase of the external magnetic field acting on the environment may turn the very vague measurement into close to ideal. The above effects suggest that quantum objectivity may appear after increasing the dynamics of the environment, although not with respect to the pointer basis, but some other one which we call generalized pointer or indicator basis. Furthermore, it seems also that when the objectivity is poor it may be improved, at least by some amount, by increasing thermal noise. We provide further evidence of that by analyzing the upper bounds on distance to the set of states representing perfect objectivity in the case of a higher number of qubits.

quant-ph↗
arXiv2022

Hybrid no-signaling-quantum correlations

Fundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term $\textbf{HNSQ}$ in the multi-party Bell scenario where some subsystems are locally quantum while the remaining subsystems are only constrained by the no-signaling principle. Specifically, the set $\textbf{HNSQ}$ is a super-quantum set of correlations derived from no-signaling assemblages by performing quantum measurements on the trusted subsystems. As a tool for optimization over the set $\textbf{HNSQ}$, we introduce an outer hierarchy of semi-definite programming approximations to the set following an approach put forward by Doherty-Parillo-Spedalieri. We then show that in contrast to the set $\textbf{NS}$ of no-signaling correlations, there exist extreme points of $\textbf{HNSQ}$ in the tripartite Bell scenario that admit quantum realization. We perform an extensive numerical analysis of the maximal violation of the facet Bell inequalities in the three-party binary input-output scenario and study the corresponding self-testing properties. In contrast to the usual no-signaling correlations, the new set allows for simple security proofs of (one-sided)-device-independent applications against super-quantum adversaries.

quant-ph↗
arXiv2021

Blurred quantum Darwinism across quantum reference frames

Quantum Darwinism describes objectivity of quantum systems via their correlations with their environment--information that hypothetical observers can recover by measuring the environments. However, observations are done with respect to a frame of reference. Here, we take the formalism of [Giacomini, Castro-Ruiz, & Brukner. Nat Commun 10, 494 (2019)], and consider the repercussions on objectivity when changing quantum reference frames. We find that objectivity depends on non-degenerative relative separations, conditional state localisation, and environment macro-fractions. There is different objective information in different reference frames due to the interchangeability of entanglement and coherence, and of statistical mixing and classical correlations. As such, objectivity is subjective across quantum reference frames.

quant-ph↗
arXiv2020

Quantum randomness protected against detection loophole attacks

Device and semi-device independent quantum randomness generators (DI- and SDI-QRNGs) are crucial for applications requiring private randomness. However, they are vulnerable to detection inefficiency attacks and this limits severely their usage for practical purposes. Here, we present a method for protecting SDI-QRNGs in prepare-and-measure scenarios against detection inefficiency attacks. The key idea is the introduction of a blocking device that adds failures in the communication between the preparation and measurement devices. We prove that, for any detection efficiency, there is a blocking rate that provides protection against these attacks. We experimentally demonstrate the generation of private randomness using weak coherent states and standard avalanche photo-detectors.

quant-ph↗
arXiv2020

Experimental certification of an informationally complete quantum measurement in a device-independent protocol

Minimal informationally complete positive operator-valued measures (MIC-POVMs) are special kinds of measurement in quantum theory in which the statistics of their $d^2$-outcomes are enough to reconstruct any $d$-dimensional quantum state. For this reason, MIC-POVMs are referred to as standard measurements for quantum information. Here, we report an experiment with entangled photon pairs that certifies, for what we believe is the first time, a MIC-POVM for qubits following a device-independent protocol (i.e., modeling the state preparation and the measurement devices as black boxes, and using only the statistics of the inputs and outputs). Our certification is achieved under the assumption of freedom of choice, no communication, and fair sampling.

quant-ph↗
arXiv2018

Steering is an essential feature of non-locality in quantum theory

A physical theory is called non-local when observers can produce instantaneous effects over distant systems. Non-local theories rely on two fundamental effects: local uncertainty relations and steering of physical states at a distance. In quantum mechanics, the former one dominates the other in a well-known class of non-local games known as XOR games. In particular, optimal quantum strategies for XOR games are completely determined by the uncertainty principle alone. This breakthrough result has yielded the fundamental open question whether optimal quantum strategies are always restricted by local uncertainty principles, with entanglement-based steering playing no role. In this work, we provide a negative answer to the question, showing that both steering and uncertainty relations play a fundamental role in determining optimal quantum strategies for non-local games. Our theoretical findings are supported by an experimental implementation with entangled photons.

quant-ph↗
arXiv2018

Applications of semi-definite optimization in quantum information protocols

This work is concerned with the issue of applications of the semi-definite programming (SDP) in the field of quantum information science. Our results of the analysis of certain quantum information protocols using this optimization technique are presented, and an implementation of a relevant numerical tool is introduced. The key method used is NPA discovered by Navascues et al. [Phys. Rev. Lett. 98, 010401 (2007)]. In chapter 1 a brief overview of mathematical methods used in this work is presented. In chapter 2 an introduction to quantum information science is given. Chapter 3 concerns the device-independent (DI) and semi-device-independent (SDI) approaches in quantum cryptography. In chapter 4 our results regarding quantum information protocols which we developed using SDP are described. The results include a new type of quantum key distribution protocol based on Hardy's paradox; several protocols for quantum random number expansion; a method of formulation of SDP relaxations of SDI protocols; and a DI Santha-Vazirani source of randomness amplification protocol. In chapter 5 an introduction to interior point methods is given. In chapter 6 the implementation of our numerical tool dedicated to problems occurring in chapter 4 are discussed and compared with other solutions.

quant-ph↗
arXiv2018

Connections Between Mutually Unbiased Bases and Quantum Random Access Codes

We present a new quantum communication complexity protocol, the promise--Quantum Random Access Code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing Semi--Definite Programming techniques.

quant-ph↗
arXiv2017

System information propagation for spin structures

We study in details decoherence process of a spin register, coupled to a spin environment. We use recently developed methods of information transfer study in open quantum systems to analyze information flow between the register and its environment. We show that there are regimes when not only the register decoheres effectively to a classical bit string, but this bit string is redundantly encoded in the environment, making it available to multiple observations. This process is more subtle than in a case of a single qubit due to possible presence of protected subspaces: Decoherence free subspaces and, so called, orthogonalization free subspaces. We show that this leads to a rich structure of coherence loss/protection in the asymptotic state of the register and a part of its environment. We formulate a series of examples illustrating these structures.

quant-ph↗
arXiv2017

Complementarity between entanglement-assisted and quantum distributed random access code

Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of $3 \rightarrow 1$ distributed RACs \cite{network} and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa.Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the $3 \rightarrow 1$ distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.

quant-ph↗
arXiv2017

Trade-offs in multi-party Bell inequality violations in qubit networks

Two overlapping bipartite binary input Bell inequalities cannot be simultaneously violated as this would contradict the usual no-signalling principle. This property is known as monogamy of Bell inequality violations and generally Bell monogamy relations refer to trade-offs between simultaneous violations of multiple inequalities. It turns out that multipartite Bell inequalities admit weaker forms of monogamies that allow for violations of a few inequalities at once. Here we systematically study monogamy relations between correlation Bell inequalities both within quantum theory and under the sole assumption of no signalling. We first investigate the trade-offs in Bell violations arising from the uncertainty relation for complementary binary observables, and exhibit several network configurations in which a tight trade-off arises in this fashion. We then derive a tight trade-off relation which cannot be obtained from the uncertainty relation showing that it does not capture monogamy entirely. The results are extended to Bell inequalities involving different number of parties and find applications in device-independent secret sharing and device-independent randomness extraction. Although two multipartite Bell inequalities may be violated simultaneously, we show that genuine multi-party non-locality, as evidenced by a generalised Svetlichny inequality, does exhibit monogamy property. Finally, using the relations derived we reveal the existence of flat regions in the set of quantum correlations.

quant-ph↗
arXiv2016

Monitoring of the process of system information broadcasting in time

One of the fundamental problems of modern physics is how the classical world, the 2nd Law of Thermodynamics and the whole irreversibility emerges from the quantum reality with reversible evolution. This relates to the problem of measurement transforming quantum, non-copyable data, towards intersubjective, copyable classical knowledge. We use the quantum state discrimination to show in a central system model how it's evolution leads to the broadcasting of the classical information. We analyze the process of orthogonalization and decoherence, their time scales and dependence on the environment.

quant-ph↗
arXiv2016

Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing

Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the postprocessing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today's computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.

quant-ph↗
arXiv2015

Device-independent quantum key distribution based on measurement inputs

We provide an analysis of a new family of device independent quantum key distribution (QKD) protocols with several novel features: (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings; (b) Instead of a single security parameter (a violation of some Bell inequality) a set of them is used to estimate the level of trust in the secrecy of the key. The main advantage of these protocols is a smaller vulnerability to imperfect random number generators made possible by feature (a). We prove the security and the robustness of such protocols. We show that using our method it is possible to construct a QKD protocol which retains its security even if the source of randomness used by communicating parties is strongly biased. As a proof of principle, an explicit example of a protocol based on the Hardy's paradox is presented. Moreover, in the noiseless case, the protocol is secure in a natural way against any type of memory attack, and thus allows to reuse the device in subsequent rounds. We also analyse the robustness of the protocol using semi-definite programming methods. Finally, we present a post-processing method, and observe a paradoxical property that rejecting some random part of the private data can increase the key rate of the protocol.

quant-ph↗
arXiv2015

Robust amplification of Santha-Vazirani sources with three devices

We demonstrate that amplification of arbitrarily weak randomness is possible using quantum resources. We present a randomness amplification protocol that involves Bell experiments. We find a Bell inequality which can amplify arbitrarily weak randomness and give a detailed analysis of the protocol involving it. Our analysis includes finding a sufficient violation of Bell inequality as a function of the initial quality of randomness. It has a very important property that for any quality the required violation is strictly lower than possible to obtain using quantum resources. Among other things, it means that the protocol takes a finite amount of time to amplify arbitrarily weak randomness.

quant-ph↗