arXiv subjects

Seth Lloyd

Publications and source records attributed to Seth Lloyd.

At least 127 records · Page 7Linked to original sources

arXiv2015

The multi-mode quantum Entropy Power Inequality

The quantum version of a fundamental entropic data-processing inequality is presented. It establishes a lower bound for the entropy that can be generated in the output channels of a scattering process, which involves a collection of independent input bosonic modes (e.g., the modes of the electromagnetic field). The impact of this inequality in quantum information theory is potentially large and some relevant implications are considered in this work.

quant-ph↗

arXiv2014

Analysis of a work of quantum art

This paper provides a quantum-mechanical analysis of an artwork, `Wigner's friends,' by Diemut Strebe. The work consists of two telescopes, one on earth, one launched into space, and explores ideas of quantum correlations and quantum measurement. This paper examines the scientific basis of the work and analyzes the form of quantum correlation between the two telescope systems.

physics.pop-ph↗

arXiv2014

Optimality of Gaussian Discord

In this Letter we exploit the recently-solved conjecture on the bosonic minimum output entropy to show the optimality of Gaussian discord, so that the computation of quantum discord for bipartite Gaussian states can be restricted to local Gaussian measurements. We prove such optimality for a large family of Gaussian states, including all two-mode squeezed thermal states, which are the most typical Gaussian states realized in experiments. Our family also includes other types of Gaussian states and spans their entire set in a suitable limit where they become Choi-matrices of Gaussian channels. As a result, we completely characterize the quantum correlations possessed by some of the most important bosonic states in quantum optics and quantum information.

quant-ph↗

arXiv2014

Quantum-locked key distribution at nearly the classical capacity rate

Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.

quant-ph↗

arXiv2014

Robust quantum data locking from phase modulation

Quantum data locking is a unique quantum phenomenon that allows a relatively short key to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the encrypted message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the shared key by a proportionate amount. This implies that a constant size key can still encrypt an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random codewords, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.

quant-ph↗

arXiv2014

Quantum brachistochrone curves as geodesics: obtaining accurate control protocols for time-optimal quantum gates

Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. With this identification we are able to obtain a numerical method that efficiently solves the brachistochrone problem. We apply it to two examples demonstrating its power.

quant-ph↗

arXiv2014

Universal quantum computation in integrable systems

Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled selectively by the global control to induce universal quantum logic gates. By contrast, chaotic quantum systems, even if controllable, do not generically allow quantum computation under global control.

quant-ph↗

arXiv2014

High-rate quantum cryptography in untrusted networks

We extend the field of continuous-variable quantum cryptography to a network formulation where two honest parties connect to an untrusted relay by insecure quantum links. To generate secret correlations, they transmit coherent states to the relay where a continuous-variable Bell detection is performed and the outcome broadcast. Even though the detection could be fully corrupted and the links subject to optimal coherent attacks, the honest parties can still extract a secret key, achieving high rates when the relay is proximal to one party, as typical in public networks with access points or proxy servers. Our theory is confirmed by an experiment generating key-rates which are orders of magnitude higher than those achievable with discrete-variable protocols. Thus, using the cheapest possible quantum resources, we experimentally show the possibility of high-rate quantum key distribution in network topologies where direct links are missing between end-users and intermediate relays cannot be trusted.

quant-ph↗

arXiv2014

Unitarity of black hole evaporation in final-state projection models

Almheiri et al. have emphasized that otherwise reasonable beliefs about black hole evaporation are incompatible with the monogamy of quantum entanglement, a general property of quantum mechanics. We investigate the final-state projection model of black hole evaporation proposed by Horowitz and Maldacena, pointing out that this model admits cloning of quantum states and polygamous entanglement, allowing unitarity of the evaporation process to be reconciled with smoothness of the black hole event horizon. Though the model seems to require carefully tuned dynamics to ensure exact unitarity of the black hole S-matrix, for a generic final-state boundary condition the deviations from unitarity are exponentially small in the black hole entropy; furthermore observers inside black holes need not detect any deviations from standard quantum mechanics. Though measurements performed inside old black holes could potentially produce causality-violating phenomena, the computational complexity of decoding the Hawking radiation may render the causality violation unobservable. Final-state projection models illustrate how inviolable principles of standard quantum mechanics might be circumvented in a theory of quantum gravity.

hep-th↗

arXiv2014

Quantum support vector machine for big data classification

Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases when classical sampling algorithms require polynomial time, an exponential speed-up is obtained. At the core of this quantum big data algorithm is a non-sparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.

quant-ph↗

arXiv2014

Simplicial Ricci Flow: An Example of a Neck Pinch Singularity in 3D

We examine a Type-1 neck pinch singularity in simplicial Ricci flow (SRF) for an axisymmetric piecewise flat 3-dimensional geometry with 3-sphere topology. SRF was recently introduced as an unstructured mesh formulation of Hamilton's Ricci flow (RF). It describes the RF of a piecewise-flat simplicial geometry. In this paper, we apply the SRF equations to a representative double-lobed axisymmetric piecewise flat geometry with mirror symmetry at the neck similar to the geometry studied by Angenent and Knopf (A-K). We choose a specific radial profile and compare the SRF equations with the corresponding finite-difference solution of the continuum A-K RF equations. The piecewise-flat 3-geometries considered here are built of isosceles-triangle-based frustum blocks. The axial symmetry of this model allows us to use frustum blocks instead of tetrahedra. The 2-sphere cross-sectional geometries in our model are regular icosahedra. We demonstrate that, under a suitably-pinched initial geometry, the SRF equations for this relatively low-resolution discrete geometry yield the canonical Type-1 neck pinch singularity found in the corresponding continuum solution. We adaptively remesh during the evolution to keep the circumcentric dual lattice well-centered. Without such remeshing, we cannot evolve the discrete geometry to neck pinch. We conclude with a discussion of future generalizations and tests of this SRF model.

math.DG↗

arXiv2014

Maximally strong entropic uncertainty relations and gauge invariance

Uncertainty relations are among the unique fingerprints of quantum physics, being direct expression of non-commutativity and complementarity. Entropic uncertainty relations arise in quantum information theory as the most natural expression of the uncertainty principle and have proven themselves important tools for cryptographic security proofs. An open question has been how strong entropic uncertainty relations can be. Here we answer this question by showing that there exist observables that obey maximally strong entropic uncertainty relations in high dimensional Hilbert spaces. Actually, we show that maximally strong uncertainty relations are typically verified if the observables are distributed somehow uniformly. In particular, we show that phase randomness in a mutually unbiased basis is sufficient, providing a link between uncertainty relations and local gauge invariance. For quantum systems of finite dimensions our approach provides an explicit relation between the strength of the uncertainty and its probability.

quant-ph↗

arXiv2013

The universe as quantum computer

This article reviews the history of digital computation, and investigates just how far the concept of computation can be taken. In particular, I address the question of whether the universe itself is in fact a giant computer, and if so, just what kind of computer it is. I will show that the universe can be regarded as a giant quantum computer. The quantum computational model of the universe explains a variety of observed phenomena not encompassed by the ordinary laws of physics. In particular, the model shows that the the quantum computational universe automatically gives rise to a mix of randomness and order, and to both simple and complex systems.

quant-ph↗

arXiv2013

Uncomputability and physical law

This article addresses the question of when physical laws and their consequences can be computed. If a physical system is capable of universal computation, then its energy gap can't be computed. At an even more fundamental level, the most concise, simply applicable formulation of the underlying laws of physics is uncomputable. That is, physicists are in the same boat as mathematicians: many quantities of interest can be computed, but not all.

quant-ph↗

arXiv2013

Quantum enigma machines and the locking capacity of a quantum channel

The locking effect is a phenomenon which is unique to quantum information theory and represents one of the strongest separations between the classical and quantum theories of information. The Fawzi-Hayden-Sen (FHS) locking protocol harnesses this effect in a cryptographic context, whereby one party can encode n bits into n qubits while using only a constant-size secret key. The encoded message is then secure against any measurement that an eavesdropper could perform in an attempt to recover the message, but the protocol does not necessarily meet the composability requirements needed in quantum key distribution applications. In any case, the locking effect represents an extreme violation of Shannon's classical theorem, which states that information-theoretic security holds in the classical case if and only if the secret key is the same size as the message. Given this intriguing phenomenon, it is of practical interest to study the effect in the presence of noise, which can occur in the systems of both the legitimate receiver and the eavesdropper. This paper formally defines the locking capacity of a quantum channel as the maximum amount of locked information that can be reliably transmitted to a legitimate receiver by exploiting many independent uses of a quantum channel and an amount of secret key sublinear in the number of channel uses. We provide general operational bounds on the locking capacity in terms of other well-known capacities from quantum Shannon theory. We also study the important case of bosonic channels, finding limitations on these channels' locking capacity when coherent-state encodings are employed and particular locking protocols for these channels that might be physically implementable.

quant-ph↗

arXiv2013

Quantum algorithms for supervised and unsupervised machine learning

Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take time polynomial in the number of vectors and the dimension of the space. Quantum computers are good at manipulating high-dimensional vectors in large tensor product spaces. This paper provides supervised and unsupervised quantum machine learning algorithms for cluster assignment and cluster finding. Quantum machine learning can take time logarithmic in both the number of vectors and their dimension, an exponential speed-up over classical algorithms.

quant-ph↗

arXiv2013

A Turing test for free will

Before Alan Turing made his crucial contributions to the theory of computation, he studied the question of whether quantum mechanics could throw light on the nature of free will. This article investigates the roles of quantum mechanics and computation in free will. Although quantum mechanics implies that events are intrinsically unpredictable, the `pure stochasticity' of quantum mechanics adds only randomness to decision making processes, not freedom. By contrast, the theory of computation implies that even when our decisions arise from a completely deterministic decision-making process, the outcomes of that process can be intrinsically unpredictable, even to -- especially to -- ourselves. I argue that this intrinsic computational unpredictability of the decision making process is what give rise to our impression that we possess free will. Finally, I propose a `Turing test' for free will: a decision maker who passes this test will tend to believe that he, she, or it possesses free will, whether the world is deterministic or not.

quant-ph↗

arXiv2013

Quantum principal component analysis

The usual way to reveal properties of an unknown quantum state, given many copies of a system in that state, is to perform measurements of different observables and to analyze the measurement results statistically. Here we show that the unknown quantum state can play an active role in its own analysis. In particular, given multiple copies of a quantum system with density matrix ρ, then it is possible to perform the unitary transformation e^{-iρt}. As a result, one can create quantum coherence among different copies of the system to perform quantum principal component analysis, revealing the eigenvectors corresponding to the large eigenvalues of the unknown state in time exponentially faster than any existing algorithm.

quant-ph↗