A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

The manner in which states of some quantum systems become effectively classical is of
great significance for the foundations of quantum physics, as well as for problems of …

Practical quantum computing will require error rates well below those achievable with
physical qubits. Quantum error correction, offers a path to algorithmically relevant error rates …

Gate-model quantum computers promise to solve currently intractable computational
problems if they can be operated at scale with long coherence times and high-fidelity logic …

Finally, here is a modern, self-contained text on quantum information theory suitable for
graduate-level courses. Develo** the subject'from the ground up'it covers classical results …

A digital computer is generally believed to be an efficient universal computing device; that is,
it is believed to be able to simulate any physical computing device with an increase in …

Quantum computers promise to increase greatly the efficiency of solving problems such as
factoring large integers, combinatorial optimization and quantum physics simulation. One of …

The field of quantum algorithms aims to find ways to speed up the solution of computational
problems by using a quantum computer. A key milestone in this field will be when a …

In quantum communication via noisy channels, the error probability scales exponentially
with the length of the channel. We present a scheme of a quantum repeater that overcomes …

Quantum communication holds promise for absolutely secure transmission of secret
messages and the faithful transfer of unknown quantum states. Photonic channels appear to …