Quantum computations: algorithms and error correction
AY Kitaev - Russian Mathematical Surveys, 1997 - iopscience.iop.org
Abstract Contents § 0. Introduction § 1. Abelian problem on the stabilizer § 2. Classical
models of computations 2.1. Boolean schemes and sequences of operations 2.2. Reversible …
models of computations 2.1. Boolean schemes and sequences of operations 2.2. Reversible …
Information and computation: Classical and quantum aspects
A Galindo, MA Martin-Delgado - Reviews of Modern Physics, 2002 - APS
Quantum theory has found a new field of application in the realm of information and
computation during recent years. This paper reviews how quantum physics allows …
computation during recent years. This paper reviews how quantum physics allows …
Learning quantum states and unitaries of bounded gate complexity
While quantum state tomography is notoriously hard, most states hold little interest to
practically minded tomographers. Given that states and unitaries appearing in nature are of …
practically minded tomographers. Given that states and unitaries appearing in nature are of …
Distillation of secret key and entanglement from quantum states
I Devetak, A Winter - Proceedings of the Royal Society A …, 2005 - royalsocietypublishing.org
We study and solve the problem of distilling a secret key from quantum states representing
correlation between two parties (Alice and Bob) and an eavesdropper (Eve) via one–way …
correlation between two parties (Alice and Bob) and an eavesdropper (Eve) via one–way …
[图书][B] Quantum entropy and its use
M Ohya, D Petz - 2004 - books.google.com
Entropy is a concept which appears in several fields and it is in the center of interest both in
mathematical and physical subjects, sometimes even at other places, for example in …
mathematical and physical subjects, sometimes even at other places, for example in …
Classical-communication cost in distributed quantum-information processing: a generalization of quantum-communication complexity
HK Lo - Physical Review A, 2000 - APS
We study the amount of classical communication needed for distributed quantum-
information processing. In particular, we introduce the concept of “remote preparation” of a …
information processing. In particular, we introduce the concept of “remote preparation” of a …
Efficient quantum key distribution scheme and a proof of its unconditional security
HK Lo, HF Chau, M Ardehali - Journal of Cryptology, 2005 - Springer
We devise a simple modification that essentially doubles the efficiency of the BB84 quantum
key distribution scheme proposed by Bennett and Brassard. We also prove the security of …
key distribution scheme proposed by Bennett and Brassard. We also prove the security of …
Sufficient subalgebras and the relative entropy of states of a von Neumann algebra
D Petz - Communications in mathematical physics, 1986 - Springer
A subalgebra M 0 of a von Neumann algebra M is called weakly sufficient with respect to a
pair (φ, ω) of states if the relative entropy of φ and ω coincides with the relative entropy of …
pair (φ, ω) of states if the relative entropy of φ and ω coincides with the relative entropy of …
[图书][B] Quantum trajectories and measurements in continuous time: the diffusive case
A Barchielli, M Gregoratti - 2009 - books.google.com
This course-based monograph introduces the reader to the theory of continuous
measurements in quantum mechanics and provides some benchmark applications. The …
measurements in quantum mechanics and provides some benchmark applications. The …
Proof of security of quantum key distribution with two-way classical communications
D Gottesman, HK Lo - IEEE Transactions on Information Theory, 2003 - ieeexplore.ieee.org
Shor and Preskill (see Phys. Rev. Lett., vol. 85, p. 441, 2000) have provided a simple proof
of security of the standard quantum key distribution scheme by Bennett and Brassard (1984) …
of security of the standard quantum key distribution scheme by Bennett and Brassard (1984) …