# Fault-tolerant quantum computation

@article{Shor1996FaulttolerantQC, title={Fault-tolerant quantum computation}, author={P. Shor}, journal={Proceedings of 37th Conference on Foundations of Computer Science}, year={1996}, pages={56-65} }

It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate… CONTINUE READING

#### Topics from this paper.

#### Paper Mentions

534 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 58 REFERENCES

Algorithms for quantum computation: discrete logarithms and factoring

- Computer Science, Mathematics
- 1994

4528