Mathematics of Quantum Computation - G. Chen, R. Brylinski (eds)
One of the most exciting developments in the scientific community these
days is the design and construction of the quantum computer (QC). A
QC stores and handles data as a collection of two-state quantum bits, or
qubits (e.g., spin 1/2 particles). Quantum computation performs calcu-
lations on data densely coded in the entangled states (of qubits) that are
the hallmark of quantum mechanics. During the 1980s, D. Deutsch, fol-
lowing the lead of P. Benioff and R. Feynman, made concrete proposals
for harnessing some of the peculiar properties of quantum mechanics to
obtain unprecedented parallelism in computation. Interest in the field
of QC has received a tremendous boost from the following two recent
results obtained by P. Shor and L. K. Grover, both researchers at Bell
Labs:
1. P. Shor's 1994 discovery of a quantum algorithm for factorization
of integers. The Shor algorithm is substantially faster than any
known classical algorithm of subexponential complexity and opens
the door to decipherment in cryptography.
2. L. K. Grover's discovery in 1996 of a quantum search algorithm
that gives a favorable optimal quadratic speed-up in the search of
a single object in a large unsorted database, which is suitable for
data mining.
One of the most exciting developments in the scientific community these
days is the design and construction of the quantum computer (QC). A
QC stores and handles data as a collection of two-state quantum bits, or
qubits (e.g., spin 1/2 particles). Quantum computation performs calcu-
lations on data densely coded in the entangled states (of qubits) that are
the hallmark of quantum mechanics. During the 1980s, D. Deutsch, fol-
lowing the lead of P. Benioff and R. Feynman, made concrete proposals
for harnessing some of the peculiar properties of quantum mechanics to
obtain unprecedented parallelism in computation. Interest in the field
of QC has received a tremendous boost from the following two recent
results obtained by P. Shor and L. K. Grover, both researchers at Bell
Labs:
1. P. Shor's 1994 discovery of a quantum algorithm for factorization
of integers. The Shor algorithm is substantially faster than any
known classical algorithm of subexponential complexity and opens
the door to decipherment in cryptography.
2. L. K. Grover's discovery in 1996 of a quantum search algorithm
that gives a favorable optimal quadratic speed-up in the search of
a single object in a large unsorted database, which is suitable for
data mining.
