Searcharxiv⌕ Search

arXiv subjects

Paweł Horodecki

Publications and source records attributed to Paweł Horodecki.

At least 37 records · Page 2Linked to original sources

Unbounded Quantum Advantage in Communication with Minimal Input Scaling

In communication complexity-like problems, previous studies have shown either an exponential quantum advantage or an unbounded quantum advantage with an exponentially large input set $Θ(2^{n})$ bits with respect to classical communication $Θ(n)$ bits. In the former, the quantum and classical separation grows exponentially in input while the latter's quantum communication resource is a constant. Remarkably, it was still open whether an unbounded quantum advantage exists while the inputs do not scale exponentially. Here we answer this question affirmatively using an input size of optimal order. Considering two variants as tasks: 1) distributed computation of relation and 2) {\it relation reconstruction}, we study the one-way zero-error communication complexity of a relation induced by a distributed clique labelling problem for orthogonality graphs. While we prove no quantum advantage in the first task, we show an {\it unbounded quantum advantage} in relation reconstruction without public coins. Specifically, for a class of graphs with order $m$, the quantum complexity is $Θ(1)$ while the classical complexity is $Θ(\log_2 m)$. Remarkably, the input size is $Θ(\log_2 m)$ bits and the order of its scaling with respect to classical communication is {\it minimal}. This is exponentially better compared to previous works. Additionally, we prove a lower bound (linear in the number of maximum cliques) on the amount of classical public coin necessary to overcome the separation in the scenario of restricted communication and connect this to the existence of Orthogonal Arrays. Finally, we highlight some applications of this task to semi-device-independent dimension witnessing and the detection of Mutually Unbiased Bases.

quant-ph↗

Randomness-free Detection of Non-projective Measurements: Qubits & beyond

Non-projective measurements play a crucial role in various information-processing protocols. In this work, we propose an operational task to identify measurements that are neither projective nor classical post-processing of data obtained from projective measurements. Our setup involves space-like separated parties with access to a shared state with bounded local dimensions. Specifically, in the case of qubits, we focus on a bipartite scenario with different sets of target correlations. While some of these correlations can be obtained through non-projective measurements on a shared two-qubit state, it is impossible to generate these correlations using {\it projective simulable} measurements on bipartite qubit states, or equivalently, by using one bit of shared randomness and local post-processing. For certain target correlations, we show that detecting qubit non-projective measurements is robust under {\it arbitrary} depolarising noise, except in the limiting case. We extend this task for qutrits and demonstrate that some correlations achievable via local non-projective measurements cannot be reproduced by both parties performing the same qutrit {\it projective simulable} measurements on their pre-shared state. We provide numerical evidence for the robustness of this scheme under {\it arbitrary} depolarising noise. For a more generic consideration (bipartite and tripartite scenario), we provide numerical evidence for a projective-simulable bound on the reward function for our task. We also show a violation of this bound by using qutrit POVMs. From a foundational perspective, we extend the notion of non-projective measurements to general probabilistic theories (GPTs) and use a randomness-free test to demonstrate that a class of GPTs, called {\it square-bits or box-world} are unphysical.

quant-ph↗

Superluminal signalling and chaos in nonlinear quantum dynamics

Nonlinear quantum dynamics is often invoked in models trying to bridge the gap between the quantum micro-world and the classical macro-world. Such endeavors, however, encounter challenges at the nexus with relativity. In 1989 Nicolas Gisin proved a powerful no-go theorem, according to which nonlinear quantum dynamics would lead to superluminal signalling, violating Einstein's causality. Here we analyse the theorem from the perspective of recent developments. First, we observe that it harmonises with the no-restriction hypothesis from General Probabilistic Theories. Second, we note that it requires a suitable synchronisation of Alice's and Bob's clocks and actions. Next, we argue that it does not automatically exclude the possibility of global nonlinear quantum dynamics on a tensor product Hilbert space. Consequently, we investigate a class of such dynamics inspired by discrete analogues of nonlinear Schrödinger equations. We show that, in general, they exhibit a chaotic character. In this context we inspect whether superluminal signalling can be avoided by relaxing the no-restriction hypothesis. We study three possible communication protocols involving either local measurements or modifications of a local Hamiltonian. We conclude that, in general, in all three cases, two spacelike separated parties can effectuate statistical superluminal information transfer. Nevertheless, we show an example of a nonlocal nonlinear quantum dynamics, which does not allow for it, provided that we relax the no-restriction hypothesis.

quant-ph↗

Revisiting dynamics of quantum causal structures -- when can causal order evolve?

Recently, there has been substantial interest in studying the dynamics of quantum theory beyond that of states, in particular, the dynamics of channels, measurements, and higher-order transformations. Ref. [Phys. Rev. X 8(1), 011047 (2018)] pursues this using the process-matrix formalism, together with a definition of the possible dynamics of such process matrices, and focusing especially on the question of evolution of causal structures. One of its major conclusions is a strong theorem saying that within the formalism, under continuous and reversible transformations, the causal order between operations must be preserved. Our result here challenges that of Ref. [Phys. Rev. X 8(1), 011047 (2018)]: if one is to take into account a full picture of the physical evolution of operations within the standard quantum-mechanical formalism, then the conclusion of Ref. [Phys. Rev. X 8(1), 011047 (2018)] does not hold. That is, we show that under certain continuous and reversible dynamics, the causal order between operations is not necessarily preserved. We moreover identify and analyse the root of this apparent contradiction, specifically, that the commonly accepted and widely applied framework of higher-order processes, whilst mathematically sound, is not always appropriate for drawing conclusions on physical dynamics. Finally, we show how to reconcile the elements of the whole picture following the intuition based on entanglement processing by local operations and classical communication.

quant-ph↗

Super-Optimal Charging of Quantum Batteries via Reservoir Engineering

Energy dissipation, typically considered an undesirable process, has recently been shown to be harnessed as a resource to optimize the performance of a quantum battery. Following this perspective, we introduce a novel technique of charging in which coherent charger-battery interaction is replaced by a dissipative interaction via an engineered shared reservoir. We demonstrate that exploiting collective effects of the engineered shared reservoir allows for extra optimization giving rise to optimal redistribution of energy, which leads to a significant enhancement in the efficiency of the charging process. The article unveils the intricacies of built-in detuning within the context of a shared environment, offering a deeper understanding of the charging mechanisms involved. These findings apply naturally to quantum circuit battery architectures, suggesting the feasibility of efficient energy storage in these systems. Moreover, the super-optimal charging offers a practical justification for charger-battery configurations.

quant-ph↗

Activation of metrologically useful genuine multipartite entanglement

We consider quantum metrology with several copies of bipartite and multipartite quantum states. We characterize the metrological usefulness by determining how much the state outperforms separable states. We identify a large class of entangled states that become maximally useful for metrology in the limit of large number of copies, even if the state is weakly entangled and not even more useful than separable states. This way we activate metrologically useful genuine multipartite entanglement. Remarkably, not only that the maximally achievable metrological usefulness is attained exponentially fast in the number of copies, but it can be achieved by the measurement of few simple correlation observables. We also make general statements about the usefulness of a single copy of pure entangled states. We surprisingly find that the multiqubit states presented in Hyllus et al. [Phys. Rev. A 82, 012337 (2010)], which are not useful, become useful if we embed the qubits locally in qutrits. We discuss the relation of our scheme to error correction, and its possible use for quantum metrology in a noisy environment.

quant-ph↗

Nonreciprocal Quantum Batteries

Nonreciprocity, arising from the breaking of time-reversal symmetry, has become a fundamental tool in diverse quantum technology applications. It enables directional flow of signals and efficient noise suppression, constituting a key element in the architecture of current quantum information and computing systems. Here we explore its potential in optimizing the charging dynamics of a quantum battery. By introducing nonreciprocity through reservoir engineering during the charging process, we induce a directed energy flow from the quantum charger to the battery, resulting in a substantial increase in energy accumulation. Despite local dissipation, the nonreciprocal approach demonstrates a fourfold increase in battery energy compared to conventional charger-battery systems. We demonstrate that employing a shared reservoir can establish an optimal condition where nonreciprocity enhances charging efficiency and elevates energy storage in the battery. This effect is observed in the stationary limit and remains applicable even in overdamped coupling regimes, eliminating the need for precise temporal control over evolution parameters. Our result can be extended to a chiral network of quantum nodes, serving as a multi-cell quantum battery system to enhance storage capacity. The proposed approach is straightforward to implement using current state-of-the-art quantum circuits, both in photonics and superconducting quantum systems. In a broader context, the concept of nonreciprocal charging has significant implications for sensing, energy capture, and storage technologies or studying quantum thermodynamics.

quant-ph↗

Complete extension: the non-signaling analog of quantum purification

Deriving quantum mechanics from information-theoretic postulates is a recent research direction taken, in part, with the view of finding a beyond-quantum theory; once the postulates are clear, we can consider modifications to them. A key postulate is the purification postulate, which we propose to replace by a more generally applicable postulate that we call the complete extension postulate (CEP), i.e., the existence of an extension of a physical system from which one can generate any other extension. This new concept leads to a plethora of open questions and research directions in the study of general theories satisfying the CEP (which may include a theory that hyper-decoheres to quantum theory). For example, we show that the CEP implies the impossibility of bit-commitment. This is exemplified by a case study of the theory of non-signalling behaviors which we show satisfies the CEP. We moreover show that in certain cases the complete extension will not be pure, highlighting the key divergence from the purification postulate.

quant-ph↗

Tilted Hardy paradoxes for device-independent randomness extraction

The device-independent paradigm has had spectacular successes in randomness generation, key distribution and self-testing, however most of these results have been obtained under the assumption that parties hold trusted and private random seeds. In efforts to relax the assumption of measurement independence, Hardy's non-locality tests have been proposed as ideal candidates. In this paper, we introduce a family of tilted Hardy paradoxes that allow to self-test general pure two-qubit entangled states, as well as certify up to $1$ bit of local randomness. We then use these tilted Hardy tests to obtain an improvement in the generation rate in the state-of-the-art randomness amplification protocols for Santha-Vazirani (SV) sources with arbitrarily limited measurement independence. Our result shows that device-independent randomness amplification is possible for arbitrarily biased SV sources and from almost separable states. Finally, we introduce a family of Hardy tests for maximally entangled states of local dimension $4, 8$ as the potential candidates for DI randomness extraction to certify up to the maximum possible $2 \log d$ bits of global randomness.

quant-ph↗

Sensitivity versus selectivity in entanglement detection via collective witnesses

In this paper, we present a supervised learning technique that utilizes artificial neural networks to design new collective entanglement witnesses for two-qubit and qubit-qutrit systems. Machine-designed collective entanglement witnesses allow for continuous tuning of their sensitivity and selectivity. These witnesses are, thus, a conceptually novel instrument allowing to study the sensitivity vs. selectivity trade-off in entanglement detection. The chosen approach is also favored due to its high generality, lower number of required measurements compared to quantum tomography, and potential for superior performance with regards to other types of entanglement witnesses. Our findings could pave the way for the development of more efficient and accurate entanglement detection methods in complex quantum systems, especially considering realistic experimental imperfections.

quant-ph↗

Two instances of random access code in the quantum regime

We consider two classes of quantum generalisations of Random Access Code (RAC) and study lower bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) [A. Grudka et al. Phys. Rev. A 92, 052312 (2015)], where unbounded entanglement and constrained classical communication are allowed, which can be seen as quantum teleportation with constrained classical communication, for which we provide a quantum lower bound. We consider two modifications to the NS-QRAC scenario, first where unbounded entanglement and constrained quantum communication is allowed and, second where bounded entanglement and unconstrained classical communication are allowed, where we find a monogamy relation for the transmission fidelities, which -- in contrast to the usual communication schemes -- involves multiple senders and a single receiver. We provide lower bounds for these scenarios. The second class is based on a random access code with a quantum channel and shared entanglement [A. Tavakoli et al. PRX Quantum 2 (4) 040357 (2021)]. We study the set of tasks where two inputs made of two digits of $d$-base are encoded over a qudit and a maximally entangled state, which can be seen as quantum dense coding with constrained quantum communication, for which we provide quantum lower bounds for $d=2,3,4$. The encoding employed utilises Gray codes.

quant-ph↗

Optimal Measurement Structures for Contextuality Applications

The Kochen-Specker (KS) theorem is a corner-stone result in the foundations of quantum mechanics describing the fundamental difference between quantum theory and classical non-contextual theories. Recently specific substructures termed $01$-gadgets were shown to exist within KS proofs that capture the essential contradiction of the theorem. Here, we show these gadgets and their generalizations provide an optimal toolbox for contextuality applications including (i) constructing classical channels exhibiting entanglement-assisted advantage in zero-error communication, (ii) identifying large separations between quantum theory and binary generalised probabilistic theories, and (iii) finding optimal tests for contextuality-based semi-device-independent randomness generation. Furthermore, we introduce and study a generalisation to definite prediction sets for more general logical propositions, that we term higher-order gadgets. We pinpoint the role these higher-order gadgets play in KS proofs by identifying these as induced subgraphs within KS graphs and showing how to construct proofs of state-independent contextuality using higher-order gadgets as building blocks. The constructions developed here may help in solving some of the remaining open problems regarding minimal proofs of the Kochen-Specker theorem.

quant-ph↗

Quantum Speed Limit for Change of Basis

Quantum speed limits provide ultimate bounds on the time required to transform one quantum state into another. Here, we extend the notion of quantum speed limits to collections of quantum states, investigating the time for converting a basis of states into an unbiased one. We provide tight bounds for systems of dimension smaller than 5, and general bounds for multi-qubit systems and Hilbert space dimension $d$. For two-qubit systems, we show that the fastest transformation implements two Hadamards and a swap of the qubits simultaneously. We further prove that for qutrit systems the evolution time depends on the particular type of the unbiased basis. We also investigate speed limits for coherence generation, providing the minimal time to establish a certain amount of coherence with a unitary evolution.

quant-ph↗

Multipartite channel assemblages

Motivated by the recent studies on post-quantum steering, we generalize the notion of bipartite channel steering by introducing the concept of multipartite no-signaling channel assemblages. We first show that beyond the bipartite case, the no-signaling and quantum descriptions of channel assemblages do not coincide. Using the Choi-Jamiołkowski isomorphism, we present a complete characterization of these classes of assemblages and use this characterization to provide sufficient conditions for extremality of quantum channel assemblages within the set of all no-signaling channel assemblages. Finally, we introduce and discuss a relaxed version of channel steering where only certain subsystems obey the no-signaling constraints. In this latter asymmetric scenario we show the possibility of certifying a perfect key bit that is secure against a general no-signaling eavesdropper.

quant-ph↗

Probing the limits of quantum theory with quantum information at subnuclear scales

Modern quantum engineering techniques enabled successful foundational tests of quantum mechanics. Yet, the universal validity of quantum postulates is an open question. Here we propose a new theoretical framework of Q-data tests, which recognises the established validity of quantum theory, but allows for more general -- 'post-quantum' -- scenarios in certain physical regimes. It can accommodate a large class of models with modified quantum wave dynamics, correlations beyond entanglement or general probabilistic postulates. We discuss its experimental implementation suited to probe the nature of strong nuclear interactions. In contrast to the present accelerator experiments, it shifts the focus from high-luminosity beam physics to individual particle coherent control.

quant-ph↗

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↗

The rank of contextuality

Quantum contextuality is one of the most recognized resources in quantum communication and computing scenarios. We provide a new quantifier of this resource, the rank of contextuality (RC). We define RC as the minimum number of non-contextual behaviors that are needed to simulate a contextual behavior. We show that the logarithm of RC is a natural contextuality measure satisfying several properties considered in the spirit of the resource-theoretic approach. The properties include faithfulness, monotonicity, and additivity under tensor product. We also give examples of how to construct contextual behaviors with an arbitrary value of RC exhibiting a natural connection between this quantifier and the arboricity of an underlying hypergraph. We also discuss exemplary areas of research in which the new measure appears as a natural quantifier.

quant-ph↗

Single trusted qubit is necessary and sufficient for quantum realisation of extremal no-signaling correlations

Quantum statistics can be considered from the perspective of postquantum no-signaling theories in which either none or only a certain number of quantum systems are trusted. In these scenarios, the role of states is played by the so-called no-signaling boxes or no-signaling assemblages respectively. It has been shown so far that in the usual Bell non-locality scenario with a single measurement run, quantum statistics can never reproduce an extremal non-local point within the set of no-signaling boxes. We provide here a general no-go rule showing that the latter stays true even if arbitrary sequential measurements are allowed. On the other hand, we prove a positive result showing that already a single trusted qubit is enough for quantum theory to produce a self-testable extremal point within the corresponding set of no-signaling assemblages. This result opens up the possibility for security proofs of cryptographic protocols against general no-signaling adversaries.

quant-ph↗