Quantum computation

We describe how physics of computation determines computational complexity. In particular we show how quantum phenomena lead to qualitatively new modes of computation. An ideal quantum computer would allow to face certain tasks out of reach of classical computers, the factorization problem being the...

Full description

Bibliographic Details
Main Authors: Barenco, A, Huelga, S, Ekert, A
Format: Conference item
Published: 1997
_version_ 1826256883863781376
author Barenco, A
Huelga, S
Ekert, A
author_facet Barenco, A
Huelga, S
Ekert, A
author_sort Barenco, A
collection OXFORD
description We describe how physics of computation determines computational complexity. In particular we show how quantum phenomena lead to qualitatively new modes of computation. An ideal quantum computer would allow to face certain tasks out of reach of classical computers, the factorization problem being the most striking example. Experimentally, however, implementation of quantum computation faces some serious difficulties due to an interaction with the environment which causes decoherence. We mention quantum error-correction as a process which can, to some extent, protect quantum computers from unwelcome effects of dissipation and decoherence. This is a brief, introductory review of quantum computation. It is based on [1].
first_indexed 2024-03-06T18:09:21Z
format Conference item
id oxford-uuid:02776621-54c0-46f7-b2b2-e46564d4d8ba
institution University of Oxford
last_indexed 2024-03-06T18:09:21Z
publishDate 1997
record_format dspace
spelling oxford-uuid:02776621-54c0-46f7-b2b2-e46564d4d8ba2022-03-26T08:40:53ZQuantum computationConference itemhttp://purl.org/coar/resource_type/c_5794uuid:02776621-54c0-46f7-b2b2-e46564d4d8baSymplectic Elements at Oxford1997Barenco, AHuelga, SEkert, AWe describe how physics of computation determines computational complexity. In particular we show how quantum phenomena lead to qualitatively new modes of computation. An ideal quantum computer would allow to face certain tasks out of reach of classical computers, the factorization problem being the most striking example. Experimentally, however, implementation of quantum computation faces some serious difficulties due to an interaction with the environment which causes decoherence. We mention quantum error-correction as a process which can, to some extent, protect quantum computers from unwelcome effects of dissipation and decoherence. This is a brief, introductory review of quantum computation. It is based on [1].
spellingShingle Barenco, A
Huelga, S
Ekert, A
Quantum computation
title Quantum computation
title_full Quantum computation
title_fullStr Quantum computation
title_full_unstemmed Quantum computation
title_short Quantum computation
title_sort quantum computation
work_keys_str_mv AT barencoa quantumcomputation
AT huelgas quantumcomputation
AT ekerta quantumcomputation