arXiv subjects

Patrick Hayden

Publications and source records attributed to Patrick Hayden.

At least 37 records · Page 2Linked to original sources

arXiv2022

A canonical Hamiltonian for open quantum systems

If an open quantum system is initially uncorrelated from its environment, then its dynamics can be written in terms of a Lindblad-form master equation. The master equation is divided into a unitary piece, represented by an effective Hamiltonian, and a dissipative piece, represented by a hermiticity-preserving superoperator; however, the division of open system dynamics into unitary and dissipative pieces is non-unique. For finite-dimensional quantum systems, we resolve this non-uniqueness by specifying a norm on the space of dissipative superoperators and defining the canonical Hamiltonian to be the one whose dissipator is minimal. We show that the canonical Hamiltonian thus defined is equivalent to the Hamiltonian initially defined by Lindblad, and that it is uniquely specified by requiring the dissipator's jump operators to be traceless, extending a uniqueness result known previously in the special case of Markovian master equations. For a system weakly coupled to its environment, we give a recursive formula for computing the canonical effective Hamiltonian to arbitrary orders in perturbation theory, which we can think of as a perturbative scheme for renormalizing the system's bare Hamiltonian.

quant-ph↗

arXiv2021

Fault-tolerant qubit from a constant number of components

With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge overhead imposed by quantum error correction itself. We propose a fault-tolerant quantum computing scheme that can nonetheless be assembled from a small number of experimental components, potentially dramatically reducing the engineering challenges associated with building a large-scale fault-tolerant quantum computer. Our scheme has a threshold of 0.39% for depolarising noise, assuming that memory errors are negligible. In the presence of memory errors, the logical error rate decays exponentially with $\sqrt{T/τ}$, where $T$ is the memory coherence time and $τ$ is the timescale for elementary gates. Our approach is based on a novel procedure for fault-tolerantly preparing three-dimensional cluster states using a single actively controlled qubit and a pair of delay lines. Although a circuit-level error may propagate to a high-weight error, the effect of this error on the prepared state is always equivalent to that of a constant-weight error. We describe how the requisite gates can be implemented using existing technologies in quantum photonic and phononic systems. With continued improvements in only a few components, we expect these systems to be promising candidates for demonstrating fault-tolerant quantum computation with a comparatively modest experimental effort.

quant-ph↗

arXiv2021

The Markov gap for geometric reflected entropy

The reflected entropy $S_R(A:B)$ of a density matrix $ρ_{AB}$ is a bipartite correlation measure lower-bounded by the quantum mutual information $I(A:B)$. In holographic states satisfying the quantum extremal surface formula, where the reflected entropy is related to the area of the entanglement wedge cross-section, there is often an order-$N^2$ gap between $S_R$ and $I$. We provide an information-theoretic interpretation of this gap by observing that $S_R - I$ is related to the fidelity of a particular Markov recovery problem that is impossible in any state whose entanglement wedge cross-section has a nonempty boundary; for this reason, we call the quantity $S_R - I$ the Markov gap. We then prove that for time-symmetric states in pure AdS$_3$ gravity, the Markov gap is universally lower bounded by $\log(2) \ell_{\text{AdS}}/2 G_N$ times the number of endpoints of the cross-section. We provide evidence that this lower bound continues to hold in the presence of bulk matter, and comment on how it might generalize above three bulk dimensions. Finally, we explore the Markov recovery problem controlling $S_R - I$ using fixed area states. This analysis involves deriving a formula for the quantum fidelity -- in fact, for all the sandwiched Rényi relative entropies -- between fixed area states with one versus two fixed areas, which may be of independent interest. We discuss, throughout the paper, connections to the general theory of multipartite entanglement in holography.

hep-th↗

arXiv2021

Automatic Knowledge Extraction with Human Interface

OrbWeaver, an automatic knowledge extraction system paired with a human interface, streamlines the use of unintuitive natural language processing software for modeling systems from their documentation. OrbWeaver enables the indirect transfer of knowledge about legacy systems by leveraging open source tools in document understanding and processing as well as using web based user interface constructs. By design, OrbWeaver is scalable, extensible, and usable; we demonstrate its utility by evaluating its performance in processing a corpus of documents related to advanced persistent threats in the cyber domain. The results indicate better knowledge extraction by revealing hidden relationships, linking co-related entities, and gathering evidence.

cs.HC↗

arXiv2020

Recycling qubits in near-term quantum computers

Quantum computers are capable of efficiently contracting unitary tensor networks, a task that is likely to remain difficult for classical computers. For instance, networks based on matrix product states or the multi-scale entanglement renormalization ansatz (MERA) can be contracted on a small quantum computer to aid the simulation of a large quantum system. However, without the ability to selectively reset qubits, the associated spatial cost can be exorbitant. In this paper, we propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form, thus dramatically reducing the spatial cost for implementing the contraction algorithm on general near-term quantum computers. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use. In the absence of noise, we prove that the state of a subset of these qubits becomes $|0\ldots 0\rangle$, up to an error exponentially small in the number of gates applied. We also provide a numerical evidence that the protocol works in the presence of noise. We also provide a numerical evidence that the protocol works in the presence of noise, and formulate a condition under which the noise-resilience follows rigorously.

quant-ph↗

arXiv2020

Black hole microstates vs. the additivity conjectures

We argue that one of the following statements must be true: (a) extensive violations of quantum information theory's additivity conjectures exist or (b) there exists a set of `disentangled' black hole microstates that can account for the entire Bekenstein-Hawking entropy, up to at most a subleading $O(1)$ correction. Possibility (a) would be a significant result in quantum communication theory, demonstrating that entanglement can enhance the ability to transmit information much more than has currently been established. Option (b) would provide new insight into the microphysics of black holes. In particular, the disentangled microstates would have to have nontrivial structure at or outside the black hole horizon, assuming the validity of the quantum extremal surface prescription for calculating entanglement entropy in AdS/CFT.

hep-th↗

arXiv2020

A Quantum Multiparty Packing Lemma and the Relay Channel

Optimally encoding classical information in a quantum system is one of the oldest and most fundamental challenges of quantum information theory. Holevo's bound places a hard upper limit on such encodings, while the Holevo-Schumacher-Westmoreland (HSW) theorem addresses the question of how many classical messages can be "packed" into a given quantum system. In this article, we use Sen's recent quantum joint typicality results to prove a one-shot multiparty quantum packing lemma generalizing the HSW theorem. The lemma is designed to be easily applicable in many network communication scenarios. As an illustration, we use it to straightforwardly obtain quantum generalizations of well-known classical coding schemes for the relay channel: multihop, coherent multihop, decode-forward, and partial decode-forward. We provide both finite blocklength and asymptotic results, the latter matching existing classical formulas. Given the key role of the classical packing lemma in network information theory, our packing lemma should help open the field to direct quantum generalization.

quant-ph↗

arXiv2020

Learning the Alpha-bits of Black Holes

When the bulk geometry in AdS/CFT contains a black hole, the boundary reconstruction of a given bulk operator will often necessarily depend on the choice of black hole microstate, an example of state dependence. As a result, whether a given bulk operator can be reconstructed on the boundary at all can depend on whether the black hole is described by a pure state or thermal ensemble. We refine this dichotomy, demonstrating that the same boundary operator can often be used for large subspaces of black hole microstates, corresponding to a constant fraction $α$ of the black hole entropy. In the Schrodinger picture, the boundary subregion encodes the $α$-bits (a concept from quantum information) of a bulk region containing the black hole and bounded by extremal surfaces. These results have important consequences for the structure of AdS/CFT and for quantum information. Firstly, they imply that the bulk reconstruction is necessarily only approximate and allow us to place non-perturbative lower bounds on the error when doing so. Second, they provide a simple and tractable limit in which the entanglement wedge is state-dependent, but in a highly controlled way. Although the state dependence of operators comes from ordinary quantum error correction, there are clear connections to the Papadodimas-Raju proposal for understanding operators behind black hole horizons. In tensor network toy models of AdS/CFT, we see how state dependence arises from the bulk operator being `pushed' through the black hole itself. Finally, we show that black holes provide the first `explicit' examples of capacity-achieving $α$-bit codes. Unintuitively, Hawking radiation always reveals the $α$-bits of a black hole as soon as possible. In an appendix, we apply a result from the quantum information literature to prove that entanglement wedge reconstruction can be made exact to all orders in $1/N$.

hep-th↗

arXiv2019

Localizing and excluding quantum information; or, how to share a quantum secret in spacetime

When can quantum information be localized to each of a collection of spacetime regions, while also excluded from another collection of regions? We answer this question by defining and analyzing the localize-exclude task, in which a quantum system must be localized to a collection of authorized regions while also being excluded from a set of unauthorized regions. This task is a spacetime analogue of quantum secret sharing, with authorized and unauthorized regions replacing authorized and unauthorized sets of parties. Our analysis yields the first quantum secret sharing scheme for arbitrary access structures for which the number of qubits required scales polynomially with the number of authorized sets. We also study a second related task called state-assembly, in which shares of a quantum system are requested at sets of spacetime points. We fully characterize the conditions under which both the localize-exclude and state-assembly tasks can be achieved, and give explicit protocols. Finally, we propose a cryptographic application of these tasks which we call party-independent transfer.

quant-ph↗

arXiv2019

Quantum Virtual Cooling

We propose a quantum information based scheme to reduce the temperature of quantum many-body systems, and access regimes beyond the current capability of conventional cooling techniques. We show that collective measurements on multiple copies of a system at finite temperature can simulate measurements of the same system at a lower temperature. This idea is illustrated for the example of ultracold atoms in optical lattices, where controlled tunnel coupling and quantum gas microscopy can be naturally combined to realize the required collective measurements to access a lower, virtual temperature. Our protocol is experimentally implemented for a Bose-Hubbard model on up to 12 sites, and we successfully extract expectation values of observables at half the temperature of the physical system. Additionally, we present related techniques that enable the extraction of zero-temperature states directly.

quant-ph↗

arXiv2019

Bit Threads and Holographic Monogamy

Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using the concept of a so-called multicommodity flow, adapted from the network setting, and tools from the theory of convex optimization. Based on the bit thread picture, we conjecture a general ansatz for a holographic state, involving only bipartite and perfect-tensor type entanglement, for any decomposition of the boundary into four regions. We also give new proofs of analogous theorems on networks.

hep-th↗

arXiv2019

Continuous symmetries and approximate quantum error correction

Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here we study the compatibility of these two important principles. If a logical quantum system is encoded into $n$ physical subsystems, we say that the code is covariant with respect to a symmetry group $G$ if a $G$ transformation on the logical system can be realized by performing transformations on the individual subsystems. For a $G$-covariant code with $G$ a continuous group, we derive a lower bound on the error correction infidelity following erasure of a subsystem. This bound approaches zero when the number of subsystems $n$ or the dimension $d$ of each subsystem is large. We exhibit codes achieving approximately the same scaling of infidelity with $n$ or $d$ as the lower bound. Leveraging tools from representation theory, we prove an approximate version of the Eastin-Knill theorem: If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then, for each logical qubit, we need a number of physical qubits per subsystem that is inversely proportional to the error parameter. We construct codes covariant with respect to the full logical unitary group, achieving good accuracy for large $d$ (using random codes) or $n$ (using codes based on $W$-states). We systematically construct codes covariant with respect to general groups, obtaining natural generalizations of qubit codes to, for instance, oscillators and rotors. In the context of the AdS/CFT correspondence, our approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and our five-rotor code can be stacked to form a covariant holographic code.

quant-ph↗

arXiv2018

Entanglement Wedge Reconstruction via Universal Recovery Channels

We apply and extend the theory of universal recovery channels from quantum information theory to address the problem of entanglement wedge reconstruction in AdS/CFT. It has recently been proposed that any low-energy local bulk operators in a CFT boundary region's entanglement wedge can be reconstructed on that boundary region itself. Existing work arguing for this proposal relies on algebraic consequences of the exact equivalence between bulk and boundary relative entropies, namely the theory of operator algebra quantum error correction. However, bulk and boundary relative entropies are only approximately equal in bulk effective field theory, and in similar situations it is known that predictions from exact entropic equalities can be qualitatively incorrect. The framework of universal recovery channels provides a robust demonstration of the entanglement wedge reconstruction conjecture in addition to new physical insights. Most notably, we find that a bulk operator acting in a given boundary region's entanglement wedge can be expressed as the response of the boundary region's modular Hamiltonian to a perturbation of the bulk state in the direction of the bulk operator. This formula can be interpreted as a noncommutative version of Bayes' rule that attempts to undo the noise induced by restricting to only a portion of the boundary, and has an integral representation in terms of modular flows. To reach these conclusions, we extend the theory of universal recovery channels to finite-dimensional operator algebras and demonstrate that recovery channels approximately preserve the multiplicative structure of the operator algebra.

hep-th↗

arXiv2018

Approximate Quantum Error Correction Revisited: Introducing the Alpha-bit

We establish that, in an appropriate limit, qubits of communication should be regarded as composite resources, decomposing cleanly into independent correlation and transmission components. Because qubits of communication can establish ebits of entanglement, qubits are more powerful resources than ebits. We identify a new communications resource, the zero-bit, which is precisely half the gap between them, replacing classical bits by zero-bits makes teleportation asymptotically reversible. The decomposition of a qubit into an ebit and two zero-bits has wide-ranging consequences including applications to state merging, the quantum channel capacity, entanglement distillation, quantum identification and remote state preparation. The source of these results is the theory of approximate quantum error correction. The action of a quantum channel is reversible if and only if no information is leaked to the environment, a characterization that is useful even in approximate form. However, different notions of approximation lead to qualitatively different forms of quantum error correction in the limit of large dimension. We study the effect of a constraint on the dimension of the reference system when considering information leakage. While the resulting condition fails to ensure that the entire input can be corrected, it does ensure that all subspaces of dimension matching that of the reference are correctable. The size of the reference can be characterized by a parameter $α$, we call the associated resource an $α$-bit. Changing $α$ interpolates between standard quantum error correction and quantum identification, a form of equality testing for quantum states. We develop the theory of $α$-bits, including the applications above, and determine the $α$-bit capacity of general quantum channels, finding single-letter formulas for the entanglement-assisted and amortised variants.

quant-ph↗

arXiv2017

Error Correction of Quantum Reference Frame Information

The existence of quantum error correcting codes is one of the most counterintuitive and potentially technologically important discoveries of quantum information theory. However, standard error correction refers to abstract quantum information, i.e., information that is independent of the physical incarnation of the systems used for storing the information. There are, however, other forms of information that are physical - one of the most ubiquitous being reference frame information. Here we analyze the problem of error correcting physical information. The basic question we seek to answer is whether or not such error correction is possible and, if so, what limitations govern the process. The main challenge is that the systems used for transmitting physical information, in addition to any actions applied to them, must necessarily obey these limitations. Encoding and decoding operations that obey a restrictive set of limitations need not exist a priori. We focus on the case of erasure errors, and we first show that the problem is equivalent to quantum error correction using group-covariant encodings. We prove a no-go theorem showing that that no finite dimensional, group-covariant quantum codes exist for Lie groups with an infinitesimal generator (e.g., U(1), SU(2), and SO(3)). We then explain how one can circumvent this no-go theorem using infinite dimensional codes, and we give an explicit example of a covariant quantum error correcting code using continuous variables for the group U(1). Finally, we demonstrate that all finite groups have finite dimensional codes, giving both an explicit construction and a randomized approximate construction with exponentially better parameters.

quant-ph↗

arXiv2016

Conditional Mutual Information of Bipartite Unitaries and Scrambling

One way to diagnose chaos in bipartite unitary channels is via the tripartite information of the corresponding Choi state, which for certain choices of the subsystems reduces to the negative conditional mutual information (CMI). We study this quantity from a quantum information-theoretic perspective to clarify its role in diagnosing scrambling. When the CMI is zero, we find that the channel has a special normal form consisting of local channels between individual inputs and outputs. However, we find that arbitrarily low CMI does not imply arbitrary proximity to a channel of this form, although it does imply a type of approximate recoverability of one of the inputs. When the CMI is maximal, we find that the residual channel from an individual input to an individual output is completely depolarizing when the other input is maximally mixed. However, we again find that this result is not robust. We also extend some of these results to the multipartite case and to the case of Haar-random pure input states. Finally, we look at the relationship between tripartite information and its Renyi-2 version which is directly related to out-of-time-order correlation functions. In particular, we demonstrate an arbitrarily large gap between the two quantities.

quant-ph↗

arXiv2016

A decoupling approach to the quantum capacity

We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will with high probability be decoupled from the channel's environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.

quant-ph↗

arXiv2016

Spacetime replication of continuous variable quantum information

The theory of relativity requires that no information travel faster than light, whereas the unitarity of quantum mechanics ensures that quantum information cannot be cloned. These conditions provide the basic constraints that appear in information replication tasks, which formalize aspects of the behavior of information in relativistic quantum mechanics. In this article, we provide continuous variable (CV) strategies for spacetime quantum information replication that are directly amenable to optical or mechanical implementation. We use a new class of homologically-constructed CV quantum error correcting codes to provide efficient solutions for the general case of information replication. As compared to schemes encoding qubits, our CV solution requires half as many shares per encoded system. We also provide an optimized five-mode strategy for replicating quantum information in a particular configuration of four spacetime regions designed not to be reducible to previously performed experiments. For this optimized strategy, we provide detailed encoding and decoding procedures using standard optical apparatus and calculate the recovery fidelity when finite squeezing is used. As such we provide a scheme for experimentally realizing quantum information replication using quantum optics.

quant-ph↗