activity
19972011
most citedQuantum algorithm for solving linear systems of equations

3.4k citations · 9.1k across the 39 of their papers we have counts for

collaborators
Showing 2008 · quant-phShow all

13 papers · 2 filters

quant-ph20083.4k cited

Quantum algorithm for solving linear systems of equations

Aram W. Harrow, Avinatan Hassidim, Seth Lloyd

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x s…

quant-ph2008707 cited

Quantum Illumination with Gaussian States

Si-Hui Tan, Baris I. Erkmen, Vittorio Giovannetti +5

An optical transmitter irradiates a target region containing a bright thermal-noise bath in which a low-reflectivity object might be embedded. The light received from this region i…

quant-ph2008252 cited

Direct and Reverse Secret-Key Capacities of a Quantum Channel

Stefano Pirandola, Raul Garcia-Patron, Samuel L. Braunstein +1

We define the direct and reverse secret-key capacities of a memoryless quantum channel as the optimal rates that entanglement-based quantum key distribution protocols can reach by…

quant-ph2008153 cited

Computable bounds for the discrimination of Gaussian states

Stefano Pirandola, Seth Lloyd

By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gauss…

quant-ph2008317 cited

Architectures for a quantum random access memory

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone

A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superp…

quant-ph2008

Security of two-way quantum cryptography against asymmetric Gaussian attacks

Stefano Pirandola, Stefano Mancini, Seth Lloyd +1

Recently, we have shown the advantages of two-way quantum communications in continuous variable quantum cryptography. Thanks to this new approach, two honest users can achieve a no…