Quantum algorithms for testing properties of distributions
Sergey Bravyi, Aram W. Harrow, et al.
STACS 2010
We ask whether there are fundamental limits on storing quantum information reliably in a bounded volume of space. To investigate this question, we study quantum error correcting codes specified by geometrically local commuting constraints on a 2D lattice of finite-dimensional quantum particles. For these 2D systems, we derive a tradeoff between the number of encoded qubits k, the distance of the code d, and the number of particles n. It is shown that kd2=O(n) where the coefficient in O(n) depends only on the locality of the constraints and dimension of the Hilbert spaces describing individual particles. The analogous tradeoff for the classical information storage is kd=O(n). © 2010 The American Physical Society.
Sergey Bravyi, Aram W. Harrow, et al.
STACS 2010
Ewout van den Berg, Sergey Bravyi, et al.
PRResearch
Christophe Piveteau, David Sutter, et al.
Physical Review Letters
Sergey Bravyi, David P. Divincenzo, et al.
Physical Review Letters