Abstract: Protected qubits such as the 0−π qubit, and bosonic qubits including cat qubits and Gottesman-Kitaev-Preskill (GKP) qubits offer advantages for fault tolerance. Some of these protected qubits (e.g., 0−π qubit and Kerr-cat qubit) are stabilized by Hamiltonians which have (near-)degenerate ground state manifolds with large energy gaps to the excited state manifolds. Without dissipative stabilization mechanisms the performance of such energy-gap-protected qubits can be limited by leakage to excited states. Here, we propose a scheme for dissipatively stabilizing an energy-gap-protected qubit using colored (i.e., frequency-selective) dissipation without inducing errors in the ground state manifold. Concretely we apply our colored dissipation technique to Kerr-cat qubits and propose colored Kerr-cat qubits which are protected by an engineered colored single-photon loss. When applied to the Kerr-cat qubits our scheme significantly suppresses leakage-induced bit-flip errors (which we show are a limiting error mechanism) while only using linear interactions. Beyond the benefits to the Kerr-cat qubit we also show that our frequency-selective loss technique can be applied to a broader class of protected qubits.

Publication: Physical Review Letters Vol.: 128 No.: 11 ISSN: 0031-9007

ID: CaltechAUTHORS:20210922-210830647

]]>

Abstract: Protected qubits such as the 0−π qubit, and bosonic qubits including cat qubits and Gottesman-Kitaev-Preskill (GKP) qubits offer advantages for fault tolerance. Some of these protected qubits (e.g., 0−π qubit and Kerr-cat qubit) are stabilized by Hamiltonians which have (near-)degenerate ground state manifolds with large energy gaps to the excited state manifolds. Without dissipative stabilization mechanisms the performance of such energy-gap-protected qubits can be limited by leakage to excited states. Here, we propose a scheme for dissipatively stabilizing an energy-gap-protected qubit using colored (i.e., frequency-selective) dissipation without inducing errors in the ground state manifold. Concretely we apply our colored dissipation technique to Kerr-cat qubits and propose colored Kerr-cat qubits which are protected by an engineered colored single-photon loss. When applied to the Kerr-cat qubits our scheme significantly suppresses leakage-induced bit-flip errors (which we show are a limiting error mechanism) while only using linear interactions. Beyond the benefits to the Kerr-cat qubit we also show that our frequency-selective loss technique can be applied to a broader class of protected qubits.

Publication: Physical Review Letters Vol.: 128 No.: 11 ISSN: 0031-9007

ID: CaltechAUTHORS:20220315-626393000

]]>

Abstract: Valiant-Vazirani showed in 1985 [45] that solving NP with the promise that "yes" instances have only one witness is powerful enough to solve the entire NP class (under randomized reductions). We are interested in extending this result to the quantum setting. We prove extensions to the classes Merlin-Arthur MA and Quantum-Classical-Merlin-Arthur QCMA [7]. Our results have implications for the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomialinverse polynomial spectral gap. We show that the estimation (to within polynomial accuracy) of the ground state energy of poly-gapped 1-D local Hamiltonians is QCMA-hard, under randomized reductions. This is in stark contrast to the case of constant gapped 1-D Hamiltonians, which is in NP [24]. Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian that allows efficient calculation of expectation values. Finally, we discuss a few of the obstacles to the establishment of an analogous result to the class Quantum-Merlin-Arthur (QMA). In particular, we show that random projections fail to provide a polynomial gap between two witnesses.

Publication: Quantum Vol.: 6ISSN: 2521-327X

ID: CaltechAUTHORS:20160527-123057985

]]>

Abstract: Stabilized cat qubits that possess biased noise channel with bit-flip errors exponentially smaller than phase-flip errors. Together with a set of bias-preserving (BP) gates, cat qubits are a promising candidate for realizing hardware efficient quantum error correction and fault-tolerant quantum computing. Compared to dissipatively stabilized cat qubits, the Kerr cat qubits can in principle support faster gate operations with higher gate fidelity, benefiting from the large energy gap that protects the code space. However, the leakage of the Kerr cats can increase the minor type of errors and compromise the noise bias. Both the fast implementation of gates and the interaction with environment can lead to such detrimental leakage if no sophisticated controls are applied. In this work, we introduce new fine-control techniques to overcome the above obstacles for Kerr cat qubits. To suppress the gate leakage, we use the derivative-based transition suppression technique to design derivative-based controls for the Kerr BP gates. We show that the fine-controlled gates can simultaneously have high gate fidelity and high noise bias and when applied to concatenated quantum error correction, can not only improve the logical error rate but also reduce resource overhead. To suppress the environment-induced leakage, we introduce colored single-photon dissipation, which can continuously cool the Kerr cats and suppress the minor errors while not enhancing the major errors.

No.: 12015
ID: CaltechAUTHORS:20220307-189714000

]]>

Abstract: We consider quantum circuits consisting of randomly chosen two-local gates and study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anticoncentrated, roughly meaning that the probability mass is not too concentrated on a small number of measurement outcomes. An understanding of the conditions for anticoncentration is important for determining which quantum circuits are difficult to simulate classically, as anticoncentration has been in some cases an ingredient of mathematical arguments that simulation is hard and in other cases a necessary condition for easy simulation. Our definition of anticoncentration is that the expected collision probability of the distribution—that is, the probability that two independently drawn outcomes will agree—is only a constant factor larger than the collision probability for the uniform distribution. We show that when the two-local gates are each drawn from the Haar measure (or any 2-design), at least Ω(n log(n)) gates (and thus Ω(log(n)) circuit depth) are needed for this condition to be met on an n-qudit circuit. In both the case where the gates are nearest neighbor on a one-dimensional ring and the case where gates are long range, we show that O(n log(n)) gates are also sufficient and we precisely compute the optimal constant prefactor for the n log(n). The technique we employ relies upon a mapping from the expected collision probability to the partition function of an Ising-like classical statistical-mechanical model, which we manage to bound using stochastic and combinatorial techniques.

Publication: PRX Quantum Vol.: 3 No.: 1 ISSN: 2691-3399

ID: CaltechAUTHORS:20210511-131126866

]]>

Abstract: We present a comprehensive architectural analysis for a proposed fault-tolerant quantum computer based on cat codes concatenated with outer quantum error-correcting codes. For the physical hardware, we propose a system of acoustic resonators coupled to superconducting circuits with a two-dimensional layout. Using estimated physical parameters for the hardware, we perform a detailed error analysis of measurements and gates, including cnot and Toffoli gates. Having built a realistic noise model, we numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. Our next step toward universal fault-tolerant quantum computation is a protocol for fault-tolerant Toffoli magic state preparation that significantly improves upon the fidelity of physical Toffoli gates at very low qubit cost. To achieve even lower overheads, we devise a new magic state distillation protocol for Toffoli states. Combining these results together, we obtain realistic full-resource estimates of the physical error rates and overheads needed to run useful fault-tolerant quantum algorithms. We find that with around 1000 superconducting circuit components, one could construct a fault-tolerant quantum computer that can run circuits, which are currently intractable for classical computers. Hardware with 18 000 superconducting circuit components, in turn, could simulate the Hubbard model in a regime beyond the reach of classical computing.

Publication: PRX Quantum Vol.: 3 No.: 1 ISSN: 2691-3399

ID: CaltechAUTHORS:20201209-172305164

]]>

Abstract: Stabilized cat codes can provide a biased noise channel with a set of bias-preserving (BP) gates, which can significantly reduce the resource overhead for fault-tolerant quantum computing. All existing schemes of BP gates, however, require adiabatic quantum evolution, with performance limited by excitation loss and nonadiabatic errors during the adiabatic gates. In this paper, we apply a derivative-based leakage-suppression technique to overcome nonadiabatic errors, so that we can implement fast BP gates on Kerr-cat qubits with improved gate fidelity while maintaining high noise bias. When applied to concatenated quantum error correction, the fast BP gates not only can improve the logical error rate but also can reduce resource overhead, which enables more efficient implementation of fault-tolerant quantum computing.

Publication: Physical Review Research Vol.: 4 No.: 1 ISSN: 2643-1564

ID: CaltechAUTHORS:20211217-233248077

]]>

Abstract: We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. This class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum Gibbs sampling and matrix exponent updates. A de-quantization of the algorithm also leads to a faster classical solver. For generic instances, our quantum solver gives a nearly quadratic speedup over state-of-the-art algorithms. Such instances include approximating the ground state of spin glasses and MaxCut on Erdös-Rényi graphs. We also provide an efficient randomized rounding procedure that converts approximately optimal SDP solutions into approximations of the original quadratic optimization problem.

Publication: Quantum Vol.: 6ISSN: 2521-327X

ID: CaltechAUTHORS:20190912-075203295

]]>

Abstract: Fault-tolerant quantum error correction is essential for implementing quantum algorithms of significant practical importance. In this work, we propose a highly effective use of the surface Gottesman-Kitaev-Preskill (GKP) code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-level qubits. In our proposal, we use error-corrected two-qubit gates between GKP qubits and introduce a maximum-likelihood decoding strategy for correcting shift errors in the two-GKP-qubit gates. Our proposed decoding reduces the total CNOT failure rate of the GKP qubits, e.g., from 0.87% to 0.36% at a GKP squeezing of 12 dB, compared to the case where the simple closest-integer decoding is used. Then, by concatenating the GKP code with the surface code, we find that the threshold GKP squeezing is given by 9.9 dB under the the assumption that finite squeezing of the GKP states is the dominant noise source. More importantly, we show that a low logical failure rate p_L < 10⁻⁷ can be achieved with moderate hardware requirements, e.g., 291 modes and 97 qubits at a GKP squeezing of 12 dB as opposed to 1457 bare qubits for the standard rotated surface code at an equivalent noise level (i.e., p=0.36%). Such a low failure rate of our surface-GKP code is possible through the use of space-time correlated edges in the matching graphs of the surface-code decoder. Further, all edge weights in the matching graphs are computed dynamically based on analog information from the GKP error correction using the full history of all syndrome measurement rounds. We also show that a highly squeezed GKP state of GKP squeezing ≳12 dB can be experimentally realized by using a dissipative stabilization method, namely, the big-small-big method, with fairly conservative experimental parameters. Lastly, we introduce a three-level ancilla scheme to mitigate ancilla decay errors during a GKP state preparation.

Publication: PRX Quantum Vol.: 3 No.: 1 ISSN: 2691-3399

ID: CaltechAUTHORS:20210511-130157842

]]>

Abstract: The Eigenstate Thermalization Hypothesis (ETH) has played a major role in explaining thermodynamic phenomena in quantum systems. However, so far, no connection has been known between ETH and the timescale of thermalization. In this paper, we rigorously show that ETH indeed implies fast thermalization to the global Gibbs state. We show fast convergence for two models of thermalization. In the first, the system is weakly coupled to a bath of (quasi)-free Fermions that we control. We derive a finitely-resolved version of Davies' generator, with explicit error bounds and resource estimates, that describes the joint evolution at finite times. The second is Quantum Metropolis Sampling, a quantum algorithm for preparing Gibbs states on a quantum computer. In both cases, no guarantee for fast convergence was previously known for non-commuting Hamiltonians, partly due to technical issues with a finite energy resolution. The critical feature of ETH we exploit is that the Hamiltonian can be modeled by random matrix theory below a sufficiently small energy scale. We show this gives quantum expander at nearby eigenstates of the Hamiltonian. This then implies fast convergence to the global Gibbs state by mapping the problem to a one-dimensional classical random walk on the spectrum of the Hamiltonian. Our results explain finite-time thermalization in chaotic open quantum systems and suggest an alternative formulation of ETH in terms of quantum expanders, which we confirm numerically for small systems.

Publication: arXiv
ID: CaltechAUTHORS:20220202-191908990

]]>

Abstract: For quantum spin systems in any spatial dimension with a local, translation-invariant Hamiltonian, we prove that asymptotic state convertibility from a quantum state to another one by a thermodynamically feasible class of quantum dynamics, called thermal operations, is completely characterized by the Kullback–Leibler (KL) divergence rate, if the state is translation-invariant and spatially ergodic. Our proof consists of two parts and is phrased in terms of a branch of the quantum information theory called the resource theory. First, we prove that any states, for which the min and max Rényi divergences collapse approximately to a single value, can be approximately reversibly converted into one another by thermal operations with the aid of a small source of quantum coherence. Second, we prove that these divergences collapse asymptotically to the KL divergence rate for any translation-invariant ergodic state. We show this via a generalization of the quantum Stein’s lemma for quantum hypothesis testing beyond independent and identically distributed situations. Our result implies that the KL divergence rate serves as a thermodynamic potential that provides a complete characterization of thermodynamic convertibility of ergodic states of quantum many-body systems in the thermodynamic limit, including out-of-equilibrium and fully quantum situations.

Publication: Journal of Physics A: Mathematical and Theoretical Vol.: 54 No.: 49 ISSN: 1751-8113

ID: CaltechAUTHORS:20190801-134551728

]]>

Abstract: We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. We show that, for local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution p_(noisy) of a generic noisy circuit instance and the output distribution pideal of the corresponding noiseless instance shrink exponentially with the expected number of gate-level errors, as F = exp(−2sϵ ± O(sϵ²)), where ϵ is the probability of error per circuit location and s is the number of two-qubit gates. Furthermore, if the noise is incoherent, the output distribution approaches the uniform distribution p_(unif) at precisely the same rate and can be approximated as p_(noisy) ≈ F_(p_(ideal)) + (1−F)p_(unif), that is, local errors are scrambled by the random quantum circuit and contribute only white noise (uniform output). Importantly, we upper bound the total variation error (averaged over random circuit instance) in this approximation as O(Fϵ√s), so the "white-noise approximation" is meaningful when ϵ√s ≪ 1, a quadratically weaker condition than the ϵs≪1 requirement to maintain high fidelity. The bound applies when the circuit size satisfies s ≥ Ω(nlog(n)) and the inverse error rate satisfies ϵ⁻¹ ≥ Ω̃ (n). The white-noise approximation is useful for salvaging the signal from a noisy quantum computation; it was an underlying assumption in complexity-theoretic arguments that low-fidelity random quantum circuits cannot be efficiently sampled classically. Our method is based on a map from second-moment quantities in random quantum circuits to expectation values of certain stochastic processes for which we compute upper and lower bounds.

Publication: arXiv
ID: CaltechAUTHORS:20211213-224949608

]]>

Abstract: Quantum simulation is expected to be one of the key applications of future quantum computers. Product formulas, or Trotterization, are the oldest and, still today, an appealing method for quantum simulation. For an accurate product formula approximation in the spectral norm, the state-of-the-art gate complexity depends on the number of Hamiltonian terms and a certain 1-norm of its local terms. This work studies the concentration aspects of Trotter error: we prove that, typically, the Trotter error exhibits 2-norm (i.e., incoherent) scaling; the current estimate with 1-norm (i.e., coherent) scaling is for the worst cases. For k-local Hamiltonians and higher-order product formulas, we obtain gate count estimates for input states drawn from a 1-design ensemble (e.g., computational basis states). Our gate count depends on the number of Hamiltonian terms but replaces the 1-norm quantity by its analog in 2-norm, giving significant speedup for systems with large connectivity. Our results generalize to Hamiltonians with Fermionic terms and when the input state is drawn from a low-particle number subspace. Further, when the Hamiltonian itself has Gaussian coefficients (e.g., the SYK models), we show the stronger result that the 2-norm behavior persists even for the worst input state. Our main technical tool is a family of simple but versatile inequalities from non-commutative martingales called uniform smoothness. We use them to derive Hypercontractivity, namely p-norm estimates for low-degree polynomials, which implies concentration via Markov's inequality. In terms of optimality, we give examples that simultaneously match our p-norm bounds and the spectral norm bounds. Therefore, our improvement is due to asking a qualitatively different question from the spectral norm bounds. Our results give evidence that product formulas in practice may generically work much better than expected.

Publication: arXiv
ID: CaltechAUTHORS:20211130-215806841

]]>

Abstract: We extend quantum Stein’s lemma in asymmetric quantum hypothesis testing to composite null and alternative hypotheses. As our main result, we show that the asymptotic error exponent for testing convex combinations of quantum states ρ^(⊗n) against convex combinations of quantum states σ^(⊗n) can be written as a regularized quantum relative entropy formula. We prove that in general such a regularization is needed but also discuss various settings where our formula as well as extensions thereof become single-letter. This includes an operational interpretation of the relative entropy of coherence in terms of hypothesis testing. For our proof, we start from the composite Stein’s lemma for classical probability distributions and lift the result to the non-commutative setting by using elementary properties of quantum entropy. Finally, our findings also imply an improved recoverability lower bound on the conditional quantum mutual information in terms of the regularized quantum relative entropy—featuring an explicit and universal recovery map.

Publication: Communications in Mathematical Physics Vol.: 385 No.: 1 ISSN: 0010-3616

ID: CaltechAUTHORS:20190801-134523759

]]>

Abstract: Recent understanding of the thermodynamics of small-scale systems have enabled the characterization of the thermodynamic requirements of implementing quantum processes for fixed input states. Here, we extend these results to construct optimal universal implementations of a given process, that is, implementations that are accurate for any possible input state even after many independent and identically distributed (i.i.d.) repetitions of the process. We find that the optimal work cost rate of such an implementation is given by the thermodynamic capacity of the process, which is a single-letter and additive quantity defined as the maximal difference in relative entropy to the thermal state between the input and the output of the channel. Beyond being a thermodynamic analogue of the reverse Shannon theorem for quantum channels, our results introduce a new notion of quantum typicality and present a thermodynamic application of convex-split methods.

Publication: Communications in Mathematical Physics Vol.: 384 No.: 3 ISSN: 0010-3616

ID: CaltechAUTHORS:20210512-104034146

]]>

Abstract: Chaotic quantum many-body dynamics typically lead to relaxation of local observables. In this process, known as quantum thermalization, a subregion reaches a thermal state due to quantum correlations with the remainder of the system, which acts as an intrinsic bath. While the bath is generally assumed to be unobserved, modern quantum science experiments have the ability to track both subsystem and bath at a microscopic level. Here, by utilizing this ability, we discover that measurement results associated with small subsystems exhibit universal random statistics following chaotic quantum many-body dynamics, a phenomenon beyond the standard paradigm of quantum thermalization. We explain these observations with an ensemble of pure states, defined via correlations with the bath, that dynamically acquires a close to random distribution. Such random ensembles play an important role in quantum information science, associated with quantum supremacy tests and device verification, but typically require highly-engineered, time-dependent control for their preparation. In contrast, our approach uncovers random ensembles naturally emerging from evolution with a time-independent Hamiltonian. As an application of this emergent randomness, we develop a benchmarking protocol which estimates the many-body fidelity during generic chaotic evolution and demonstrate it using our Rydberg quantum simulator. Our work has wide ranging implications for the understanding of quantum many-body chaos and thermalization in terms of emergent randomness and at the same time paves the way for applications of this concept in a much wider context.

Publication: arXiv
ID: CaltechAUTHORS:20210512-104054951

]]>

Abstract: We study whether one can write a Matrix Product Density Operator (MPDO) as the Gibbs state of a quasi-local parent Hamiltonian. We conjecture this is the case for generic MPDO and give supporting evidences. To investigate the locality of the parent Hamiltonian, we take the approach of checking whether the quantum conditional mutual information decays exponentially. The MPDO we consider are constructed from a chain of 1-input/2-output (`Y-shaped') completely-positive maps, i.e. the MPDO have a local purification. We derive an upper bound on the conditional mutual information for bistochastic channels and strictly positive channels, and show that it decays exponentially if the correctable algebra of the channel is trivial. We also introduce a conjecture on a quantum data processing inequality that implies the exponential decay of the conditional mutual information for every Y-shaped channel with trivial correctable algebra. We additionally investigate a close but nonequivalent cousin: MPDO measured in a local basis. We provide sufficient conditions for the exponential decay of the conditional mutual information of the measured states, and numerically confirmed they are generically true for certain random MPDO.

Publication: arXiv
ID: CaltechAUTHORS:20210511-131755023

]]>

Abstract: Quantum state tomography is a powerful, but resource-intensive, general solution for numerous quantum information processing tasks. This motivates the design of robust tomography procedures that use relevant resources as sparingly as possible. Important cost factors include the number of state copies and measurement settings, as well as classical postprocessing time and memory. In this work, we present and analyze an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Classical runtime is also reduced substantially and numerical experiments demonstrate a favorable comparison with other state-of-the-art techniques. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.

Publication: arXiv
ID: CaltechAUTHORS:20210511-142009646

]]>

Abstract: Recall the classical hypothesis testing setting with two sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p ∈ P or from a distribution q ∈ Q and wants to decide from which set the points were sampled. It is known that the optimal exponential rate at which errors decrease can be achieved by a simple maximum-likelihood ratio test which does not depend on p or q, but only on the sets P and Q . We consider an adaptive generalization of this model where the choice of p ∈ P and q ∈ Q can change in each sample in some way that depends arbitrarily on the previous samples. In other words, in the kth round, an adversary, having observed all the previous samples in rounds 1,…,k−1 , chooses p_k ∈ P and q_k ∈ Q , with the goal of confusing the hypothesis test. We prove that even in this case, the optimal exponential error rate can be achieved by a simple maximum-likelihood test that depends only on P and Q. We then show that the adversarial model has applications in hypothesis testing for quantum states using restricted measurements. For example, it can be used to study the problem of distinguishing entangled states from the set of all separable states using only measurements that can be implemented with local operations and classical communication (LOCC). The basic idea is that in our setup, the deleterious effects of entanglement can be simulated by an adaptive classical adversary. We prove a quantum Stein’s Lemma in this setting: In many circumstances, the optimal hypothesis testing rate is equal to an appropriate notion of quantum relative entropy between two states. In particular, our arguments yield an alternate proof of Li and Winter’s recent strengthening of strong subadditivity for von Neumann entropy.

Publication: IEEE Transactions on Information Theory Vol.: 66 No.: 8 ISSN: 0018-9448

ID: CaltechAUTHORS:20200730-074100066

]]>

Abstract: Topological entanglement entropy has been extensively used as an indicator of topologically ordered phases. We study the conditions needed for two-dimensional topologically trivial states to exhibit spurious contributions that contaminate topological entanglement entropy. We show that, if the state at the boundary of a subregion is a stabilizer state, then it has a nonzero spurious contribution to the region if and only if the state is in a nontrivial one-dimensional G₁×G₂ symmetry-protected-topological (SPT) phase under an on-site symmetry. However, we provide a candidate of a boundary state that has a nonzero spurious contribution but does not belong to any such SPT phase.

Publication: Physical Review Research Vol.: 2 No.: 3 ISSN: 2643-1564

ID: CaltechAUTHORS:20200707-115529620

]]>

Abstract: We prove that the quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We demonstrate the exponential decay for short-ranged interacting systems and power-law decay for long-ranged interacting systems. Consequently, we establish the efficiency of quantum Gibbs sampling algorithms, a strong version of the area law, the quasilocality of effective Hamiltonians on subsystems, a clustering theorem for mutual information, and a polynomial-time algorithm for classical Gibbs state simulations.

Publication: Physical Review Letters Vol.: 124 No.: 22 ISSN: 0031-9007

ID: CaltechAUTHORS:20200601-141729048

]]>

Abstract: The accurate computation of Hamiltonian ground, excited and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed in constructing large-scale quantum computers, these tasks should be carried out in a resource-efficient way. In this regard, existing techniques based on phase estimation or variational algorithms display potential disadvantages; phase estimation requires deep circuits with ancillae, that are hard to execute reliably without error correction, while variational algorithms, while flexible with respect to circuit depth, entail additional high-dimensional classical optimization. Here, we introduce the quantum imaginary time evolution and quantum Lanczos algorithms, which are analogues of classical algorithms for finding ground and excited states. Compared with their classical counterparts, they require exponentially less space and time per iteration, and can be implemented without deep circuits and ancillae, or high-dimensional optimization. We furthermore discuss quantum imaginary time evolution as a subroutine to generate Gibbs averages through an analogue of minimally entangled typical thermal states. Finally, we demonstrate the potential of these algorithms via an implementation using exact classical emulation as well as through prototype circuits on the Rigetti quantum virtual machine and Aspen-1 quantum processing unit.

Publication: Nature Physics Vol.: 16 No.: 2 ISSN: 1745-2473

ID: CaltechAUTHORS:20190801-134541389

]]>

Abstract: Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random gates, approximate simulation of typical instances is almost as hard as exact simulation. We prove that this is not the case by exhibiting a shallow circuit family with uniformly random gates that cannot be efficiently classically simulated near-exactly under standard hardness assumptions, but can be simulated approximately for all but a superpolynomially small fraction of circuit instances in time linear in the number of qubits and gates. We furthermore conjecture that sufficiently shallow random circuits are efficiently simulable more generally. To this end, we propose and analyze two simulation algorithms. Implementing one of our algorithms numerically, we give strong evidence that it is efficient both asymptotically and, in some cases, in practice. To argue analytically for efficiency, we reduce the simulation of 2D shallow random circuits to the simulation of a form of 1D dynamics consisting of alternating rounds of random local unitaries and weak measurements -- a type of process that has generally been observed to undergo a phase transition from an efficient-to-simulate regime to an inefficient-to-simulate regime as measurement strength is varied. Using a mapping from quantum circuits to statistical mechanical models, we give evidence that a similar computational phase transition occurs for our algorithms as parameters of the circuit architecture like the local Hilbert space dimension and circuit depth are varied.

Publication: arXiv
ID: CaltechAUTHORS:20210512-104029585

]]>

Abstract: The resource theory of thermal operations, an established model for small-scale thermodynamics, provides an extension of equilibrium thermodynamics to nonequilibrium situations. On a lattice of any dimension with any translation-invariant local Hamiltonian, we identify a large set of translation-invariant states that can be reversibly converted to and from the thermal state with thermal operations and a small amount of coherence. These are the spatially ergodic states, i.e., states that have sharp statistics for any translation-invariant observable, and mixtures of such states with the same thermodynamic potential. As an intermediate result, we show for a general state that if the gap between the min- and the max-relative entropies to the thermal state is small, then the state can be approximately reversibly converted to and from the thermal state with thermal operations and a small source of coherence. Our proof provides a quantum version of the Shannon-McMillan-Breiman theorem for the relative entropy and a quantum Stein’s lemma for ergodic states and local Gibbs states. Our results provide a strong link between the abstract resource theory of thermodynamics and more realistic physical systems as we achieve a robust and operational characterization of the emergence of a thermodynamic potential in translation-invariant lattice systems.

Publication: Physical Review Letters Vol.: 123 No.: 25 ISSN: 0031-9007

ID: CaltechAUTHORS:20190801-134555157

]]>

Abstract: The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the size of the shortest quantum computation that executes the unitary or prepares the state. It is reasonable to expect that the complexity of a quantum state governed by a chaotic many-body Hamiltonian grows linearly with time for a time that is exponential in the system size; however, because it is hard to rule out a short-cut that improves the efficiency of a computation, it is notoriously difficult to derive lower bounds on quantum complexity for particular unitaries or states without making additional assumptions. To go further, one may study more generic models of complexity growth. We provide a rigorous connection between complexity growth and unitary k-designs, ensembles which capture the randomness of the unitary group. This connection allows us to leverage existing results about design growth to draw conclusions about the growth of complexity. We prove that local random quantum circuits generate unitary transformations whose complexity grows linearly for a long time, mirroring the behavior one expects in chaotic quantum systems and verifying conjectures by Brown and Susskind. Moreover, our results apply under a strong definition of quantum complexity based on optimal distinguishing measurements.

Publication: arXiv
ID: CaltechAUTHORS:20210512-095238258

]]>

Abstract: The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2⁵³ (about 10¹⁶). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm.

Publication: Nature Vol.: 574 No.: 7779 ISSN: 0028-0836

ID: CaltechAUTHORS:20191028-155653039

]]>

Abstract: A key feature of ground states of gapped local 1D Hamiltonians is their relatively low entanglement --- they are well approximated by matrix product states (MPS) with bond dimension scaling polynomially in the length N of the chain, while general states require a bond dimension scaling exponentially. We show that the bond dimension of these MPS approximations can be improved to a constant, independent of the chain length, if we relax our notion of approximation to be more local: for all length-k segments of the chain, the reduced density matrices of our approximations are ϵ-close to those of the exact state. If the state is a ground state of a gapped local Hamiltonian, the bond dimension of the approximation scales like (k/ϵ)^(1+o(1)), and at the expense of worse but still poly(k,1/ϵ) scaling of the bond dimension, we give an alternate construction with the additional features that it can be generated by a constant-depth quantum circuit with nearest-neighbor gates, and that it applies generally for any state with exponentially decaying correlations. For a completely general state, we give an approximation with bond dimension exp(O(k/ϵ)), which is exponentially worse, but still independent of N. Then, we consider the prospect of designing an algorithm to find a local approximation for ground states of gapped local 1D Hamiltonians. When the Hamiltonian is translationally invariant, we show that the ability to find O(1)-accurate local approximations to the ground state in T(N) time implies the ability to estimate the ground state energy to O(1) precision in O(T(N)log(N)) time.

Publication: Quantum Vol.: 3ISSN: 2521-327X

ID: CaltechAUTHORS:20190801-134544835

]]>

Abstract: 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 ground spaces. More recently, in the context of the anti-de Sitter/conformal field theory 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 Letter 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 obeying the eigenstate thermalization hypothesis 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 nonstabilizer codes in the ground space and low energy subspace of physically plausible 1D gapless models.

Publication: Physical Review Letters Vol.: 123 No.: 11 ISSN: 0031-9007

ID: CaltechAUTHORS:20190206-155714600

]]>

Abstract: We prove that any one-dimensional (1D) quantum state with small quantum conditional mutual information in all certain tripartite splits of the system, which we call a quantum approximate Markov chain, can be well-approximated by a Gibbs state of a short-range quantum Hamiltonian. Conversely, we also derive an upper bound on the (quantum) conditional mutual information of Gibbs states of 1D short-range quantum Hamiltonians. We show that the conditional mutual information between two regions A and C conditioned on the middle region B decays exponentially with the square root of the length of B. These two results constitute a variant of the Hammersley–Clifford theorem (which characterizes Markov networks, i.e. probability distributions which have vanishing conditional mutual information, as Gibbs states of classical short-range Hamiltonians) for 1D quantum systems. The result can be seen as a strengthening—for 1D systems—of the mutual information area law for thermal states. It directly implies an efficient preparation of any 1D Gibbs state at finite temperature by a constant-depth quantum circuit.

Publication: Communications in Mathematical Physics Vol.: 370 No.: 1 ISSN: 0010-3616

ID: CaltechAUTHORS:20170726-094724141

]]>

Abstract: We consider the scaling of entanglement entropy in random Projected Entangled Pairs States (PEPS) with an internal symmetry given by a finite group G. We systematically demonstrate a correspondence between this entanglement entropy and the difference of free energies of a classical Ising model with an addition non-local term. This non-local term counts the number of domain walls in a particular configuration of the classical spin model. We argue that for that overwhelming majority of such states, this gives rise to an area law scaling with well-defined topological entanglement entropy. The topological entanglement entropy is shown to be log|G| for a simply connected region A and which manifests as a difference in the number of domain walls of ground state energies for the two spin models.

Publication: arXiv
ID: CaltechAUTHORS:20190801-134548265

]]>

Abstract: Chaotic dynamics in quantum many-body systems scrambles local information so that at late times it can no longer be accessed locally. This is reflected quantitatively in the out-of-time-ordered correlator of local operators, which is expected to decay to 0 with time. However, for systems of finite size, out-of-time-ordered correlators do not decay exactly to 0 and in this paper we show that the residual value can provide useful insights into the chaotic dynamics. When energy is conserved, the late-time saturation value of the out-of-time-ordered correlator of generic traceless local operators scales as an inverse polynomial in the system size. This is in contrast to the inverse exponential scaling expected for chaotic dynamics without energy conservation. We provide both analytical arguments and numerical simulations to support this conclusion.

Publication: Physical Review Letters Vol.: 123 No.: 1 ISSN: 0031-9007

ID: CaltechAUTHORS:20170726-091047115

]]>

Abstract: Thermodynamics imposes restrictions on what state transformations are possible. In the macroscopic limit of asymptotically many independent copies of a state—as for instance in the case of an ideal gas—the possible transformations become reversible and are fully characterized by the free energy. In this Letter, we present a thermodynamic resource theory for quantum processes that also becomes reversible in the macroscopic limit, a property that is especially rare for a resource theory of quantum channels. We identify a unique single-letter and additive quantity, the thermodynamic capacity, that characterizes the “thermodynamic value” of a quantum channel, in the sense that the work required to simulate many repetitions of a quantum process employing many repetitions of another quantum process becomes equal to the difference of the respective thermodynamic capacities. On a technical level, we provide asymptotically optimal constructions of universal implementations of quantum processes. A challenging aspect of this construction is the apparent necessity to coherently combine thermal engines that would run in different thermodynamic regimes depending on the input state. Our results have applications in quantum Shannon theory by providing a generalized notion of quantum typical subspaces and by giving an operational interpretation to the entropy difference of a channel.

Publication: Physical Review Letters Vol.: 122 No.: 20 ISSN: 0031-9007

ID: CaltechAUTHORS:20190211-152656438

]]>

Abstract: We consider two-dimensional states of matter satisfying a uniform area law for entanglement. We show that the topological entanglement entropy is equal to the minimum relative entropy distance from the reduced state to the set of thermal states of local models. The argument is based on strong subadditivity of quantum entropy. For states with zero topological entanglement entropy, in particular, the formula gives locality of the states at the boundary of a region as thermal states of local Hamiltonians. It also implies that the entanglement spectrum of a two-dimensional region is equal to the spectrum of a one-dimensional local thermal state on the boundary of the region.

Publication: Physical Review B Vol.: 99 No.: 19 ISSN: 2469-9950

ID: CaltechAUTHORS:20180620-190843167

]]>

Abstract: Preparing quantum thermal states on a quantum computer is in general a difficult task. We provide a procedure to prepare a thermal state on a quantum computer with a logarithmic depth circuit of local quantum channels assuming that the thermal state correlations satisfy the following two properties: (i) the correlations between two regions are exponentially decaying in the distance between the regions, and (ii) the thermal state is an approximate Markov state for shielded regions. We require both properties to hold for the thermal state of the Hamiltonian on any induced subgraph of the original lattice. Assumption (ii) is satisfied for all commuting Gibbs states, while assumption (i) is satisfied for every model above a critical temperature. Both assumptions are satisfied in one spatial dimension. Moreover, both assumptions are expected to hold above the thermal phase transition for models without any topological order at finite temperature. As a building block, we show that exponential decay of correlation (for thermal states of Hamiltonians on all induced subgraphs) is sufficient to efficiently estimate the expectation value of a local observable. Our proof uses quantum belief propagation, a recent strengthening of strong sub-additivity, and naturally breaks down for states with topological order.

Publication: Communications in Mathematical Physics Vol.: 365 No.: 1 ISSN: 0010-3616

ID: CaltechAUTHORS:20170726-092817023

]]>

Abstract: We study thermal states of strongly interacting quantum spin chains and prove that those can be represented in terms of convex combinations of matrix product states. Apart from revealing new features of the entanglement structure of Gibbs states, our results provide a theoretical justification for the use of White's algorithm of minimally entangled typical thermal states. Furthermore, we shed new light on time dependent matrix product state algorithms which yield hydrodynamical descriptions of the underlying dynamics.

Publication: Physical Review B Vol.: 98 No.: 23 ISSN: 2469-9950

ID: CaltechAUTHORS:20190102-092233446

]]>

Abstract: The Quantum Approximate Optimization Algorithm, QAOA, uses a shallow depth quantum circuit to produce a parameter dependent state. For a given combinatorial optimization problem instance, the quantum expectation of the associated cost function is the parameter dependent objective function of the QAOA. We demonstrate that if the parameters are fixed and the instance comes from a reasonable distribution then the objective function value is concentrated in the sense that typical instances have (nearly) the same value of the objective function. This applies not just for optimal parameters as the whole landscape is instance independent. We can prove this is true for low depth quantum circuits for instances of MaxCut on large 3-regular graphs. Our results generalize beyond this example. We support the arguments with numerical examples that show remarkable concentration. For higher depth circuits the numerics also show concentration and we argue for this using the Law of Large Numbers. We also observe by simulation that if we find parameters which result in good performance at say 10 bits these same parameters result in good performance at say 24 bits. These findings suggest ways to run the QAOA that reduce or eliminate the use of the outer loop optimization and may allow us to find good solutions with fewer calls to the quantum computer.

Publication: arXiv
ID: CaltechAUTHORS:20190801-134537838

]]>

Abstract: 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 and/or conditional erasure if Alice has available the best possible system E to help in the deconstruction and/or conditional erasure task.

Publication: Physical Review A Vol.: 98 No.: 4 ISSN: 2469-9926

ID: CaltechAUTHORS:20170726-092810091

]]>

Abstract: 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 [Phys. Rev. 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.

Publication: Physical Review Letters Vol.: 121 No.: 4 ISSN: 0031-9007

ID: CaltechAUTHORS:20180727-091530188

]]>

Abstract: Three-dimensional (3D) color codes have advantages for fault-tolerant quantum computing, such as protected quantum gates with relatively low overhead and robustness against imperfect measurement of error syndromes. Here we investigate the storage threshold error rates for bit-flip and phase-flip noise in the 3D color code (3DCC) on the body-centered cubic lattice, assuming perfect syndrome measurements. In particular, by exploiting a connection between error correction and statistical mechanics, we estimate the threshold for 1D stringlike and 2D sheetlike logical operators to be p^((1))_(3DCC) ≃ 1.9% and p^((2))_(3DCC) ≃ 27.6%. We obtain these results by using parallel tempering Monte Carlo simulations to study the disorder-temperature phase diagrams of two new 3D statistical-mechanical models: the four- and six-body random coupling Ising models.

Publication: Physical Review Letters Vol.: 120 No.: 18 ISSN: 0031-9007

ID: CaltechAUTHORS:20171004-145219476

]]>

Abstract: The work concerns the problem of finding a protocol for randomness amplification secure against non-signaling adversary with polynomial number of devices, which allows for correlations between the device and the source of weak randomness. We focus on the epsilon-Santha-Vazirani sources, and provide two results in this direction. First we revisit the seminal protocol of R. Colbeck and R. Renner (CR protocol) of randomness amplification using Santha-Vazirani (SV) sources, and prove its security relaxing partially assumptions of independence between the devices and the source at a price of narrowed range of epsilon. The relaxation allows that the SV source can indicate as a final device from which randomness is taken choosen with uniform probability from the insecure devices. The proof of relaxation bases on the assumption which is a generalization of Santha-Vazirani condition - the SV condition for boxes: there does not exist a device such that given its inputs and outputs one can get to know the value of SV source by more than epsilon. Second, we prove security of the CR protocol allowing arbitrary correlations between SV source and device, up to the mentioned SV-box condition, and the assumption that the devices are not correlated with each other. We prove that if the final device chosen in the protocol was not secure, an independent tester could guess the value of SV source bits more than the SV-box condition allows. The strategy of a tester is to choose a random device out of the ones which do not satisfy condition of the Chain Bell inequality. The idea of the proof of the second result indicates that the CR protocol may be secure under attack which arbitrarily correlates SV with devices of arbitrary type, and is promising in studying this problem.

No.: 10442
ID: CaltechAUTHORS:20190827-110541191

]]>

Abstract: We construct a Hamiltonian whose dynamics simulate the dynamics of every other Hamiltonian up to exponentially long times in the system size. The Hamiltonian is time-independent, local, one-dimensional, and translation invariant. As a consequence, we show (under plausible computational complexity assumptions) that the circuit complexity of the unitary dynamics under this Hamiltonian grows steadily with time up to an exponential value in system size. This result makes progress on a recent conjecture by Susskind, in the context of the AdS/CFT correspondence, that the time evolution of the thermofield double state of two conformal fields theories with a holographic dual has a circuit complexity increasing linearly in time, up to exponential time.

Publication: arXiv
ID: CaltechAUTHORS:20190801-134530640

]]>

Abstract: We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank at most r, and sparsity s. The first algorithm assumes access to an oracle to the matrices at unit cost. We show that it has run time Õ(s^2(√((mϵ)^(−10)) + √((nϵ)^(−12))), with ϵ the error of the solution. This gives an optimal dependence in terms of m, n and quadratic improvement over previous quantum algorithms when m ≈ n. The second algorithm assumes a fully quantum input model in which the matrices are given as quantum states. We show that its run time is Õ (√m + poly(r))⋅poly(log m,log n,B,ϵ^(−1)), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only poly-logarithmically in n and polynomially in r. We apply the second SDP solver to learn a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state ρ with rank at most r, we show we can find in time √m⋅poly(log m,log n,r,ϵ^(−1)) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements, up to error ϵ. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes' principle from statistical mechanics. As in previous work, we obtain our algorithm by "quantizing" classical SDP solvers based on the matrix multiplicative weight method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension, which could be of independent interest.

Publication: arXiv
ID: CaltechAUTHORS:20190801-134527208

]]>

Abstract: We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time n^(1/2) m^(1/2) s^2 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 upper bounds on the size of the optimal primal and dual solutions, respectively. 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^(1/2) + m^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.

ID: CaltechAUTHORS:20180105-142517243

]]>

Abstract: We prove that the entanglement entropy of any state evolved under an arbitrary 1/r^α long-range-interacting D-dimensional lattice spin Hamiltonian cannot change faster than a rate proportional to the boundary area for any α>D+1. We also prove that for any α>2D+2, the ground state of such a Hamiltonian satisfies the entanglement area law if it can be transformed along a gapped adiabatic path into a ground state known to satisfy the area law. These results significantly generalize their existing counterparts for short-range interacting systems, and are useful for identifying dynamical phase transitions and quantum phase transitions in the presence of long-range interactions.

Publication: Physical Review Letters Vol.: 119 No.: 5 ISSN: 0031-9007

ID: CaltechAUTHORS:20170726-092004962

]]>

Abstract: 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 in each of the subsystems one can get an exponential improvement in the error dependence on the dimension of the subsystems. We also obtain similar results for non-signaling probability distributions. We give several applications of the results to quantum complexity theory, polynomial optimization, and quantum information theory. The proofs of the new quantum de Finetti theorems are based on information theory, in particular on the chain rule of mutual information. The results constitute improvements and generalizations of a recent de Finetti theorem due to Brandão, Christandl and Yard.

Publication: Communications in Mathematical Physics Vol.: 353 No.: 2 ISSN: 0010-3616

ID: CaltechAUTHORS:20170601-151508738

]]>

Abstract: We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst case running time n^(1/2)m^(1/2)S^2 poly(log(n), log(m), R, r, 1/δ), with n and s the dimension and sparsity of the input matrices, respectively, m the number of constraints, δ the accuracy of the solution, and R, r 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 giving a Ω(n^(1/2) + m^(1/2)) quantum lower bound for solving semidefinite programs with constant s, R, r and δ. We then argue that in some instances the algorithm offer even exponential speed-ups. This is the case whenever the quantum Gibbs states of Hamiltonians given by linear combinations of the input matrices of the SDP can be prepared efficiently on a quantum computer. An example are SDPs in which the input matrices have low-rank: For SDPs with the maximum rank of any input matrix bounded by rank, we show the quantum algorithm runs in time poly(log(n), log(m), rank, r, R, δ)m^(1/2). The quantum algorithm is constructed by a combination of quantum Gibbs sampling and the multiplicative weight method. In particular it is based on an classical algorithm of Arora and Kale for approximately solving SDPs. We present a modification of their algorithm to eliminate the need of solving an inner linear program which may be of independent interest.

ID: CaltechAUTHORS:20170726-063707920

]]>

Abstract: 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.

Publication: Physical Review Letters Vol.: 118 No.: 14 ISSN: 0031-9007

ID: CaltechAUTHORS:20170403-143421083

]]>

Abstract: 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 cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding 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 unitary time evolutions (“circuits”) are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time 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 understanding the self-equilibration of closed quantum dynamics.

Publication: Physical Review Letters Vol.: 116 No.: 17 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-113319489

]]>

Abstract: Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology.

Publication: Nature Communications Vol.: 7ISSN: 2041-1723

ID: CaltechAUTHORS:20160524-103844109

]]>

Abstract: 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.

ID: CaltechAUTHORS:20160608-095659909

]]>

Abstract: The problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this work, we relax this assumption, and reconsider the original protocol of Colbeck and Renner, Nature Physics 8, 450-454 (2012), on randomness amplification using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition for devices, namely that any string of SV source bits remains weakly random conditioned upon any other bit string from the same SV source and the outputs obtained when this further string is input into the devices. Assuming this condition, we show that a quantum device using a singlet state to violate the chained Bell inequalities leads to full randomness in the asymptotic scenario of a large number of settings, for a restricted set of SV sources (with 0 ≤ ε <(2^((1/12))−1)/2(2^((1/12))+1) ≈ 0.0144). We also study a device-independent protocol that allows for correlations between the sequence of boxes used in the protocol and the SV source bits used to choose the particular box from whose output the randomness is obtained. Assuming the SV-like condition for devices, we show that the honest parties can achieve amplification of the weak source against this attack for the parameter range 0 ≤ ε < 0.0132. We leave the case of a yet more general attack on the amplification protocol as an interesting open problem.

ID: CaltechAUTHORS:20160608-095147622

]]>

Abstract: We prove an area law with a logarithmic correction for the mutual information for fixed points of local dissipative quantum system satisfying a rapid mixing condition, under either of the following assumptions: the fixed point is pure or the system is frustration free.

Publication: Journal of Mathematical Physics Vol.: 56 No.: 10 ISSN: 0022-2488

ID: CaltechAUTHORS:20151202-080343555

]]>

Abstract: We present several polynomial- and quasipolynomial-time approximation schemes for a large class of generalized operator norms. Special cases include the 2→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 ℓ^n_1 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 ℓ_1 spaces. This principle has been used in learning theory, where it is known as Maurey's empirical method.

ID: CaltechAUTHORS:20160608-094748588

]]>

Abstract: 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 behavior 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 constitute proof of an area law for unbounded Hamiltonians beyond those that are integrable.

Publication: Physical Review B Vol.: 92 No.: 11 ISSN: 1098-0121

ID: CaltechAUTHORS:20160607-074448112

]]>

Abstract: In recent years it has been recognized that properties of physical systems such as entanglement, athermality, and asymmetry, can be viewed as resources for important tasks in quantum information, thermodynamics, and other areas of physics. This recognition was followed by the development of specific quantum resource theories (QRTs), such as entanglement theory, determining how quantum states that cannot be prepared under certain restrictions may be manipulated and used to circumvent the restrictions. Here we discuss the general structure of QRTs, and show that under a few assumptions (such as convexity of the set of free states), a QRT is asymptotically reversible if its set of allowed operations is maximal, that is, if the allowed operations are the set of all operations that do not generate (asymptotically) a resource. In this case, the asymptotic conversion rate is given in terms of the regularized relative entropy of a resource which is the unique measure or quantifier of the resource in the asymptotic limit of many copies of the state. This measure also equals the smoothed version of the logarithmic robustness of the resource.

Publication: Physical Review Letters Vol.: 115 No.: 7 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-110307168

]]>

Abstract: 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 regularized 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.

Publication: Physical Review Letters Vol.: 115 No.: 5 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-105210912

]]>

Abstract: Recently the first physically realistic protocol amplifying the randomness of Santha-Vazirani sources using a finite number of no-signaling devices and with a constant rate of noise has been proposed, however there still remained the open question whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling devices and in a situation where the violation of a Bell inequality implies only an upper bound for some outcome probability for some setting combination? Here, we solve this problem and present the first device-independent protocol for the task of randomness amplification of Santha-Vazirani sources using a device consisting of only two non-signaling components. We show that the protocol can amplify any such source that is not fully deterministic into a totally random source while tolerating a constant noise rate and prove the security of the protocol against general no-signaling adversaries. The minimum requirement for a device-independent Bell inequality based protocol for obtaining randomness against no-signaling attacks is that every no-signaling box that obtains the observed Bell violation has the conditional probability P(x|u) of at least a single input-output pair (u,x) bounded from above. We show how one can construct protocols for randomness amplification in this minimalistic scenario.

ID: CaltechAUTHORS:20160608-092908091

]]>

Abstract: The second law of thermodynamics places constraints on state transformations. It applies to systems composed of many particles, however, we are seeing that one can formulate laws of thermodynamics when only a small number of particles are interacting with a heat bath. Is there a second law of thermodynamics in this regime? Here, we find that for processes which are approximately cyclic, the second law for microscopic systems takes on a different form compared to the macroscopic scale, imposing not just one constraint on state transformations, but an entire family of constraints. We find a family of free energies which generalize the traditional one, and show that they can never increase. The ordinary second law relates to one of these, with the remainder imposing additional constraints on thermodynamic transitions. We find 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 relevant for small systems, and also apply to individual macroscopic systems interacting via long-range interactions. By making precise the definition of thermal operations, the laws of thermodynamics are unified in this framework, with the first law defining the class of operations, the zeroth law emerging as an equivalence relation between thermal states, and the remaining laws being monotonicity of our generalized free energies.

Publication: Proceedings of the National Academy of Sciences of the United States of America Vol.: 112 No.: 11 ISSN: 0027-8424

ID: CaltechAUTHORS:20160607-074905677

]]>

Abstract: 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.

No.: 18
ID: CaltechAUTHORS:20160608-092309554

]]>

Abstract: Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p ∈ P or from a distribution q ∈ Q and wants to decide from which set the points were sampled. It is known that the optimal exponential rate at which errors decrease can be achieved by a simple maximum-likelihood ratio test which does not depend on p or q, but only on the sets P and Q. We consider an adaptive generalization of this model where the choice of p ∈ P and q ∈ Q can change in each sample in some way that depends arbitrarily on the previous samples. In other words, in the kth round, an adversary, having observed all the previous samples in rounds 1, ..., κ-1, chooses p_κ ∈ P and q_κ ∈ Q, with the goal of confusing the hypothesis test. We prove that even in this case, the optimal exponential error rate can be achieved by a simple maximum-likelihood test that depends only on P and Q. We then show that the adversarial model has applications in hypothesis testing for quantum states using restricted measurements. For example, it can be used to study the problem of distinguishing entangled states from the set of all separable states using only measurements that can be implemented with local operations and classical communication (LOCC). The basic idea is that in our setup, the deleterious effects of entanglement can be simulated by an adaptive classical adversary. We prove a quantum Stein's Lemma in this setting: In many circumstances, the optimal hypothesis testing rate is equal to an appropriate notion of quantum relative entropy between two states. In particular, our arguments yield an alternate proof of Li and Winter's recent strengthening of strong subadditivity for quantum relative entropy.

ID: CaltechAUTHORS:20200730-074813402

]]>

Abstract: The ideas of thermodynamics have proved fruitful in the setting of quantum information theory, in particular the notion that when the allowed transformations of a system are restricted, certain states of the system become useful resources with which one can prepare previously inaccessible states. The theory of entanglement is perhaps the best-known and most well-understood resource theory in this sense. Here, we return to the basic questions of thermodynamics using the formalism of resource theories developed in quantum information theory and show that the free energy of thermodynamics emerges naturally from the resource theory of energy-preserving transformations. Specifically, the free energy quantifies the amount of useful work which can be extracted from asymptotically many copies of a quantum system when using only reversible energy-preserving transformations and a thermal bath at fixed temperature. The free energy also quantifies the rate at which resource states can be reversibly interconverted asymptotically, provided that a sublinear amount of coherent superposition over energy levels is available, a situation analogous to the sublinear amount of classical communication required for entanglement dilution.

Publication: Physical Review Letters Vol.: 111 No.: 25 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-104504897

]]>

Abstract: We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum hypothesis testing in terms of the smooth max-relative entropy of the two states representing the two hypotheses. Then using a relative entropy version of the quantum asymptotic equipartition property (QAEP), we can recover the strong converse rate of the i.i.d. hypothesis testing problem in the asymptotics. On the other hand, combining Stein's lemma with our bounds, we obtain a stronger (ε-independent) version of the relative entropy-QAEP. Similarly, we provide bounds on the one-shot ε-error classical capacity of a quantum channel in terms of a smooth max-relative entropy variant of its Holevo capacity. Using these bounds and the ε-independent version of the relative entropy-QAEP, we can recover both the Holevo- Schumacher- Westmoreland theorem about the optimal direct rate of a memoryless quantum channel with product state encoding, as well as its strong converse counterpart.

Publication: IEEE Transactions on Information Theory Vol.: 59 No.: 12 ISSN: 0018-9448

ID: CaltechAUTHORS:20160525-154244272

]]>

Abstract: A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect. We prove the result in two steps. In the first, we show that almost any element of an approximate unitary 3-design is useful to solve a certain black-box problem efficiently. The problem is based on a recent oracle construction of Aaronson and gives an exponential separation between quantum and classical bounded-error with postselection query complexities. In the second step, which may be of independent interest, we prove that linear-sized random quantum circuits give an approximate unitary 3-design. The key ingredient in the proof is a technique from quantum many-body theory to lower bound the spectral gap of local quantum Hamiltonians.

Publication: Quantum Information and Computation Vol.: 13 No.: 11-12 ISSN: 1533-7146

ID: CaltechAUTHORS:20160608-075528573

]]>

Abstract: The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this paper, we show how to express this quantity as a regularized optimization of the entanglement formation over states that can be generated between sender and receiver. Our formula is the channel analog of a well-known formula for the entanglement cost of quantum states in terms of the entanglement of formation and shares a similar relation to the recently shattered hope for additivity. The entanglement cost of a quantum channel can be seen as the analog of the quantum reverse Shannon theorem in the case where free classical communication is allowed. The techniques used in the proof of our result are then also inspired by a recent proof of the quantum reverse Shannon theorem and feature the one-shot formalism for quantum information theory, the postselection technique for quantum channels as well as Sion's minimax theorem. We discuss two applications of our result. First, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only improves the range of parameters where security can be shown, but also allows us to prove security for storage devices for which no results were known before. Second, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.

Publication: IEEE Transactions on Information Theory Vol.: 59 No.: 10 ISSN: 0018-9448

ID: CaltechAUTHORS:20160525-153515356

]]>

Abstract: Area laws for entanglement in quantum many-body systems give useful information about their low-temperature behaviour and are tightly connected to the possibility of good numerical simulations. An intuition from quantum many-body physics suggests that an area law should hold whenever there is exponential decay of correlations in the system, a property found, for instance, in non-critical phases of matter. However, the existence of quantum data-hiding states—that is, states having very small correlations, yet a volume scaling of entanglement—was believed to be a serious obstruction to such an implication. Here we prove that notwithstanding the phenomenon of data hiding, one-dimensional quantum many-body states satisfying exponential decay of correlations always fulfil an area law. To obtain this result we combine several recent advances in quantum information theory, thus showing the usefulness of the field for addressing problems in other areas of physics.

Publication: Nature Physics Vol.: 9 No.: 11 ISSN: 1745-2473

ID: CaltechAUTHORS:20160524-105556554

]]>

Abstract: Is there a meaningful quantum counterpart to public communication? We argue that it is the symmetric-side channel. This connection is partially motivated by recent work, where it was found that if a sender would like to communicate a secret message to a receiver through an insecure quantum channel using a shared quantum state as a key, then the insecure quantum channel is only ever used to simulate a symmetric-side channel. Here, we further show, in complete analogy to the role of public classical communication, that assistance by a symmetric-side channel makes equal the distillable entanglement, the recently introduced mutual independence, and a generalization of the latter, which quantifies the extent to which one of the parties can perform quantum privacy amplification. Symmetric-side channels, and the closely related erasure channel, have been recently harnessed to provide examples of superactivation of the quantum channel capacity. Our findings give new insight into this nonadditivity and its relation to quantum privacy. In particular, we show that single-copy superactivation protocols with the erasure channel, which encompasses all examples of nonadditivity of the quantum capacity found to date, can be understood as a conversion of mutual independence into distillable entanglement.

Publication: IEEE Transactions on Information Theory Vol.: 59 No.: 4 ISSN: 0018-9448

ID: CaltechAUTHORS:20160524-093536574

]]>

Abstract: We provide quantitative bounds on the characterization of multiparticle separable states by states that have locally symmetric extensions. The bounds are derived from two-particle bounds and relate to recent studies on quantum versions of de Finetti’s theorem. We discuss algorithmic applications of our results, in particular a quasipolynomial-time algorithm to decide whether a multiparticle quantum state is separable or entangled (for constant number of particles and constant error in the norm induced by one-way local operations and classical communication, or in the Frobenius norm). Our results provide a theoretical justification for the use of the search for symmetric extensions as a test for multiparticle entanglement.

Publication: Physical Review Letters Vol.: 109 No.: 16 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-103153917

]]>

Abstract: We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.

Publication: Physical Review E Vol.: 86 No.: 3 ISSN: 1539-3755

ID: CaltechAUTHORS:20160526-082007335

]]>

Abstract: A classical one-time pad allows two parties to send private messages over a public classical channel—an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state which allows two parties to send private messages or private quantum states over a public quantum channel. If the eavesdropper intercepts the quantum communication she learns nothing about the message. In the classical case, a one-time pad can be created using shared and partially private correlations. Here we consider the quantum case in the presence of an eavesdropper, and find the single-letter formula for the rate at which the two parties can send messages using a general quantum state as a quantum one-time pad. Surprisingly, the formula coincides with the distillable entanglement assisted by a symmetric channel, an important quantity in quantum information theory, but which lacked a clear operational meaning.

Publication: Physical Review Letters Vol.: 108 No.: 4 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-101711780

]]>

Abstract: Superactivation is the property that two channels with zero quantum capacity can be used together to yield a positive capacity. Here we demonstrate that this effect exists for a wide class of inequivalent channels, none of which can simulate each other. We also consider the case where one of two zero-capacity channels is applied, but the sender is ignorant of which one is applied. We find examples where the greater the entropy of mixing of the channels, the greater the lower bound for the capacity. Finally, we show that the effect of superactivation is rather generic by providing an example of superactivation using the depolarizing channel.

Publication: Physical Review Letters Vol.: 108 No.: 4 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-103621898

]]>

Abstract: Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, it is strictly positive if and only if the state is entangled. We derive the lower bound on squashed entanglement from a lower bound on the quantum conditional mutual information which is used to define squashed entanglement. The quantum conditional mutual information corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof is based on two recent results from quantum information theory: the operational interpretation of the quantum mutual information as the optimal rate for state redistribution and the interpretation of the regularised relative entropy of entanglement as an error exponent in hypothesis testing. The distance to the set of separable states is measured in terms of the LOCC norm, an operationally motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shared by two parties, using any protocol formed by local quantum operations and classical communication (LOCC) between the parties. A similar result for the Frobenius or Euclidean norm follows as an immediate consequence. The result has two applications in complexity theory. The first application is a quasipolynomial-time algorithm solving the weak membership problem for the set of separable states in LOCC or Euclidean norm. The second application concerns quantum Merlin-Arthur games. Here we show that multiple provers are not more powerful than a single prover when the verifier is restricted to LOCC operations thereby providing a new characterisation of the complexity class QMA.

Publication: Communications in Mathematical Physics Vol.: 306 No.: 3 ISSN: 0010-3616

ID: CaltechAUTHORS:20160607-124125598

]]>

Abstract: Entangled inputs can enhance the capacity of quantum channels, this being one of the consequences of the celebrated result showing the nonadditivity of several quantities relevant for quantum information science. In this work, we answer the converse question (whether entangled inputs can ever render noisy quantum channels to have maximum capacity) to the negative: No sophisticated entangled input of any quantum channel can ever enhance the capacity to the maximum possible value, a result that holds true for all channels both for the classical as well as the quantum capacity. This result can hence be seen as a bound as to how “nonadditive quantum information can be.” As a main result, we find first practical and remarkably simple computable single-shot bounds to capacities, related to entanglement measures. As examples, we discuss the qubit amplitude damping and identify the first meaningful bound for its classical capacity.

Publication: Physical Review Letters Vol.: 106 No.: 23 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-102352442

]]>

Abstract: We obtain expressions for the optimal rates of one-shot entanglement manipulation under operations which generate a negligible amount of entanglement. As the optimal rates for entanglement distillation and dilution in this paradigm, we obtain the max- and min-relative entropies of entanglement, the two logarithmic robustnesses of entanglement, and smoothed versions thereof. This gives a new operational meaning to these entanglement measures. Moreover, by considering the limit of many identical copies of the shared entangled state, we partially recover the recently found reversibility of entanglement manipulation under the class of operations which asymptotically do not generate entanglement.

Publication: IEEE Transactions on Information Theory Vol.: 57 No.: 3 ISSN: 0018-9448

ID: CaltechAUTHORS:20160525-155015519

]]>

Abstract: Given many independent and identically-distributed (i.i.d.) copies of a quantum system described either by the state ρ or σ (called null and alternative hypotheses, respectively), what is the optimal measurement to learn the identity of the true state? In asymmetric hypothesis testing one is interested in minimizing the probability of mistakenly identifying ρ instead of σ, while requiring that the probability that σ is identified in the place of ρ is bounded by a small fixed number. Quantum Stein’s Lemma identifies the asymptotic exponential rate at which the specified error probability tends to zero as the quantum relative entropy of ρ and σ. We present a generalization of quantum Stein’s Lemma to the situation in which the alternative hypothesis is formed by a family of states, which can moreover be non-i.i.d. We consider sets of states which satisfy a few natural properties, the most important being the closedness under permutations of the copies. We then determine the error rate function in a very similar fashion to quantum Stein’s Lemma, in terms of the quantum relative entropy. Our result has two applications to entanglement theory. First it gives an operational meaning to an entanglement measure known as regularized relative entropy of entanglement. Second, it shows that this measure is faithful, being strictly positive on every entangled state. This implies, in particular, that whenever a multipartite state can be asymptotically converted into another entangled state by local operations and classical communication, the rate of conversion must be non-zero. Therefore, the operational definition of multipartite entanglement is equivalent to its mathematical definition

Publication: Communications in Mathematical Physics Vol.: 295 No.: 3 ISSN: 0010-3616

ID: CaltechAUTHORS:20160526-105804802

]]>

Abstract: We consider the manipulation of multipartite entangled states in the limit of many copies under quantum operations that asymptotically cannot generate entanglement. In stark contrast to the manipulation of entanglement under local operations and classical communication, the entanglement shared by two or more parties can be reversibly interconverted in this setting. The unique entanglement measure is identified as the regularized relative entropy of entanglement, which is shown to be equal to a regularized and smoothed version of the logarithmic robustness of entanglement. Here we give a rigorous proof of this result, which is fundamentally based on a certain recent extension of quantum Stein’s Lemma, giving the best measurement strategy for discriminating several copies of an entangled state from an arbitrary sequence of non-entangled states, with an optimal distinguishability rate equal to the regularized relative entropy of entanglement. We moreover analyse the connection of our approach to axiomatic formulations of the second law of thermodynamics.

Publication: Communications in Mathematical Physics Vol.: 295 No.: 3 ISSN: 0010-3616

ID: CaltechAUTHORS:20160526-104144804

]]>

Abstract: Hastings recently reported a randomized construction of channels violating the minimum output entropy additivity conjecture. Here we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact probability distribution of the Schmidt coefficients of a random bipartite pure state, as in the original proof, but rather derive the necessary large deviation bounds by a concentration of measure argument. Furthermore, we prove non-additivity for the overwhelming majority of channels consisting of a Haar random isometry followed by partial trace over the environment, for an environment dimension much bigger than the output dimension. This makes Hastings' original reasoning clearer and extends the class of channels for which additivity can be shown to be violated.

Publication: Open Systems & Information Dynamics Vol.: 17 No.: 1 ISSN: 1230-1612

ID: CaltechAUTHORS:20160523-163304954

]]>

Abstract: Entanglement is central both to the foundations of quantum theory and, as a novel resource, to quantum information science. The theory of entanglement establishes basic laws that govern its manipulation, in particular the non-increase of entanglement under local operations on the constituent particles. Such laws aim to draw from them formal analogies to the second law of thermodynamics; however, whereas in the second law the entropy uniquely determines whether a state is adiabatically accessible from another, the manipulation of entanglement under local operations exhibits a fundamental irreversibility, which prevents the existence of such an order. Here, we show that a reversible theory of entanglement and a rigorous relationship with thermodynamics may be established when considering all non-entangling transformations. The role of the entropy in the second law is taken by the asymptotic relative entropy of entanglement in the basic law of entanglement. We show the usefulness of this approach to general resource theories and to quantum information theory.

Publication: Nature Physics Vol.: 4 No.: 11 ISSN: 1745-2473

ID: CaltechAUTHORS:20160526-104927174

]]>

Abstract: In this thesis we present new results relevant to two important problems in quantum information science: the development of a theory of entanglement and the exploration of the use of controlled quantum systems to the simulation of quantum many-body phenomena. In the first part we introduce a new approach to the study of entanglement by considering its manipulation under operations not capable of generating entanglement and show there is a total order for multipartite quantum states in this framework. We also present new results on hypothesis testing of correlated sources and give further evidence on the existence of NPPT bound entanglement. In the second part, we study the potential as well as the limitations of a quantum computer for calculating properties of many-body systems. First we analyse the usefulness of quantum computation to calculate additive approximations to partition functions and spectral densities of local Hamiltonians. We then show that the determination of ground state energies of local Hamiltonians with an inverse polynomial spectral gap is QCMA-hard. In the third and last part, we approach the problem of quantum simulating many-body systems from a more pragmatic point of view. We analyze the realization of paradigmatic condensed matter Hamiltonians in arrays of coupled microcavities, such as the Bose-Hubbard and the anisotropic Heisenberg models, and discuss the feasibility of an experimental realization with state-of-the-art current technology.

ID: CaltechAUTHORS:20160524-092724487

]]>

Abstract: The increasing level of experimental control over atomic and optical systems gained in the past years have paved the way for the exploration of new physical regimes in quantum optics and atomic physics, characterised by the appearance of quantum many-body phenomena, originally encountered only in condensed-matter physics, and the possibility of experimentally accessing them in a more controlled manner. In this review article we survey recent theoretical studies concerning the use of cavity quantum electrodynamics to create quantum many-body systems. Based on recent experimental progress in the fabrication of arrays of interacting micro-cavities and on their coupling to atomic-like structures in several different physical architectures, we review proposals on the realisation of paradigmatic many-body models in such systems, such as the Bose-Hubbard and the anisotropic Heisenberg models. Such arrays of coupled cavities offer interesting properties as simulators of quantum many-body physics, including the full addressability of individual sites and the accessibility of inhomogeneous models.

ID: CaltechAUTHORS:20160524-091906413

]]>

Abstract: We show that the geometry of the set of quantum states plays a crucial role in the behavior of entanglement in different physical systems. More specifically, it is shown that singular points at the border of the set of unentangled states originate singularities in the dynamics of entanglement of smoothly varying quantum states. We illustrate this result by implementing a photonic parametric down-conversion experiment. Moreover, this effect is connected to recently discovered singularities in condensed matter models.

Publication: Physical Review A Vol.: 78 No.: 1 ISSN: 1050-2947

ID: CaltechAUTHORS:20160524-104623826

]]>

Abstract: We consider entanglement distillation under the assumption that the input states are allowed to be correlated among each other. We hence replace the usually considered independent and identically distributed hypothesis by the weaker assumption of merely having identical reductions. We find that whether a state is then distillable or not is only a property of these reductions, and not of the correlations that are present in the input state. This is shown by establishing an appealing relation between the set of copy-correlated undistillable states and the standard set of undistillable states: The former turns out to be the convex hull of the latter. As an example of the usefulness of our approach to the study of entanglement distillation, we prove a new activation result, which generalizes earlier findings: It is shown that for every entangled state σ and every k, there exists a copy-correlated k-undistillable state ρ such that σ⊗ρ is single-copy distillable. Finally, the relation of our results to the conjecture about the existence of bound entangled states with a nonpositive partial transpose is discussed.

Publication: Journal of Mathematical Physics Vol.: 49 No.: 4 ISSN: 0022-2488

ID: CaltechAUTHORS:20160524-091208947

]]>

Abstract: We propose a new method to produce self- and cross-Kerr photonic nonlinearities, using light-induced Stark shifts due to the interaction of a cavity mode with atoms. The proposed experimental set-up is simpler than in previous approaches, while the strength of the nonlinearity obtained with a single atom is the same as in the setting based on electromagnetically induced transparency. Furthermore our scheme can be applied to engineer effective photonic nonlinear interactions whose strength increases with the number of atoms coupled to the cavity mode, leading to photon–photon interactions several orders of magnitude larger than previously considered possible.

Publication: New Journal of Physics Vol.: 10 No.: 4 ISSN: 1367-2630

ID: CaltechAUTHORS:20160607-100618673

]]>

Abstract: We demonstrate that polaritons in an array of interacting micro-cavities with strong atom–photon coupling can form a two-component Bose–Hubbard model in which both polariton species are protected against spontaneous emission as their atomic part is stored in two ground states of the atoms. The parameters of the effective model can be tuned via the driving strength of external lasers and include attractive and repulsive polariton interactions. We also describe a method to measure the number statistics in one cavity for each polariton species independently.

Publication: New Journal of Physics Vol.: 10 No.: 3 ISSN: 1367-2630

ID: CaltechAUTHORS:20160526-103035847

]]>

Abstract: We show that atoms trapped in microcavities that interact via the exchange of virtual photons can model an anisotropic Heisenberg spin-1/2 lattice in an external magnetic field. All parameters of the effective Hamiltonian can individually be tuned via external lasers. Since the occupations of excited atomic levels and photonic states are strongly suppressed, the effective model is robust against decoherence mechanisms, has a long lifetime, and its implementation is feasible with current experimental technology. The model provides a feasible way to create cluster states in these devices.

Publication: Physical Review Letters Vol.: 99 No.: 16 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-083814006

]]>

Abstract: We analyse the relationship between the full additivity of the entanglement cost and its full monotonicity under local operations and classical communication. We show that the two properties are equivalent for the entanglement cost. The proof works for the regularization of any convex, subadditive, and asymptotically continuous entanglement monotone, and hence also applies to the asymptotic relative entropy of entanglement.

Publication: Open Systems & Information Dynamics Vol.: 14 No.: 3 ISSN: 1230-1612

ID: CaltechAUTHORS:20160523-163755100

]]>

Abstract: Entanglement witnesses provide tools to detect entanglement in experimental situations without the need of having full tomographic knowledge about the state. If one estimates in an experiment an expectation value smaller than zero, one can directly infer that the state has been entangled, or specifically multi-partite entangled, in the first place. In this paper, we emphasize that all these tests—based on the very same data—give rise to quantitative estimates in terms of entanglement measures: 'If a test is strongly violated, one can also infer that the state was quantitatively very much entangled'. We consider various measures of entanglement, including the negativity, the entanglement of formation, and the robustness of entanglement, in the bipartite and multipartite setting. As examples, we discuss several experiments in the context of quantum state preparation that have recently been performed.

Publication: New Journal of Physics Vol.: 9 No.: 3 ISSN: 1367-2630

ID: CaltechAUTHORS:20160607-095644015

]]>

Abstract: Observing quantum phenomena in strongly correlated many-particle systems is difficult because of the short length- and timescales involved. Exerting control over the state of individual elements within such a system is even more so, and represents a hurdle in the realization of quantum computing devices. Substantial progress has been achieved with arrays of Josephson junctions and cold atoms in optical lattices, where detailed control over collective properties is feasible, but addressing individual sites remains a challenge. Here we show that a system of polaritons held in an array of resonant optical cavities—which could be realized using photonic crystals or toroidal microresonators—can form a strongly interacting many-body system showing quantum phase transitions, where individual particles can be controlled and measured. The system also offers the possibility to generate attractive on-site potentials yielding highly entangled states and a phase with particles much more delocalized than in superfluids.

Publication: Nature Physics Vol.: 2 No.: 12 ISSN: 1745-2473

ID: CaltechAUTHORS:20160525-155847226

]]>

Abstract: Entanglement has been widely used as a tool for the investigation of phase transitions (PTs). However, analysing several entanglement measures in the two-qubit context, we see that distinct entanglement quantifiers can indicate different orders for the same PT. Examples are given for different Hamiltonians. This leaves open the possibility of addressing different orders to the same PT if entanglement is used as an order parameter. Moving on to the multipartite context, we show necessary and sufficient conditions for a family of entanglement monotones to confirm quantum PTs.

Publication: New Journal of Physics Vol.: 8 No.: 10 ISSN: 1367-2630

ID: CaltechAUTHORS:20160607-094020846

]]>

Abstract: We present a new measure of entanglement for mixed states. It can be approximately computable for every state and can be used to quantify all different types of multipartite entanglement. We show that it satisfies the usual properties of a good entanglement quantifier and derive relations between it and other entanglement measures.

Publication: International Journal of Quantum Information Vol.: 4 No.: 2 ISSN: 0219-7499

ID: CaltechAUTHORS:20160523-164306346

]]>

Abstract: We show that the quantum order parameters (QOPs) associated with the transitions between a normal conductor and a superconductor in the BCS and η-pairing models and between a Mott-insulator and a superfluid in the Bose–Hubbard model are directly related to the amount of entanglement existent in the ground state of each system. This connection gives a physical meaningful interpretation to these QOP, which shows the intrinsically quantum nature of the phase transitions considered.

Publication: New Journal of Physics Vol.: 7ISSN: 1367-2630

ID: CaltechAUTHORS:20160525-145304920

]]>

Abstract: We study if all maximally entangled states are pure through several entanglement monotones. In the bipartite case, we find that the same conditions which lead to the uniqueness of the entropy of entanglement as a measure of entanglement exclude the existence of maximally mixed entangled states. In the multipartite scenario, our conclusions allow us to generalize the idea of the monogamy of entanglement: we establish the polygamy of entanglement, expressing that if a general state is maximally entangled with respect to some kind of multipartite entanglement, then it is necessarily factorized of any other system.

Publication: Physical Review A Vol.: 72 No.: 4 ISSN: 1050-2947

ID: CaltechAUTHORS:20160607-081812978

]]>

Abstract: We present a unifying approach to the quantification of entanglement based on entanglement witnesses, which includes several already established entanglement measures such as the negativity, the concurrence, and the robustness of entanglement. We then introduce an infinite family of new entanglement quantifiers, having as its limits the best separable approximation measure and the generalized robustness. Gaussian states, states with symmetry, states constrained to super-selection rules, and states composed of indistinguishable particles are studied under the view of the witnessed entanglement. We derive new bounds to the fidelity of teleportation d_(min), for the distillable entanglement E_D and for the entanglement of formation. A particular measure, the PPT-generalized robustness, stands out due to its easy calculability and provides sharper bounds to d_(min) and E_D than the negativity in most of the states. We illustrate our approach studying thermodynamical properties of entanglement in the Heisenberg XXX and dimerized models.

Publication: Physical Review A Vol.: 72 No.: 2 ISSN: 1050-2947

ID: CaltechAUTHORS:20160526-081252302

]]>

Abstract: We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as robust semidefinite programs (RSDPs). We propose, using well known properties of RSDPs, several sufficient tests for separability of mixed states. Our results are then generalized to multipartite density operators.

Publication: Physical Review A Vol.: 70 No.: 6 ISSN: 1050-2947

ID: CaltechAUTHORS:20160524-110104407

]]>

Abstract: We introduce an operational procedure to determine, with arbitrary probability and accuracy, optimal entanglement witnesses for every multipartite entangled state. This method provides an operational criterion for separability which is asymptotically necessary and sufficient. Our results are also generalized to detect all different types of multipartite entanglement.

Publication: Physical Review Letters Vol.: 93 No.: 22 ISSN: 0031-9007

ID: CaltechAUTHORS:20160607-081033875

]]>