Searcharxiv⌕ Search

arXiv subjects

Seth Lloyd

Publications and source records attributed to Seth Lloyd.

At least 199 records · Page 11Linked to original sources
arXiv2008

Quantum Illumination

The use of entangled light to illuminate objects is shown to provide significant enhancements over unentangled light for detecting and imaging those objects in the presence of high levels of noise and loss. Each signal sent out is entangled with an ancilla, which is retained. Detection takes place via an entangling measurement on the returning signal together with the ancilla. Quantum illumination with e bits of entanglement increases the effective signal-to-noise ratio of detection and imaging by a factor of 2^e, an exponential improvement over unentangled illumination.

quant-ph↗
arXiv2008

Quantum coding theorem from privacy and distinguishability

We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

quant-ph↗
arXiv2007

Quantum private queries

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the server in possession of the database without revealing which item she retrieved: if the server tries to obtain information on the query, the person querying the database can find it out. Furthermore our protocol ensures perfect data privacy of the database, i.e. the information that the user can retrieve in a single queries is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction both in communication complexity and in running-time computational complexity.

quant-ph↗
arXiv2007

A simple evolutionary game with feedback between perception and reality

We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which perception affects reality. By varying the `reality map', which relates the amount wagered to the probability of the outcome, it is possible to move continuously from a purely objective game in which probabilities have no dependence on wagers, to a purely subjective game in which probabilities equal the amount wagered. The reality map can reflect self-reinforcing strategies or self-defeating strategies. In self-reinforcing games, rational players can achieve increasing returns and manipulate the outcome probabilities to their advantage; consequently, an early lead in the game, whether acquired by chance or by strategy, typically gives a persistent advantage. We investigate the game both in and out of equilibrium and with and without rational players. We introduce a method of measuring the inefficiency of the game and show that in the large time limit the inefficiency decreases slowly in its approach to equilibrium as a power law with an exponent between zero and one, depending on the subjectivity of the game.

physics.soc-ph↗
arXiv2006

Macroscopic Entanglement by Entanglement Swapping

We present a scheme for entangling two micromechanical oscillators. The scheme exploits the quantum effects of radiation pressure and it is based on a novel application of entanglement swapping, where standard optical measurements are used to generate purely mechanical entanglement. The scheme is presented by first solving the general problem of entanglement swapping between arbitrary bipartite Gaussian states, for which simple input-output formulas are provided.

quant-ph↗
arXiv2006

Interferometric tunability of the absorption

We propose an interferometric setup that permits to tune the quantity of radiation absorbed by an object illuminated by a fixed light source. The method can be used to selectively irradiate portions of an object based on their transmissivities or to accurately estimate the transmissivities from rough absorption measurements.

quant-ph↗
arXiv2005

Convergence Conditions for Random Quantum Circuits

Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.

quant-ph↗
arXiv2005

Quantum metrology

We point out a general framework that encompasses most cases in which quantum effects enable an increase in precision when estimating a parameter (quantum metrology). The typical quantum precision-enhancement is of the order of the square root of the number of times the system is sampled. We prove that this is optimal and we point out the different strategies (classical and quantum) that permit to attain this bound.

quant-ph↗
arXiv2005

Decoherent histories and generalized measurements

The theory of decoherent histories allows one to talk of the behavior of quantum systems in the absence of measurement. This paper generalizes the idea of decoherent histories to arbitrary open system operations and proposes experimentally testable criteria for decoherence.

quant-ph↗
arXiv2005

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the central issues in quantum computation, namely designing new quantum algorithms and constructing fault tolerant quantum computers. In particular, by translating the main open questions in the area of quantum algorithms to the language of spectral gaps of sparse matrices, the result makes these questions accessible to a wider scientific audience, acquainted with mathematical physics, expander theory and rapidly mixing Markov chains.

quant-ph↗
arXiv2005

Conditions for the multiplicativity of maximal l_p-norms of channels for fixed integer p

We introduce a condition for memoryless quantum channels which, when satisfied guarantees the multiplicativity of the maximal l_p-norm with p a fixed integer. By applying the condition to qubit channels, it can be shown that it is not a necessary condition, although some known results for qubits can be recovered. When applied to the Werner-Holevo channel, which is known to violate multiplicativity when p is large relative to the dimension d, the condition suggests that multiplicativity holds when $d \geqslant 2^{p-1}$. This conjecture is proved explicitly for p=2, 3, 4. Finally, a new class of channels is considered which generalizes the depolarizing channel to maps which are combinations of the identity channel and a noisy one whose image is an arbitrary density matrix. It is shown that these channels are multiplicative for p = 2.

quant-ph↗
arXiv2004

Quantum-enhanced measurements: beating the standard quantum limit

Quantum mechanics, through the Heisenberg uncertainty principle, imposes limits to the precision of measurement. Conventional measurement techniques typically fail to reach these limits. Conventional bounds to the precision of measurements such as the shot noise limit or the standard quantum limit are not as fundamental as the Heisenberg limits, and can be beaten using quantum strategies that employ `quantum tricks' such as squeezing and entanglement.

quant-ph↗
arXiv2004

Entanglement Assisted Metrology

We propose a new approach to the measurement of a single spin state, based on nuclear magnetic resonance (NMR) techniques and inspired by the coherent control over many-body systems envisaged by Quantum Information Processing (QIP). A single target spin is coupled via the natural magnetic dipolar interaction to a large ensemble of spins. Applying external radio frequency (rf) pulses, we can control the evolution of the system so that the spin ensemble reaches one of two orthogonal states whose collective properties differ depending on the state of the target spin and are easily measured. We first describe this measurement process using QIP gates; then we show how equivalent schemes can be defined in terms of the Hamiltonian of the spin system and thus implemented under conditions of real control, using well established NMR techniques. We demonstrate this method with a proof of principle experiment in ensemble liquid state NMR and simulations for small spin systems.

quant-ph↗
arXiv2004

Quantum Process Tomography of the Quantum Fourier Transform

The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented, and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The quantum operation studied was the quantum Fourier transform, which is important in several quantum algorithms and poses a rigorous test for the precision of our recently-developed strongly modulating control fields. The results were analyzed in an attempt to decompose the implementation errors into coherent (overall systematic), incoherent (microscopically deterministic), and decoherent (microscopically random) components. This analysis yielded a superoperator consisting of a unitary part that was strongly correlated with the theoretically expected unitary superoperator of the quantum Fourier transform, an overall attenuation consistent with decoherence, and a residual portion that was not completely positive - although complete positivity is required for any quantum operation. By comparison with the results of computer simulations, the lack of complete positivity was shown to be largely a consequence of the incoherent errors during the quantum process tomography procedure. These simulations further showed that coherent, incoherent, and decoherent errors can often be identified by their distinctive effects on the spectrum of the overall superoperator. The gate fidelity of the experimentally determined superoperator was 0.64, while the correlation coefficient between experimentally determined superoperator and the simulated superoperator was 0.79; most of the discrepancies with the simulations could be explained by the cummulative effect of small errors in the single qubit gates.

quant-ph↗
arXiv2004

Almost Certain Escape from Black Holes

This paper examines how black holes might compute in light of recent models of the black-hole final state. These models suggest that quantum information can escape from the black hole by a process akin to teleportation. They require a specific final state and restrictions on the interaction between the collapsing matter and the incoming Hawking radiation for quantum information to escape. This paper shows that for an arbitrary final state and for generic interactions between matter and Hawking radiation, the quantum information about how the hole was formed and the results of any computation performed by the matter inside the hole escapes with fidelity exponentially close to 1.

quant-ph↗
arXiv2004

Additivity properties of a Gaussian Channel

The Amosov-Holevo-Werner conjecture implies the additivity of the minimum Re'nyi entropies at the output of a channel. The conjecture is proven true for all Re'nyi entropies of integer order greater than two in a class of Gaussian bosonic channel where the input signal is randomly displaced or where it is coupled linearly to an external environment.

quant-ph↗
arXiv2004

Conveyor belt clock synchronization

A protocol for synchronizing distant clocks is proposed that does not rely on the arrival times of the signals which are exchanged, and an optical implementation based on coherent-state pulses is described. This protocol is not limited by any dispersion that may be present in the propagation medium through which the light signals are exchanged. Possible improvements deriving from the use of quantum-mechanical effects are also addressed.

quant-ph↗