arXiv subjects

Ranieri Nery

Publications and source records attributed to Ranieri Nery.

14 recordsLinked to original sources

arXiv2024

Parallel ergotropy: Maximum work extraction via parallel local unitary operations

Maximum quantum work extraction is generally defined in terms of the ergotropy functional, no matter how experimentally complicated is the implementation of the optimal unitary allowing for it, especially in the case of multipartite systems. In this framework, we consider a quantum battery made up of many interacting sub-systems and study the maximum extractable work via concurrent local unitary operations on each subsystem. We call the resulting functional parallel ergotropy. Focusing on the bipartite case, we first observe that parallel ergotropy outperforms work extraction via egoistic strategies, in which the first agent A extracts locally on its part the maximum available work and the second agent B, subsequently, extracts what is left on the other part. For the agents, this showcases the need of cooperating for an overall benefit. Secondly, from the informational point of view, we observe that the parallel capacity of a state can detect entanglement and compare it with the statistical entanglement witness that exploits fluctuations of stochastic work extraction. Additionally, we face the technical problem of computing parallel ergotropy. We derive analytical upper bounds for specific classes of states and Hamiltonians and provide receipts to obtain numerical upper bounds via semi-definite programming in the generic case. Finally, extending the concept of parallel ergotropy, we demonstrate that system's free-time evolution and application of local unitaries allow one to saturate the gap with the ergotropy of the whole system.

quant-ph↗

arXiv2024

Efficient and operational quantifier of non-divisibility in terms of channel discrimination

The understanding of open quantum systems is crucial for the development of quantum technologies. Of particular relevance is the characterisation of divisible quantum dynamics, seen as a generalisation of Markovian processes to the quantum setting. Here, we propose a way to detect divisibility and quantify how non-divisible a quantum channel is through the concept of channel discrimination. We ask how well we can distinguish generic dynamics from divisible dynamics. We show that this question can be answered efficiently through semidefinite programming, which provides us with an operational and efficient way to quantify divisibility.

quant-ph↗

arXiv2024

Observational-Interventional Bell Inequalities

Generalizations of Bell's theorem, particularly within quantum networks, are now being analyzed through the causal inference lens. However, the exploration of interventions, a central concept in causality theory, remains significantly unexplored. In this work we give an initial step in this direction, by analyzing the instrumental scenario and proposing novel hybrid Bell inequalities integrating observational and interventional data. Focusing on binary outcomes with any number of inputs, we obtain the complete characterization of the observational-interventional polytope, equivalent to a Hardy-like Bell inequality albeit describing a distinct quantum experiment. To illustrate its applications, we show a significant enhancement regarding threshold detection efficiencies for quantum violations also showing the use of these hybrid approach in quantum steering scenarios.

quant-ph↗

arXiv2022

Witnessing the non-objectivity of an unknown quantum dynamics

Quantum Darwinism offers an explanation for the emergence of classical objective features -- those we are used to at macroscopic scales -- from quantum properties at the microscopic level. The interaction of a quantum system with its surroundings redundantly proliferates information to many parts of the environment, turning it accessible and objective to different observers. But given that one cannot probe the quantum system directly, only its environment, how to witness whether an unknown quantum property can be deemed objective or not? Here we propose a probabilistic framework to analyze this question and show that objectivity implies a Bell-like inequality. Among several other results, we show quantum violations of this inequality, a device-independent proof of the non-objectivity of quantum correlations that give rise to the phenomenon we name "collective hallucination": observers probing distinct parts of the environment can agree upon their measurement outcome of a given observable but such outcome can be totally uncorrelated from the property of the quantum system that fixed observable should be probing. We also implement an appealing photonic experiment where the temporal degree of freedom of photons is the quantum system of interest, while their polarization acts as the environment. Employing a fully black-box approach, we achieve the violation of a Bell inequality, thus certifying the non-objectivity of the underlying quantum dynamics in a fully device-independent framework.

quant-ph↗

arXiv2022

Witnessing Non-Classicality in a Simple Causal Structure with Three Observable Variables

Seen from the modern lens of causal inference, Bell's theorem is nothing else than the proof that a specific classical causal model cannot explain quantum correlations. It is thus natural to move beyond Bell's paradigmatic scenario and consider different causal structures. For the specific case of three observable variables, it is known that there are three non-trivial causal networks. Two of those, are known to give rise to quantum non-classicality: the instrumental and the triangle scenarios. Here we analyze the third and remaining one, which we name the Evans scenario, akin to the causal structure underlying the entanglement-swapping experiment. We prove a number of results about this elusive scenario and introduce new and efficient computational tools for its analysis that also can be adapted to deal with more general causal structures. We do not solve its main open problem -- whether quantum non-classical correlations can arise from it -- but give a significant step in this direction by proving that post-quantum correlations, analogous to the paradigmatic Popescu-Rohrlich box, do violate the constraints imposed by a classical description of Evans causal structure.

quant-ph↗

arXiv2022

Quantifying Quantum Causal Influences

Causal influences are at the core of any empirical science, the reason why its quantification is of paramount relevance for the mathematical theory of causality and applications. Quantum correlations, however, challenge our notion of cause and effect, implying that tools and concepts developed over the years having in mind a classical world, have to be reevaluated in the presence of quantum effects. Here, we propose the quantum version of the most common causality quantifier, the average causal effect (ACE), measuring how much a target quantum system is changed by interventions on its presumed cause. Not only it offers an innate manner to quantify causation in two-qubit gates but also in alternative quantum computation models such as the measurement-based version, suggesting that causality can be used as a proxy for optimizing quantum algorithms. Considering quantum teleportation, we show that any pure entangled state offers an advantage in terms of causal effects as compared to separable states. This broadness of different uses showcases that, just as in the classical case, the quantification of causal influence has foundational and applied consequences and can lead to a yet totally unexplored tool for quantum information science.

quant-ph↗

arXiv2022

Quantum Finance: a tutorial on quantum computing applied to the financial market

Previously only considered a frontier area of Physics, nowadays quantum computing is one of the fastest growing research field, precisely because of its technological applications in optimization problems, machine learning, information security and simulations. The goal of this article is to introduce the fundamentals of quantum computing, focusing on a promising quantum algorithm and its application to a financial market problem. More specifically, we discuss the portfolio optimization problem using the \textit{Quantum Approximate Optimization Algorithm} (QAOA). We not only describe the main concepts involved but also consider simple practical examples, involving financial assets available on the Brazilian stock exchange, with codes, both classic and quantum, freely available as a Jupyter Notebook. We also analyze in details the quality of the combinatorial portfolio optimization solutions through QAOA using SENAI/CIMATEC's ATOS QLM quantum simulator.

q-fin.PM↗

arXiv2022

Events in quantum mechanics are maximally non-absolute

The notorious quantum measurement problem brings out the difficulty to reconcile two quantum postulates: the unitary evolution of closed quantum systems and the wave-function collapse after a measurement. This problematics is particularly highlighted in the Wigner's friend thought experiment, where the mismatch between unitary evolution and measurement collapse leads to conflicting quantum descriptions for different observers. A recent no-go theorem has established that the (quantum) statistics arising from an extended Wigner's friend scenario is incompatible when one try to hold together three innocuous assumptions, namely no-superdeterminism, parameter independence and absoluteness of observed events. Building on this extended scenario, we introduce two novel measures of non-absoluteness of events. The first is based on the EPR2 decomposition, and the second involves the relaxation of the absoluteness hypothesis assumed in the aforementioned no-go theorem. To prove that quantum correlations can be maximally non-absolute according to both quantifiers, we show that chained Bell inequalities (and relaxations thereof) are also valid constraints for Wigner's experiment.

quant-ph↗

arXiv2021

Enhancing entanglement and total correlations dynamics via local unitaries

The interaction with the environment is one of the main obstacles to be circumvented in practical implementations of quantum information tasks. The use of local unitaries, while not changing the initial entanglement present in a given state, can enormously change its dynamics through a noisy channel, and consequently its ability to be used as a resource. This way, local unitaries provide an easy and accessible way to enhance quantum correlations in a variety of different experimental platforms. Given an initial entangled state and a certain noisy channel, what are the local unitaries providing the most robust dynamics? In this paper we solve this question considering two qubits states, together with paradigmatic and relevant noisy channels, showing its consequences for teleportation protocols and identifying cases where the most robust states are not necessarily the ones imprinting the least information about themselves into the environment. We also derive a general law relating the interplay between the total correlations in the system and environment with their mutual information built up over the noisy dynamics. Finally, we employ the IBM Quantum Experience to provide a proof-of-principle experimental implementation of our results.

quant-ph↗

arXiv2021

Quantum communication complexity beyond Bell nonlocality

Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be minimised -- a key motivation behind the communication complexity problem (CCP). Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. Furthermore, the connection between quantum CCPs and nonlocality provides an information-theoretic insights into fundamental quantum mechanics. Here we connect quantum CCPs with a generalised nonlocality framework -- beyond the paradigmatic Bell's theorem -- by incorporating the underlying causal structure, which governs the distributed task, into a so-called nonlocal hidden variable model. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities, whose violation is both necessary and sufficient for a quantum gain. We experimentally implement a multipartite CCP akin to the guess-your-neighbour-input scenario, and demonstrate a quantum advantage when multipartite Greenberger-Horne-Zeilinger (GHZ) states are shared among three users.

quant-ph↗

arXiv2021

Semi-device-independent certification of entanglement in superdense coding

Superdense coding is a paradigmatic protocol in quantum information science, employing a quantum communication channel to send classical information more efficiently. As we show here, it can be understood as a particular case of a prepare and measure experiment, a scenario that has attracted growing attention for its fundamental and practical applications. Formulating superdense coding as a prepare and measure scenario allows us to provide a semi-device-independent witness of entanglement that significantly improves over previous tests. Furthermore, we also show how to adapt our results into self-testing of maximally entangled states and also provide a semidefinite program formulation allowing to efficiently optimize, for any shared quantum state, the probability of success in the superdense coding protocol.

quant-ph↗

arXiv2021

General Method for Classicality Certification in the Prepare and Measure Scenario

Preparation and measurement of physical systems are the operational building blocks of any physical experiment, and to describe them is the first purpose of any physical theory. It is remarkable that, in some situations, even when only preparation and measurement devices of a single system are present and they are uncharacterized, it is possible to distinguish between the behaviours of quantum and classical systems relying only on observational data. Certifying the physical origin of measurement statistics in the prepare and measure scenario is of primal importance for developing quantum networks, distributing quantum keys and certifying randomness, to mention a few applications, but, surprisingly, no general methods to do so are known. We progress on this problem by crafting a general, sufficient condition to certify that a given set of preparations can only generate classical statistics, for any number of generalized measurements. As an application, we employ the method to demonstrate non-classicality activation in the prepare and measure scenario, also considering its application in random access codes. Following that, we adapt our method to certify, again through a sufficient condition, whether a given set of measurements can never give rise to non-classical behaviors, irrespective of what preparations they may act upon. This, in turn, allows us to find a large set of incompatible measurements that cannot be used to demonstrate non-classicality, thus showing incompatibility is not sufficient for non-classicality in the prepare and measure scenario.

quant-ph↗

arXiv2020

Multistage games and Bell scenarios with communication

Bell nonlocality is a cornerstone of quantum theory with applications in information processing ranging from cryptography to distributed computing and game theory. Indeed, it is known that Bell's theorem can be formally linked to Bayesian games, allowing the use of nonlocal correlations to advise players and thereby achieve new points of equilibrium that are unavailable classically. Here we generalize this link, proving the connection between multistage games of incomplete information with Bell scenarios involving the communication of measurement outcomes between the parties. We apply the general framework for a few cases of interest and analyze the equilibrium reached by quantum nonlocal correlations.

quant-ph↗

arXiv2020

Semidefinite tests for quantum network topologies

Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing. Generally, these protocols involve many independent sources sharing entanglement among distant parties that, upon measuring their systems, generate correlations across the network. The question of which correlations a given quantum network can give rise to, remains almost uncharted. Here we show that constraints on the observable covariances, previously derived for the classical case, also hold for quantum networks. The network topology yields tests that can be cast as semidefinite programs, thus allowing for the efficient characterization of the correlations in a wide class of quantum networks, as well as systematic derivations of device-independent and experimentally testable witnesses. We obtain such semidefinite tests for fixed measurement settings, as well as parties that independently choose among collections of measurement settings. The applicability of the method is demonstrated for various networks, and compared with previous approaches.

quant-ph↗