Searcharxiv⌕ Search

arXiv subjects

Fernando G. S. L. Brandao

Publications and source records attributed to Fernando G. S. L. Brandao.

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

Deconstruction and conditional erasure of quantum correlations

We define the deconstruction cost of a tripartite quantum state on systems $ABE$ as the minimum rate of noise needed to apply to the $AE$ systems, such that there is negligible disturbance to the marginal state on the $BE$ systems, while the system $A$ of the resulting state is locally recoverable from the $E$ system alone. We refer to such actions as deconstruction operations and protocols implementing them as state deconstruction protocols. State deconstruction generalizes Landauer erasure of a single-party quantum state as well the erasure of correlations of a two-party quantum state. We find that the deconstruction cost of a tripartite quantum state on systems $ABE$ is equal to its conditional quantum mutual information (CQMI) $I(A;B|E)$, thus giving the CQMI an operational interpretation in terms of a state deconstruction protocol. We also define a related task called conditional erasure, in which the goal is to apply noise to systems $AE$ in order to decouple system $A$ from systems $BE$, while causing negligible disturbance to the marginal state of systems $BE$. We find that the optimal rate of noise for conditional erasure is also equal to the CQMI $I(A;B|E)$. State deconstruction and conditional erasure lead to operational interpretations of the quantum discord and squashed entanglement, which are quantum correlation measures based on the CQMI. We find that the quantum discord is equal to the cost of simulating einselection, the process by which a quantum system interacts with an environment, resulting in selective loss of information in the system. The squashed entanglement is equal to half the minimum rate of noise needed for deconstruction/conditional erasure if Alice has available the best possible system $E$ to help in the deconstruction/conditional erasure task.

quant-ph↗
arXiv2018

Conditional Decoupling of Quantum Information

Insights from quantum information theory show that correlation measures based on quantum entropy are fundamental tools that reveal the entanglement structure of multipartite states. In that spirit, Groisman, Popescu, and Winter [Physical Review A 72, 032317 (2005)] showed that the quantum mutual information $I(A;B)$ quantifies the minimal rate of noise needed to erase the correlations in a bipartite state of quantum systems $AB$. Here, we investigate correlations in tripartite systems $ABE$. In particular, we are interested in the minimal rate of noise needed to apply to the systems $AE$ in order to erase the correlations between $A$ and $B$ given the information in system $E$, in such a way that there is only negligible disturbance on the marginal $BE$. We present two such models of conditional decoupling, called deconstruction and conditional erasure cost of tripartite states $ABE$. Our main result is that both are equal to the conditional quantum mutual information $I(A;B|E)$ -- establishing it as an operational measure for tripartite quantum correlations.

quant-ph↗
arXiv2018

Quantum Error Correcting Codes in Eigenstates of Translation-Invariant Spin Chains

Quantum error correction was invented to allow for fault-tolerant quantum computation. Systems with topological order turned out to give a natural physical realization of quantum error correcting codes (QECC) in their groundspaces. More recently, in the context of the AdS/CFT correspondence, it has been argued that eigenstates of CFTs with a holographic dual should also form QECCs. These two examples raise the question of how generally eigenstates of many-body models form quantum codes. In this work we establish new connections between quantum chaos and translation-invariance in many-body spin systems, on one hand, and approximate quantum error correcting codes (AQECC), on the other hand. We first observe that quantum chaotic systems exhibiting the Eigenstate Thermalization Hypothesis (ETH) have eigenstates forming approximate quantum error-correcting codes. Then we show that AQECC can be obtained probabilistically from translation-invariant energy eigenstates of every translation-invariant spin chain, including integrable models. Applying this result to 1D classical systems, we describe a method for using local symmetries to construct parent Hamiltonians that embed these codes into the low-energy subspace of gapless 1D quantum spin chains. As explicit examples we obtain local AQECC in the ground space of the 1D ferromagnetic Heisenberg model and the Motzkin spin chain model with periodic boundary conditions, thereby yielding non-stabilizer codes in the ground space and low energy subspace of physically plausible 1D gapless models.

quant-ph↗
arXiv2017

Quantum Speed-ups for Semidefinite Programming

We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time $n^{\frac{1}{2}} m^{\frac{1}{2}} s^2 \text{poly}(\log(n), \log(m), R, r, 1/δ)$, with $n$ and $s$ the dimension and row-sparsity of the input matrices, respectively, $m$ the number of constraints, $δ$ the accuracy of the solution, and $R, r$ a upper bounds on the size of the optimal primal and dual solutions. This gives a square-root unconditional speed-up over any classical method for solving SDPs both in $n$ and $m$. We prove the algorithm cannot be substantially improved (in terms of $n$ and $m$) giving a $Ω(n^{\frac{1}{2}}+m^{\frac{1}{2}})$ quantum lower bound for solving semidefinite programs with constant $s, R, r$ and $δ$. The quantum algorithm is constructed by a combination of quantum Gibbs sampling and the multiplicative weight method. In particular it is based on a classical algorithm of Arora and Kale for approximately solving SDPs. We present a modification of their algorithm to eliminate the need for solving an inner linear program which may be of independent interest.

quant-ph↗
arXiv2017

Thermalization and Return to Equilibrium on Finite Quantum Lattice Systems

Thermal states are the bedrock of statistical physics. Nevertheless, when and how they actually arise in closed quantum systems is not fully understood. We consider this question for systems with local Hamiltonians on finite quantum lattices. In a first step, we show that states with exponentially decaying correlations equilibrate after a quantum quench. Then we show that the equilibrium state is locally equivalent to a thermal state, provided that the free energy of the equilibrium state is sufficiently small and the thermal state has exponentially decaying correlations. As an application, we look at a related important question: When are thermal states stable against noise? In other words, if we locally disturb a closed quantum system in a thermal state, will it return to thermal equilibrium? We rigorously show that this occurs when the correlations in the thermal state are exponentially decaying. All our results come with finite-size bounds, which are crucial for the growing field of quantum thermodynamics and other physical applications.

quant-ph↗
arXiv2016

Quantum Gibbs Samplers: the commuting case

We analyze the problem of preparing quantum Gibbs states of lattice spin Hamiltonians with local and commuting terms on a quantum computer and in nature. Our central result is an equivalence between the behavior of correlations in the Gibbs state and the mixing time of the semigroup which drives the system to thermal equilibrium (the Gibbs sampler). We introduce a framework for analyzing the correlation and mixing characteristics of quantum Gibbs states and quantum Gibbs samplers, which is rooted in the theory of non-commutative Lp spaces. We consider two distinct classes of Gibbs samplers, one of which being the well-studied Davies generators modelling the dynamics on the system due to weak-coupling with a large Markovian environment. We show that their gap is independent of system size if, and only if, a certain strong form of clustering of correlations holds in the Gibbs state. As concrete applications of our formalism, we show that for every one-dimensional lattice system, or for systems in lattices of any dimension at high enough temperatures, the Gibbs samplers of commuting Hamiltonians are always gapped, giving an efficient way of preparing these states on a quantum computer.

quant-ph↗
arXiv2016

Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution

We give two strengthenings of an inequality for the quantum conditional mutual information of a tripartite quantum state recently proved by Fawzi and Renner, connecting it with the ability to reconstruct the state from its bipartite reductions. Namely we show that the conditional mutual information is an upper bound on the regularised relative entropy distance between the quantum state and its reconstructed version. It is also an upper bound for the measured relative entropy distance of the state to its reconstructed version. The main ingredient of the proof is the fact that the conditional mutual information is the optimal quantum communication rate in the task of state redistribution.

quant-ph↗
arXiv2016

Efficient Quantum Pseudorandomness

Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum systems, but in many case pseudorandom operations can emulate certain properties of truly random ones. Indeed in the classical realm there is by now a well-developed theory of such pseudorandom operations. However the construction of such objects turns out to be much harder in the quantum case. Here we show that random quantum circuits are a powerful source of quantum pseudorandomness. This gives the for the first time a polynomialtime construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography and to understanding self-equilibration of closed quantum dynamics.

quant-ph↗
arXiv2016

The Mathematics of Entanglement

These notes are from a series of lectures given at the Universidad de Los Andes in Bogotá, Colombia on some topics of current interest in quantum information. While they aim to be self-contained, they are necessarily incomplete and idiosyncratic in their coverage. For a more thorough introduction to the subject, we recommend one of the textbooks by Nielsen and Chuang or by Wilde, or the lecture notes of Mermin, Preskill or Watrous. Our notes by contrast are meant to be a relatively rapid introduction into some more contemporary topics in this fast-moving field. They are meant to be accessible to advanced undergraduates or starting graduate students.

quant-ph↗
arXiv2015

Estimating operator norms using covering nets

We present several polynomial- and quasipolynomial-time approximation schemes for a large class of generalized operator norms. Special cases include the $2\rightarrow q$ norm of matrices for $q>2$, the support function of the set of separable quantum states, finding the least noisy output of entanglement-breaking quantum channels, and approximating the injective tensor norm for a map between two Banach spaces whose factorization norm through $\ell_1^n$ is bounded. These reproduce and in some cases improve upon the performance of previous algorithms by Brandão-Christandl-Yard and followup work, which were based on the Sum-of-Squares hierarchy and whose analysis used techniques from quantum information such as the monogamy principle of entanglement. Our algorithms, by contrast, are based on brute force enumeration over carefully chosen covering nets. These have the advantage of using less memory, having much simpler proofs and giving new geometric insights into the problem. Net-based algorithms for similar problems were also presented by Shi-Wu and Barak-Kelner-Steurer, but in each case with a run-time that is exponential in the rank of some matrix. We achieve polynomial or quasipolynomial runtimes by using the much smaller nets that exist in $\ell_1$ spaces. This principle has been used in learning theory, where it is known as Maurey's empirical method.

quant-ph↗
arXiv2015

Generic emergence of classical features in quantum Darwinism

Quantum Darwinism explains the emergence of classical reality from the underlying quantum reality by the fact that a quantum system is observed indirectly, by looking at parts of its environment, so that only specific information about the system that is redundantly proliferated to many parts of the environment becomes accessible and objective. However it is not clear under what conditions this mechanism holds true. Here we rigorously prove that the emergence of classicality is a general feature of any quantum dynamics: observers who acquire information about a quantum system indirectly have access at most to classical information about one and the same measurement of the quantum system; moreover, if such information is available to many observers, they necessarily agree. Remarkably, our analysis goes beyond the system-environment categorization. We also provide a full characterization of the so-called quantum discord in terms of local redistribution of correlations.

quant-ph↗
arXiv2015

Entanglement area law from specific heat capacity

We study the scaling of entanglement in low-energy states of quantum many-body models on lattices of arbitrary dimensions. We allow for unbounded Hamiltonians such that systems with bosonic degrees of freedom are included. We show that if at low enough temperatures the specific heat capacity of the model decays exponentially with inverse temperature, the entanglement in every low-energy state satisfies an area law (with a logarithmic correction). This behaviour of the heat capacity is typically observed in gapped systems. Assuming merely that the low-temperature specific heat decays polynomially with temperature, we find a subvolume scaling of entanglement. Our results give experimentally verifiable conditions for area laws, show that they are a generic property of low-energy states of matter, and, to the best of our knowledge, constitute the first proof of an area law for unbounded Hamiltonians beyond those that are integrable.

quant-ph↗
arXiv2015

Robust Device-Independent Randomness Amplification with Few Devices

Randomness amplification is the task of transforming a source of somewhat random bits into a source of fully random bits. Although it is impossible to amplify randomness from a single source by classical means, the situation is different considering non-local correlations allowed by quantum mechanics. Here we give the first device-independent protocol for randomness amplification using a constant number of devices. The protocol involves four devices, can amplify any non-deterministic source into a fully random source, tolerates a constant rate of error, and has its correctness based solely on the assumption of no-signaling between the devices. In contrast all previous protocols either required an unbounded number of devices, or could only amplify sources sufficiently close to fully random.

quant-ph↗
arXiv2015

Equivalence of Statistical Mechanical Ensembles for Non-Critical Quantum Systems

We consider the problem of whether the canonical and microcanonical ensembles are locally equivalent for short-ranged quantum Hamiltonians of $N$ spins arranged on a $d$-dimensional lattices. For any temperature for which the system has a finite correlation length, we prove that the canonical and microcanonical state are approximately equal on regions containing up to $O(N^{1/(d+1)})$ spins. The proof rests on a variant of the Berry--Esseen theorem for quantum lattice systems and ideas from quantum information theory.

quant-ph↗
arXiv2015

Exponential Decay of Correlations Implies Area Law

We prove that a finite correlation length, i.e. exponential decay of correlations, implies an area law for the entanglement entropy of quantum states defined on a line. The entropy bound is exponential in the correlation length of the state, thus reproducing as a particular case Hastings proof of an area law for groundstates of 1D gapped Hamiltonians. As a consequence, we show that 1D quantum states with exponential decay of correlations have an efficient classical approximate description as a matrix product state of polynomial bond dimension, thus giving an equivalence between injective matrix product states and states with a finite correlation length. The result can be seen as a rigorous justification, in one dimension, of the intuition that states with exponential decay of correlations, usually associated with non-critical phases of matter, are simple to describe. It also has implications for quantum computing: It shows that unless a pure state quantum computation involves states with long-range correlations, decaying at most algebraically with the distance, it can be efficiently simulated classically. The proof relies on several previous tools from quantum information theory - including entanglement distillation protocols achieving the hashing bound, properties of single-shot smooth entropies, and the quantum substate theorem - and also on some newly developed ones. In particular we derive a new bound on correlations established by local random measurements, and we give a generalization to the max-entropy of a result of Hastings concerning the saturation of mutual information in multiparticle systems. The proof can also be interpreted as providing a limitation on the phenomenon of data hiding in quantum states.

quant-ph↗
arXiv2014

The second laws of quantum thermodynamics

The second law of thermodynamics tells us which state transformations are so statistically unlikely that they are effectively forbidden. Its original formulation, due to Clausius, states that "Heat can never pass from a colder to a warmer body without some other change, connected therewith, occurring at the same time". The second law applies to systems composed of many particles interacting; however, we are seeing that one can make sense of thermodynamics in the regime where we only have a small number of particles interacting with a heat bath. Is there a second law of thermodynamics in this regime? Here, we find that for processes which are cyclic or very close to cyclic, the second law for microscopic systems takes on a very different form than it does at the macroscopic scale, imposing not just one constraint on what state transformations are possible, but an entire family of constraints. In particular, we find a family of free energies which generalise the traditional one, and show that they can never increase. We further find that there are three regimes which determine which family of second laws govern state transitions, depending on how cyclic the process is. In one regime one can cause an apparent violation of the usual second law, through a process of embezzling work from a large system which remains arbitrarily close to its original state. These second laws are not only relevant for small systems, but also apply to individual macroscopic systems interacting via long-range interactions, which only satisfy the ordinary second law on average. By making precise the definition of thermal operations, the laws of thermodynamics take on a simple form with the first law defining the class of thermal operations, the zeroeth law emerging as a unique condition ensuring the theory is nontrivial, and the remaining laws being a monotonicity property of our generalised free energies.

quant-ph↗
arXiv2014

Quantum de Finetti Theorems under Local Measurements with Applications

Quantum de Finetti theorems are a useful tool in the study of correlations in quantum multipartite states. In this paper we prove two new quantum de Finetti theorems, both showing that under tests formed by local measurements one can get a much improved error dependence on the dimension of the subsystems. We also obtain similar results for non-signaling probability distributions. We give the following applications of the results: We prove the optimality of the Chen-Drucker protocol for 3-SAT, under the exponential time hypothesis. We show that the maximum winning probability of free games can be estimated in polynomial time by linear programming. We also show that 3-SAT with m variables can be reduced to obtaining a constant error approximation of the maximum winning probability under entangled strategies of O(m^{1/2})-player one-round non-local games, in which the players communicate O(m^{1/2}) bits all together. We show that the optimization of certain polynomials over the hypersphere can be performed in quasipolynomial time in the number of variables n by considering O(log(n)) rounds of the Sum-of-Squares (Parrilo/Lasserre) hierarchy of semidefinite programs. As an application to entanglement theory, we find a quasipolynomial-time algorithm for deciding multipartite separability. We consider a result due to Aaronson -- showing that given an unknown n qubit state one can perform tomography that works well for most observables by measuring only O(n) independent and identically distributed (i.i.d.) copies of the state -- and relax the assumption of having i.i.d copies of the state to merely the ability to select subsystems at random from a quantum multipartite state. The proofs of the new quantum de Finetti theorems are based on information theory, in particular on the chain rule of mutual information.

quant-ph↗