2003Unpublished venueRequires access

Quantum communication and quantum computing

P. L. Knight

Open publisher page 20 citations

Abstract

Summary form only given. Quantum mechanics offers the information scientist a new rich resource, which is only recently being tapped to allow for secure communication in the form of quantum cryptography, and for tremendous parallelism in quantum information processing and computing. I will describe developments and prospects for each. Quantum cryptography has already advanced beyond the research laboratory to become a realizable technology with proven secret key distribution for encryption. Quantum computing, although at an earlier stage of development has been recognized as a major new development in physics, enables us (if a quantum computer is realizable) to attack problems previously thought to be too complex for normal computation in a reasonable time. Examples of quantum algorithms involving this kind of advantage are Shor's for fast factorization (in itself a threat to secure communication) and Grover's for data base searching. I will discuss the ways quantum mechanics allow such a speed-up, stressing how quantum entanglement is the key resource being exploited, and how quantum gates, networks, and the processors may be implemented in a realistically noisy environment. Simple demonstrators have already been built, and I will discuss prospects for future realization of large-scale processors.

About this research paper

What this paper is about

Summary form only given. Quantum mechanics offers the information scientist a new rich resource, which is only recently being tapped to allow for secure communication in the form of quantum cryptography, and for tremendous parallelism in quantum information processing and computing. I will describe developments and prospects for each. Quantum cryptography has already advanced beyond the research laboratory to become a realizable technology with proven secret key distribution for encryption. Quantum computing, although at an earlier stage of development has been recognized as a major new development in physics, enables us (if a quantum computer is realizable) to attack problems previously thought to be too complex for normal computation in a reasonable time. Examples of quantum algorithms involving this kind of advantage are Shor's for fast factorization (in itself a threat to secure communication) and Grover's for data base searching. I will discuss the ways quantum mechanics allow such a speed-up, stressing how quantum entanglement is the key resource being exploited, and how quantum gates, networks, and the processors may be implemented in a realistically noisy environment. Simple demonstrators have already been built, and I will discuss prospects for future realization of large-scale processors.

Why it matters

OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Summary form only given. Quantum mechanics offers the information scientist a new rich resource, which is only recently being tapped to allow for secure communication in the form of quantum cryptography, and for tremendous parallelism in quantum information processing and computing. I will describe developments and prospects for each. Quantum cryptography has already advanced beyond the research laboratory to become a realizable technology with proven secret key distribution for encryption. Quantum computing, although at an earlier stage of development has been recognized as a major new development in physics, enables us (if a quantum computer is realizable) to attack problems previously thought to be too complex for normal computation in a reasonable time. Examples of quantum algorithms involving this kind of advantage are Shor's for fast factorization (in itself a threat to secure communication) and Grover's for data base searching. I will discuss the ways quantum mechanics allow such a speed-up, stressing how quantum entanglement is the key resource being exploited, and how quantum gates, networks, and the processors may be implemented in a realistically noisy environment. Simple demonstrators have already been built, and I will discuss prospects for future realization of large-scale processors.

Key concepts: Computer science, Quantum computer, Quantum, Quantum information science, Quantum network, Physics, Quantum mechanics, Quantum entanglement

Related papers

Back to paper searchBrowse research topicsOriginal source
Quantum communication and quantum computing — Research Paper | ScholarLens